You can subscribe to this list here.
2003 |
Jan
|
Feb
|
Mar
|
Apr
|
May
(3) |
Jun
|
Jul
|
Aug
(12) |
Sep
(12) |
Oct
(56) |
Nov
(65) |
Dec
(37) |
---|---|---|---|---|---|---|---|---|---|---|---|---|
2004 |
Jan
(59) |
Feb
(78) |
Mar
(153) |
Apr
(205) |
May
(184) |
Jun
(123) |
Jul
(171) |
Aug
(156) |
Sep
(190) |
Oct
(120) |
Nov
(154) |
Dec
(223) |
2005 |
Jan
(184) |
Feb
(267) |
Mar
(214) |
Apr
(286) |
May
(320) |
Jun
(299) |
Jul
(348) |
Aug
(283) |
Sep
(355) |
Oct
(293) |
Nov
(232) |
Dec
(203) |
2006 |
Jan
(352) |
Feb
(358) |
Mar
(403) |
Apr
(313) |
May
(165) |
Jun
(281) |
Jul
(316) |
Aug
(228) |
Sep
(279) |
Oct
(243) |
Nov
(315) |
Dec
(345) |
2007 |
Jan
(260) |
Feb
(323) |
Mar
(340) |
Apr
(319) |
May
(290) |
Jun
(296) |
Jul
(221) |
Aug
(292) |
Sep
(242) |
Oct
(248) |
Nov
(242) |
Dec
(332) |
2008 |
Jan
(312) |
Feb
(359) |
Mar
(454) |
Apr
(287) |
May
(340) |
Jun
(450) |
Jul
(403) |
Aug
(324) |
Sep
(349) |
Oct
(385) |
Nov
(363) |
Dec
(437) |
2009 |
Jan
(500) |
Feb
(301) |
Mar
(409) |
Apr
(486) |
May
(545) |
Jun
(391) |
Jul
(518) |
Aug
(497) |
Sep
(492) |
Oct
(429) |
Nov
(357) |
Dec
(310) |
2010 |
Jan
(371) |
Feb
(657) |
Mar
(519) |
Apr
(432) |
May
(312) |
Jun
(416) |
Jul
(477) |
Aug
(386) |
Sep
(419) |
Oct
(435) |
Nov
(320) |
Dec
(202) |
2011 |
Jan
(321) |
Feb
(413) |
Mar
(299) |
Apr
(215) |
May
(284) |
Jun
(203) |
Jul
(207) |
Aug
(314) |
Sep
(321) |
Oct
(259) |
Nov
(347) |
Dec
(209) |
2012 |
Jan
(322) |
Feb
(414) |
Mar
(377) |
Apr
(179) |
May
(173) |
Jun
(234) |
Jul
(295) |
Aug
(239) |
Sep
(276) |
Oct
(355) |
Nov
(144) |
Dec
(108) |
2013 |
Jan
(170) |
Feb
(89) |
Mar
(204) |
Apr
(133) |
May
(142) |
Jun
(89) |
Jul
(160) |
Aug
(180) |
Sep
(69) |
Oct
(136) |
Nov
(83) |
Dec
(32) |
2014 |
Jan
(71) |
Feb
(90) |
Mar
(161) |
Apr
(117) |
May
(78) |
Jun
(94) |
Jul
(60) |
Aug
(83) |
Sep
(102) |
Oct
(132) |
Nov
(154) |
Dec
(96) |
2015 |
Jan
(45) |
Feb
(138) |
Mar
(176) |
Apr
(132) |
May
(119) |
Jun
(124) |
Jul
(77) |
Aug
(31) |
Sep
(34) |
Oct
(22) |
Nov
(23) |
Dec
(9) |
2016 |
Jan
(26) |
Feb
(17) |
Mar
(10) |
Apr
(8) |
May
(4) |
Jun
(8) |
Jul
(6) |
Aug
(5) |
Sep
(9) |
Oct
(4) |
Nov
|
Dec
|
2017 |
Jan
(5) |
Feb
(7) |
Mar
(1) |
Apr
(5) |
May
|
Jun
(3) |
Jul
(6) |
Aug
(1) |
Sep
|
Oct
(2) |
Nov
(1) |
Dec
|
2018 |
Jan
|
Feb
|
Mar
|
Apr
(1) |
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
2020 |
Jan
|
Feb
|
Mar
|
Apr
|
May
(1) |
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
2025 |
Jan
(1) |
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
S | M | T | W | T | F | S |
---|---|---|---|---|---|---|
|
|
1
(8) |
2
(4) |
3
(21) |
4
(23) |
5
(3) |
6
|
7
(8) |
8
(2) |
9
|
10
(6) |
11
(4) |
12
(6) |
13
(1) |
14
(9) |
15
(10) |
16
(11) |
17
(3) |
18
(10) |
19
(9) |
20
(2) |
21
(10) |
22
(16) |
23
(8) |
24
(6) |
25
(6) |
26
(3) |
27
(5) |
28
(1) |
29
(14) |
30
(5) |
31
(14) |
|
|
From: David G. <dav...@gm...> - 2006-08-10 22:40:17
|
I have a look like this: for i,_ in enumerate(myRunObject.results[0]): pylab.plot(x, counts[i]) That will plot a bunch of curves and I would like the point style to change as well as the colour (which changes automatically). Is there a nice way to do this? The only idea I had was to make a list of the possible point styles that I like and grab a point style from that list according to the index = mod(i, len(listOfPointStyles)) -- David Grant http://www.davidgrant.ca |
From: Daniel M. <dan...@ya...> - 2006-08-10 20:55:47
|
Werner, Thanks for your work in solving this problem. I'm experiencing the same trouble. I can compile to .exe if I exclude wxmsw26uh_vc.dll, but then when I run my final .exe, I get a error dialog popup and the program won't run. The dialog says "The procedure entry point ?GetZoom@wxPrintPreview@@UBEHXZ could not be located in the dynamic link library wxmsw26uh_vc.dll" Did you experience this problem after compiling with an excluded wxmsw26uh_vc.dll? BTW, I'm working with Python 2.4, the unicode verison of wxPython, and windows XP. With Regards, Daniel McQuillen |
From: Jeff W. <js...@fa...> - 2006-08-10 19:56:55
|
Daniel Poelzleithner wrote: > -----BEGIN PGP SIGNED MESSAGE----- > Hash: SHA1 > > Hi, > > I'm using django and basemap to render tiles i can use to make an > overlay on google maps. I'm using this to generate a topology of an open > mesh network (freifunk) here in leipzig :) > On my local developing machine this works very nice and due heavy > caching of database lookups it doesn't seem slow. My problem is, that > the production machine isn't that fast and has to little memory :( > > Now I'm thinking of a better algorithm to generate the tiles. Currently > they are generated on demand and then saved to disc for later usage. But > the topology is fetched every 10 minutes, so the disc files timeout > relative fast. > > my current algorithm looks like this: > > fetch all node positions and cache them through pickle. > These are rendered as small blue dots on the map (Yes, here I can > optimize to only call plot when the node is in boundries of the tile. > > then all connections for the last topo are fetched and cached. > Now there is a problem, I have to plot all connections into the plot, > because it's not easy to say which lines are actually in the tile. I > haven't looked deep into matplotlib to know how optimized it already > ignores plots which are out of bound. > > Now I'm asking my self: is it possible to make a basemap instance with > some lat/lng borders, plot all stuff in it, and then move the borders to > get a new tile which is next to the last one ? Would such a algorithm be > faster then the current one ? > > If not, there is also the posibility to create one large image at > largest zoomlevel for the most used region and then cut and scale the > image until all tiles are generated. > > You can find the sourcecode at: > http://ff-firmware.quamquam.org/trac/browser/ffsomething/trunk/apps/uptime/topoimg.py > mktopo() is acutally doing the work :) > > kindly regards > Daniel > Daniel: If you know what the lat/lon boundaries of all the tiles are beforehand, you can create Basemap instances for all those tiles once, then save them to pickles and have the app just load those pickles on demand. That way you will avoid the overhead of creating the Basemap instances, which can be significant, especially when higher resolution boundaries are used (since all of those boundaries have to be transformed from geographic to projection coordinates when the instance is created). -Jeff -- Jeffrey S. Whitaker Phone : (303)497-6313 Meteorologist FAX : (303)497-6449 NOAA/OAR/PSD R/PSD1 Email : Jef...@no... 325 Broadway Office : Skaggs Research Cntr 1D-124 Boulder, CO, USA 80303-3328 Web : http://tinyurl.com/5telg |
From: Daniel P. <po...@po...> - 2006-08-10 19:38:11
|
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi, I'm using django and basemap to render tiles i can use to make an overlay on google maps. I'm using this to generate a topology of an open mesh network (freifunk) here in leipzig :) On my local developing machine this works very nice and due heavy caching of database lookups it doesn't seem slow. My problem is, that the production machine isn't that fast and has to little memory :( Now I'm thinking of a better algorithm to generate the tiles. Currently they are generated on demand and then saved to disc for later usage. But the topology is fetched every 10 minutes, so the disc files timeout relative fast. my current algorithm looks like this: fetch all node positions and cache them through pickle. These are rendered as small blue dots on the map (Yes, here I can optimize to only call plot when the node is in boundries of the tile. then all connections for the last topo are fetched and cached. Now there is a problem, I have to plot all connections into the plot, because it's not easy to say which lines are actually in the tile. I haven't looked deep into matplotlib to know how optimized it already ignores plots which are out of bound. Now I'm asking my self: is it possible to make a basemap instance with some lat/lng borders, plot all stuff in it, and then move the borders to get a new tile which is next to the last one ? Would such a algorithm be faster then the current one ? If not, there is also the posibility to create one large image at largest zoomlevel for the most used region and then cut and scale the image until all tiles are generated. You can find the sourcecode at: http://ff-firmware.quamquam.org/trac/browser/ffsomething/trunk/apps/uptime/topoimg.py mktopo() is acutally doing the work :) kindly regards Daniel -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.3 (GNU/Linux) Comment: GnuPT 2.7.2 Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFE24sHy/mkIQp7AD0RApIIAJ9rixzc9B84H/rvkZi5WZHeNmLb0QCgnrzx De40WjI3L2E4/rdOlorGO1M= =6Fq9 -----END PGP SIGNATURE----- |