Hi Natalia,

That is very interesting and a nice write-up. Where you expand further where "darker colors correspond to the smaller steps" comparing the meaning of the ones with black at the bottom and the ones with black at the top?

I wasn't clear on "Even more impressive thing is the accuracy's depending on the initial state." ...why some have black in the middle, some have it at the bottom. Also I can't tell how a different 'initial state' is reflected in the graph. In the 'Euler method' graph, what are the red and blue lines? Are A0 to A4 different initial states, or progressive estimates of on run of the algorithm?

A graph that I think would be interesting is a scatter plot of Accuracy versus Benchmark. There could be a time-series line for each algorithm that might be:
* Over a short time, perhaps show last N runs (with older line segments getting fainter)
* Over a longer period, to avoid congestion where a lot of data points might be similar, have some minimum threshold that the next result needs to move from the last graph data point before it is included as the next graph data point, then label that point with its build number.

cheers -ben

Natalia Tymchuk wrote:

Hello,
I wrote another blog post concerning my project on Google Summer of Code, and there's how I assessed the results using Graph-ET.
http://nataliatymchuk.blogspot.com/2013/09/code-functionality-assessment.html

Best regard,
Natalia
_______________________________________________
Moose-dev mailing list
Moose-dev@iam.unibe.ch
https://www.iam.unibe.ch/mailman/listinfo/moose-dev
  