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}

S  M  T  W  T  F  S 

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

8
(3) 
9
(3) 
10
(2) 
11

12
(1) 
13

14

15
(1) 
16

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

28
(4) 
29
(3) 
30
(1) 
31
(10) 




From: <prnienhuis@us...>  20120725 17:12:33

Revision: 10775 http://octave.svn.sourceforge.net/octave/?rev=10775&view=rev Author: prnienhuis Date: 20120725 17:11:56 +0000 (Wed, 25 Jul 2012) Log Message:  Added NEWS file + updated/reconstructed old news to it Added Paths:  trunk/octaveforge/extra/java/NEWS Added: trunk/octaveforge/extra/java/NEWS ===================================================================  trunk/octaveforge/extra/java/NEWS (rev 0) +++ trunk/octaveforge/extra/java/NEWS 20120725 17:11:56 UTC (rev 10775) @@ 0,0 +1,55 @@ +Summary of important uservisible changes for releases of the Java package + +=============================================================================== +java1.2.9 Release Date: 20120725 Release Manager: Philip Nienhuis +=============================================================================== + +** Bug fixes & improvements: + configure.base: properly enable java if JAVA_ARCH was set beforehand + (Thomas Weber) + __java__.cc: restore the locale after initializing the JVM (S\xE9bastien + Villemot) + + All dialog functions: accept cell array for dialog text caption (ML + compatible) (not for dialog title!) bug #36311 + +** Added pre_install.m, which should warn before, and if needed abort, actual + installation step if JAVA_HOME wasn't properly set. If needed, pre_install.m + also adds the directory containing the Java executables to the PATH, + provided this resides in the expected place (i.e., JAVA_HOME/bin) + +=============================================================================== +java1.2.8 Release Date: 20110608 Release Manager: Philip Nienhuis +=============================================================================== + +** Bug fixes & improvements: + Octave.java: Support for java.lang.short & java.lang.long + + __java__.cc: Fixed wrong input arg order for javaMethod() + Removed extra ")" in getcwd call + +** Updated docs and added doc generation scripts(Martin Hepperle) + +=============================================================================== +java1.2.7 Release Date: 20100304 Release Managers: Martin Hepperle & + Philip Nienhuis +=============================================================================== + +** Bug fixes & improvements + Many many improvements by Martin Hepperle + +** Added extensive docs in pdf, html and texinfo format (Martin Hepperle) + +** Added TeX support (Martin Hepperle) + +** Added dialog methods: msgbox, errordlg, inputdlg, warndlg, listdlg, questdlg, + helpdlg + test script (Martin Hepperle) + +** Implemented static classpath (Martin Hepperle) + +** Added Matlabcompatible javaMethod and javaObject as wrappers for + java_invoke() and java_new() (Martin Hepperle) + +** Added javarmpath(), javamethods() (Martin Hepperle) + +** Added javamem() This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. 
From: <benjf5@us...>  20120725 15:06:01

Revision: 10774 http://octave.svn.sourceforge.net/octave/?rev=10774&view=rev Author: benjf5 Date: 20120725 15:05:47 +0000 (Wed, 25 Jul 2012) Log Message:  lsrealwavelet written; not fully tested, but performs as expected thus far. Modified Paths:  trunk/octaveforge/extra/lssa/lsrealwavelet.m Modified: trunk/octaveforge/extra/lssa/lsrealwavelet.m ===================================================================  trunk/octaveforge/extra/lssa/lsrealwavelet.m 20120725 04:48:43 UTC (rev 10773) +++ trunk/octaveforge/extra/lssa/lsrealwavelet.m 20120725 15:05:47 UTC (rev 10774) @@ 8,18 +8,23 @@ ## @end deffun function transform = lsrealwavelet(T, X, maxfreq, ncoeff, noctave, t_min, t_max, minimum_window_number, sigma=0.1 ) +function transform = lsrealwavelet(T, X, maxfreq, ncoeff, noctave, t_min, t_max, minimum_window_number ) delta_t = (t_max  t_min)/(t_subdiv1) # fails if you're trying to use less than 2 windows. Why use the wavelet tool at that point?  len_tx = length (T) omegamult = 2 ^ (  1/ ncoeff ) omegamult_inv = 1 / omegamult winradius = pi / ( sigma * maxfreq ) current_radius = winradius; +minimum_window_width = ( t_max  t_min ) / minimum_window_number; +minimum_window_radius = minimum_window_width / 2; +sigma = maxfreq * 2 ^ ( noctave ) / minimum_window_radius; +## sigma needs to be such that  t _ k  t  = minimum_window_radius implies +## that sigma * maxfrequency * 2 ^ (  noctave ) * minimum_window_radius = 1 + +## for a specific other frequency, sigma * frequency * window_radius = 1 means +## window_radius = 1 / ( frequency * sigma ) + + o = maxfreq; # zeta _ ( t , omega ) = sum(w(sigma omega (t_k  t )e^(i omega (t_k  t))xi_k) @@ 33,57 +38,34 @@ transform = cell(noctave*ncoeff,1); ## in this, win_t is the centre of the window in question window_min = t_min; ## Although that will vary depending on the window. This is just an implementation for the first window. win_t = window_min + window_radius;  windowed_t = ((abs (Twin_t) < window_radius) .* T); zeta = sum( cubicwgt ((windowed_t  win_t) ./ window_radius) .* exp(  i * o .* windowed_t ) .* X ) / sum ( cubicwgt( windowed_t ./ window_radius ) ); iota = sum( cubicwgt ((windowed_t  win_t) ./ window_radius) .* exp(  i * 2 * o .* windowed_t) .* X ) / sum ( cubicwgt( windowed_t .* 2 * o ) ) ## this will of course involve an additional large memory allocation, at least in the short term, ## but it's faster to do the operation once on the time series, then multiply it by the data series.   +for iter = 1:(noctave*ncoeff) + ## in this, win_t is the centre of the window in question + window_min = t_min; + ## Although that will vary depending on the window. This is just an + ## implementation for the first window. + current_frequency = maxfreq * 2 ^ (  iter / ncoeff ); + current_radius = 1 / ( current_frequency * sigma ); + current_window_number = ceil( ( t_max  t_min ) / current_radius); for iter_freq = 1:( noctave * ncoeff )  t = t_min;  tx_point = 1;  for iter_elem = 1:t_subdiv  if tx_point > len_tx  break  endif  while ( tx_point+1 <= len_tx) && ((tT(tx_point+1))<winradius)  tx_point++;  endwhile  zeta = 0;  iota = 0;  iota0 = 0;  count = 0;  ot = o * ( T(tx_point)  t);  sot = sigma * ot;  while ( tx_point <= len_tx) && ( (sot = sigma * (ot = o*(T(tx_point)t))) < pi )  w = 0.5 * ( 1 + cos (sot));  iota0 += w;  zeta += w * ( cos (ot) + sin (ot) * i ) * X(tx_point);  ot *= 2;  iota += w * ( cos(ot) + sin (ot) * i );  count++;  tx_point++;  endwhile  if count > 0  result = 2 * ( conj (zeta) * iota0 + zeta * conj (iota) ) / ( ( count + iota0 ) ** 2  real(iota) ** 2  imag(iota) ** 2 )  printf("%d\n",result);  transform(iter_freq,iter_elem) = result;  else  transform(iter_freq,iter_elem) = 0;  endif  t += delta_t + transform{iter} = zeros(1,current_window_number); + win_t = window_min + current_radius; + for iter_window = 1:current_window_number + ## the beautiful part of this code is that if parts end up falling outside the + ## vector, it won't matter (although it's wasted computations.) + ## I may add a trap to avoid too many wasted cycles. + windowed_t = ((abs (Twin_t) < current_radius) .* T); + ## this will of course involve an additional large memory allocation, at least in the short term, + ## but it's faster to do the operation once on the time series, then multiply it by the data series. + iota0 = sum ( cubicwgt (windowed_t ./ current_radius ) ); + zeta = sum( cubicwgt ((windowed_t  win_t) ./ current_radius) .* exp(  i * o .* windowed_t ) .* X ) / iota0; + iota = sum( cubicwgt ((windowed_t  win_t) ./ current_radius) .* exp(  i * 2 * o .* windowed_t) .* X ) / sum ( cubicwgt( windowed_t .* 2 * o ) ); + transform{iter}(iter_window) = 2 * ( conj(zeta) * iota0 + zeta * conj(iota) ) / ( ( length ( find (windowed_t)) + iota0 ) ^ 2  real(iota) ^ 2  imag(iota) ^ 2 ); + window_min += 2 * current_radius; + ## I remain hesitant about this value, since it is entirely possible necessary precision will be lost. Should I try to reduce that? endfor  o *= omegamult  winradius *= omegamult_inv  iter_freq + endfor + endfunction This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. 
From: <benjf5@us...>  20120725 04:49:18

Revision: 10773 http://octave.svn.sourceforge.net/octave/?rev=10773&view=rev Author: benjf5 Date: 20120725 04:48:43 +0000 (Wed, 25 Jul 2012) Log Message:  Working on lsrealwavelet, have some solid progress. (Not currently usable.) Added Paths:  trunk/octaveforge/extra/lssa/SampleDataSet.m trunk/octaveforge/extra/lssa/lsrealwavelet.m Added: trunk/octaveforge/extra/lssa/SampleDataSet.m ===================================================================  trunk/octaveforge/extra/lssa/SampleDataSet.m (rev 0) +++ trunk/octaveforge/extra/lssa/SampleDataSet.m 20120725 04:48:43 UTC (rev 10773) @@ 0,0 +1,25 @@ +## Copyright (C) 2012 Benjamin Lewis <benjf5@...> +## +## 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, see <http://www.gnu.org/licenses/>;. + +## No function structure to this, I just want to use it to store the +## sums of sines and cosines I'll use for testing. + +xvec = linspace(0,8,1000); +maxfreq = 4 / ( 2 * pi ); + +yvec = ( 2.*sin(maxfreq.*xvec) + 3.*sin((3/4)*maxfreq.*xvec) +  0.5 .* sin((1/4)*maxfreq.*xvec)  0.2 .* cos(maxfreq .* xvec) + + cos((1/4)*maxfreq.*xvec)); + Added: trunk/octaveforge/extra/lssa/lsrealwavelet.m ===================================================================  trunk/octaveforge/extra/lssa/lsrealwavelet.m (rev 0) +++ trunk/octaveforge/extra/lssa/lsrealwavelet.m 20120725 04:48:43 UTC (rev 10773) @@ 0,0 +1,89 @@ +# Copyright (C) 2012 Benjamin Lewis <benjf5@...> + +##* texinfo * +## @deffun {Function File} {t =} +## +## +## +## @end deffun + + +function transform = lsrealwavelet(T, X, maxfreq, ncoeff, noctave, t_min, t_max, minimum_window_number, sigma=0.1 ) + +delta_t = (t_max  t_min)/(t_subdiv1) +# fails if you're trying to use less than 2 windows. Why use the wavelet tool at that point? + +len_tx = length (T) +omegamult = 2 ^ (  1/ ncoeff ) +omegamult_inv = 1 / omegamult +winradius = pi / ( sigma * maxfreq ) + +current_radius = winradius; + +o = maxfreq; + +# zeta _ ( t , omega ) = sum(w(sigma omega (t_k  t )e^(i omega (t_k  t))xi_k) +# / sum( w(sigma omega ( t_k  t ) ) ); +# +# w ( t ) = { 1  3  t  ^ 2 + 2  t  ^ 3 , t in [  1 , 1 ] ; 0 for others } + +# Now, I *think* that this transform is supposed to be applied by taking +# t as the centre of each window, while sigma should scale the time +# values inside the window to the window. I think. + +transform = cell(noctave*ncoeff,1); + +## in this, win_t is the centre of the window in question +window_min = t_min; +## Although that will vary depending on the window. This is just an implementation for the first window. +win_t = window_min + window_radius; + +windowed_t = ((abs (Twin_t) < window_radius) .* T); +zeta = sum( cubicwgt ((windowed_t  win_t) ./ window_radius) .* exp(  i * o .* windowed_t ) .* X ) / sum ( cubicwgt( windowed_t ./ window_radius ) ); +iota = sum( cubicwgt ((windowed_t  win_t) ./ window_radius) .* exp(  i * 2 * o .* windowed_t) .* X ) / sum ( cubicwgt( windowed_t .* 2 * o ) ) +## this will of course involve an additional large memory allocation, at least in the short term, +## but it's faster to do the operation once on the time series, then multiply it by the data series. + + + +for iter_freq = 1:( noctave * ncoeff ) + t = t_min; + tx_point = 1; + for iter_elem = 1:t_subdiv + if tx_point > len_tx + break + endif + while ( tx_point+1 <= len_tx) && ((tT(tx_point+1))<winradius) + tx_point++; + endwhile + zeta = 0; + iota = 0; + iota0 = 0; + count = 0; + ot = o * ( T(tx_point)  t); + sot = sigma * ot; + while ( tx_point <= len_tx) && ( (sot = sigma * (ot = o*(T(tx_point)t))) < pi ) + w = 0.5 * ( 1 + cos (sot)); + iota0 += w; + zeta += w * ( cos (ot) + sin (ot) * i ) * X(tx_point); + ot *= 2; + iota += w * ( cos(ot) + sin (ot) * i ); + count++; + tx_point++; + endwhile + if count > 0 + result = 2 * ( conj (zeta) * iota0 + zeta * conj (iota) ) / ( ( count + iota0 ) ** 2  real(iota) ** 2  imag(iota) ** 2 ) + printf("%d\n",result); + transform(iter_freq,iter_elem) = result; + else + transform(iter_freq,iter_elem) = 0; + endif + t += delta_t + endfor + o *= omegamult + winradius *= omegamult_inv + iter_freq +endfor + + +endfunction This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. 