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
(2) 
2

3
(1) 
4
(7) 
5
(1) 
6

7
(5) 
8

9
(8) 
10
(8) 
11
(1) 
12
(2) 
13
(4) 
14
(6) 
15

16
(1) 
17
(2) 
18
(3) 
19
(3) 
20
(2) 
21
(3) 
22
(5) 
23
(1) 
24
(3) 
25
(2) 
26
(1) 
27
(1) 
28

29
(2) 
30
(6) 






From: <lindnerb@us...>  20081117 17:26:02

Revision: 5441 http://octave.svn.sourceforge.net/octave/?rev=5441&view=rev Author: lindnerb Date: 20081117 17:25:48 +0000 (Mon, 17 Nov 2008) Log Message:  correct installation of pango headers and libs Modified Paths:  trunk/octaveforge/admin/Windows/mingw32/pango/build1.22.33.sh Modified: trunk/octaveforge/admin/Windows/mingw32/pango/build1.22.33.sh ===================================================================  trunk/octaveforge/admin/Windows/mingw32/pango/build1.22.33.sh 20081117 12:56:36 UTC (rev 5440) +++ trunk/octaveforge/admin/Windows/mingw32/pango/build1.22.33.sh 20081117 17:25:48 UTC (rev 5441) @@ 31,9 +31,41 @@ # MAKEFILE=win32/Makefile.gcc # header files to be installed HEADERS="cairo.h cairodeprecated.h cairopdf.h cairops.h cairosvg.h cairoversion.h cairowin32.h" HEADERS2="cairofeatures.h" INCLUDE_DIR=include/cairo +HEADERS=" +pangoattributes.h +pangobiditype.h +pangobreak.h +pangocontext.h +pangocoverage.h +pangoengine.h +pangofont.h +pangofontmap.h +pangofontset.h +pangoglyphitem.h +pangoglyph.h +pangogravity.h +pangoitem.h +pangolanguage.h +pangolayout.h +pangomatrix.h +pangomodules.h +pangoot.h +pangorenderer.h +pangoscript.h +pangotabs.h +pangotypes.h +pangoutils.h +pango.h +pangocairo.h +pangofcdecoder.h +pangofcfont.h +pangofcfontmap.h +pangoft2.h +pangowin32.h" +HEADERS2=" +pangofeatures.h +pangoenumtypes.h" +INCLUDE_DIR=include/pango source ../gcc43_common.sh @@ 66,30 +98,37 @@ ) } PCFILES="cairo.pc cairoft.pc cairopdf.pc cairopng.pc cairops.pc cairosvg.pc cairowin32.pc cairowin32font.pc" +PCFILES="pango.pc pangocairo.pc pangoft2.pc pangowin32.pc" install() { install_pre;  ${CP} ${CP_FLAGS} ${BUILDDIR}/src/.libs/libcairo2.dll ${SHAREDLIB_PATH}  ${CP} ${CP_FLAGS} ${BUILDDIR}/src/.libs/libcairo.dll.a ${LIBRARY_PATH}  ${CP} ${CP_FLAGS} ${BUILDDIR}/src/.libs/libcairo.a ${STATICLIBRARY_PATH} + ${CP} ${CP_FLAGS} ${BUILDDIR}/pango/.libs/libpango1.00.dll ${SHAREDLIB_PATH} + ${CP} ${CP_FLAGS} ${BUILDDIR}/pango/.libs/libpango1.0.dll.a ${LIBRARY_PATH} + + ${CP} ${CP_FLAGS} ${BUILDDIR}/pango/.libs/libpangocairo1.00.dll ${SHAREDLIB_PATH} + ${CP} ${CP_FLAGS} ${BUILDDIR}/pango/.libs/libpangocairo1.0.dll.a ${LIBRARY_PATH} + + ${CP} ${CP_FLAGS} ${BUILDDIR}/pango/.libs/libpangoft21.00.dll ${SHAREDLIB_PATH} + ${CP} ${CP_FLAGS} ${BUILDDIR}/pango/.libs/libpangoft21.0.dll.a ${LIBRARY_PATH} + + ${CP} ${CP_FLAGS} ${BUILDDIR}/pango/.libs/libpangowin321.00.dll ${SHAREDLIB_PATH} + ${CP} ${CP_FLAGS} ${BUILDDIR}/pango/.libs/libpangowin321.0.dll.a ${LIBRARY_PATH} + mkdir vp ${LICENSE_PATH}/${PKG} ${CP} ${CP_FLAGS} ${SRCDIR}/COPYING ${LICENSE_PATH}/${PKG}  ${CP} ${CP_FLAGS} ${SRCDIR}/COPYINGLGPL2.1 ${LICENSE_PATH}/${PKG}  ${CP} ${CP_FLAGS} ${SRCDIR}/COPYINGMPL1.1 ${LICENSE_PATH}/${PKG} for a in $HEADERS; do  ${CP} ${CP_FLAGS} ${SRCDIR}/src/$a ${INCLUDE_PATH} + ${CP} ${CP_FLAGS} ${SRCDIR}/pango/$a ${INCLUDE_PATH} done for a in $HEADERS2; do  ${CP} ${CP_FLAGS} ${BUILDDIR}/src/$a ${INCLUDE_PATH} + ${CP} ${CP_FLAGS} ${BUILDDIR}/pango/$a ${INCLUDE_PATH} done for a in $PCFILES; do  ${CP} ${CP_FLAGS} ${BUILDDIR}/src/$a ${PKGCONFIGDATA_PATH} + ${CP} ${CP_FLAGS} ${BUILDDIR}/$a ${PKGCONFIGDATA_PATH} done @@ 117,10 +156,7 @@ ${RM} ${RM_FLAGS} ${PKGCONFIGDATA_PATH}/$a done  ${RM} ${RM_FLAGS} ${LICENSE_PATH}/${PKG}/COPYING  ${RM} ${RM_FLAGS} ${LICENSE_PATH}/${PKG}/COPYINGLGPL2.1  ${RM} ${RM_FLAGS} ${LICENSE_PATH}/${PKG}/COPYINGMPL1.1 uninstall_post; } This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. 
From: <fpoto@us...>  20081117 12:56:49

Revision: 5440 http://octave.svn.sourceforge.net/octave/?rev=5440&view=rev Author: fpoto Date: 20081117 12:56:36 +0000 (Mon, 17 Nov 2008) Log Message:  Documentation improved. Method "median" implemented. Try to mimic Matlab's clustering order (not there yet). Modified Paths:  trunk/octaveforge/main/statistics/inst/linkage.m Modified: trunk/octaveforge/main/statistics/inst/linkage.m ===================================================================  trunk/octaveforge/main/statistics/inst/linkage.m 20081116 19:49:09 UTC (rev 5439) +++ trunk/octaveforge/main/statistics/inst/linkage.m 20081117 12:56:36 UTC (rev 5440) @@ 33,29 +33,35 @@ ## two columns are the numbers of the two component clusters and column ## 3 contains their distance. ## ## Methods can be: +## Methods define the way the distance between two clusters is computed: ## ## @table @samp ## @item "single" (default) ## Shortest distance between two clusters (aka a minimum spanning tree) +## Distance between two clusters is the minimum distance between two +## elements belonging each to one cluster. Produces a cluster tree +## known as minimum spanning tree. ## ## @item "complete" ## Furthest distance between two clusters +## Furthest distance between two elements belonging each to one cluster. ## ## @item "average" ## Unweighted pair group method with averaging (UPGMA) +## The mean distance between all pair of elements each belonging to one +## cluster. ## ## @item "weighted" ## Weighted pair group method with averaging (WPGMA) ## Same as Median, its formal definition does not require Euclidean ## metric. (Is this true?) ## ## @item "centroid" ## Centroid distance +## Unweighted PairGroup Method using Centroids (UPGMC) +## Assumes Euclidean metric. The distance between cluster centroids, +## each centroid being the center of mass of a cluster. ## ## @item "median" ## Weighted pairgroup method using centroids (WPGMC) ## To be used with Euclidean metric. (Is this true?) +## Weighted pairgroup method using centroids (WPGMC). +## Assumes Euclidean metric. Distance between cluster centroids. When +## two clusters are joined together, the new centroid is the midpoint +## between the joined centroids. ## ## @item "ward" ## Inner squared distance (minimum variance) @@ 82,17 +88,18 @@ error ("linkage: x must be a vector"); endif  ## Function findfxn must return a scalar from a vector and a row from + ## Function distance must return a scalar from a vector and a row from ## a matrix. method = lower (method); switch (method) case "single"  ## this is just a minimal spanning tree  findfxn = @min; + dist = @min; case "complete"  findfxn = @max;  case { "median", "weighted", "average", "centroid", "ward" } + dist = @max; + case "median" + dist = @mediandist; # see below + case { "weighted", "average", "centroid", "ward" } error ("linkage: %s is not yet implemented", method); otherwise error ("linkage: %s: unknown method", method); @@ 106,31 +113,54 @@ y = zeros (n1, 3); # clusters from n+1 to 2*n1 for yidx = 1:n1 ## Find the two nearest clusters  [m midx] = min (dissim(:)); # the min distance and its first index  [r, c] = ind2sub (size (dissim), midx); # row and col number + ## For equaldistance nodes, the order in which nodes are added to + ## clusters is arbitrary. The following code chooses the nodes so + ## to mostly get the same ordering as in Matlab. Note that the + ## weighted methods can produce different clusterings depending on + ## the order in which elements are added to clusters. + [r c] = find (dissim == min (dissim(:)), 1, "last"); ## Here is the new cluster y(yidx, :) = [cname(r) cname(c) dissim(r, c)];  ## Add it as a new cluster index and remove the old ones + ## Put it in place of the first one and remove the second cname(r) = yidx + n; cname(c) = [];  ## Add the new dissimilarities and remove the old ones  newdissim = findfxn (dissim([r c], :));  newdissim(r) = Inf;  dissim(r,:) = newdissim;  dissim(:,r) = newdissim'; + ## Same for the dissimilarities, take care of the diagonal element + d = dist (dissim([r c], :)); + d(r) = Inf; + dissim(r,:) = d; + dissim(:,r) = d'; dissim(c,:) = []; dissim(:,c) = []; endfor + ## Check that distances are monotonically increasing + if (any (diff (y(:,3)) < 0)) + warning ("clustering", + "linkage: cluster distances do not monotonically increase\n\ + you should maybe use a method different from \"%s\"", method); + endif + endfunction +## Take two row vectors, which are the distances of clusters I and J +## from the others. Column J of second row contains Inf, column J of +## first row contains distance between clusters I and J. The centroid +## of the new cluster is midway between the old ones. Use the law of +## cosines to find distances of the new ones from all the others. +function y = mediandist (x) + interdist = x(1, x(2,:) == Inf); # distance between component clusters + y = sqrt (sumsq (x) / 2  interdist^2 / 4); +endfunction + %!shared x, y, t %! x = [3 1.7; 1 1; 2 3; 2 2.5; 1.2 1; 1.1 1.5; 3 1]; %! y = reshape(mod(magic(6),5),[],3); %! t = 1e6; %!assert (cond (linkage (pdist (x))), 66.534612, t); %!assert (cond (linkage (pdist (y))), 34.945071, t); %!assert (cond (linkage (pdist (x), "single")), 66.534612, t); %!assert (cond (linkage (pdist (y), "single")), 34.945071, t); %!assert (cond (linkage (pdist (x), "complete")), 27.071750, t); %!assert (cond (linkage (pdist (y), "complete")), 20.296516, t); +%!assert (cond (linkage (pdist (x))), 56.981591, t); +%!assert (cond (linkage (pdist (y))), 27.771542, t); +%!assert (cond (linkage (pdist (x), "single")), 56.981591, t); +%!assert (cond (linkage (pdist (y), "single")), 27.771542, t); +%!assert (cond (linkage (pdist (x), "complete")), 26.681691, t); +%!assert (cond (linkage (pdist (y), "complete")), 21.726318, t); +%!assert (cond (linkage (pdist (x), "median")), 39.032841, t); +%!assert (cond (linkage (pdist (y), "median")), 26.159331, t); This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. 