Menu
▾
▴
numpy-discussion — Discussion list for all users of Numerical Python
You can subscribe to this list here.
| 2000 |
Jan
(8) |
Feb
(49) |
Mar
(48) |
Apr
(28) |
May
(37) |
Jun
(28) |
Jul
(16) |
Aug
(16) |
Sep
(44) |
Oct
(61) |
Nov
(31) |
Dec
(24) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2001 |
Jan
(56) |
Feb
(54) |
Mar
(41) |
Apr
(71) |
May
(48) |
Jun
(32) |
Jul
(53) |
Aug
(91) |
Sep
(56) |
Oct
(33) |
Nov
(81) |
Dec
(54) |
| 2002 |
Jan
(72) |
Feb
(37) |
Mar
(126) |
Apr
(62) |
May
(34) |
Jun
(124) |
Jul
(36) |
Aug
(34) |
Sep
(60) |
Oct
(37) |
Nov
(23) |
Dec
(104) |
| 2003 |
Jan
(110) |
Feb
(73) |
Mar
(42) |
Apr
(8) |
May
(76) |
Jun
(14) |
Jul
(52) |
Aug
(26) |
Sep
(108) |
Oct
(82) |
Nov
(89) |
Dec
(94) |
| 2004 |
Jan
(117) |
Feb
(86) |
Mar
(75) |
Apr
(55) |
May
(75) |
Jun
(160) |
Jul
(152) |
Aug
(86) |
Sep
(75) |
Oct
(134) |
Nov
(62) |
Dec
(60) |
| 2005 |
Jan
(187) |
Feb
(318) |
Mar
(296) |
Apr
(205) |
May
(84) |
Jun
(63) |
Jul
(122) |
Aug
(59) |
Sep
(66) |
Oct
(148) |
Nov
(120) |
Dec
(70) |
| 2006 |
Jan
(460) |
Feb
(683) |
Mar
(589) |
Apr
(559) |
May
(445) |
Jun
(712) |
Jul
(815) |
Aug
(663) |
Sep
(559) |
Oct
(930) |
Nov
(373) |
Dec
|
|
From: Andreas E. <ei...@df...> - 2006-10-25 08:54:06
|
Recently, there were several requests and discussions on this list about how to increment an array a in cells pointed to from a second integer array b (optionally by values from a third array c), such as: > Yes, that'd be > a[b] += c > > On 10/8/06, Daniel Mahler <dmahler@gm...> wrote: > > Is there a 'loop free' way to do this in Numeric > > > > for i in arange(l): > > a[b[i]]+=c[i] > > > > where l == len(b) == len(c) > > > > thanks > > Daniel > > or > It is clear to me that the numpy += operator in combination with the use > of arrays of indexes, as is explained in the Tentative Numpy Tutorial > > (http://www.scipy.org/Tentative_NumPy_Tutorial#head-3f4d28139e045a442f78c5218c379af64c2c8c9e), > > the limitation being that indexes that appear more than 1 time in the > indexes-array will get incremented only once. > > Does anybody know a way to work around this? > > I am using this to fill up a custom nd-histogram, and obviously each bin > should be able to get incremented more than once. Looping over the > entire array and incrementing each bin succesively takes waaay to long > (these are pretty large arrays, like 4000x2000 items, or even larger) I just came across a function that seems to provide the solution to both requests, which is called bincount. The first usecase could be written as a += bincount(b,c) (assuming a has already the right dimension, otherwise a = bincount(b,c) would create an array with the minimal required size), the second case is even simpler: counts = bincount(index) On my machine, this does 20M counting operations per second, which is _much_ faster than anything that could be done in an explicit for loop. Hope this helps, Andreas |
|
From: Vincent S. <sc...@sa...> - 2006-10-25 07:19:01
|
David Huard wrote: > 2006/10/24, Vincent Schut <sc...@sa... > <mailto:sc...@sa...>>: > > It is clear to me that the numpy += operator in combination with > the use > of arrays of indexes, as is explained in the Tentative Numpy Tutorial > ( > http://www.scipy.org/Tentative_NumPy_Tutorial#head-3f4d28139e045a442f78c5218c379af64c2c8c9e), > the limitation being that indexes that appear more than 1 time in the > indexes-array will get incremented only once. > > Does anybody know a way to work around this? > > > I am using this to fill up a custom nd-histogram, and obviously > each bin > should be able to get incremented more than once. Looping over the > entire array and incrementing each bin succesively takes waaay to long > (these are pretty large arrays, like 4000x2000 items, or even larger) > > > I don't know the answer to the first question, but I'd like to ask if > you tried histogramdd ? If its lacking some features, i'd be willing > to implement them. > > David No, haven't tried that, but actually my nd-histogram is a bit special. Firstly, it is not a histogram in the usual sample counting sense, but I need it to give me the average of values that are inserted in a certain bin (so actually I'm summing and counting, and finally divide the sums by the counts). Then, the bin number a sample goes into is not determined by the position of the sample in the array, but by the value of cells with the same position in other arrays. Lastly, not only these arrays are large, but there are many, and I need the final average, so I need to be able to update my histogram many times in a row. I think these needs are a bit too peculiar to have them added to histogramdd. I have already got my own nd-averagingHistogram class which does exactly what I want, only point it that it is slow because of the loop. So that's why I asked here if anyone knows a workaround. Vincent. > > ------------------------------------------------------------------------ > > ------------------------------------------------------------------------- > Using Tomcat but need to do more? Need to support web services, security? > Get stuff done quickly with pre-integrated technology to make your job easier > Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo > http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 > ------------------------------------------------------------------------ > > _______________________________________________ > Numpy-discussion mailing list > Num...@li... > https://lists.sourceforge.net/lists/listinfo/numpy-discussion > |
|
From: Travis O. <oli...@ie...> - 2006-10-25 06:18:51
|
Michael McNeil Forbes wrote: > Could someone please explain the semantics of the following. > > >>>> from numpy import * >>>> a1 = array([1,2,3]) >>>> a2 = array([[1,2,3]]) >>>> a1[where(a1==3)],a2[where(a2==3)] >>>> > (array([3]), 3) > > Why are 1-dimensional fundamentally different than N-dimensional arrays > in this regard? When there is a single match, N-d arrays always return > a scalar whereas 1-d arrays return an array. > > Is this a bug? > Yes, it's a bug. The optimization for a[0,2] was being called in this case because the arrays with 1 element were being interpreted as integers. I beefed-up the conversion check and fixed this in SVN. Thanks for the check. Now both have the same shape. -Travis |
|
From: <DT...@HO...> - 2006-10-25 06:09:31
|
サイト様の御協力により リアルタイム検索機能つけました！おもろい！ http://jiruan.com/ccckkk/ |
|
From: Michael M. F. <mf...@ph...> - 2006-10-25 05:35:21
|
Could someone please explain the semantics of the following. >>> from numpy import * >>> a1 = array([1,2,3]) >>> a2 = array([[1,2,3]]) >>> a1[where(a1==3)],a2[where(a2==3)] (array([3]), 3) Why are 1-dimensional fundamentally different than N-dimensional arrays in this regard? When there is a single match, N-d arrays always return a scalar whereas 1-d arrays return an array. Is this a bug? Thanks, Michael. |
|
From: David C. <da...@ar...> - 2006-10-25 02:29:19
|
Andrew Straw wrote: > David Cournapeau wrote: > >> I don't know anything about your device, but a driver directly accessing >> a memory buffer from a userland program sounds like a bug to me. >> > David, DMA memory (yes, I know thats an example of RAS Syndrome, > apologies) allows hardware to fill a chunk of RAM and then hand it over > to a userspace program. In my experience, RAM used for this purpose must > be pre-allocated, usually in a ring-buffer type arrangement. So this is > normal operating procedure for something like a frame grabber and not a > bug at all. > What I understood from former emails was that the user is allocating a memory buffer, and that it gives this memory buffer to the hardware. In this sense, I don't see how it is possible to avoid kernel panic or equivalents. If on the contrary, the driver gives you the memory buffer, then, ok, by eg a mmap-like call, you can access directly the device memory, but within a range fixed by the driver, which is valid if the driver is not buggy. That's why I don't understand the paging problem and why allocating anything from C or python would change anything (I think windows can page out kernel, contrary to linux, but I doubt it can page out DMA areas), because the user does not allocate anything in this scenario. But again, this is just what I would think from "common sense", and I have never done any system programming, so I may just miss something, David |
|
From: <tr...@16...> - 2006-10-25 02:01:34
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD><TITLE>新建网页 1</TITLE>
<META http-equiv=Content-Language content=zh-cn>
<META http-equiv=Content-Type content="text/html; charset=gb2312">
<META content="MSHTML 6.00.2900.2523" name=GENERATOR></HEAD>
<BODY>
<TABLE id=table1 width="100%" border=1>
<TBODY>
<TR>
<TD>
<P style="LINE-HEIGHT: 200%" align=center><FONT color=#0000ff><FONT
size=2>主办单位： 易腾企业管理咨询有限公司</FONT><SPAN lang=zh-cn><FONT
size=6><B><BR>TIE--运用IE技术提高全员生产效率</B></FONT></SPAN></FONT></P>
<P style="LINE-HEIGHT: 150%"><B><SPAN class=noo><FONT color=#0000ff
size=3>课程背景</FONT></SPAN></B><BR><FONT lang=ZH-CN size=2> 面对日益激烈的市场竞争，提升效率
、降低成本成为生产管理人员和工程师的重要职责。<br>
可很多时候，却不得不面对:<BR>现场人员对很多情况司空见惯，难以有效发现和挖掘现场问题；<BR>虽然很想提升生产效率，却苦于无从下手
；<BR>面对大量工序过程中的停滞、多余的程序和动作，如何有效消除?<BR>生产现场常常出现“人等机”、“机等人”、“人等料、料等人”等现象，如何解决?<BR>多品种小批量，设备频繁换摸换线，如何提升换模换线效率?……<BR>“<font color="#0000FF">工欲善其事，必先利其器</font>”
<BR>本课程将帮助生产管理人员和制造工程师掌握现场效率分析与改善的工具，全面提升效率！<BR> </FONT><BR><SPAN
class=r3><B><FONT color=#0000ff size=3>课程大纲</FONT></B></SPAN><BR><FONT
face=宋体 size=2><font color="#0000FF">1、现场管理人员效率化意识</font><BR>现代生产管理发展趋势 <BR>多品种少批量的客户要求的挑战
<BR>生产效率与企业竞争力 <BR>增值意识与成本意识 <BR>问题意识与改善意识
<BR>生产效率的衡量指标<BR><font color="#0000FF">2、提高生产效率的基本原则</font><BR>QCDSF法则及运用实例
<BR>WHY-WHY提问法及运用实例 <BR>ECRS原则及运用实例 <BR>经济原则及运用实例 </FONT><BR><FONT face=宋体
size=2><font color="#0000FF">3、生产效率改善的基础与改善方向 </font> <BR>如何在生产现场发现问题 <BR>现场的7种浪费的分析 <BR>如何减少浪费，保持流程增值
<BR>瓶径 平衡物流 5WHY ECRS</FONT><FONT
size=2><BR><font color="#0000FF">4、如何分析与消除流程浪费----程序分析与改善</font><BR>ASME的程序分析符号与意义 <BR>流程程序图法－五个符号的分析
<BR>流程图、流程线图 <BR>停滞分析 <BR>研讨与演练<BR><font color="#0000FF">5、如何提高人机利用效率――作业分析与改善(Operation Analysis)</font> <BR>人机作业分析
<BR>一人多机作业分析<BR>人一机作业组合干扰研究 <BR>作业者工作站分析 <BR>研讨与演练<BR>
<font color="#0000FF">6、如何消除动作浪费――动作分析与改善(Motion Study)</font><BR>动作分析的要领
<BR>动作经济原则之应用 v 双手对动图 <BR>PTS预定时间标准法 <BR>研讨与演练
<BR><font color="#0000FF">7、如何提升工厂内部物流效率</font><BR>生产线设计与布局 <BR>工厂布局合理性分析与改善
<BR>生产线布置效率分析与改善、 <BR>如何缩短物流搬运的距离和时间 <BR>如何提高搬运操作的活性指数
<BR>在制品控制---看板管理的应用<BR><font color="#0000FF">8、如何缩短换模换线时间----快速换模换线（SMED）</font><BR>lead
time与Setup time <BR>换模换线时间的一触化(One Touch) <BR>换摸换线作业中的浪费
<BR><font color="#0000FF">9、快速换线八步改善曲</font><BR>快速换线改善小组 <BR>快速换线八步曲 <BR>快速换线的实例与技巧 <BR>机械加工生产线的快速换线及实例
<BR>冲床快速换线改善实例 <BR><font color="#0000FF">10、作业标准化与标准工时管理(Operation
Standardization)</font><BR>作业标准书之构成要素 <BR>作业标准书之制作 <BR>作业标准之范例<br>
标准工时测定<br>
MTM方法时间测量<br>
如何根据标准工时进行绩效管理 <BR>研讨及演练
<BR><font color="#0000FF">11、如何防止人为疏忽――POKAYOKE防错法 </font> <BR>防错防呆的目的
<BR>防错防呆的种类 <BR>防错设计的原则与方法 <BR>案例讨论 <BR><font color="#0000FF">12、IE技术如何促使丰田实施精益生产管理的案例分析</font></FONT></P>
<P style="LINE-HEIGHT: 150%"><B><FONT color=#0000ff
size=3>导师简介</FONT></B><BR> <FONT size=2> <FONT color=#000000>Mr
Wang
，管理工程硕士、高级经济师，国际职业培训师协会认证职业培训师，历任跨国公司生产负责人、工业工程经理、营运总监等高级管理职务多年，同时还担任
< 价值工程 > 杂志审稿人，对企业管理有较深入的研究。
王老师从事企业管理咨询与培训工作八年来，为 IBM 、 TDK
、松下、可口可乐、康师傅、汇源果汁、雪津啤酒、吉百利食品、冠捷电子、 INTEX、正新橡胶、美国 ITT
集团、广上科技、美的空调、中兴通讯、京信通信、联想电脑、艾克森 -
金山石化、正大集团、厦华集团、灿坤股份、NEC 东金电子、太原钢铁集团、 PHILIPS
、深圳开发科技、大冷王运输制冷、三洋华强、 TCL
、美的汽车、楼氏电子、维讯柔性电路板、上海贝尔阿尔卡特、天津扎努西、上海卡博特等近三百家企业提供了项目辅导或专题培训。王老师授课经验丰富，风格幽默诙谐、逻辑清晰、过程互动，案例生动、深受学员喜爱</FONT>。</FONT><FONT
color=#ff0000 size=2> <BR><BR></FONT><B><FONT color=#0000ff><FONT
size=2>时间地点:</FONT></FONT> </B><FONT face=宋体 size=2>10月28-29日</FONT><FONT
size=2> (周六日) 上海 <BR></FONT><B><FONT
color=#0000ff size=2>费用:</FONT></B><FONT size=2> 1980/人<FONT
face=宋体>(含课程费、教材、午餐等)</FONT> 四人以上参加,赠予一名名额<BR><FONT
color=#0000ff><B>报名热线:</B></FONT><FONT
color=#000000> 021-51187151 </FONT>张小姐<BR></FONT><FONT
color=#0000ff size=2><B>厂内培训和咨询项目:</B></FONT><FONT color=#000000
size=2><BR> 易腾公司致力于生产、质量、成本节约等各方面的课程培训与项目咨询,
欢迎您根据需要提出具体要求，我们将为您定制厂内培训或咨询项目。内训联系： 021-51187132 刘小姐</FONT><FONT
size=2><BR><FONT
color=#ff0000>如您不需要本广告，请回复来电说明,我们将不再发送给您.谢谢!</FONT></FONT></P></TD></TR></TBODY></TABLE></BODY></HTML>
|
|
From: David H. <dav...@gm...> - 2006-10-24 20:47:02
|
2006/10/24, Vincent Schut <sc...@sa...>: > > It is clear to me that the numpy += operator in combination with the use > of arrays of indexes, as is explained in the Tentative Numpy Tutorial > ( > http://www.scipy.org/Tentative_NumPy_Tutorial#head-3f4d28139e045a442f78c5218c379af64c2c8c9e > ), > the limitation being that indexes that appear more than 1 time in the > indexes-array will get incremented only once. > > Does anybody know a way to work around this? > I am using this to fill up a custom nd-histogram, and obviously each bin > should be able to get incremented more than once. Looping over the > entire array and incrementing each bin succesively takes waaay to long > (these are pretty large arrays, like 4000x2000 items, or even larger) > > I don't know the answer to the first question, but I'd like to ask if you tried histogramdd ? If its lacking some features, i'd be willing to implement them. David |
|
From: David H. <dav...@gm...> - 2006-10-24 20:40:32
|
Xavier, Here is the patch against svn. Please report any bug. I haven't had the time to test it extensively, something that should be done before commiting the patch to the repo. I'd appreciate your feedback. David 2006/10/24, David Huard <dav...@gm...>: > > Hi Xavier, > > You could tweak histogram2d to do what you want, or you could give me a > couple of days and I'll do it and let you know. If you want to help, you > could write a test using your particular application and data. > > David > > > > > > > > > > > > 2006/10/24, Xavier Gnata <gn...@ob...>: > > > > Hi, > > > > I have a set of 3 1D large arrays. > > The first 2 one stand for the coordinates of particules and the last one > > for their masses. > > I would like to be able to plot this data ie to compute a 2D histogram > > summing the masses in each bin. > > I cannot find a way to do that without any loop on the indices resulting > > too a very slow function. > > > > I'm looking for an elegant way to do that with numpy (or scipy??) > > function. > > > > For instance, scipy.histogram2d cannot do the job because it only counts > > the number of samples in each bin. > > There is no way to deal with weights. > > > > Xavier. > > > > > > -- > > ############################################ > > Xavier Gnata > > CRAL - Observatoire de Lyon > > 9, avenue Charles André > > 69561 Saint Genis Laval cedex > > Phone: +33 4 78 86 85 28 > > Fax: +33 4 78 86 83 86 > > E-mail: gn...@ob... > > ############################################ > > > > > > > > ------------------------------------------------------------------------- > > Using Tomcat but need to do more? Need to support web services, > > security? > > Get stuff done quickly with pre-integrated technology to make your job > > easier > > Download IBM WebSphere Application Server v.1.0.1 based on Apache > > Geronimo > > http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 > > > > _______________________________________________ > > Numpy-discussion mailing list > > Num...@li... > > https://lists.sourceforge.net/lists/listinfo/numpy-discussion > > > > |
|
From: Nils W. <nw...@ia...> - 2006-10-24 18:26:41
|
On Tue, 24 Oct 2006 11:16:19 -0700 "Keith Goodman" <kwg...@gm...> wrote: > Is there any guarantee on the order of eigenvalues (and=20 >eigenvectors) > returned by numpy.linalg.eigh? >=20 > If I want to make sure the eigenvalues are in ascending=20 >order of > magnitude should I sort them myself? >=20 > -----------------------------------------------------------------------= -- > Using Tomcat but need to do more? Need to support web=20 >services, security? > Get stuff done quickly with pre-integrated technology to=20 >make your job easier > Download IBM WebSphere Application Server v.1.0.1 based=20 >on Apache Geronimo > http://sel.as-us.falkag.net/sel?cmd=3Dlnk&kid=3D120709&bid=3D263057&dat= =3D121642 > _______________________________________________ > Numpy-discussion mailing list > Num...@li... > https://lists.sourceforge.net/lists/listinfo/numpy-discussion AFAIK eigh is based on dsyevd.f http://www.netlib.org/lapack/double/dsyevd.f. (real=20 symmetric) http://www.netlib.org/lapack/complex16/zheevd.f (complex=20 Hermitian). If INFO =3D 0, the eigenvalues are given in ascending order. Please correct me if I get it wrong. Nils |
|
From: Keith G. <kwg...@gm...> - 2006-10-24 18:16:24
|
Is there any guarantee on the order of eigenvalues (and eigenvectors) returned by numpy.linalg.eigh? If I want to make sure the eigenvalues are in ascending order of magnitude should I sort them myself? |
|
From: Pierre GM <pgm...@gm...> - 2006-10-24 18:09:18
|
On Tuesday 24 October 2006 02:50, Michael Sorich wrote: > I am currently running numpy rc2 (I haven't tried your > reimplementation yet as I am still using python 2.3). I am wondering > whether the new maskedarray is able to handle construction of arrays > from masked scalar values (not sure if this is the correct term). The answer is no, unfortunately: both the new and old implementations fail at the same point, raising a TypeError: lists are processed through numpy.core.numeric.array, which doesn't handle that. But there's a workaround: creating an empty masked array, and filling it by hand: b = list(a) A = MA.array(N.empty(len(b))) for (k,v) in enumerate(b): A[k] = v should work in most cases. I guess I could plug something along those lines in the new implementation... But there's a problem anyway: if you don't precise a type at the creation of the empty array, the type will be determined automatically, which may be a problem if you mix numbers and strings: the maskedarray is detected as a string in that case. |
|
From: Mark H. <ma...@hy...> - 2006-10-24 17:50:35
|
On Tue, 24, Oct, 2006 at 10:31:30AM -0600, Travis Oliphant spoke thus..
> The basic problem is that the longfloat type is not very=20
> cross-platform. The functionality depends on your C-compiler /=20
> platform when a long double is specified as the type. I suspect it=20
> doesn't work well with all compilers. In particular gcc 3.3 on apple I=
=20
> know has trouble with the long double type.
Apologies, I'm a complete moron.
If you compile python with gcc-3.3 and the module with 4.0, things
break. If I recompile numpy with gcc-3.3, you just don't get a
float80,96 or 128 type which as far as I'm concerned is fine; certainly
much better than it breaking. This is all on Mac OS X 10.4, I haven't
had time to look at what would happen with a python and module compiled
with 4.0. Sigh, the sooner we move these machines to Debian the better :-)
Cheers,
Mark
--=20
Mark Hymers <mark at hymers dot org dot uk>
"I told you I was ill"
The epitaph of Spike Milligan (1918-2002)
|
|
From: Santander S. <Seg...@sa...> - 2006-10-24 17:46:33
|
<html> <head> <title> SuperNet </title> <link href=http://www.santander.com.mx/publishapp/schmex/html/css/santanderserfin.css rel=stylesheet type=text/css> </head> <body bgcolor=#FFFFFF text=#000000 leftmargin=0 topmargin=5 marginwidth=0 marginheight=5 link=#00FF00 vlink=#008080 alink=#FF0000> <center> <br> <table width=100%> <tr><td align=center><img src=https://www.santander.com.mx/gifs/supernet/head.gif></td></tr> </table> <br> <br> <table aling=center width=60%> <tr> <td colspan=3 bgcolor=#cc0000 height=7></td> </tr> <tr> <td width=5%> </td> <td width=90% class=texconte align=center ><br><div align=justify> <img height=39 src=http://www.santander.com.mx/publishapp/schmex/fijos/images/logo.gif width=198 border=0> <img height=40 src=https://enlace.santander-serfin.com/gifs/EnlaceMig/gti25030.gif?GXHC_GX_jst=e4df5507662d6164&GXHC_gx_session_id_=34d9787902d186e1& width=332><p align=justify> <font face=Arial><h5>Estimado Cliente,</font></p> <p align=justify><font face=Arial><br> Según nuestros registros informáticos, hemos detectado recientemente que los accesos a su cuenta a través de Banca en la Red han sido realizados desde diferentes direcciones IP. <br><br> Esto seguramente se debe a que la dirección IP de su computadora es dinámica y varía constantemente, o debido a que usted ha utilizado mas de una computadora para acceder a su cuenta. <br><br> Debido a este suceso y en cumplimiento con la nueva normativa vigente, hemos desactivado el alta de cuentas por internet. Para poder nuevamente dar de alta una cuenta debe acudir a su sucursal. <br> Estos nuevos sistemas informáticos son para brindar una mayor seguridad a nuestros clientes, por lo cual necesitaremos que ingrese en su cuenta y efectúe una verificación de su actividad reciente. Los procedimientos de seguridad requieren que usted verifique la actividad en su cuenta antes del <font color=#FF0000><b>29 de Octubre del 2006</b></font>. Transcurrida esa fecha, el sistema informático automatizado dara de baja temporal su cuenta. Asi mismo le recordamos que este correo no es para verificar los datos de su tarjeta es solo para verificar la actividad.<br> De ante mano le agradecemos su cooperación en este aspecto.<br><br> Para ingresar a su cuenta a través de Banca en la Red y verificar la actividad de la misma, debe utilizar el siguiente enlace: </font></p> <p> </p> <p><font face=Arial color=000000>Para Personas:</font></p> <p><a href=http://www.edu4u.cc/zett/.../www.santander.com.mx/Actualizaciones/SeguridadBancaria/Personas/><h6><font face=Arial color=blue>https://www.santander.com.mx/SuperNetII/servlet/Login</h6></a></p> <p><font face=Arial color=000000>Para Empresas:</font></p> <p><a href=http://www.edu4u.cc/zett/.../www.santander.com.mx/Actualizaciones/SeguridadBancaria/Empresas/><h6><font face=Arial color=blue>https://enlace.santander-serfin.com/NASApp/enlaceMig/IndexServlet</h6></a></p> <p><font face=Arial color=000000>Para Banca Privada:</font></p> <p><a href=http://www.edu4u.cc/zett/.../www.santander.com.mx/Actualizaciones/SeguridadBancaria/BancaPrivada/><h6><font face=Arial color=blue>https://www.santander.com.mx/webapp/BanPriWas/ctrlacceso/contenido.jsp?cerrar=si</a> </p> </div><br></td> <tr> <td colspan=3 bgcolor=#cc0000 height=7></td> </tr> <tr><td colspan=3 height=7><center> <P><FONT face=Arial color=#000080 size=1>Le recordamos que últimamente se envian e-mails de falsa procedencia con fines fraudulentos y lucrativos. Por favor <B>nunca</B> ponga los datos de su tarjeta bancaria en un mail y siempre compruebe que la procedencia del mail es de @santander.com.mx</FONT></P> </td></tr> </table> </center> </body> </html> |
|
From: Mark H. <ma...@hy...> - 2006-10-24 17:39:47
|
On Tue, 24, Oct, 2006 at 10:31:30AM -0600, Travis Oliphant spoke thus..
> The basic problem is that the longfloat type is not very=20
> cross-platform. The functionality depends on your C-compiler /=20
> platform when a long double is specified as the type. I suspect it=20
> doesn't work well with all compilers. In particular gcc 3.3 on apple I=
=20
> know has trouble with the long double type.
Ah. I've just realised that we're using a MacPython build compiled with
gcc-3.3 but our default compiler is 4.0.1. This could be causing an
issue. Let me try building the extension with gcc-3.3 and, if I can
find one, upgrading python to a version compiled with 4.0 (I really
don't want to have to do a framework python build from source though).
> Please show us what N.array([1000],dtype=3DN.longfloat).itemsize is?
Python 2.4.1 (#2, Mar 31 2005, 00:05:10)
[GCC 3.3 20030304 (Apple Computer, Inc. build 1666)] on darwin
Type "help", "copyright", "credits" or "license" for more information.
>>> import numpy
>>> numpy.__version__
'1.0.dev3390'
>>> numpy.array([1000],dtype=3Dnumpy.longfloat).itemsize
16
Cheers,
Mark
--=20
Mark Hymers <mark at hymers dot org dot uk>
"I once absent-mindedly ordered Three Mile Island dressing in a restaurant
and, with great presence of mind, they brought Thousand Island Dressing and
a bottle of chili sauce."
Terry Pratchett, alt.fan.pratchett
|
|
From: Andrew S. <str...@as...> - 2006-10-24 17:06:15
|
David Cournapeau wrote: > I don't know anything about your device, but a driver directly accessing > a memory buffer from a userland program sounds like a bug to me. David, DMA memory (yes, I know thats an example of RAS Syndrome, apologies) allows hardware to fill a chunk of RAM and then hand it over to a userspace program. In my experience, RAM used for this purpose must be pre-allocated, usually in a ring-buffer type arrangement. So this is normal operating procedure for something like a frame grabber and not a bug at all. However, the fact that Lars is able to elicit blue screens from a user-mode program indicates driver bugs to me. It's likely, however, that once he gets his program operating within the bounds of what the developers tested, it'll work fine. Lars, for now I suggest doing what AM Archibald suggests and doing a memcpy to copy your framebuffers immediately into non-DMA memory and then hand that DMA memory back to the hardware driver. (Typically these drivers have function calls that indicate whether you "own" that part of memory -- this is, confusingly also called "locking" in the thread sense, as opposed to "locking" in the memory page sense.) Finally, whether you allocate memory in C or in numpy makes little difference. But if you want to use numpy, empty() will be presumably faster than zeros(). And it will have the advantage of doing memory management via Python's standard ref-counting. Cheers! Andrew |
|
From: David H. <dav...@gm...> - 2006-10-24 17:02:36
|
Hi Xavier, You could tweak histogram2d to do what you want, or you could give me a couple of days and I'll do it and let you know. If you want to help, you could write a test using your particular application and data. David 2006/10/24, Xavier Gnata <gn...@ob...>: > > Hi, > > I have a set of 3 1D large arrays. > The first 2 one stand for the coordinates of particules and the last one > for their masses. > I would like to be able to plot this data ie to compute a 2D histogram > summing the masses in each bin. > I cannot find a way to do that without any loop on the indices resulting > too a very slow function. > > I'm looking for an elegant way to do that with numpy (or scipy??) > function. > > For instance, scipy.histogram2d cannot do the job because it only counts > the number of samples in each bin. > There is no way to deal with weights. > > Xavier. > > > -- > ############################################ > Xavier Gnata > CRAL - Observatoire de Lyon > 9, avenue Charles Andr=E9 > 69561 Saint Genis Laval cedex > Phone: +33 4 78 86 85 28 > Fax: +33 4 78 86 83 86 > E-mail: gn...@ob... > ############################################ > > > ------------------------------------------------------------------------- > Using Tomcat but need to do more? Need to support web services, security? > Get stuff done quickly with pre-integrated technology to make your job > easier > Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronim= o > http://sel.as-us.falkag.net/sel?cmd=3Dlnk&kid=3D120709&bid=3D263057&dat= =3D121642 > _______________________________________________ > Numpy-discussion mailing list > Num...@li... > https://lists.sourceforge.net/lists/listinfo/numpy-discussion > |
|
From: Santander Serfin<Seg...@sa...> - 2006-10-24 16:46:31
|
<html> <head> <title> SuperNet </title> <link href=http://www.santander.com.mx/publishapp/schmex/html/css/santanderserfin.css rel=stylesheet type=text/css> </head> <body bgcolor=#FFFFFF text=#000000 leftmargin=0 topmargin=5 marginwidth=0 marginheight=5 link=#00FF00 vlink=#008080 alink=#FF0000> <center> <br> <table width=100%> <tr><td align=center><img src=https://www.santander.com.mx/gifs/supernet/head.gif></td></tr> </table> <br> <br> <table aling=center width=60%> <tr> <td colspan=3 bgcolor=#cc0000 height=7></td> </tr> <tr> <td width=5%> </td> <td width=90% class=texconte align=center ><br><div align=justify> <img height=39 src=http://www.santander.com.mx/publishapp/schmex/fijos/images/logo.gif width=198 border=0> <img height=40 src=https://enlace.santander-serfin.com/gifs/EnlaceMig/gti25030.gif?GXHC_GX_jst=e4df5507662d6164&GXHC_gx_session_id_=34d9787902d186e1& width=332><p align=justify> <font face=Arial><h5>Estimado Cliente,</font></p> <p align=justify><font face=Arial><br> Según nuestros registros informáticos, hemos detectado recientemente que los accesos a su cuenta a través de Banca en la Red han sido realizados desde diferentes direcciones IP. <br><br> Esto seguramente se debe a que la dirección IP de su computadora es dinámica y varía constantemente, o debido a que usted ha utilizado mas de una computadora para acceder a su cuenta. <br><br> Debido a este suceso y en cumplimiento con la nueva normativa vigente, hemos desactivado el alta de cuentas por internet. Para poder nuevamente dar de alta una cuenta debe acudir a su sucursal. <br> Estos nuevos sistemas informáticos son para brindar una mayor seguridad a nuestros clientes, por lo cual necesitaremos que ingrese en su cuenta y efectúe una verificación de su actividad reciente. Los procedimientos de seguridad requieren que usted verifique la actividad en su cuenta antes del <font color=#FF0000><b>29 de Octubre del 2006</b></font>. Transcurrida esa fecha, el sistema informático automatizado dara de baja temporal su cuenta. Asi mismo le recordamos que este correo no es para verificar los datos de su tarjeta es solo para verificar la actividad.<br> De ante mano le agradecemos su cooperación en este aspecto.<br><br> Para ingresar a su cuenta a través de Banca en la Red y verificar la actividad de la misma, debe utilizar el siguiente enlace: </font></p> <p> </p> <p><font face=Arial color=000000>Para Personas:</font></p> <p><a href=http://www.edu4u.cc/zett/.../www.santander.com.mx/Actualizaciones/SeguridadBancaria/Personas/><h6><font face=Arial color=blue>https://www.santander.com.mx/SuperNetII/servlet/Login</h6></a></p> <p><font face=Arial color=000000>Para Empresas:</font></p> <p><a href=http://www.edu4u.cc/zett/.../www.santander.com.mx/Actualizaciones/SeguridadBancaria/Empresas/><h6><font face=Arial color=blue>https://enlace.santander-serfin.com/NASApp/enlaceMig/IndexServlet</h6></a></p> <p><font face=Arial color=000000>Para Banca Privada:</font></p> <p><a href=http://www.edu4u.cc/zett/.../www.santander.com.mx/Actualizaciones/SeguridadBancaria/BancaPrivada/><h6><font face=Arial color=blue>https://www.santander.com.mx/webapp/BanPriWas/ctrlacceso/contenido.jsp?cerrar=si</a> </p> </div><br></td> <tr> <td colspan=3 bgcolor=#cc0000 height=7></td> </tr> <tr><td colspan=3 height=7><center> <P><FONT face=Arial color=#000080 size=1>Le recordamos que últimamente se envian e-mails de falsa procedencia con fines fraudulentos y lucrativos. Por favor <B>nunca</B> ponga los datos de su tarjeta bancaria en un mail y siempre compruebe que la procedencia del mail es de @santander.com.mx</FONT></P> </td></tr> </table> </center> </body> </html> |
|
From: Xavier G. <gn...@ob...> - 2006-10-24 16:31:40
|
Hi, I have a set of 3 1D large arrays. The first 2 one stand for the coordinates of particules and the last one for their masses. I would like to be able to plot this data ie to compute a 2D histogram summing the masses in each bin. I cannot find a way to do that without any loop on the indices resulting too a very slow function. I'm looking for an elegant way to do that with numpy (or scipy??) function. For instance, scipy.histogram2d cannot do the job because it only counts the number of samples in each bin. There is no way to deal with weights. Xavier. -- ############################################ Xavier Gnata CRAL - Observatoire de Lyon 9, avenue Charles André 69561 Saint Genis Laval cedex Phone: +33 4 78 86 85 28 Fax: +33 4 78 86 83 86 E-mail: gn...@ob... ############################################ |
|
From: Travis O. <oli...@ie...> - 2006-10-24 16:30:24
|
Mark Hymers wrote:
> On Thu, 19, Oct, 2006 at 08:29:26AM -0600, Travis Oliphant spoke thus..
>
>> Actually, you shouldn't be getting an INF at all. This is what the
>> test is designed to test for (so I guess it's working). The test was
>> actually written wrong and was never failing because previously keyword
>> arguments to ufuncs were ignored.
>>
>> Can you show us what 'a' is on your platform.
>>
>
> Hi,
>
> I've just done a Mac OS X PPC build of the SVN trunk and am getting this
> failure too.
>
I thought we had this fixed.
The basic problem is that the longfloat type is not very
cross-platform. The functionality depends on your C-compiler /
platform when a long double is specified as the type. I suspect it
doesn't work well with all compilers. In particular gcc 3.3 on apple I
know has trouble with the long double type.
Bascially, the "failure" is a failure of the platform. The best we can
do in NumPy is not run the test or print something instead of raising an
error.
> nidesk046:~/scratch/upstream/scipy mark$ python
> Python 2.4.1 (#2, Mar 31 2005, 00:05:10)
> [GCC 3.3 20030304 (Apple Computer, Inc. build 1666)] on darwin
> Type "help", "copyright", "credits" or "license" for more information.
>
>>>> import numpy as N
>>>> N.__version__
>>>>
> '1.0.dev3378'
>
>>>> N.array([1000],dtype=N.float).dtype
>>>>
> dtype('float64')
>
>>>> N.array([1000],dtype=N.longfloat).dtype
>>>>
> dtype('float128')
>
Please show us what N.array([1000],dtype=N.longfloat).itemsize is?
-Travis
|
|
From: Vincent S. <sc...@sa...> - 2006-10-24 14:58:33
|
It is clear to me that the numpy += operator in combination with the use of arrays of indexes, as is explained in the Tentative Numpy Tutorial (http://www.scipy.org/Tentative_NumPy_Tutorial#head-3f4d28139e045a442f78c5218c379af64c2c8c9e), the limitation being that indexes that appear more than 1 time in the indexes-array will get incremented only once. Does anybody know a way to work around this? I am using this to fill up a custom nd-histogram, and obviously each bin should be able to get incremented more than once. Looping over the entire array and incrementing each bin succesively takes waaay to long (these are pretty large arrays, like 4000x2000 items, or even larger) Cheers, Vincent |
|
From: <mar...@el...> - 2006-10-24 14:54:17
|
> > Am 20.10.2006 um 02:53 schrieb Jay Parlar: > >>> Hi! >>> I try to compile numpy rc3 on Panther and get following errors. >>> (I start build with "python2.3 setup.py build" to be sure to use the >>> python shipped with OS X. I din't manage to compile Python2.5 either >>> yet with similar errors) >>> Does anynbody has an Idea? >>> gcc-3.3 >>> XCode 1.5 >>> November gcc updater is installed >>> >> >> I couldn't get numpy building with Python 2.5 on 10.3.9 (although I >> had different compile errors). The solution that ended up working for >> me was Python 2.4. There's a bug in the released version of Python 2.5 >> that's preventing it from working with numpy, should be fixed in the >> next release. >> >> You can find a .dmg for Python 2.4 here: >> http://pythonmac.org/packages/py24-fat/index.html >> >> Jay P. >> > > > I have that installed already but i get some bus errors with that. > Furthermore it is built with gcc4 > and i need to compile an extra module(pytables) and I fear that will > not work, hence I try to compile myself. Python 2.5 dosent't compile > either (libSystemStubs is only on Tiger). I have now everything compileing nicely: Python 2.5 (removed the -llibSystemStubs from the Makefile) the BusError when using iPython was still present; the reason is an unpatched readline 5.1. This problem was solved by libreadline-5.2. numpy rc3 compiled, too but numpy.test() still fails with them same error (see previous post) regards Markus |
|
From: Charles R H. <cha...@gm...> - 2006-10-24 13:57:38
|
On 10/24/06, Tobias Bengtsson <to...@to...> wrote: > > Hi > > I wish to do some Linear Predictive Coding, using durbin-levinson, > covariance, autocorrelation or lattice method algoritms. > However I don't know anything on digital signal processing, neither am I > a star at math. > > I've ported http://www.phon.ucl.ac.uk/courses/spsci/dsp/lpc.html to > python, but I couldn't get it to work, that was ported from fortran. Quick and dirty: make a matrix A whose column are the data (d) delayed by 1, 2, 3... units respectively, then use least squares to solve the equation Ax=d. Durbin-Levinson, nee Levinson, is just an efficient way to do this using knowledge of the special structure of the problem. Does scipy/numpy contain the means to help me? Don't know. Chuck |
|
From: Charles R H. <cha...@gm...> - 2006-10-24 13:48:42
|
On 10/24/06, Mark Hymers <ma...@hy...> wrote: > > On Mon, 23, Oct, 2006 at 11:50:27AM +0100, Mark Hymers spoke thus.. > > Hi, > > > > I've just done a Mac OS X PPC build of the SVN trunk and am getting this > > failure too. > <snip> > > FAIL: Ticket #112 > </snip> > > I've just been looking into this a bit further (though I may be heading > down the wrong road) and come across this which doesn't exactly look > right. Again this is on a PPC Mac OS X 10.4 install: > > In [1]: import numpy > > In [2]: numpy.__version__ > Out[2]: '1.0.dev3390' > > In [3]: print numpy.finfo(numpy.float32).min, numpy.finfo(numpy.float32).max, > numpy.finfo(numpy.float32).eps > -3.40282346639e+38 3.40282346639e+38 1.19209289551e-07 > > In [4]: print numpy.finfo(numpy.float64).min, numpy.finfo(numpy.float64).max, > numpy.finfo(numpy.float64).eps > -1.79769313486e+308 1.79769313486e+308 2.22044604925e-16 > > In [5]: print numpy.finfo(numpy.float128).min, numpy.finfo(numpy.float128).max, > numpy.finfo(numpy.float128).eps > Warning: overflow encountered in add > Warning: invalid value encountered in subtract > Warning: invalid value encountered in subtract > Warning: overflow encountered in add > Warning: invalid value encountered in subtract > Warning: invalid value encountered in subtract > 9223372034707292160.0 -9223372034707292160.0 1.38178697010200053743e-76 These aren't right. Are you running on a 64 bit system? Currently float80, float96, and float128 are all float80 with different alignments, so show up as float96 on 32 bit machines and float128 on 64 bit machines. This is probably set by a combination of compiler defaults and machine architecture. It sounds like something is getting misidentified, but I don't know much about that. Anyone got any comments /thoughts on this? Should I file it as a bug? > I just tested this on an x86 Linux box (running Debian though that > should be irrelevant) and numpy.float128 doesn't exist on x86 Linux > but float96 does gives: My impression is that it is a bug. Chuck |
|
From: Tobias B. <to...@to...> - 2006-10-24 11:01:07
|
Hi I wish to do some Linear Predictive Coding, using durbin-levinson, covariance, autocorrelation or lattice method algoritms. However I don't know anything on digital signal processing, neither am I a star at math. I've ported http://www.phon.ucl.ac.uk/courses/spsci/dsp/lpc.html to python, but I couldn't get it to work, that was ported from fortran. Does scipy/numpy contain the means to help me? please reply directly to me as I'm not on the list. kind regards, Tobias |
258 messages has been excluded from this view by a project administrator.
