You can subscribe to this list here.
2001 
_{Jan}

_{Feb}
(1) 
_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}
(1) 
_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}


2002 
_{Jan}
(1) 
_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}
(1) 
_{Aug}
(1) 
_{Sep}

_{Oct}

_{Nov}
(1) 
_{Dec}

2003 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}
(1) 
_{Aug}
(1) 
_{Sep}

_{Oct}
(83) 
_{Nov}
(57) 
_{Dec}
(111) 
2004 
_{Jan}
(38) 
_{Feb}
(121) 
_{Mar}
(107) 
_{Apr}
(241) 
_{May}
(102) 
_{Jun}
(190) 
_{Jul}
(239) 
_{Aug}
(158) 
_{Sep}
(184) 
_{Oct}
(193) 
_{Nov}
(47) 
_{Dec}
(68) 
2005 
_{Jan}
(190) 
_{Feb}
(105) 
_{Mar}
(99) 
_{Apr}
(65) 
_{May}
(92) 
_{Jun}
(250) 
_{Jul}
(197) 
_{Aug}
(128) 
_{Sep}
(101) 
_{Oct}
(183) 
_{Nov}
(186) 
_{Dec}
(42) 
2006 
_{Jan}
(102) 
_{Feb}
(122) 
_{Mar}
(154) 
_{Apr}
(196) 
_{May}
(181) 
_{Jun}
(281) 
_{Jul}
(310) 
_{Aug}
(198) 
_{Sep}
(145) 
_{Oct}
(188) 
_{Nov}
(134) 
_{Dec}
(90) 
2007 
_{Jan}
(134) 
_{Feb}
(181) 
_{Mar}
(157) 
_{Apr}
(57) 
_{May}
(81) 
_{Jun}
(204) 
_{Jul}
(60) 
_{Aug}
(37) 
_{Sep}
(17) 
_{Oct}
(90) 
_{Nov}
(122) 
_{Dec}
(72) 
2008 
_{Jan}
(130) 
_{Feb}
(108) 
_{Mar}
(160) 
_{Apr}
(38) 
_{May}
(83) 
_{Jun}
(42) 
_{Jul}
(75) 
_{Aug}
(16) 
_{Sep}
(71) 
_{Oct}
(57) 
_{Nov}
(59) 
_{Dec}
(152) 
2009 
_{Jan}
(73) 
_{Feb}
(213) 
_{Mar}
(67) 
_{Apr}
(40) 
_{May}
(46) 
_{Jun}
(82) 
_{Jul}
(73) 
_{Aug}
(57) 
_{Sep}
(108) 
_{Oct}
(36) 
_{Nov}
(153) 
_{Dec}
(77) 
2010 
_{Jan}
(42) 
_{Feb}
(171) 
_{Mar}
(150) 
_{Apr}
(6) 
_{May}
(22) 
_{Jun}
(34) 
_{Jul}
(31) 
_{Aug}
(38) 
_{Sep}
(32) 
_{Oct}
(59) 
_{Nov}
(13) 
_{Dec}
(62) 
2011 
_{Jan}
(114) 
_{Feb}
(139) 
_{Mar}
(126) 
_{Apr}
(51) 
_{May}
(53) 
_{Jun}
(29) 
_{Jul}
(41) 
_{Aug}
(29) 
_{Sep}
(35) 
_{Oct}
(87) 
_{Nov}
(42) 
_{Dec}
(20) 
2012 
_{Jan}
(111) 
_{Feb}
(66) 
_{Mar}
(35) 
_{Apr}
(59) 
_{May}
(71) 
_{Jun}
(32) 
_{Jul}
(11) 
_{Aug}
(48) 
_{Sep}
(60) 
_{Oct}
(87) 
_{Nov}
(16) 
_{Dec}
(38) 
2013 
_{Jan}
(5) 
_{Feb}
(19) 
_{Mar}
(41) 
_{Apr}
(47) 
_{May}
(14) 
_{Jun}
(32) 
_{Jul}
(18) 
_{Aug}
(68) 
_{Sep}
(9) 
_{Oct}
(42) 
_{Nov}
(12) 
_{Dec}
(10) 
2014 
_{Jan}
(14) 
_{Feb}
(139) 
_{Mar}
(137) 
_{Apr}
(66) 
_{May}
(72) 
_{Jun}
(142) 
_{Jul}
(70) 
_{Aug}
(22) 
_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 




1

2

3

4

5

6

7
(4) 
8
(4) 
9

10

11

12

13

14

15

16
(7) 
17
(5) 
18

19
(2) 
20

21
(2) 
22
(5) 
23

24

25

26

27

28

29

30



From: Tatsuro MATSUOKA <tmacchant3@ya...>  20110617 23:58:53

Hello I have tried to build mingw binary using config/mingw/Makefile instead of config/makefile.mgw. Using this makefile, gnuplot executables are installed into 'bin' directory. On Dec 03, 2009, Petr pointed out. http://old.nabble.com/Re%3Adirectrynameproblembinisnotcorrectryrecognizedonwindowsinsomecasesp26619776.html Use 'bin' directory for storing gnuplot executables make related files should be saved in unixy way. Is the change of Makefile intentional? Regards Tatsuro 
From: Alexandre Felipe <o.felipe@gm...>  20110617 13:03:43

PieterTjerk method is fairly better :D redefining it this make the same thing but you ask for a maximum integration distance instead a maximum intf(x0,a,h) = (h<=delta) ? f(x0+a/2)*a : ( intf(x0,a/2,delta) + intf(x0+a/2,a/2,delta) ) when you use gnuplot i think you want to plot something, this version if you say plot intf(x0, x  x0, delta) ensures that any integration interval will be larger than delta, and that the recurrence steep will be the minimum (with this function structure) if you plot with 1024 samples the integration function intf(x0, a, delta) is called 1397077 times, and the function f(x) will be evaluated 350548 times and the max recurrence depth will be 10 to integrate with the same acuracy the Daniel's scheme will call the intf* functions and f(x) are called about 523 thounsand times. and the max recurrence deepth is 1024 my scheme calls f(x) 1024 times and intf(x) 1024 times, but use some global variables. excuseme i accidentally replied only to 3snoW here goes the my scheme. It's not encouraged the use of global variables, but in such case i think here we a better solution, not THE better solution # Characteristic for the integration n_samps = 100; a = 0.0; b = 5.0; # initialization aux = 0.0; h = (ba)/n_samps; set samples n_samps set xrange [a to b] # the function f(x) = sin(5*x)/(0.1+x) #the integrator scheme intf(x) = (aux = (aux + f(x)*h)) # plot it plot f(x), intf(x) # another function f(x) = sin(x)*x replot for the 2D is also possible. the only thing you need is to reinit the aux variable when x=a this scheme is as poor as the former, therefore it's O(nsamples) and why to use recurrence if you can use memorization? intf can also have other integration schemes, with the advantage that you have to implement only once for example simpson's rule or any other method intf(x) = (aux = (aux + (f(xh)+4*f(x0.5*h)+f(x))*h/6)) this example make the h function to be called three times more. the ideal to generate plots is to derive integration schemes open in f(xh) and closed in f(x), but i will not make this now :D 
From: Alexandre Felipe <o.felipe@gm...>  20110617 13:01:56

The PieterTjerk is fairly better :D redefining it this make the same thing but you ask for a maximum integration distance instead a maximum intf(x0,a,h) = (h<=delta) ? f(x0+a/2)*a : ( intf(x0,a/2,delta) + intf(x0+a/2,a/2,delta) ) when you use gnuplot i think you want to plot something, this version if you say plot intf(x0, x  x0, delta) ensures that any integration interval will be larger than delta, and that the recurrence steep will be the minimum (with this function structure) if you plot with 1024 samples the integration function intf(x0, a, delta) is called 1397077 times, and the function f(x) will be evaluated 350548 times and the max recurrence depth will be 10 to integrate with the same acuracy the Daniel's scheme will call the intf* functions and f(x) are called about 523 thounsand times. and the max recurrence deepth is 1024 my scheme calls f(x) 1024 times and intf(x) 1024 times, but use some global variables. excuseme i accidentally replied only to 3snoW here goes the my scheme. It's not encouraged the use of global variables, but in such case i think here we a better solution, not THE better solution # Characteristic for the integration n_samps = 100; a = 0.0; b = 5.0; # initialization aux = 0.0; h = (ba)/n_samps; set samples n_samps set xrange [a to b] # the function f(x) = sin(5*x)/(0.1+x) #the integrator scheme intf(x) = (aux = (aux + f(x)*h)) # plot it plot f(x), intf(x) # another function f(x) = sin(x)*x replot for the 2D is also possible. the only thing you need is to reinit the aux variable when x=a this scheme is as poor as the former, therefore it's O(nsamples) and why to use recurrence if you can use memorization? intf can also have other integration schemes, with the advantage that you have to implement only once for example simpson's rule or any other method intf(x) = (aux = (aux + (f(xh)+4*f(x0.5*h)+f(x))*h/6)) this example make the h function to be called three times more. the ideal to generate plots is to derive integration schemes open in f(xh) and closed in f(x), but i will not make this now :D 
From: Alexandre Felipe <o.felipe@gm...>  20110617 13:01:08

The PieterTjerk is fairly better :D redefining it this make the same thing but you ask for a maximum integration distance instead a maximum intf(x0,a,h) = (h<=delta) ? f(x0+a/2)*a : ( intf(x0,a/2,delta) + intf(x0+a/2,a/2,delta) ) when you use gnuplot i think you want to plot something, this version if you say plot intf(x0, x  x0, delta) ensures that any integration interval will be larger than delta, and that the recurrence steep will be the minimum (with this function structure) if you plot with 1024 samples the integration function intf(x0, a, delta) is called 1397077 times, and the function f(x) will be evaluated 350548 times and the max recurrence depth will be 10 to integrate with the same acuracy the Daniel's scheme will call the intf* functions and f(x) are called about 523 thounsand times. and the max recurrence deepth is 1024 my scheme calls f(x) 1024 times and intf(x) 1024 times, but use some global variables. excuseme i accidentally replied only to 3snoW here goes the my scheme. It's not encouraged the use of global variables, but in such case i think here we a better solution, not THE better solution # Characteristic for the integration n_samps = 100; a = 0.0; b = 5.0; # initialization aux = 0.0; h = (ba)/n_samps; set samples n_samps set xrange [a to b] # the function f(x) = sin(5*x)/(0.1+x) #the integrator scheme intf(x) = (aux = (aux + f(x)*h)) # plot it plot f(x), intf(x) # another function f(x) = sin(x)*x replot for the 2D is also possible. the only thing you need is to reinit the aux variable when x=a this scheme is as poor as the former, therefore it's O(nsamples) and why to use recurrence if you can use memorization? intf can also have other integration schemes, with the advantage that you have to implement only once for example simpson's rule or any other method intf(x) = (aux = (aux + (f(xh)+4*f(x0.5*h)+f(x))*h/ 6)) this example make the h function to be called three times more. the ideal to generate plots is to derive integration schemes open in f(xh) and closed in f(x), but i will not make this now :D 
From: Alexandre Felipe <o.felipe@gm...>  20110617 11:30:50

Does someone read what i have wrote? 