end me any comments, questions and suggestions! I am quite open to
feedback.
Thanks,
--Hoyt
++++
+ Hoyt Koepke
+ University of Washington Department of Statistics
+ http://www.stat.washington.edu/~hoytak/
+ hoy...
o feedback.
Thanks,
--Hoyt
++++
+ Hoyt Koepke
+ University of Washington Department of Statistics
+ http://www.stat.washington.edu/~hoytak/
+ hoy...@gmail.com
++
___
NumPy-
gt;
> It does. Thanks a lot, it is very useful to have expert knowledge
> available.
Well, I don't know if I'm an "expert" in this area, but I rub
shoulders with a few and I'm glad to be of help.
-- Hoyt
+ Hoyt Koep
opular mainly because it's the best one that can be coded up
efficiently in a few hundred lines of code.
Hope that answers your questions :-).
--Hoyt
++++++++
+ Hoyt Koepke
+ University of Washington Department of Statistics
+ http://www.sta
k.
And there's tons of implementations out there, as it's often a
standard coding project in undergrad algorithms courses.
http://en.wikipedia.org/wiki/Hungarian_algorithm has links to a few.
-- Hoyt
++++++++
+ Hoyt Koepke
+ University of Washington
s solvers for this problem and
has python bindings. It's under the boost license (is that ok?). It
might be a bit heavyweight for this, though, but it's great software.
-- Hoyt
++++++++
+ Hoyt Koepke
+ University of Washington Dep
et a patch together for the distutils. However, I'd want
someone to review it since I'm not that confident in my knowledge of
the distutils code. I can also try to turn this into a more complete
description for the wiki.
-- Hoyt
+ Hoyt Koepke
+ University of Washingt
yt
On Fri, Mar 25, 2011 at 2:30 PM, Pauli Virtanen wrote:
> On Fri, 25 Mar 2011 13:46:41 -0700, Hoyt Koepke wrote:
> [clip]
>> Also, I could still not get the CloughTocher2DInterpolator to not
>> segfault.
>
> Backtrace would be useful here. It's probably best to recomp
tic -xHOST -fPIC -DMKL_LP64 -mkl -g -O3'
I'd be happy to answer any more questions about the process as needed.
Now, back to my real work.
-- Hoyt
ion to/from the existing python
representations of the matlab objects. Discussion/comments on this
point are welcome.
++++
+ Hoyt Koepke
+ University of Washington Department of Statistics
+ http://www.stat.washington.edu/~hoytak/
+ h
ed to create intent(cache|hide)|optional array-- must
have defined dimensions but got (5,5,)
and so on, with different tuples on the end.
Other than these errors, everything seemed to work great. What might
I be doing wrong there?
Thanks!
-- Hoyt
+
ibc.so.6 (0x7f591578c000)
libdl.so.2 => /lib/libdl.so.2 (0x7f5915588000)
libutil.so.1 => /lib/libutil.so.1 (0x7f5915385000)
/lib64/ld-linux-x86-64.so.2 (0x7f591770c000)
I also attached the build log here (which is the same for the first
error up to th
ent! This sounds like exactly what I was hoping for. I assume
in my case, I just need __array_priority__ > 10 to gain priority over
a matrix (from reading
http://docs.scipy.org/doc/numpy/reference/arrays.classes.html). Is
that correct?
Thanks!
--Hoyt
+++++
the current behavior? Would
it be possible/easy to change it?
Thanks!
-- Hoyt
+ Hoyt Koepke
+ University of Washington Department of Statistics
+ http://www.stat.washington.edu/~hoytak/
+ hoy...@gmail.com
++
_
FYI for general readers, I found the following discussion on this
topic really helpful:
http://stackoverflow.com/questions/457927/git-workflow-and-rebase-vs-merge-questions
--Hoyt
+ Hoyt Koepke
+ University of Washington Department of Statistics
I
was still impressed.
--Hoyt
++++
+ Hoyt Koepke
+ University of Washington Department of Statistics
+ http://www.stat.washington.edu/~hoytak/
+ hoy...@gmail.com
++
___
NumPy-Discussion mailing list
N
cz
R[2,2] = cy
return R
++++++++
+ Hoyt Koepke
+ University of Washington Department of Statistics
+ http://www.stat.washington.edu/~hoytak/
+ hoy...@gmail.com
++
would become C code. Compilers these days are very good at
optimizing that kind of thing too.
--Hoyt
++++
+ Hoyt Koepke
+ University of Washington Department of Statistics
+ http://www.stat.
ookup in the module.
> also you still have a few duplicate multiplications, e.g. cx*cz, cx*sz, ..?
> but this looks already like micro optimizatio
+ Hoyt Koepke
+ University of Washington Department of Statis
to renormalize properly afterwards.
Quick and dirty, but should work.
--Hoyt
--
++++++++
+ Hoyt Koepke
+ University of Washington Department of Statistics
+ http://www.stat.washington.edu/~ho
; detected *** python: free(): invalid next size (fast):
> 0x1196b550 ***
>
>
> I then have to kill python to get control again.
> -gideon
>
> ___
> Numpy-discussion mailing list
> Numpy-discussion@scipy.org
> http://
ain!
--Hoyt
> cheers,
>
> David
>
> ___
> Numpy-discussion mailing list
> Numpy-discussion@scipy.org
> http://projects.scipy.org/mailman/listinfo/numpy-discussion
>
--
+ Hoyt
tup.py ) ?
This now works in the sense that it doesn't hang. I still get a
number of test failures, however (build + test logs attached).
Thanks a lot for the help!
--Hoyt
++++++++
+ Hoyt Koepke
+ University of Washington Department of Sta
Sorry;
I also added '-fPIC' to the compile flags, though it may work without
having it there. I just got errors related to not having it and so
threw it at everything...
--Hoyt
On Wed, Nov 19, 2008 at 11:41 PM, Hoyt Koepke <[EMAIL PROTECTED]> wrote:
> Attached.
>
>
' to LDFLAGS to
get it to work.
Thanks!
--Hoyt
On Wed, Nov 19, 2008 at 11:33 PM, David Cournapeau
<[EMAIL PROTECTED]> wrote:
> On Wed, 2008-11-19 at 23:23 -0800, Hoyt Koepke wrote:
>> Hello,
>>
>> Sorry about this bug report I know how much us programmers like
&g
lated, but they don't seem to be at first glance.
I've attached the full log. If there is anything more you want me to
do with this, I'd be happy to.
Thanks!
--Hoyt
++++++++
+ Hoyt Koepke
+ University of Washington Depart
defined in numpy.i, so I had either to use the 1-dimensional
> arrays even in case of multidimensional data or to copy the data. I
> wondered wether there is a more elegant way of using numpy arrays on the
> python side and TNT::Arrays on the C++ side without having to
> explicitely write
Excellent; thank you -- I will test it out soon.
-- Hoyt
On Sat, Oct 25, 2008 at 2:57 AM, David Cournapeau <[EMAIL PROTECTED]> wrote:
> On Sun, Oct 19, 2008 at 7:57 PM, David Cournapeau <[EMAIL PROTECTED]> wrote:
>>
>> The trunk requires some changes which are not released yet. It will be
>> in t
Hello,
I'm trying to install the latest numpy using setupscons.py, but it
gives me an error that I can't track down. It's in the latest numpy
release (5946). with the latest numpyscons from the 0.9.3 branch.
Here's the last part of output:
is bootstrapping ? True
Executing scons command (pkg is
_
> Numpy-discussion mailing list
> Numpy-discussion@scipy.org
> http://projects.scipy.org/mailman/listinfo/numpy-discussion
>
>
--
+++
Hoyt Koepke
UBC Department of Computer Science
http://www.cs.ubc.ca/~hoytak/
[EMAIL PROTECTED]
++
--Hoyt
--
+++
Hoyt Koepke
UBC Department of Computer Science
http://www.cs.ubc.ca/~hoytak/
[EMAIL PROTECTED]
+++
___
Numpy-discussion mailing list
Numpy-discussion@scipy.org
http://projects.scipy.org/mailman/listinfo
],
> [ 3.19525931, 0.77487798]])
>>>> fn()
> *** glibc detected *** python: munmap_chunk(): invalid pointer:
> 0x08439d28 ***
>
> --
> Pauli Virtanen
>
>
> ___
> Numpy-discussion mailing list
> Numpy-discussion@
to use v[0:2,:], 3d v[0:2,:,:]. It's
a bit more picky. I think that's the problem with your second line
-- try replacing v[:] with v[0,:] and theta[1-curidx] with
theta[1-curidx, :]. (I may have missed some others.)
weave.blitz is currently limited to just array operations... it
does
ld have thought the direct assignment would be
> quicker since then there is no copying.
>
> What am I missing?
Actually, I think you are correct. My bad. I was mainly thinking in
terms of weave.blitz, where it would make a difference, then
translating back...
--Hoyt
++
k] = 1
theta[curidx, idx_spk] += b
# Flop to handle previous stuff
curidx = 2 - curidx
--
+++
Hoyt Koepke
UBC Department of Computer Science
http://www.cs.ubc.ca/~hoytak/
[EMAIL PROTECTED]
+++
On Mon, May 19, 2008 at 11:08 AM, James Snyder <[EMAIL PR
> and then update the others only if the row you're updating has that
> minimum value in it. Then, when scanning for the min dist, you only
> need to scan O(n) rows.
Sorry, let me clarify -- Update the entries corresponding to entries
in the row you're updating if they are the same as the mini
ut 1.9 seconds to 0.7
> > seconds! Thank you.
> >
> > When I run the single linkage clustering on my data I get one big
> > cluster and a bunch of tiny clusters. So I need to try a different
> > linkage method. Average linkage sounds good, but it sounds hard to
> > code
.9 seconds to 0.7
> seconds! Thank you.
>
> When I run the single linkage clustering on my data I get one big
> cluster and a bunch of tiny clusters. So I need to try a different
> linkage method. Average linkage sounds good, but it sounds hard to
> code.
>
>
> ___
> > >
> >
> > Why do you want to do that?
>
> Single linkage clustering; x is the distance matrix.
>
>
> ___
> Numpy-discussion mailing list
> Numpy-discussion@scipy.org
> http://projects.scipy.org/mailman
Okay, thanks! I didn't check.
--Hoyt
On Thu, May 1, 2008 at 7:00 PM, Charles R Harris
<[EMAIL PROTECTED]> wrote:
>
>
>
> On Thu, May 1, 2008 at 7:49 PM, Hoyt Koepke <[EMAIL PROTECTED]> wrote:
> > To be honest, this doesn't seem justifiable.
> >
a bug report?
--Hoyt
On Mon, Apr 28, 2008 at 11:51 PM, Charles R Harris
<[EMAIL PROTECTED]> wrote:
>
>
>
> On Tue, Apr 29, 2008 at 12:28 AM, Hoyt Koepke <[EMAIL PROTECTED]> wrote:
> > Hello,
> >
> > I have a quick question that I'm hoping will improve
that will help?)
Thanks!
--Hoyt
--
+++++++
Hoyt Koepke
UBC Department of Computer Science
http://www.cs.ubc.ca/~hoytak/
[EMAIL PROTECTED]
+++
___
Numpy-discussion mailing list
Numpy-discussion
actor.
--Hoyt
On Mon, Apr 28, 2008 at 8:29 AM, Hoyt Koepke <[EMAIL PROTECTED]> wrote:
> I may not understand what you are asking, Rich, but I'm not sure I
> agree with Alan. A Gaussian fit to data x should fit exactly as well
> as data fit to ax, a > 0, just with a var
iling list
> Numpy-discussion@scipy.org
> http://projects.scipy.org/mailman/listinfo/numpy-discussion
>
--
+++
Hoyt Koepke
UBC Department of Computer Science
http://www.cs.ubc.ca/~hoytak/
[EMAIL PROTECTED]
+++
_
d contact the sip
> developer, Phil Thompson, he does some contracting job for Airbus.
>
> Cheers,
>
> Gaël
>
>
> ___
> Numpy-discussion mailing list
> Numpy-discussion@scipy.org
> http://projects.scipy.org/mail
/~dfg/AndysSplineTutorial/BSplines.html
>
> Chuck
>
>
>
> _______
> Numpy-discussion mailing list
> Numpy-discussion@scipy.org
> http://projects.scipy.org/mailman/listinfo/numpy-discussion
>
>
--
++
> Numpy-discussion mailing list
> Numpy-discussion@scipy.org
> http://projects.scipy.org/mailman/listinfo/numpy-discussion
>
>
--
+++
Hoyt Koepke
UBC Department of Computer Science
http://www.cs.ubc.ca/~hoytak/
[EMAIL PROTECTED]
++
> In [1]: import numpy
>
> In [2]: numpy.info('eigvals')
> *** Found in numpy.linalg ***
> eigvals(a)
Fair enough Don't know why I missed that, prob relied too much on
Google search :-)
Having it as part of iPython does make sense.
--Hoyt
___
ds
> documentation by the exact function name, not by looking into the
> docstrings.
>
> So, should info and lookfor be combined, or kept separate?
>
> --
> Pauli Virtanen
>
>
> _______
> Numpy-discussion mailing list
> Numpy-discussion
If the rest of the matrix is already zeros and memory wasn't a
problem, you could just use
A_sym = A + A.T - diag(diag(A))
If memory was an issue, I'd suggest weave.inline (if that's a viable
option) or pyrex to do the loop, which would be about as fast as you
could get.
--Hoyt
On Wed, Mar 26
Try
result = A[1:] - A[:-1]
--Hoyt
On Fri, Mar 21, 2008 at 7:43 PM, Chris Withers <[EMAIL PROTECTED]> wrote:
> Hi All,
>
> Say I have an array like:
>
> >>> measurements = array([100,109,115,117])
>
> What do I do to it to get:
>
> array([9, 6, 2])
>
> Is the following really the best way?
Okay, thanks! I won't be using the multivariate_normal function in my
code, so this should work fine.
--Hoyt
On Tue, Mar 11, 2008 at 3:00 PM, Robert Kern <[EMAIL PROTECTED]> wrote:
>
> On Tue, Mar 11, 2008 at 4:18 PM, Hoyt Koepke <[EMAIL PROTECTED]> wrote:
> >
This should be a really quick question. Is a RandomState object
thread safe? I'm wanting to use a common RandomState object in a
multithreaded program, and I need to know if it's necessary to protect
it with a lock (which wouldn't be difficult).
Thanks!
--Hoyt
___
I would definitely suggest using scipy's weave.inline for this. It
seems like this particular function can be translated into C code
really easily, which would give you a HUGE speed up. Look at some of
the examples in scipy/weave/examples to see how to do this. The numpy
book also has a section
54 matches
Mail list logo
