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: Stephan T. <st...@si...> - 2006-08-02 23:00:20
|
Hi David, > I updated that patch to work (it's in ticket #114, btw, for those following > along), and integrated it last week. Please give the current svn a try to see > how it works. > I'm really sorry I overlooked your changes. Thanks a lot for your efforts. I will try the various windows builds in the next days and address the remaining issues. > I had it done mid-July, but I guess you didn't get the Trac email? I haven't received any email notfication from Trac. Is there something I can do about the missing notifications? Stephan |
From: David M. C. <co...@ph...> - 2006-08-02 22:36:40
|
On Wed, 02 Aug 2006 23:42:52 +0200 Stephan Tolksdorf <st...@si...> wrote: > > The changes by jlc46, I agree, don't look like what we want up there in > > the long term. However, they do look like valid issues (s)he had while > > trying to follow the instructions on that page. Not being much of a > > Windows user myself, I have no idea what the issues involved are, but > > perhaps before simply reverting them you could get to the bottom of the > > issue? > > I think these questions should be posted on the mailing list so that > everybody gets a chance to answer them, not only the people subscribing > to the particular Wiki page. > > Regarding the installation problems on Windows: A while ago I put some > effort into writing a patch to correct a few build issues on windows. > Due to unfortunate reasons nobody tried to apply the patch until part of > it was obsoleted by changes of David M. Cooke to system_info.py. As I > didn't keep track of David's changes to the build system I asked him for > advice regarding the integration of my patch, but I never got a reply. > Seems like I will have to bite the bullet and replicate some of my > earlier efforts... I updated that patch to work (it's in ticket #114, btw, for those following along), and integrated it last week. Please give the current svn a try to see how it works. I had it done mid-July, but I guess you didn't get the Trac email? -- |>|\/|< /--------------------------------------------------------------------------\ |David M. Cooke http://arbutus.physics.mcmaster.ca/dmc/ |co...@ph... |
From: David M. C. <co...@ph...> - 2006-08-02 22:33:29
|
On Tue, 1 Aug 2006 23:44:59 +0200 "Pau Gargallo" <pau...@gm...> wrote: > you may be interested in this python graph library > https://networkx.lanl.gov/ There's also http://wiki.python.org/moin/PythonGraphApi, which lists a bunch. It's the result of a discussion on c.l.py a few years ago about trying to come up with a standard API for graphs. I don't believe they came up with anything, but that page contains ideas to consider. -- |>|\/|< /--------------------------------------------------------------------------\ |David M. Cooke http://arbutus.physics.mcmaster.ca/dmc/ |co...@ph... |
From: Tim H. <tim...@ie...> - 2006-08-02 22:10:20
|
Ivan Vilata i Balaguer wrote: > Hi all, > > I'm attaching some patches that enable the current version of numexpr > (r2142) to: > > 1. Handle int64 integers in addition to int32 (constants, variables and > arrays). Python int objects are considered int32 if they fit in 32 > bits. Python long objects and int objects that don't fit in 32 bits > (for 64-bit platforms) are considered int64. > > 2. Handle string constants, variables and arrays (not Unicode), with > support for comparison operators (==, !=, <, <=, >=, >). (This > brings the old ``memsizes`` variable back.) String temporaries > (necessary for other kinds of operations) are not supported. > > The patches also include test cases and some minor corrections (e.g. > removing odd carriage returns in some lines in compile.py). There are > three patches to ease their individual review: > > * numexpr-int64.diff only contains the changes for int64 support. > * numexpr-str.diff only contains the changes for string support. > * numexpr-int64str.diff contains all changes. > > The task has been somehow difficult, but I think the result fits quite > well in numexpr. So, what's your opinion about the patches? Are they > worth integrating into the main branch? Thanks! > Unfortunately, I'm in the process of moving everything over to a new box, so my build environment is all broken and I can't try them out right now. However, just so you don't think everyone is ignoring you, I figured I'd reply. What use cases do you have in mind for the string comparison stuff? Strings are one of those features of numpy that I've personally never seen a use for, so I'm not that enthusiastic about them them in numarray, Particularly since it sounds like support is likely to only be partial. However, feel free to convince me otherwise. Or just convince David Cooke ;-) -tim > :: > > Ivan Vilata i Balaguer >qo< http://www.carabos.com/ > Cárabos Coop. V. V V Enjoy Data > "" > > ------------------------------------------------------------------------ > > ------------------------------------------------------------------------- > Take Surveys. Earn Cash. Influence the Future of IT > Join SourceForge.net's Techsay panel and you'll get the chance to share your > opinions on IT & business topics through brief surveys -- and earn cash > http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV > ------------------------------------------------------------------------ > > _______________________________________________ > Numpy-discussion mailing list > Num...@li... > https://lists.sourceforge.net/lists/listinfo/numpy-discussion > |
From: Stephan T. <st...@si...> - 2006-08-02 21:43:02
|
> The changes by jlc46, I agree, don't look like what we want up there in > the long term. However, they do look like valid issues (s)he had while > trying to follow the instructions on that page. Not being much of a > Windows user myself, I have no idea what the issues involved are, but > perhaps before simply reverting them you could get to the bottom of the > issue? I think these questions should be posted on the mailing list so that everybody gets a chance to answer them, not only the people subscribing to the particular Wiki page. Regarding the installation problems on Windows: A while ago I put some effort into writing a patch to correct a few build issues on windows. Due to unfortunate reasons nobody tried to apply the patch until part of it was obsoleted by changes of David M. Cooke to system_info.py. As I didn't keep track of David's changes to the build system I asked him for advice regarding the integration of my patch, but I never got a reply. Seems like I will have to bite the bullet and replicate some of my earlier efforts... Regards, Stephan |
From: Andrew S. <str...@as...> - 2006-08-02 20:54:00
|
David wrote: >Stephan Tolksdorf wrote: > > >>Hi >> >>A user named jlc46 is misusing the wiki page "Installing SciPy/Windows" >>to ask for help on his installation problems. How can I >>a) contact him in order to ask him to post his questions on the mailing >>lists, and >> >> > >You cannot find out his email address as a normal wiki-user. >Alternatively, you may add a note at the top of the wiki-page. > > > >>b) most easily revert changes to wiki-pages? >> >> > >"Normally", you will have a revert link at each version (if you have >'admin'-permission) at the page-info: >http://new.scipy.org/Wiki/Installing_SciPy/Windows?action=info > >I assume that the people listed on >http://new.scipy.org/Wiki/Installing_SciPy/EditorsGroup >have this 'admin' permission. Maybe you can be added. > > Stephan, I just added you to http://scipy.org/Wiki/EditorsGroup , so you should now have "revert" among your options in the "get info" page. The changes by jlc46, I agree, don't look like what we want up there in the long term. However, they do look like valid issues (s)he had while trying to follow the instructions on that page. Not being much of a Windows user myself, I have no idea what the issues involved are, but perhaps before simply reverting them you could get to the bottom of the issue? |
From: Mark H. <ma...@mi...> - 2006-08-02 20:51:10
|
I need a binary threshold and numpy.where() seems very slow on numpy 0.9.9.2800: python -m timeit -n 10 -s "import numpy as n;a=n.ones((512,512), n.uint8)*129" "a_bin=n.where( a>128, 128,0)" 10 loops, best of 3: 37.9 msec per loop I'm thinking the conversion of the min, max constants from python ints to n.uint8 might be slowing it down? Is there a better way? Scipy is also an option. Ive search up list quickly and nothing jumps out. For comparison Ive got some ctypes wrapped OpenCv code (that I'd like to avoid) doing the same thing in < 1 msec: Cv images here are unsigned 8 bit as above: python -m timeit -n 50 -s "import cv;sz=cv.cvSize(512,512);a=cv.cvCreateImage(sz, 8, 1); a_bin=cv.cvCreateImage(sz,8,1)" "cv.cvThreshold(a, a_bin, float(128), float(255), cv.CV_THRESH_BINARY )" 50 loops, best of 3: 348 usec per loop And with the Intel IPP optimizations turned on < 0.1msec: python -m timeit -n 50 -s "import cv; sz=cv.cvSize(512,512); a=cv.cvCreateImage(sz, 8, 1); a_bin=cv.cvCreateImage(sz,8,1)" "cv.cvThreshold(a, a_bin, float(128), float(255), cv.CV_THRESH_BINARY )" 50 loops, best of 3: 59.5 usec per loop Regards, Mark |
From: Robert K. <rob...@gm...> - 2006-08-02 20:14:53
|
Stephan Tolksdorf wrote: > Hi > > A user named jlc46 is misusing the wiki page "Installing SciPy/Windows" > to ask for help on his installation problems. How can I > a) contact him in order to ask him to post his questions on the mailing > lists, and Not sure. > b) most easily revert changes to wiki-pages? Click the "info" button on the page. There will be a list of revisions. Old revisions will have a "revert" link in the right-hand column. I believe (although I recommend checking the MoinMoin documentation before trying this) that clicking that link will revert the text back to whatever it was at that revision. -- Robert Kern "I have come to believe that the whole world is an enigma, a harmless enigma that is made terrible by our own mad attempt to interpret it as though it had an underlying truth." -- Umberto Eco |
From: David <dav...@ti...> - 2006-08-02 20:13:34
|
Stephan Tolksdorf wrote: > Hi > > A user named jlc46 is misusing the wiki page "Installing SciPy/Windows" > to ask for help on his installation problems. How can I > a) contact him in order to ask him to post his questions on the mailing > lists, and You cannot find out his email address as a normal wiki-user. Alternatively, you may add a note at the top of the wiki-page. > b) most easily revert changes to wiki-pages? "Normally", you will have a revert link at each version (if you have 'admin'-permission) at the page-info: http://new.scipy.org/Wiki/Installing_SciPy/Windows?action=info I assume that the people listed on http://new.scipy.org/Wiki/Installing_SciPy/EditorsGroup have this 'admin' permission. Maybe you can be added. Regards, David > Any hint would be appreciated. > > Regards, > Stephan |
From: Stephan T. <st...@si...> - 2006-08-02 19:52:22
|
Hi A user named jlc46 is misusing the wiki page "Installing SciPy/Windows" to ask for help on his installation problems. How can I a) contact him in order to ask him to post his questions on the mailing lists, and b) most easily revert changes to wiki-pages? Any hint would be appreciated. Regards, Stephan |
From: Tom L. <lo...@as...> - 2006-08-02 19:47:02
|
> http://www.scipy.org/ReleaseNotes/NumPy_1.0 > > Please correct problems and add to them as needed. This is incredibly helpful---quite a few things I wasn't aware of. Many, many thanks! -Tom Loredo ------------------------------------------------- This mail sent through IMP: http://horde.org/imp/ |
From: Nick F. <nv...@MI...> - 2006-08-02 19:18:35
|
> Message: 2 > Date: Wed, 02 Aug 2006 12:06:45 -0600 > From: Travis Oliphant <oli...@ie...> > Subject: [Numpy-discussion] Release Notes for 1.0 posted > To: numpy-discussion <num...@li...> > Message-ID: <44D...@ie...> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > http://www.scipy.org/ReleaseNotes/NumPy_1.0 > > Please correct problems and add to them as needed. > > -Travis > What's not clear to me upon reading this page is what diff set this is describing. Are these the changes between 0.9.8 and 1.0b1? Especially if this page is to be updated with each release, we should be explicit about what changed when. This is a helpful document. Thanks. Take care, Nick |
From: <jk...@to...> - 2006-08-02 19:04:24
|
<html> <head> <meta http-equiv="Content-Type" content="text/html; charset=gb2312"> <title>无标题文档</title> <style type="text/css"> <!-- .td { font-size: 12px; color: #313131; line-height: 20px; font-family: "Arial", "Helvetica", "sans-serif"; } --> </style> </head> <body leftmargin="0" background="http://bo.sohu.com//images/img20040502/dj_bg.gif"> <table width="100%" border="0" cellspacing="0" cellpadding="0"> <tr> <td height="31" background="http://igame.sina.com.cn/club/images/topmenu/topMenu_8.gif" class="td"><div align="center"><font color="#FFFFFF">主办单位:易腾企业管理咨询有限公司</font></div></td> </tr> </table> <table width="673" border="0" align="center" cellpadding="0" cellspacing="0"> <tr> <td height="62" bgcolor="#8C8C8C"> <div align="center"> <table width="100%" border="0" cellspacing="1" cellpadding="0" height="69"> <tr> <td height="67" bgcolor="#F3F3F3"><div align="center"><font lang="ZH-CN" color="#FF0000" size="6"><b>车间管理人员八项修炼</b></font></div></td> </tr> </table> </div></td> </tr> </table> <table width="673" border="0" align="center" cellpadding="0" cellspacing="0" class="td" height="1411"> <tr> <td height="1415" bgcolor="#FFFFFF"> <div align="center"> <table width="99%" border="0" cellspacing="0" cellpadding="0"> <tr> <td width="17%" height="20" bgcolor="#BF0000" class="td"> <div align="center"><font color="#FFFFFF">[课 程 背 景]</font></div></td> <td width="83%" class="td"> </td> </tr> <tr> <td height="74" colspan="2" class="td"> <p ALIGN="JUSTIFY"><font LANG="ZH-CN"> </font><font lang="ZH-CN" size="2"> <span style="mso-bidi-font-size: 9.0pt; mso-bidi-font-family: Times New Roman; mso-font-kerning: 1.0pt; mso-ansi-language: EN-US; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA">车间是生产型企业的中心,车间和制造部门管理的好坏,直接影响着产品“质量、成本、交货期”各项指标的完成,伴随着微利时代的到来和组织结构趋向扁平化的今天,车间管理在企业中将扮演愈加重要的角色!<br> 而车间管理人员常常面临:<br> 1、工作做了不少,每天也忙忙碌碌,管理好象还是理不出头绪,如何有效的推进车间管理工作?<br> 2、品种多,计划变化频繁,生产任务忽高忽低,如何提高生产车间柔型,有效的保证生产进度?<br> 3、生产过程不稳定,机器故障和产品质量问题常常发生,如何有效的控制提高质量和提高设备利用率<br> 4、现场很多事情需要依靠下属和同级部门共同努力,如何有效沟通和协调激发下属的主动性和责任心? </span></font></td> </tr> </table> </div> <div align="center" style="width: 671; height: 1"> </div> <div align="center"> <table width="99%" height="84" border="0" cellpadding="0" cellspacing="0"> <tr> <td width="17%" height="20" bgcolor="#0080C0" class="td"> <div align="center"><font color="#FFFFFF">[课 程 大 纲]</font></div></td> <td width="83%" class="td"> </td> </tr> <tr> <td height="64" colspan="2" class="td"> <p><font size="2"><b><font color="#0000FF">◇ 车间管理人员的角色定位</font></b><br> 车间管理人员的职责与角色认知<br> 如何建立好的管理的基础<br> 如何成为好的车间现场管理人员<br> 车间管理工作的重心与要点<br> <b><font color="#0000FF">◇ 如何有效的推进车间管理工作</font></b><br> 车间整体工作的推进体系<br> 车间管理项目的指标化<br> 如何将目标与指标展开为具体的实施方案<br> 如何有效的分解车间管理目标<br> 如何通过报告与例会进行管理追踪<br> <b><font color="#0000FF">◇ 如何有效的挖掘车间问题</font></b><br> 工厂常见问题<br> 如何从4M查核各个环节的问题<br> 如何寻找“三呆”,消除“三呆”<br> 如何建立适宜的标准,作为暴露问题的指针<br> <b><font color="#0000FF">◇ 车间管理的基础--如何运用5S和目视管理</font></b><br> 为什么5S是工厂管理合理化的根本<br> 5S的核心与实质<br> 精益目视管理<br> 5S信息板,KANBAN卡片<br> 创建和应用不同类型的视觉控制工具<br> 案例研讨<br> <b><font color="#0000FF">◇ 车间进度与过程控制</font></b><br> 生产作业计划的追踪实施<br> 如何控制最佳的生产节拍,保持有效产出<br> 如何提高生产管理系统的柔性<br> 如何减少运输时间,缩短交期<br> 运用U型生产线布置方式提高生产线的效率<br> 如何降低换线时间适应生产线的转换<br> 如何利用多能工随时调整生产安排<br> 如何化解瓶颈环节的制约<br> 如何通过快速换型技术实现多品种生产转换<br> 换型物料车与换型工具车的使用<br> <b><font color="#0000FF">◇ 现场质量改进</font></b><br> 如何识别质量问题<br> 如何运用品管圈活动改进质量管理<br> 推移管理与预防性问题发现<br> 质量问题的对应流程与要点<br> 质量改善活动的四阶段十步骤<br> <b><font color="#0000FF">◇ 现场成本控制</font></b><br> 盈亏平衡点――学习老板的经营观<br> 现场成本管理的主要指标<br> 降低制造成本的主要途径<br> 减少现场浪费的活动方法<br> 放大镜――从宏观到微观的工具<br> 标准成本与标准工时的测定<br> 标准成本/标准工时的差异分析<br> <b><font color="#0000FF">◇ 现场设备管理TPM</font></b><br> 设备管理的八大支柱<br> 数字化的综合效率管理<br> 设备的六大损失<br> 改善慢性损失,向零故障挑战 <br> 设备初期清扫与困难源对策<br> 自主保养的七步骤<br> <b><font color="#0000FF">◇ 车间人员管理</font></b><br> 新型的上下级关系<br> 自我培养与培养下属的意识<br> 如何有效的指导与辅导下属<br> 如何塑造持续学习与改善的现场氛围<br> 如何有效的向上级沟通与汇报<br> 同级部门之间沟通与反馈的技巧<br> 人际技巧与关系处理<br> 激励下属的技巧与方法<br> <b><font color="#0000FF">◇ 案例讨论</font></b></font> </p></td> </tr> </table> <table width="99%" height="84" border="0" cellpadding="0" cellspacing="0"> <tr> <td width="17%" height="20" bgcolor="#0080C0" class="td"> <div align="center"><font color="#FFFFFF">[导 师 简 介]</font></div></td> <td width="83%" class="td"> </td> </tr> <tr> <td height="64" colspan="2" class="td"> <p><font size="2"><font color="#FF0000"> Mr Wang,管理工程硕士、高级经济师,6SIGMA黑带,国际职业培训师协会认证职业培训师。</font>王先生长期推行工业工程、精益生产等先进运作方式,历任大型跨国公司生产负责人、工业工程经理、项目总监,对企业管理有较深入的研究。王老师主要从事生产计划与物料控制、IE技术应用、成本控制、价值工程的讲授,先后为IBM、TDK、松下、可口可乐、康师傅、汇源果汁、雪津啤酒、吉百利食品、冠捷电子、正新橡胶、美国ITT集团、广上科技、美的空调、中兴通讯、京信通信、联想电脑、艾克森-金山石化、正大集团、厦华集团、灿坤股份、NEC东金电子、太原钢铁集团、PHILIPS、三洋华强、TCL、EPSON、长安福特、泰科电子、长城计算机等知名企业提供项目辅导或专题培训。王老师授课经验丰富,风格幽默诙谐、逻辑清晰、过程互动,案例生动、深受学员喜爱</font> 。</p></td> </tr> </table> </div> <div align="center"> <table width="667" border="0" cellpadding="0" cellspacing="0" height="46"> <tr> <td width="111" height="20" bgcolor="#0080C0" class="td"> <div align="center"><font color="#FFFFFF">[时间/地点/报名]</font></div></td> <td width="552" class="td" height="20"> </td> </tr> <tr> <td height="26" colspan="2" class="td" width="665"> <p><font size="2"><font color="#000000"><b>时间: </b></font>8月12-13日 (周六/日) <b> </b> 地点: 上海 </font></p> </td> </tr> </table> </div> <table width="99%" height="27" border="0" align="center" cellpadding="0" cellspacing="0"> <tr> <td height="27" class="td"> <p><font size="2"><font color="#000000"><b>费用: </b></font>1980元/人(含课程费、教材,午餐、茶水等) <font color="#000000"><b> </b>优惠:</font>四人以上参加,赠予一名名额</font> </p> </td> </tr> </table> <table width="99%" height="32" border="0" align="center" cellpadding="0" cellspacing="0"> <tr> <td height="12" class="td"> <font size="2"><font color="#000000"><b>报名/咨询电话:</b></font> 谢小姐<font color="#000000"> </font>1 3 6 8 1 7 9 5 7 4 0 <font color="#000000"> (上海以外客户请加拨0 )</font> <br> 注: 如您不需要此邮件,请将邮箱发送至: ts...@to...(并在邮件标题注明订退)</font></td> </tr> </table> </td> </tr> </table> </body> </html> |
From: Torgil S. <tor...@gm...> - 2006-08-02 18:31:18
|
> What do people think? Is it worth it? This could be a coding-sprint > effort at SciPy. > > > -Travis Sounds like a good idea. This should make old code work while not imposing unneccessary restrictions on numpy due to backward compatibility. //Torgil |
From: Travis O. <oli...@ie...> - 2006-08-02 18:06:51
|
http://www.scipy.org/ReleaseNotes/NumPy_1.0 Please correct problems and add to them as needed. -Travis |
From: Bryce H. <bhe...@en...> - 2006-08-02 17:43:51
|
Enthought is pleased to announce the release of Python Enthought Edition Version 1.0.0 (http://code.enthought.com/enthon/) -- a python distribution for Windows. About Python Enthought Edition: ------------------------------- Python 2.4.3, Enthought Edition is a kitchen-sink-included Python distribution for Windows including the following packages out of the box: Numpy SciPy IPython Enthought Tool Suite wxPython PIL mingw MayaVi Scientific Python VTK and many more... More information is available about all Open Source code written and released by Enthought, Inc. at http://code.enthought.com 1.0.0 Release Notes ------------------------- A lot of work has gone into testing this release, and it is our most stable release to date, but there are a couple of caveats: * The generated documentation index entries are missing. The full text search does work and the table of contents is complete, so this feature will be pushed to version 1.1.0. * IPython may cause problems when starting the first time if a previous version of IPython was ran. If you see "WARNING: could not import user config", either follow the directions which follow the warning. * Some users are reporting that older matplotlibrc files are not compatible with the version of matplotlib installed with this release. Please refer to the matplotlib mailing list (http://sourceforge.net/mail/?group_id=80706) for further help. We are grateful to everyone who has helped test this release. If you'd like to contribute or report a bug, you can do so at https://svn.enthought.com/enthought. |
From: Stefan v. d. W. <st...@su...> - 2006-08-02 11:35:50
|
On Tue, Aug 01, 2006 at 06:21:49PM -0600, Travis Oliphant wrote: > I'm wondering about whether or not some additional effort should be=20 > placed in numpy.oldnumeric so that replacing Numeric with=20 > numpy.oldnumeric actually gives no compatibility issues (i.e. the only=20 > thing you have to change is replace imports with new names). In=20 > other words a simple array sub-class could be created that mimics the=20 > old Numeric array and the old functions could be created as well with=20 > the same arguments. >=20 > The very same thing could be done with numarray. This would make=20 > conversion almost trivial.=20 >=20 > Then, the convertcode script could be improved to make all the changes=20 > that would take a oldnumeric-based module to a more modern numpy-based=20 > module. A similar numarray script could be developed as well. >=20 > What do people think? Is it worth it? This could be a coding-sprint=20 > effort at SciPy. This sounds like a very good idea to me. I hope that those of us who cannot attend SciPy 2006 can still take part in the coding sprints, be it via IRC or some other communications media. Cheers St=E9fan |
From: Travis O. <oli...@ee...> - 2006-08-02 00:22:00
|
Torgil Svensson wrote: >>They are supposed to have different defaults because the functional >>forms are largely for backward compatibility where axis=0 was the default. >> >>-Travis >> >> > >Isn't backwards compatibility what "oldnumeric" is for? > > > As this discussion indicates there has been a switch from numpy 0.9.8 to numpy 1.0b of how to handle backward compatibility. Instead of importing old names a new sub-package numpy.oldnumeric was created. This mechanism is incomplete in the sense that there are still some backward-compatible items in numpy such as defaults on the axis keyword for functions versus methods and you still have to make the changes that convertcode.py makes to the code to get it to work. I'm wondering about whether or not some additional effort should be placed in numpy.oldnumeric so that replacing Numeric with numpy.oldnumeric actually gives no compatibility issues (i.e. the only thing you have to change is replace imports with new names). In other words a simple array sub-class could be created that mimics the old Numeric array and the old functions could be created as well with the same arguments. The very same thing could be done with numarray. This would make conversion almost trivial. Then, the convertcode script could be improved to make all the changes that would take a oldnumeric-based module to a more modern numpy-based module. A similar numarray script could be developed as well. What do people think? Is it worth it? This could be a coding-sprint effort at SciPy. -Travis |
From: Torgil S. <tor...@gm...> - 2006-08-01 22:45:40
|
> They are supposed to have different defaults because the functional > forms are largely for backward compatibility where axis=0 was the default. > > -Travis Isn't backwards compatibility what "oldnumeric" is for? +1 for consistent defaults. |
From: David G. <dav...@gm...> - 2006-08-01 22:20:03
|
I saw that one as well. Looks neat! Too bad they rarely mention the word "graph" so they never come up on my google searches. I found them through del.icio.us by searching for python and graph. Dave On 8/1/06, Pau Gargallo <pau...@gm...> wrote: > > you may be interested in this python graph library > https://networkx.lanl.gov/ > > pau > > On 8/1/06, David Grant <dav...@gm...> wrote: > > I actually just looked into the boost graph library and hit a wall. I > > basically had trouble running bjam on it. It complained about a missing > > build file or something like that. > > > > Anyways, for now I can live with non-sparse implementation. This is > mostly > > prototyping code for integeration in to a largely Java system (with some > > things written in C). So this will be ported to Java or C eventually. > > Whether or not I will need to protoype something that scales to > thousands of > > nodes remains to be seen. > > > > Dave > > > > > > On 8/1/06, Charles R Harris <cha...@gm...> wrote: > > > > > > Hi David, > > > > > > I often have several thousand nodes in a graph, sometimes clustered > into > > connected components. I suspect that using an adjacency matrix is an > > inefficient representation for graphs of that size while for smaller > graphs > > the overhead of more complicated structures wouldn't be noticeable. Have > you > > looked at the boost graph library? I don't like all their stuff but it > is a > > good start with lots of code and a suitable license. > > > > > > Chuck > > > > > > > > > > > > On 8/1/06, David Grant < dav...@gm...> wrote: > > > > > > > > > > > > > > > > I have written my own graph class, it doesn't really do much, just has > a > > few methods, it might do more later. Up until now it has just had one > piece > > of data, an adjacency matrix, so it looks something like this: > > > > > > class Graph: > > > def __init__(self, Adj): > > > self.Adj = Adj > > > > > > I had the idea of changing Graph to inherit numpy.ndarray instead, so > then > > I can just access itself directly rather than having to type self.Adj. > Is > > this the right way to go about it? To inherit from numpy.ndarray? > > > > > > The reason I'm using a numpy array to store the graph by the way is > the > > following: > > > -Memory is not a concern (yet) so I don't need to use a sparse > structure > > like a sparse array or a dictionary > > > -I run a lot of sums on it, argmin, blanking out of certain rows and > > columns using fancy indexing, grabbing subgraphs using vector indexing > > > > > > > > > -- > > > David Grant > > > http://www.davidgrant.ca > > > > > > > > > ------------------------------------------------------------------------- > > > Take Surveys. Earn Cash. Influence the Future of IT > > > Join SourceForge.net's Techsay panel and you'll get the chance to > share > > your > > > opinions on IT & business topics through brief surveys -- and earn > cash > > > > > > http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV > > > > > > _______________________________________________ > > > Numpy-discussion mailing list > > > Num...@li... > > > > > https://lists.sourceforge.net/lists/listinfo/numpy-discussion > > > > > > > > > > > > > > > > > > > > > > > -- > > David Grant > > http://www.davidgrant.ca > > > ------------------------------------------------------------------------- > > Take Surveys. Earn Cash. Influence the Future of IT > > Join SourceForge.net's Techsay panel and you'll get the chance to share > your > > opinions on IT & business topics through brief surveys -- and earn cash > > > http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV > > > > _______________________________________________ > > Numpy-discussion mailing list > > Num...@li... > > https://lists.sourceforge.net/lists/listinfo/numpy-discussion > > > > > > > -- David Grant http://www.davidgrant.ca |
From: Pau G. <pau...@gm...> - 2006-08-01 21:45:06
|
you may be interested in this python graph library https://networkx.lanl.gov/ pau On 8/1/06, David Grant <dav...@gm...> wrote: > I actually just looked into the boost graph library and hit a wall. I > basically had trouble running bjam on it. It complained about a missing > build file or something like that. > > Anyways, for now I can live with non-sparse implementation. This is mostly > prototyping code for integeration in to a largely Java system (with some > things written in C). So this will be ported to Java or C eventually. > Whether or not I will need to protoype something that scales to thousands of > nodes remains to be seen. > > Dave > > > On 8/1/06, Charles R Harris <cha...@gm...> wrote: > > > > Hi David, > > > > I often have several thousand nodes in a graph, sometimes clustered into > connected components. I suspect that using an adjacency matrix is an > inefficient representation for graphs of that size while for smaller graphs > the overhead of more complicated structures wouldn't be noticeable. Have you > looked at the boost graph library? I don't like all their stuff but it is a > good start with lots of code and a suitable license. > > > > Chuck > > > > > > > > On 8/1/06, David Grant < dav...@gm...> wrote: > > > > > > > > > > > I have written my own graph class, it doesn't really do much, just has a > few methods, it might do more later. Up until now it has just had one piece > of data, an adjacency matrix, so it looks something like this: > > > > class Graph: > > def __init__(self, Adj): > > self.Adj = Adj > > > > I had the idea of changing Graph to inherit numpy.ndarray instead, so then > I can just access itself directly rather than having to type self.Adj. Is > this the right way to go about it? To inherit from numpy.ndarray? > > > > The reason I'm using a numpy array to store the graph by the way is the > following: > > -Memory is not a concern (yet) so I don't need to use a sparse structure > like a sparse array or a dictionary > > -I run a lot of sums on it, argmin, blanking out of certain rows and > columns using fancy indexing, grabbing subgraphs using vector indexing > > > > > > -- > > David Grant > > http://www.davidgrant.ca > > > > > ------------------------------------------------------------------------- > > Take Surveys. Earn Cash. Influence the Future of IT > > Join SourceForge.net's Techsay panel and you'll get the chance to share > your > > opinions on IT & business topics through brief surveys -- and earn cash > > > http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV > > > > _______________________________________________ > > Numpy-discussion mailing list > > Num...@li... > > > https://lists.sourceforge.net/lists/listinfo/numpy-discussion > > > > > > > > > > > > > > -- > David Grant > http://www.davidgrant.ca > ------------------------------------------------------------------------- > Take Surveys. Earn Cash. Influence the Future of IT > Join SourceForge.net's Techsay panel and you'll get the chance to share your > opinions on IT & business topics through brief surveys -- and earn cash > http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV > > _______________________________________________ > Numpy-discussion mailing list > Num...@li... > https://lists.sourceforge.net/lists/listinfo/numpy-discussion > > > |
From: Mathew Y. <my...@jp...> - 2006-08-01 20:47:07
|
Here are few problems I had with numpy and scipy 1) Compiling scipy on solaris requires running ld -G instead of gcc -shared. Apparently, gcc was not passing the correct args to my nongnu ld. I could not figure out how to alter setup.py to link using ld instead of gcc so I had to link by hand. 2) memmap has to be modified to remove "flush" on Windows. If calls to flush are allowed, Python (ActiveState) crashes at program exit. 3) savemat in scipy.io.mio had to be modified to remove type check since I am using the class memmap which derives from ndarray. In savemat a check is made that the object being save is an Array. Mathew |
From: David G. <dav...@gm...> - 2006-08-01 20:36:18
|
I actually just looked into the boost graph library and hit a wall. I basically had trouble running bjam on it. It complained about a missing build file or something like that. Anyways, for now I can live with non-sparse implementation. This is mostly prototyping code for integeration in to a largely Java system (with some things written in C). So this will be ported to Java or C eventually. Whether or not I will need to protoype something that scales to thousands of nodes remains to be seen. Dave On 8/1/06, Charles R Harris <cha...@gm...> wrote: > > Hi David, > > I often have several thousand nodes in a graph, sometimes clustered into > connected components. I suspect that using an adjacency matrix is an > inefficient representation for graphs of that size while for smaller graphs > the overhead of more complicated structures wouldn't be noticeable. Have you > looked at the boost graph library? I don't like all their stuff but it is a > good start with lots of code and a suitable license. > > Chuck > > On 8/1/06, David Grant <dav...@gm...> wrote: > > > I have written my own graph class, it doesn't really do much, just has a > few methods, it might do more later. Up until now it has just had one piece > of data, an adjacency matrix, so it looks something like this: > > class Graph: > def __init__(self, Adj): > self.Adj = Adj > > I had the idea of changing Graph to inherit numpy.ndarray instead, so then > I can just access itself directly rather than having to type self.Adj. Is > this the right way to go about it? To inherit from numpy.ndarray? > > The reason I'm using a numpy array to store the graph by the way is the > following: > -Memory is not a concern (yet) so I don't need to use a sparse structure > like a sparse array or a dictionary > -I run a lot of sums on it, argmin, blanking out of certain rows and > columns using fancy indexing, grabbing subgraphs using vector indexing > > -- > David Grant > http://www.davidgrant.ca > > ------------------------------------------------------------------------- > Take Surveys. Earn Cash. Influence the Future of IT > Join SourceForge.net's Techsay panel and you'll get the chance to share > your > opinions on IT & business topics through brief surveys -- and earn cash > http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV > > _______________________________________________ > Numpy-discussion mailing list > Num...@li... > https://lists.sourceforge.net/lists/listinfo/numpy-discussion > > > > -- David Grant http://www.davidgrant.ca |
From: David G. <dav...@gm...> - 2006-08-01 20:31:37
|
Thanks Bill, I think you are right, I think what I have is what I want (ie. not extending ndarray). I guess do go along with the "whatever makes your life the easiest" mantra, all I am really missing right now is the ability to access my Graph object like this g[blah] with square brackets and to do vector indexing and all that. What is the name of the double-underscored method that I should implement (and then call the underlying datastructure's corresponding method)? I see __getitem__ and __getslice__... hmm, this could get messy. Maybe the way I have it is ok. Maybe I can live with G.Adj. Dave On 8/1/06, Bill Baxter <wb...@gm...> wrote: > > Hi David, > > For a graph, the fact that it's stored as a matrix, or stored as > linked nodes, or dicts, etc, is an implementation detail. So from a > classical OO point of view, inheritance is not what you want. > Inheritance says "this is a kind of that". But a graph is not a kind > of matrix. A matrix is merely one possible way to represent a graph. > Many matrix operations don't even make sense on a graph (although a > lot of them do...). Also you say "memory is not a concern (yet)", but > maybe it will be later, and then you'll want to change the underlying > representation. Ideally you will be able to do this in such a way > that all your graph-using code works completely without modification. > This will be harder to do if you derive from ndarray. Because to > prevent existing code from breaking you have to duplicate ndarray's > interface exactly, because you don't know which ndarray methods are > being used by all existing Graph-using code. > > On the other hand, in the short term it's probably easier to derive > from ndarray directly if all you need is something quick and dirty. > But maybe then you don't even need to make a graph class. All you > need is > > Graph = ndarray > > I've seen plenty of Matlab code that just uses raw matrices to > represent graphs without introducing any new type or class. It may be > that's good enough for what you want to do. > > Python is not really a "Classical OO" language, in the sense that > there's.no real data hiding, etc. Python's philosophy seems to be > more like "whatever makes your life the easiest". So do what you > think will make your life easiest based on the totality of your > circumstances (including need for future maintenance). > > If memory is your only concern, then if/when it becomes and issue, a > switch to scipy.sparse matrix shouldn't be too bad if you want to just > use the ndarray interface. > > --bill > > > On 8/2/06, David Grant <dav...@gm...> wrote: > > I have written my own graph class, it doesn't really do much, just has a > few > > methods, it might do more later. Up until now it has just had one piece > of > > data, an adjacency matrix, so it looks something like this: > > > > class Graph: > > def __init__(self, Adj): > > self.Adj = Adj > > > > I had the idea of changing Graph to inherit numpy.ndarray instead, so > then I > > can just access itself directly rather than having to type self.Adj. Is > this > > the right way to go about it? To inherit from numpy.ndarray? > > > > The reason I'm using a numpy array to store the graph by the way is the > > following: > > -Memory is not a concern (yet) so I don't need to use a sparse structure > > like a sparse array or a dictionary > > -I run a lot of sums on it, argmin, blanking out of certain rows and > columns > > using fancy indexing, grabbing subgraphs using vector indexing > > > > -- > > David Grant > > http://www.davidgrant.ca > > > ------------------------------------------------------------------------- > > Take Surveys. Earn Cash. Influence the Future of IT > > Join SourceForge.net's Techsay panel and you'll get the chance to share > your > > opinions on IT & business topics through brief surveys -- and earn cash > > > http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV > > > > _______________________________________________ > > Numpy-discussion mailing list > > Num...@li... > > https://lists.sourceforge.net/lists/listinfo/numpy-discussion > > > > > > > -- David Grant http://www.davidgrant.ca |
From: Travis O. <oli...@ee...> - 2006-08-01 19:54:59
|
Sasha wrote: >I cannot reproduce your results, but I wonder if the following is right: > > > >>>>a = array([1,2,3,4,5]) >>>>var(a[newaxis,:]) >>>> >>>> >array([ 0., 0., 0., 0., 0.]) > > >>>>a[newaxis,:].var() >>>> >>>> >2.0 > > >>>>a[newaxis,:].var(axis=0) >>>> >>>> >array([ 0., 0., 0., 0., 0.]) > >Are method and function supposed to have different defaults? It looks >like the method defaults to variance over all axes while the function >defaults to axis=0. > > > They are supposed to have different defaults because the functional forms are largely for backward compatibility where axis=0 was the default. -Travis |