Screenshot instructions:
Windows
Mac
Red Hat Linux
Ubuntu
Click URL instructions:
Rightclick on ad, choose "Copy Link", then paste here →
(This may not be possible with some types of ads)
You can subscribe to this list here.
2001 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}
(10) 
_{Aug}
(5) 
_{Sep}
(3) 
_{Oct}
(41) 
_{Nov}
(41) 
_{Dec}
(33) 

2002 
_{Jan}
(75) 
_{Feb}
(10) 
_{Mar}
(170) 
_{Apr}
(174) 
_{May}
(66) 
_{Jun}
(11) 
_{Jul}
(10) 
_{Aug}
(44) 
_{Sep}
(73) 
_{Oct}
(28) 
_{Nov}
(139) 
_{Dec}
(52) 
2003 
_{Jan}
(35) 
_{Feb}
(93) 
_{Mar}
(62) 
_{Apr}
(10) 
_{May}
(55) 
_{Jun}
(70) 
_{Jul}
(37) 
_{Aug}
(16) 
_{Sep}
(56) 
_{Oct}
(31) 
_{Nov}
(57) 
_{Dec}
(83) 
2004 
_{Jan}
(85) 
_{Feb}
(67) 
_{Mar}
(27) 
_{Apr}
(37) 
_{May}
(75) 
_{Jun}
(85) 
_{Jul}
(160) 
_{Aug}
(68) 
_{Sep}
(104) 
_{Oct}
(25) 
_{Nov}
(39) 
_{Dec}
(23) 
2005 
_{Jan}
(10) 
_{Feb}
(45) 
_{Mar}
(43) 
_{Apr}
(19) 
_{May}
(108) 
_{Jun}
(31) 
_{Jul}
(41) 
_{Aug}
(23) 
_{Sep}
(65) 
_{Oct}
(58) 
_{Nov}
(44) 
_{Dec}
(54) 
2006 
_{Jan}
(96) 
_{Feb}
(27) 
_{Mar}
(69) 
_{Apr}
(59) 
_{May}
(67) 
_{Jun}
(35) 
_{Jul}
(13) 
_{Aug}
(461) 
_{Sep}
(160) 
_{Oct}
(399) 
_{Nov}
(32) 
_{Dec}
(72) 
2007 
_{Jan}
(316) 
_{Feb}
(305) 
_{Mar}
(318) 
_{Apr}
(54) 
_{May}
(194) 
_{Jun}
(173) 
_{Jul}
(282) 
_{Aug}
(91) 
_{Sep}
(227) 
_{Oct}
(365) 
_{Nov}
(168) 
_{Dec}
(18) 
2008 
_{Jan}
(71) 
_{Feb}
(111) 
_{Mar}
(155) 
_{Apr}
(173) 
_{May}
(70) 
_{Jun}
(67) 
_{Jul}
(55) 
_{Aug}
(83) 
_{Sep}
(32) 
_{Oct}
(68) 
_{Nov}
(80) 
_{Dec}
(29) 
2009 
_{Jan}
(46) 
_{Feb}
(18) 
_{Mar}
(95) 
_{Apr}
(76) 
_{May}
(140) 
_{Jun}
(98) 
_{Jul}
(84) 
_{Aug}
(123) 
_{Sep}
(94) 
_{Oct}
(131) 
_{Nov}
(142) 
_{Dec}
(125) 
2010 
_{Jan}
(128) 
_{Feb}
(158) 
_{Mar}
(172) 
_{Apr}
(134) 
_{May}
(94) 
_{Jun}
(84) 
_{Jul}
(32) 
_{Aug}
(127) 
_{Sep}
(167) 
_{Oct}
(109) 
_{Nov}
(69) 
_{Dec}
(78) 
2011 
_{Jan}
(39) 
_{Feb}
(58) 
_{Mar}
(52) 
_{Apr}
(47) 
_{May}
(56) 
_{Jun}
(76) 
_{Jul}
(55) 
_{Aug}
(54) 
_{Sep}
(165) 
_{Oct}
(255) 
_{Nov}
(328) 
_{Dec}
(263) 
2012 
_{Jan}
(82) 
_{Feb}
(147) 
_{Mar}
(400) 
_{Apr}
(216) 
_{May}
(209) 
_{Jun}
(160) 
_{Jul}
(86) 
_{Aug}
(141) 
_{Sep}
(156) 
_{Oct}
(6) 
_{Nov}

_{Dec}

2015 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}
(1) 
_{Aug}

_{Sep}
(1) 
_{Oct}

_{Nov}
(1) 
_{Dec}
(2) 
2016 
_{Jan}

_{Feb}
(2) 
_{Mar}
(2) 
_{Apr}
(1) 
_{May}
(1) 
_{Jun}
(2) 
_{Jul}
(1) 
_{Aug}
(1) 
_{Sep}

_{Oct}

_{Nov}
(1) 
_{Dec}

S  M  T  W  T  F  S 






1
(1) 
2
(1) 
3
(7) 
4
(10) 
5
(9) 
6
(5) 
7
(3) 
8
(3) 
9

10

11

12
(11) 
13
(8) 
14
(1) 
15
(2) 
16

17
(2) 
18

19

20
(1) 
21

22
(1) 
23
(1) 
24

25

26

27
(1) 
28
(3) 
29
(2) 
30

31







From: soren hauberg <hauberg@us...>  20061228 22:42:21

Update of /cvsroot/octave/octaveforge/main/image/src In directory sc8prcvs3.sourceforge.net:/tmp/cvsserv32167/src Modified Files: Makefile Added Files: __bwdist.cc Log Message: First revision of bwarea.m and __bwarea.cc Index: Makefile =================================================================== RCS file: /cvsroot/octave/octaveforge/main/image/src/Makefile,v retrieving revision 1.4 retrieving revision 1.5 diff u d r1.4 r1.5  Makefile 8 Dec 2006 11:06:56 0000 1.4 +++ Makefile 28 Dec 2006 22:42:12 0000 1.5 @@ 13,7 +13,7 @@ endif all: cordflt2.oct bwlabel.oct bwfill.oct rotate_scale.oct \  houghtf.oct graycomatrix.oct deriche.oct \ + houghtf.oct graycomatrix.oct deriche.oct __bwdist.oct \ $(JPEG) $(PNG) $(IMAGEMAGICK) jpgread.oct: jpgread.cc  NEW FILE: __bwdist.cc  /* Copyright (C) 2006 Pedro Felzenszwalb This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 021111307 USA */ /* * Remark by SÃ¸ren Hauberg, december 28th 2006. * * This code was mainly written by Pedro Felzenszwalb and published * on http://people.cs.uchicago.edu/~pff/dt/ * Pedro kindly released his code under the GPL and I ported it to * Octave. */ #include <octave/oct.h> #define INF 1E20 template <class T> inline T square(const T &x) { return x*x; }; /* dt of 1d function using squared distance */ static float *dt(float *f, int n) { float *d = new float[n]; int *v = new int[n]; float *z = new float[n+1]; int k = 0; v[0] = 0; z[0] = INF; z[1] = +INF; for (int q = 1; q <= n1; q++) { float s = ((f[q]+square(q))(f[v[k]]+square(v[k])))/(2*q2*v[k]); while (s <= z[k]) { k; s = ((f[q]+square(q))(f[v[k]]+square(v[k])))/(2*q2*v[k]); } k++; v[k] = q; z[k] = s; z[k+1] = +INF; } k = 0; for (int q = 0; q <= n1; q++) { while (z[k+1] < q) k++; d[q] = square(qv[k]) + f[v[k]]; } delete [] v; delete [] z; return d; } /* dt of 2d function using squared distance */ static void dt(NDArray &im) { const int width = im.dim2(); const int height = im.dim1(); float *f = new float[std::max(width,height)]; // transform along columns for (int x = 0; x < width; x++) { for (int y = 0; y < height; y++) { f[y] = im(x, y); } float *d = dt(f, height); for (int y = 0; y < height; y++) { im(x, y) = d[y]; } delete [] d; } // transform along rows for (int y = 0; y < height; y++) { for (int x = 0; x < width; x++) { f[x] = im(x, y); } float *d = dt(f, width); for (int x = 0; x < width; x++) { im(x, y) = d[x]; } delete [] d; } delete f; } /* dt of binary image using squared distance */ void dt(boolNDArray &im, NDArray &out) { const int width = im.dim2(); const int height = im.dim1(); for (int y = 0; y < height; y++) { for (int x = 0; x < width; x++) { if (im(x, y)) out(x, y) = 0; else out(x, y) = INF; } } dt(out); } DEFUN_DLD(__bwdist, args, nargout, "\ * texinfo *\n\ @deftypefn {Function File} __bwdist (@var{bw})\n\ Computes the Euclidian Distance Transform for a binary image @var{bw}.\n\ You should not call this function directly, instead call 'bwdist'.\n\ @seealso{bwdist}\n\ @end deftypefn\n\ ") { octave_value_list retval; boolNDArray bw = args(0).bool_array_value(); if (error_state) { error("__bwdist: input must be a boolean matrix"); return retval; } const dim_vector dims = bw.dims(); if (dims.length() != 2) { error("__bwdist: currently only binary images are supported"); return retval; } NDArray *out = new NDArray(dims); dt(bw, *out); retval.append(*out); return retval; } 
From: soren hauberg <hauberg@us...>  20061228 22:42:15

Update of /cvsroot/octave/octaveforge/main/image/inst In directory sc8prcvs3.sourceforge.net:/tmp/cvsserv32167/inst Added Files: bwdist.m Log Message: First revision of bwarea.m and __bwarea.cc  NEW FILE: bwdist.m  (This appears to be a binary file; contents omitted.) 
From: Paul Kienzle <pkienzle@us...>  20061228 06:15:16

Update of /cvsroot/octave/octaveforge/main/optim/inst In directory sc8prcvs3.sourceforge.net:/tmp/cvsserv6118 Modified Files: wpolyfit.m Log Message: Corrections to comments regarding Ftest for polynomial degree Index: wpolyfit.m =================================================================== RCS file: /cvsroot/octave/octaveforge/main/optim/inst/wpolyfit.m,v retrieving revision 1.1 retrieving revision 1.2 diff u d r1.1 r1.2  wpolyfit.m 20 Aug 2006 13:37:57 0000 1.1 +++ wpolyfit.m 28 Dec 2006 06:15:12 0000 1.2 @@ 44,12 +44,12 @@ ## @example ## [poly1,S1] = wpolyfit(x,y,dy,n); ## [poly2,S2] = wpolyfit(x,y,dy,n+1); ## F = (S1.normr^2  S2.normr^2)/(S2.normr^2/S2.df); ## p = 1f_cdf(F,1,S2.df); +## F = (S1.normr^2  S2.normr^2)/(S1.dfS2.df)/(S2.normr^2/S2.df); +## p = 1f_cdf(F,S1.dfS2.df,S2.df); ## @end example ## p is the probability of observing the improvement in chi^2 obtained ## by adding the extra parameter to the fit. If p < 0.01, you can reject ## the higher order polynomial at the 1% level. +## the lower order polynomial at the 1% level. ## ## You can estimate the uncertainty in the polynomial coefficients ## themselves using 