Mailman 3 September 2012 - SciPy-Dev

ckdtree pull request
by Vincent Schut Sept. 9, 2012

Sept. 9, 2012

Hi all, there is this pull request with improvements for ckdtree (https://github.com/scipy/scipy/pull/262) that fixes quite some memory leaks for me. It saves me from the need to frequently restart my remote processing scripts, that use ckdtrees, and otherwise leak memory like a sieve... May I humbly request - as just a user who knows his place - this to be merged? Best, Vincent Schut.

4 6

extended functionality of max/min ufuncs
by Tom Grydeland Sept. 8, 2012

Sept. 8, 2012

Hi all, I'm working on a system to translate (EXELIS/ITTVIS/RSI) IDL to Python/Numpy. The results are close to usable for many purposes, but some simple constructs are causing snags I was hoping you could help me with. IDL's MAX function supports a second (output) argument which will contain the index of the maximum value. One can write PRINT, MAX(x, id), id to get the value and index of the maximum element. In Numpy, I could do id = np.argmax(x); print x[id], id to get the same results in two statements. However, I can give MAX an extra keyword /NAN to tell it to ignore NaN and infinities. In Numpy, I have np.nanmax, but no np.nanargmax. In addition, MAX has the output keywords MIN=value and SUBSCRIPT_MIN=index to return the minimum value and its index from the same function call. Similarly, MIN has output keywords MAX=value and SUBSCRIPT_MAX=index, so I can get max/min values and their indices (ignoring NaNs) in a single call -- in Numpy I would need two calls, two indexing operations, one temporary array of values and one of indices. Would it be hard to add similar functionality to Numpy's min() and max() functions? Is it desirable? Regards, -- Tom Grydeland <Tom.Grydeland(a)(gmail.com)>

2 1

Re: [SciPy-Dev] [SciPy-User] ANN: SciPy 0.11.0 release candidate 2
by Ralf Gommers Sept. 8, 2012

Sept. 8, 2012

On Tue, Aug 14, 2012 at 12:09 AM, Christoph Gohlke <cgohlke(a)uci.edu> wrote: > On 8/13/2012 11:30 AM, Ralf Gommers wrote: > > Hi, > > > > I am pleased to announce the availability of the second release > > candidate of SciPy 0.11.0. For this release many new features have been > > added, and over 120 tickets and pull requests have been closed. Also > > noteworthy is that the number of contributors for this release has risen > > to over 50. Some of the highlights are: > > > > - A new module, sparse.csgraph, has been added which provides a > > number of common sparse graph algorithms. > > - New unified interfaces to the existing optimization and root > > finding functions have been added. > > > > Sources and binaries can be found at > > http://sourceforge.net/projects/scipy/files/scipy/0.11.0rc2/, release > > notes are copied below. > > > > For this release candidate all known issues (with the exception of one > > Qhull issue on Debian, s390x platform) have been solved. In the meantime > > also OS X 10.8 was released, this RC contains a few build fixes for that > > platform. > > > > If no more serious issues are reported, the final release will be in one > > week. > > > > Cheers, > > Ralf > > > Hi Ralf, > > test_qz_double_sort is now failing in all msvc9/MKL builds (Python 2.6 > to 3.2, 32 and 64 bit): > Hmm, I think that that excludes anything compiler or ATLAS specific. This is the only test which really checks the results are correct for float input, almost all the other test only check that the output of qz is self-consistent (no hard-coded expected output). It seems that a couple more tests would be helpful. This issue has held up the release for too long already, so unless someone has time to get it resolved this week, I propose the following: 1. Figure out if the problem is the sort function or something else. 2. If it's sort, disable it. Otherwise remove the qz function from the 0.11.x branch. Ralf > > FAIL: test_qz_double_sort (test_decomp.TestQZ) > ---------------------------------------------------------------------- > Traceback (most recent call last): > File > "X:\Python32\lib\site-packages\scipy\linalg\tests\test_decomp.py", line > 1728, in test_qz_double_sort > [ 0. , 0. , 0. , -12.8217]]), 4) > File "X:\Python32\lib\site-packages\numpy\testing\utils.py", line > 800, in assert_array_almost_equal > header=('Arrays are not almost equal to %d decimals' % decimal)) > File "X:\Python32\lib\site-packages\numpy\testing\utils.py", line > 636, in assert_array_compare > raise AssertionError(msg) > AssertionError: > Arrays are not almost equal to 4 decimals > > (mismatch 62.5%) > x: array([[-14.66007968, -27.25220511, -31.55732717, -29.0823765 ], > [ 0. , 30.23027809, 42.47668118, 52.55438253], > [ 0. , 0. , 0.71600413, -2.77147791], > [ 0. , 0. , 0. , 2.50096525]]) > y: array([[ 3.57864000e+01, -8.09061000e+01, -1.20629000e+01, > -9.49800000e+00], > [ 0.00000000e+00, 2.76380000e+00, -2.35050000e+00,... > > > Christoph > > _______________________________________________ > SciPy-User mailing list > SciPy-User(a)scipy.org > http://mail.scipy.org/mailman/listinfo/scipy-user >

1 1

John Hunter's memorial service: Oct 1, 2012
by Fernando Perez Sept. 7, 2012

Sept. 7, 2012

Hi all, I have just received the following information from John's family regarding the memorial service: John's memorial service will be held on Monday, October 1, 2012, at 11.a.m. at Rockefeller Chapel at the University of Chicago. The exact address is 5850 S. Woodlawn Ave, Chicago, IL 60615. The service is open to the public. The service will be fully planned and scripted with no room for people to eulogize, however, we will have a reception after the service, hosted by Tradelink, where people can talk. Regards, f

1 1