processi

about processes and engines

Archive for the ‘tlug’ Category

slidesharing

just played a bit with slideshare, where I uploaded my march presentation at the TLUG :

UPDATE : I removed the presentation from SlideShare as using incoming bullets resulted in too many slides. I don’t have the time to rehash the presentation for slideshare.
Anyway the PDF is available via RubyForge.

notes to self :

– the first page should be the title page (but I like to have a blank page while people arrive / gather)
– too much bullets
– がんばります。。。

in general :
– sharing slides != presenting them

Slideshare is nice. Reminds of that very interesting blog post about PowerPoint battle plans.

Written by John Mettraux

April 25, 2007 at 7:57 am

Posted in bpm, ruby, tlug, workflow

talking at the tlug, the movie

The video of my presentation of OpenWFEru at the Tokyo Linux User Group is available now (along with the excellent presentation of Edmund Edgar about Second Life).

The slides are available as well (without my funny swiss accent).

Many thanks to the TLUG guys for the opportunity.

Update : a direct link to the video in mp4.

Written by John Mettraux

March 26, 2007 at 2:31 pm

Posted in bpm, openwferu, ruby, tlug, workflow

Cyclo Saikuro

Yesterday evening was the revival of Ninjava, a gathering of programming enthusiasts (not only Java) in the Tokyo area.

Zev Blut presented one of his open source projects : Saikuro.

“Saikuro” is a japanese transliteration of “Cyclo”. This tool analyses a set of ruby code and outputs a report about its “cyclomatic complexity”.

saikuro.pngIn short, this metric looks at how many branches there are in a piece of code and returns a complexity score.

In this example, the complexity is “3” : the easy way to compute the metric is by counting how many areas are “encircled” by the graph representing the code (plus the area surrounding the graph).

Pointers to articles about that metric are available from Saikuro’s home page.

I ran Saikuro over my OpenWFEru project. Saikuro generated two reports, one about Cyclomatic Complexity and one about the count of tokens per line.
For OpenWFEru the very first written methods (the one dealing with interfacing with the Java engine over REST) were flagged in red. As Zev pointed out, such ‘parsing’ code sports loads of ‘ifs’ and thus yields a high CC score.
To the reports.

At the end of the talk, the discussions centered on the usefulness of the metric for a developer and especially a project manager, and on how to integrate it in a development process. (check in, code review, …)

It’s a simple and effective metric, nice addition to a Ruby toolboox. This utility deserves to be gemified.
It would be nice if the reports actually displayed the methods (at least the ones in the red), maybe with a bit of Erb and a ruby.css…

Emerson Mills will talk about “agile software development process” (“scrum à la Mills” as he said) in the next (April) meeting of Ninjava.

Thanks to the Cerego guys for hosting this meeting !

Written by John Mettraux

March 16, 2007 at 12:11 am

talking at the tlug

TLUGI’ll be talking about OpenWFEru, Ruby workflow and BPM (technical point of view) tomorrow afternoon at the TLUG technical meeting of march.

Thanks to Zev and his team for this lively Linux User Group they are supporting.

Written by John Mettraux

March 9, 2007 at 3:56 am

sqs & s3

I just attended a technical meeting of the Tokyo Linux User group. Emerson Mills of Amazon Web Services talked about SQS and S3. He also talked about the Elastic Computing Cloud and the Mechanical Turk.

Since I first learnt about the Simple Queue Service, I wanted to build an OpenWFE adapter for it, this service might be ideal as a base for a worklist. The Simple Storage Service on the other hand would be suitable for a document management system (DMS), maybe some versioning and locking would have to be added on top of it, but well, the hard work has already been done by Amazon.

Workflow + DMS persisted in Amazon services… Only the transient things would run on their own servers, and those servers could be Elastic provided.

Written by John Mettraux

November 11, 2006 at 1:07 pm