Mailman 3 February 2012 - NumPy-Discussion

Matrices and arrays of vectors
by Bob Dowling Feb. 24, 2012

Feb. 24, 2012

Conceptually, I have a 2-d grid of 2-d vectors. I am representing this as an ndarray of shape (2,M,N). I want to apply a 2x2 matrix individually to each vector in the grid. However, I can't work out the appropriate syntax for getting the matrix multiplication to broadcast over the grid. All attempts at multiplication seem to want to cast the 3-d array into a matricx with the inevitable error message "ValueError: shape too large to be a matrix." Does such a method exist? This is a dummy script to show the sort of thing I'm trying to do: import math import numpy import numpy.random # Rotation angle theta = math.pi/6.0 # Grid shape M = 10 N = 10 # Establish the rotation matrix c = math.cos(theta) s = math.sin(theta) rotation = numpy.matrix([[c, s], [-1.0*s, c]]) # Fudge some data to work with data = numpy.random.uniform(-1.0, 1.0, 2*M*N).reshape(2,M,N) # THIS DOES NOT WORK. # BUT WHAT DOES? rotated_data = rotation*data

4 5

Re: [Numpy-discussion] Test survey that I have been putting together
by Hans-Martin v. Gaudecker Feb. 24, 2012

Feb. 24, 2012

> From: Travis Oliphant <travis(a)continuum.io> > After you complete the survey, I would really appreciate any feedback on questions that could be improved, removed, or added. Hi Travis, I didn't really get whom you mean by "they" in: 5. What do they want you to be using (technologies, languages, libraries)? Is that supposed to be getting back to 2. -- colleagues, coauthors? Or the organisation in 4.? The cluster question is not really covering the use-case for many University users, I imagine. E.g. our cluster here has a large number of nodes, but it is shared among many users so I would hardly be able to use more than a few dozen nodes at a time. Maybe rephrase in terms of access? And although I am aware that it might stir up some emotions on the list, adding "missing value support" to the desired features would be useful IMHO. Best, Hans-Martin

1 0

Announcing Theano 0.5
by Pascal Lamblin Feb. 23, 2012

Feb. 23, 2012

=========================== Announcing Theano 0.5 =========================== This is a major version, with lots of new features, bug fixes, and some interface changes (deprecated or potentially misleading features were removed). Upgrading to Theano 0.5 is recommended for everyone, but you should first make sure that your code does not raise deprecation warnings with Theano 0.4.1. Otherwise, in one case the results can change. In other cases, the warnings are turned into errors (see below for details). For those using the bleeding edge version in the git repository, we encourage you to update to the `0.5` tag. If you have updated to 0.5rc1 or 0.5rc2, you are highly encouraged to update to 0.5, as some bugs introduced in those versions have now been fixed, see items marked with '#' in the lists below. What's New ---------- Highlight: * Moved to github: http://github.com/Theano/Theano/ * Old trac ticket moved to assembla ticket: http://www.assembla.com/spaces/theano/tickets * Theano vision: http://deeplearning.net/software/theano/introduction.html#theano-vision (Many people) * Theano with GPU works in some cases on Windows now. Still experimental. (Sebastian Urban) * Faster dot() call: New/Better direct call to cpu and gpu ger, gemv, gemm and dot(vector, vector). (James, Frédéric, Pascal) * C implementation of Alloc. (James, Pascal) * theano.grad() now also work with sparse variable. (Arnaud) * Macro to implement the Jacobian/Hessian with theano.tensor.{jacobian,hessian} (Razvan) * See the Interface changes. Interface Behavior Changes: * The current default value of the parameter axis of theano.{max,min,argmax,argmin,max_and_argmax} is now the same as numpy: None. i.e. operate on all dimensions of the tensor. (Frédéric Bastien, Olivier Delalleau) (was deprecated and generated a warning since Theano 0.3 released Nov. 23rd, 2010) * The current output dtype of sum with input dtype [u]int* is now always [u]int64. You can specify the output dtype with a new dtype parameter to sum. The output dtype is the one using for the summation. There is no warning in previous Theano version about this. The consequence is that the sum is done in a dtype with more precision than before. So the sum could be slower, but will be more resistent to overflow. This new behavior is the same as numpy. (Olivier, Pascal) # When using a GPU, detect faulty nvidia drivers. This was detected when running Theano tests. Now this is always tested. Faulty drivers results in in wrong results for reduce operations. (Frederic B.) Interface Features Removed (most were deprecated): * The string modes FAST_RUN_NOGC and STABILIZE are not accepted. They were accepted only by theano.function(). Use Mode(linker='c|py_nogc') or Mode(optimizer='stabilize') instead. * tensor.grad(cost, wrt) now always returns an object of the "same type" as wrt (list/tuple/TensorVariable). (Ian Goodfellow, Olivier) * A few tag.shape and Join.vec_length left have been removed. (Frederic) * The .value attribute of shared variables is removed, use shared.set_value() or shared.get_value() instead. (Frederic) * Theano config option "home" is not used anymore as it was redundant with "base_compiledir". If you use it, Theano will now raise an error. (Olivier D.) * scan interface changes: (Razvan Pascanu) * The use of `return_steps` for specifying how many entries of the output to return has been removed. Instead, apply a subtensor to the output returned by scan to select a certain slice. * The inner function (that scan receives) should return its outputs and updates following this order: [outputs], [updates], [condition]. One can skip any of the three if not used, but the order has to stay unchanged. Interface bug fix: * Rop in some case should have returned a list of one Theano variable, but returned the variable itself. (Razvan) New deprecation (will be removed in Theano 0.6, warning generated if you use them): * tensor.shared() renamed to tensor._shared(). You probably want to call theano.shared() instead! (Olivier D.) Bug fixes (incorrect results): * On CPU, if the convolution had received explicit shape information, they where not checked at runtime. This caused wrong result if the input shape was not the one expected. (Frederic, reported by Sander Dieleman) * Theoretical bug: in some case we could have GPUSum return bad value. We were not able to reproduce this problem * patterns affected ({0,1}*nb dim, 0 no reduction on this dim, 1 reduction on this dim): 01, 011, 0111, 010, 10, 001, 0011, 0101 (Frederic) * div by zero in verify_grad. This hid a bug in the grad of Images2Neibs. (James) * theano.sandbox.neighbors.Images2Neibs grad was returning a wrong value. The grad is now disabled and returns an error. (Frederic) * An expression of the form "1 / (exp(x) +- constant)" was systematically matched to "1 / (exp(x) + 1)" and turned into a sigmoid regardless of the value of the constant. A warning will be issued if your code was affected by this bug. (Olivier, reported by Sander Dieleman) * When indexing into a subtensor of negative stride (for instance, x[a:b:-1][c]), an optimization replacing it with a direct indexing (x[d]) used an incorrect formula, leading to incorrect results. (Pascal, reported by Razvan) * The tile() function is now stricter in what it accepts to allow for better error-checking/avoiding nonsensical situations. The gradient has been disabled for the time being as it only implemented (incorrectly) one special case. The `reps` argument must be a constant (not a tensor variable), and must have the same length as the number of dimensions in the `x` argument; this is now checked. (David) # Fix a bug with Gemv and Ger on CPU, when used on vectors with negative strides. Data was read from incorrect (and possibly uninitialized) memory space. This bug was probably introduced in 0.5rc1. (Pascal L.) # The Theano flag "nvcc.flags" is now included in the hard part of the key. This mean that now we recompile all modules for each value of "nvcc.flags". A change in "nvcc.flags" used to be ignored for module that were already compiled. (Frederic B.) Scan fixes: * computing grad of a function of grad of scan (reported by Justin Bayer, fix by Razvan) before : most of the time crash, but could be wrong value with bad number of dimensions (so a visible bug) now : do the right thing. * gradient with respect to outputs using multiple taps (reported by Timothy, fix by Razvan) before : it used to return wrong values now : do the right thing. Note: The reported case of this bug was happening in conjunction with the save optimization of scan that give run time errors. So if you didn't manually disable the same memory optimization (number in the list4), you are fine if you didn't manually request multiple taps. * Rop of gradient of scan (reported by Timothy and Justin Bayer, fix by Razvan) before : compilation error when computing R-op now : do the right thing. * save memory optimization of scan (reported by Timothy and Nicolas BL, fix by Razvan) before : for certain corner cases used to result in a runtime shape error now : do the right thing. * Scan grad when the input of scan has sequences of different lengths. (Razvan, reported by Michael Forbes) * Scan.infer_shape now works correctly when working with a condition for the number of loops. In the past, it returned n_steps as the length, which is not always true. (Razvan) * Scan.infer_shape crash fix. (Razvan) New features: * AdvancedIncSubtensor grad defined and tested (Justin Bayer) * Adding 1D advanced indexing support to inc_subtensor and set_subtensor (James Bergstra) * tensor.{zeros,ones}_like now support the dtype param as numpy (Frederic) * Added configuration flag "exception_verbosity" to control the verbosity of exceptions (Ian) * theano-cache list: list the content of the theano cache (Frederic) * theano-cache unlock: remove the Theano lock (Olivier) * tensor.ceil_int_div to compute ceil(a / float(b)) (Frederic) * MaxAndArgMax.grad now works with any axis (The op supports only 1 axis) (Frederic) * used by tensor.{max,min,max_and_argmax} * tensor.{all,any} (Razvan) * tensor.roll as numpy: (Matthew Rocklin, David Warde-Farley) * Theano with GPU works in some cases on Windows now. Still experimental. (Sebastian Urban) * IfElse now allows to have a list/tuple as the result of the if/else branches. * They must have the same length and corresponding type (Razvan) * Argmax output dtype is now int64 instead of int32. (Olivier) * Added the element-wise operation arccos. (Ian) * Added sparse dot with dense grad output. (Yann Dauphin) * Optimized to Usmm and UsmmCscDense in some case (Yann) * Note: theano.dot and theano.sparse.structured_dot() always had a gradient with the same sparsity pattern as the inputs. The new theano.sparse.dot() has a dense gradient for all inputs. * GpuAdvancedSubtensor1 supports broadcasted dimensions. (Frederic) * TensorVariable.zeros_like() and SparseVariable.zeros_like() * theano.sandbox.cuda.cuda_ndarray.cuda_ndarray.device_properties() (Frederic) * theano.sandbox.cuda.cuda_ndarray.cuda_ndarray.mem_info() return free and total gpu memory (Frederic) * Theano flags compiledir_format. Keep the same default as before: compiledir_%(platform)s-%(processor)s-%(python_version)s. (Josh Bleecher Snyder) * We also support the "theano_version" substitution. * IntDiv c code (faster and allow this elemwise to be fused with other elemwise) (Pascal) * Internal filter_variable mechanism in Type. (Pascal, Ian) * Ifelse works on sparse. * It makes use of gpu shared variable more transparent with theano.function updates and givens parameter. * Added a_tensor.transpose(axes) axes is optional (James) * theano.tensor.transpose(a_tensor, kwargs) We where ignoring kwargs, now it is used as the axes. * a_CudaNdarray_object[*] = int, now works (Frederic) * tensor_variable.size (as numpy) computes the product of the shape elements. (Olivier) * sparse_variable.size (as scipy) computes the number of stored values. (Olivier) * sparse_variable[N, N] now works (Li Yao, Frederic) * sparse_variable[M:N, O:P] now works (Li Yao, Frederic, Pascal) M, N, O, and P can be Python int or scalar tensor variables, None, or omitted (sparse_variable[:, :M] or sparse_variable[:M, N:] work). * tensor.tensordot can now be moved to GPU (Sander Dieleman, Pascal, based on code from Tijmen Tieleman's gnumpy, http://www.cs.toronto.edu/~tijmen/gnumpy.html) # Many infer_shape implemented on sparse matrices op. (David W.F.) # Added theano.sparse.verify_grad_sparse to easily allow testing grad of sparse op. It support testing the full and structured gradient. # The keys in our cache now store the hash of constants and not the constant values themselves. This is significantly more efficient for big constant arrays. (Frederic B.) # 'theano-cache list' lists key files bigger than 1M (Frederic B.) # 'theano-cache list' prints an histogram of the number of keys per compiled module (Frederic B.) # 'theano-cache list' prints the number of compiled modules per op class (Frederic B.) # The Theano flag "nvcc.fastmath" is now also used for the cuda_ndarray.cu file. # Add the header_dirs to the hard part of the compilation key. This is currently used only by cuda, but if we use library that are only headers, this can be useful. (Frederic B.) # Alloc, GpuAlloc are not always pre-computed (constant_folding optimization) at compile time if all their inputs are constant. (Frederic B., Pascal L., reported by Sander Dieleman) # New Op tensor.sort(), wrapping numpy.sort (Hani Almousli) New optimizations: * AdvancedSubtensor1 reuses preallocated memory if available (scan, c|py_nogc linker) (Frederic) * dot22, dot22scalar work with complex. (Frederic) * Generate Gemv/Gemm more often. (James) * Remove scan when all computations can be moved outside the loop. (Razvan) * scan optimization done earlier. This allows other optimizations to be applied. (Frederic, Guillaume, Razvan) * exp(x) * sigmoid(-x) is now correctly optimized to the more stable form sigmoid(x). (Olivier) * Added Subtensor(Rebroadcast(x)) => Rebroadcast(Subtensor(x)) optimization. (Guillaume) * Made the optimization process faster. (James) * Allow fusion of elemwise when the scalar op needs support code. (James) * Better opt that lifts transpose around dot. (James) Crashes fixed: * T.mean crash at graph building time. (Ian) * "Interactive debugger" crash fix. (Ian, Frederic) * Do not call gemm with strides 0, some blas refuse it. (Pascal Lamblin) * Optimization crash with gemm and complex. (Frederic) * GPU crash with elemwise. (Frederic, some reported by Chris Currivan) * Compilation crash with amdlibm and the GPU. (Frederic) * IfElse crash. (Frederic) * Execution crash fix in AdvancedSubtensor1 on 32 bit computers. (Pascal) * GPU compilation crash on MacOS X. (Olivier) * Support for OSX Enthought Python Distribution 7.x. (Graham Taylor, Olivier) * When the subtensor inputs had 0 dimensions and the outputs 0 dimensions. (Frederic) * Crash when the step to subtensor was not 1 in conjunction with some optimization. (Frederic, reported by Olivier Chapelle) * Runtime crash related to an optimization with subtensor of alloc (reported by Razvan, fixed by Frederic) * Fix dot22scalar cast of integer scalars (Justin Bayer, Frédéric, Olivier) * Fix runtime crash in gemm, dot22. FB * Fix on 32bits computer: make sure all shape are int64.(Olivier) * Fix to deque on python 2.4 (Olivier) * Fix crash when not using c code (or using DebugMode) (not used by default) with numpy 1.6*. Numpy has a bug in the reduction code that made it crash. (Pascal) * Crashes of blas functions (Gemv on CPU; Ger, Gemv and Gemm on GPU) when matrices had non-unit stride in both dimensions (CPU and GPU), or when matrices had negative strides (GPU only). In those cases, we are now making copies. (Pascal) # More cases supported in AdvancedIncSubtensor1. (Olivier D.) # Fix crash when a broadcasted constant was used as input of an elemwise Op and needed to be upcasted to match the op's output. (Reported by John Salvatier, fixed by Pascal L.) # Fixed a memory leak with shared variable (we kept a pointer to the original value) (Ian G.) Known bugs: * CAReduce with nan in inputs don't return the good output (`Ticket <https://www.assembla.com/spaces/theano/tickets/763>`_). * This is used in tensor.{max,mean,prod,sum} and in the grad of PermuteRowElements. Sandbox: * cvm interface more consistent with current linker. (James) * Now all tests pass with the linker=cvm flags. * vm linker has a callback parameter. (James) * review/finish/doc: diag/extract_diag. (Arnaud Bergeron, Frederic, Olivier) * review/finish/doc: AllocDiag/diag. (Arnaud, Frederic, Guillaume) * review/finish/doc: MatrixInverse, matrix_inverse. (Razvan) * review/finish/doc: matrix_dot. (Razvan) * review/finish/doc: det (determinent) op. (Philippe Hamel) * review/finish/doc: Cholesky determinent op. (David) * review/finish/doc: ensure_sorted_indices. (Li Yao) * review/finish/doc: spectral_radius_boud. (Xavier Glorot) * review/finish/doc: sparse sum. (Valentin Bisson) * review/finish/doc: Remove0 (Valentin) * review/finish/doc: SquareDiagonal (Eric) Sandbox New features (not enabled by default): * CURAND_RandomStreams for uniform and normal (not picklable, GPU only) (James) * New sandbox.linalg.ops.pinv(pseudo-inverse) op (Razvan) Documentation: * Many updates. (Many people) * Updates to install doc on MacOS. (Olivier) * Updates to install doc on Windows. (David, Olivier) * Doc on the Rop function (Ian) * Added how to use scan to loop with a condition as the number of iteration. (Razvan) * Added how to wrap in Theano an existing python function (in numpy, scipy, ...). (Frederic) * Refactored GPU installation of Theano. (Olivier) Others: * Better error messages in many places. (Many people) * PEP8 fixes. (Many people) * Add a warning about numpy bug when using advanced indexing on a tensor with more than 2**32 elements (the resulting array is not correctly filled and ends with zeros). (Pascal, reported by David WF) * Added Scalar.ndim=0 and ScalarSharedVariable.ndim=0 (simplify code) (Razvan) * New min_informative_str() function to print graph. (Ian) * Fix catching of exception. (Sometimes we used to catch interrupts) (Frederic, David, Ian, Olivier) * Better support for utf string. (David) * Fix pydotprint with a function compiled with a ProfileMode (Frederic) * Was broken with change to the profiler. * Warning when people have old cache entries. (Olivier) * More tests for join on the GPU and CPU. (Frederic) * Do not request to load the GPU module by default in scan module. (Razvan) * Fixed some import problems. (Frederic and others) * Filtering update. (James) * On Windows, the default compiledir changed to be local to the computer/user and not transferred with roaming profile. (Sebastian Urban) * New theano flag "on_shape_error". Defaults to "warn" (same as previous behavior): it prints a warning when an error occurs when inferring the shape of some apply node. The other accepted value is "raise" to raise an error when this happens. (Frederic) * The buidbot now raises optimization/shape errors instead of just printing a warning. (Frederic) * better pycuda tests (Frederic) * check_blas.py now accept the shape and the number of iteration as parameter (Frederic) * Fix opt warning when the opt ShapeOpt is disabled (enabled by default) (Frederic) * More internal verification on what each op.infer_shape return. (Frederic, James) * Argmax dtype to int64 (Olivier) * Improved docstring and basic tests for the Tile Op (David). Reviewers (alphabetical order): * David, Frederic, Ian, James, Olivier, Razvan Download and Install -------------------- You can download Theano from http://pypi.python.org/pypi/Theano Installation instructions are available at http://deeplearning.net/software/theano/install.html Description ----------- Theano is a Python library that allows you to define, optimize, and efficiently evaluate mathematical expressions involving multi-dimensional arrays. It is built on top of NumPy. Theano features: * tight integration with NumPy: a similar interface to NumPy's. numpy.ndarrays are also used internally in Theano-compiled functions. * transparent use of a GPU: perform data-intensive computations up to 140x faster than on a CPU (support for float32 only). * efficient symbolic differentiation: Theano can compute derivatives for functions of one or many inputs. * speed and stability optimizations: avoid nasty bugs when computing expressions such as log(1+ exp(x)) for large values of x. * dynamic C code generation: evaluate expressions faster. * extensive unit-testing and self-verification: includes tools for detecting and diagnosing bugs and/or potential problems. Theano has been powering large-scale computationally intensive scientific research since 2007, but it is also approachable enough to be used in the classroom (IFT6266 at the University of Montreal). Resources --------- About Theano: http://deeplearning.net/software/theano/ Theano-related projects: http://github.com/Theano/Theano/wiki/Related-projects About NumPy: http://numpy.scipy.org/ About SciPy: http://www.scipy.org/ Machine Learning Tutorial with Theano on Deep Architectures: http://deeplearning.net/tutorial/ Acknowledgments --------------- I would like to thank all contributors of Theano. For this particular release, many people have helped, notably (in alphabetical order): Hani Almousli, Frédéric Bastien, Justin Bayer, Arnaud Bergeron, James Bergstra, Valentin Bisson, Josh Bleecher Snyder, Yann Dauphin, Olivier Delalleau, Guillaume Desjardins, Sander Dieleman, Xavier Glorot, Ian Goodfellow, Philippe Hamel, Pascal Lamblin, Eric Laufer, Grégoire Mesnil, Razvan Pascanu, Matthew Rocklin, Graham Taylor, Sebastian Urban, David Warde-Farley, and Yao Li. I would also like to thank users who submitted bug reports, notably: Nicolas Boulanger-Lewandowski, Olivier Chapelle, Michael Forbes, Timothy Lillicrap, and John Salvatier. Also, thank you to all NumPy and Scipy developers as Theano builds on their strengths. -- Pascal

1 0

python geospatial package?
by Chao YUE Feb. 23, 2012

Feb. 23, 2012

Hi all, Is anyone using some python geospatial package that can do jobs like intersection, etc. the job is like you automatically extract a region on a global map etc. thanks and cheers, Chao -- *********************************************************************************** Chao YUE Laboratoire des Sciences du Climat et de l'Environnement (LSCE-IPSL) UMR 1572 CEA-CNRS-UVSQ Batiment 712 - Pe 119 91191 GIF Sur YVETTE Cedex Tel: (33) 01 69 08 29 02; Fax:01.69.08.77.16 ************************************************************************************

4 3

ABI status of Master
by Travis Oliphant Feb. 23, 2012

Feb. 23, 2012

Hey all, From what I can tell, the master branch is still ABI compatible with NumPy 1.7. Is that true? I'd like to relabel the version of the master branch to 1.8. Does anyone see any problems with that? Thanks, -Travis

3 2

Numpy 1.5.1/1.6.1 doesn't build doc with sphinx 1.1.2
by Sandro Tosi Feb. 22, 2012

Feb. 22, 2012

Hello, with the new sphinx, v1.1.2, numpy documentation of 1.5.1 or 1.6.1 doesn't build. The full log of the debian package build is at: http://people.debian.org/~jwilk/tmp/python-numpy_1.6.1-3_i386.build attached is the file left in /tmp by sphinx for the error. Could you please give it a look? Cheers, -- Sandro Tosi (aka morph, morpheus, matrixhasu) My website: http://matrixhasu.altervista.org/ Me at Debian: http://wiki.debian.org/SandroTosi

3 3

Re: [Numpy-discussion] NumPy-Discussion Digest, Vol 65, Issue 165
by Jeffrey Starn Feb. 22, 2012

Feb. 22, 2012

Good for us Feds! (But I'm sure some people will think it's a waste of money) Not sure how that impacts our building here, but actually the landscaping is not too bad considering where we are. I don't know what's native in our front planting. --------------------------------------------------------------------------------------------------------- Jeff Starn, Groundwater Specialist U.S. Geological Survey 101 Pitkin Street East Hartford, CT 06108 (860) 291-6746 jjstarn(a)usgs.gov "Our observation of the planets' regular motion was the first triumph of empirical science over irrational dogma. We named them after the gods just to be safe." --Jon Stewart --------------------------------------------------------------------------------------------------------- From: numpy-discussion-request(a)scipy.org To: numpy-discussion(a)scipy.org Date: 02/22/2012 08:52 AM Subject: NumPy-Discussion Digest, Vol 65, Issue 165 Sent by: numpy-discussion-bounces(a)scipy.org Send NumPy-Discussion mailing list submissions to numpy-discussion(a)scipy.org To subscribe or unsubscribe via the World Wide Web, visit http://mail.scipy.org/mailman/listinfo/numpy-discussion or, via email, send a message with subject or body 'help' to numpy-discussion-request(a)scipy.org You can reach the person managing the list at numpy-discussion-owner(a)scipy.org When replying, please edit your Subject line so it is more specific than "Re: Contents of NumPy-Discussion digest..." Today's Topics: 1. Where is arrayobject.h? (Neal Becker) 2. Re: Where is arrayobject.h? (V. Armando Sol?) 3. Re: Proposed Roadmap Overview (Gael Varoquaux) 4. Live coding demonstration (alan(a)ajackson.org) 5. Re: Live coding demonstration (Flavio Coelho) 6. Re: Proposed Roadmap Overview (Neal Becker) 7. Re: Proposed Roadmap Overview (Perry Greenfield) 8. Re: Live coding demonstration (Fahredd?n Basegmez) ---------------------------------------------------------------------- Message: 1 Date: Tue, 21 Feb 2012 13:26:17 -0500 From: Neal Becker <ndbecker2(a)gmail.com> Subject: [Numpy-discussion] Where is arrayobject.h? To: numpy-discussion(a)scipy.org Message-ID: <ji0nka$doe$1(a)dough.gmane.org> Content-Type: text/plain; charset="ISO-8859-1" What is the correct way to find the installed location of arrayobject.h? On fedora, I had been using: (via scons): import distutils.sysconfig PYTHONINC = distutils.sysconfig.get_python_inc() PYTHONLIB = distutils.sysconfig.get_python_lib(1) NUMPYINC = PYTHONLIB + '/numpy/core/include' But on ubuntu, this fails. It seems numpy was installed into /usr/local/lib/..., while PYTHONLIB expands to /usr/lib/python2.7/dist-packages. Is there a universal method? ------------------------------ Message: 2 Date: Tue, 21 Feb 2012 19:31:55 +0100 From: "V. Armando Sol?" <sole(a)esrf.fr> Subject: Re: [Numpy-discussion] Where is arrayobject.h? To: Discussion of Numerical Python <numpy-discussion(a)scipy.org> Message-ID: <4F43E31B.3000802(a)esrf.fr> Content-Type: text/plain; charset=ISO-8859-1; format=flowed On 21/02/2012 19:26, Neal Becker wrote: > What is the correct way to find the installed location of arrayobject.h? > > On fedora, I had been using: > (via scons): > > import distutils.sysconfig > PYTHONINC = distutils.sysconfig.get_python_inc() > PYTHONLIB = distutils.sysconfig.get_python_lib(1) > > NUMPYINC = PYTHONLIB + '/numpy/core/include' > > But on ubuntu, this fails. It seems numpy was installed into > /usr/local/lib/..., while PYTHONLIB expands to /usr/lib/python2.7/dist-packages. > > Is there a universal method? > > I use: import numpy numpy.get_include() If that is universal I cannot tell. Armando ------------------------------ Message: 3 Date: Tue, 21 Feb 2012 23:18:53 +0100 From: Gael Varoquaux <gael.varoquaux(a)normalesup.org> Subject: Re: [Numpy-discussion] Proposed Roadmap Overview To: Discussion of Numerical Python <numpy-discussion(a)scipy.org> Message-ID: <20120221221853.GB13483(a)phare.normalesup.org> Content-Type: text/plain; charset=us-ascii On Sun, Feb 19, 2012 at 05:44:27AM -0500, David Warde-Farley wrote: > I think the comments about the developer audience NumPy will attract are important. There may be lots of C++ developers out there, but the intersection of (truly competent in C++) and (likely to involve oneself in NumPy development) may well be quite small. That's a very valid concern. It is reminiscent of a possible cause to our lack of contributors to Mayavi: contributing to Mayavi requires knowing VTK. One of the major benefits of Mayavi is that it makes it is to use the power of VTK without understanding it well. The intersection of the people interested in using Mayavi and able to contribute to it is almost empty. This is stricking to me, because I know a lot of who know VTK well. Most of them couldn't care less for Mayavi: they are happy coding directly in VTK in C++. This is also a reason why I don't code UIs any more: I simply cannot find the resource to maintain them in proportion with the number of users that they garner. A sad statement. Gael ------------------------------ Message: 4 Date: Tue, 21 Feb 2012 20:31:27 -0600 From: <alan(a)ajackson.org> Subject: [Numpy-discussion] Live coding demonstration To: numpy-discussion(a)scipy.org Message-ID: <20120221203127.3b7d845d(a)ajackson.org> Content-Type: text/plain; charset=US-ASCII This is the sort of programming environment I would love to have in python. http://flowingdata.com/2012/02/20/live-coding-and-inventing-on-principle/ -- ----------------------------------------------------------------------- | Alan K. Jackson | To see a World in a Grain of Sand | | alan(a)ajackson.org | And a Heaven in a Wild Flower, | | www.ajackson.org | Hold Infinity in the palm of your hand | | Houston, Texas | And Eternity in an hour. - Blake | ----------------------------------------------------------------------- ------------------------------ Message: 5 Date: Wed, 22 Feb 2012 09:34:27 -0200 From: Flavio Coelho <fccoelho(a)gmail.com> Subject: Re: [Numpy-discussion] Live coding demonstration To: Discussion of Numerical Python <numpy-discussion(a)scipy.org> Message-ID: <CAAbyzbQRGg1ukD9aBBBshPJx-rTnc1dagFiYTkSofBFe=MHTVw(a)mail.gmail.com> Content-Type: text/plain; charset="iso-8859-1" Shouldn't be hard to implement as a set of plugins to an editor. Hope someone starts such a project. On Wed, Feb 22, 2012 at 00:31, <alan(a)ajackson.org> wrote: > This is the sort of programming environment I would love to have in > python. > > > http://flowingdata.com/2012/02/20/live-coding-and-inventing-on-principle/ > > -- > ----------------------------------------------------------------------- > | Alan K. Jackson | To see a World in a Grain of Sand | > | alan(a)ajackson.org | And a Heaven in a Wild Flower, | > | www.ajackson.org | Hold Infinity in the palm of your hand | > | Houston, Texas | And Eternity in an hour. - Blake | > ----------------------------------------------------------------------- > _______________________________________________ > NumPy-Discussion mailing list > NumPy-Discussion(a)scipy.org > http://mail.scipy.org/mailman/listinfo/numpy-discussion > -- Fl?vio Code?o Coelho ================ +55(21) 3799-5567 Professor Escola de Matem?tica Aplicada Funda??o Get?lio Vargas Rio de Janeiro - RJ Brasil

1 0

Live coding demonstration
by alan＠ajackson.org Feb. 22, 2012

Feb. 22, 2012

This is the sort of programming environment I would love to have in python. http://flowingdata.com/2012/02/20/live-coding-and-inventing-on-principle/ -- ----------------------------------------------------------------------- | Alan K. Jackson | To see a World in a Grain of Sand | | alan(a)ajackson.org | And a Heaven in a Wild Flower, | | www.ajackson.org | Hold Infinity in the palm of your hand | | Houston, Texas | And Eternity in an hour. - Blake | -----------------------------------------------------------------------

3 2

Where is arrayobject.h?
by Neal Becker Feb. 21, 2012

Feb. 21, 2012

What is the correct way to find the installed location of arrayobject.h? On fedora, I had been using: (via scons): import distutils.sysconfig PYTHONINC = distutils.sysconfig.get_python_inc() PYTHONLIB = distutils.sysconfig.get_python_lib(1) NUMPYINC = PYTHONLIB + '/numpy/core/include' But on ubuntu, this fails. It seems numpy was installed into /usr/local/lib/..., while PYTHONLIB expands to /usr/lib/python2.7/dist-packages. Is there a universal method?

2 1

is there an efficient way to get a random set of subsets/combinations?
by Yaroslav Halchenko Feb. 21, 2012

Feb. 21, 2012

Hi to all Numeric Python experts, could not think of a mailing list with better fit to my question which might have an obvious answer: straightforward (naive) Python code to answer my question would be something like import random, itertools n,p,k=100,50,10 # don't try to run with this numbers! ;) print random.sample(list(itertools.combinations(range(n), p)), k) so the goal is to get k (non-repeating) p-subsets of n, where n and p prohibitively large to first populate the full set of combinations. Thank you in advance ;-) -- =------------------------------------------------------------------= Keep in touch www.onerussian.com Yaroslav Halchenko www.ohloh.net/accounts/yarikoptic

3 3