Hi,
I am trying to profile a bit of code I have written using cProfile. When I
run it I get the message:
TypeError: unhashable type: 'numpy.ndarray'
I am using runctx with some local variables which are ndarrays.
I am guessing that this is a lmitation of either cProfile or numpy or the
mix of
Bit of a newb question I suspect...
I have a matrix and a vector which has the same number of elements as the
matrix has rows. I want to multiply each element in a row in the matrix by
the corresponding element in the vector. I can obviously do this with a
loop, but am guessing there is a more
her here or probably better to simplejson.
On Mon, Nov 10, 2008 at 5:58 PM, Christopher Barker
<[EMAIL PROTECTED]>wrote:
> Simon Palmer wrote:
> > What, if any, header information from numarray gets put in the bytes by
> > tostring(), especially as I have n dimensions?
>
>
.
On Mon, Nov 10, 2008 at 5:36 PM, Robert Kern <[EMAIL PROTECTED]> wrote:
> On Mon, Nov 10, 2008 at 11:25, Simon Palmer <[EMAIL PROTECTED]>
> wrote:
> > Does anyone have a recommendation of a library/method for serialization
> of
> > numpy arrays to and from text
Does anyone have a recommendation of a library/method for serialization of
numpy arrays to and from text (specifically for the purposes of embedding in
XML)? I don't want to use pickle or tostring() because my XML has to be
consumable across a variety of programming environments.
I'm currently us
Thanks very much everyone, this has been very helpful. I have been doing
some timing of my own and the order of magnitude difference that numpy
provides wins. I'm learning python as I go so some of my questions come
from a lack of language skillls, but it is good to get to know the numpy
dialect
At the risk of uttering a heresy, are you bound to Python for this? I bet
you could find a C library that will work well, plus it is not a hard
algorithm to code yourself. I am pretty sure I have used a numerical
recipes algorithm for regression in my distant past.
Also I can't help thinking the
using all the data. As scientists this is obvious, as a
lay person, and particularly a business person, it appears to be madness.
The fewer leaps of faith necessary the better.
On Wed, Jun 11, 2008 at 7:34 PM, Anne Archibald <[EMAIL PROTECTED]>
wrote:
> 2008/6/10 Simon Palmer <
clustering yes, hierarchical no.
On Wed, Jun 11, 2008 at 4:55 PM, Charles R Harris <[EMAIL PROTECTED]>
wrote:
>
>
> On Wed, Jun 11, 2008 at 9:33 AM, Simon Palmer <[EMAIL PROTECTED]>
> wrote:
>
>> Pretty simple. I don't do any transformations. It is a
ms of performance
and scalability. A fast and efficient solution to this issue would make a
huge difference to me.
On Wed, Jun 11, 2008 at 1:05 AM, Robert Kern <[EMAIL PROTECTED]> wrote:
> On Tue, Jun 10, 2008 at 18:53, Simon Palmer <[EMAIL PROTECTED]>
> wrote:
> > Hi I have
Hi I have a problem which involves the creation of a large square matrix
which is zero across its diagonal and symmetrical about the diagonal i.e.
m[i,j] = m[j,i] and m[i,i] = 0. So, in fact, it is a large triangular
matrix. I was wondering whether there is any way of easily handling a
matrix of
11 matches
Mail list logo
