CUPE 3903 loses the public relations war

Toronto Star editorial strongly criticizing the CUPE 3903 strike: http://www.thestar.com/comment/article/532272

An article in NOW mildly critical of the strike: http://www.nowtoronto.com/daily/story.cfm?content=165896

Although the Star is center-left, it's perhaps not so surprising that they would devote editorial space to criticizing CUPE. But it's astonishing that NOW -- known for some fairly hard-core leftist views -- would make anything other than positive comments about the strike.

A perfect metaphor for every internet comment board in the world

(via Gawker)

TSE breaks Yahoo's stock ticker, again

Seems Yahoo's stock ticker can't handle moves of greater than 1000 points. Here's a screenshot from this morning (the market opened at around 9065 and, as you can see, was up about 1600 points at the time this was taken). Hooray for volatility!

TSE breaks Yahoo's stock ticker

This morning's 1000-point drop on the Toronto Stock Exchange was so bad, it broke Yahoo's stock ticker (note, the open was around 10,800 points):

Science: Gross and fascinating. (Grosscinating?)

In only the fifth recorded battle between pythons and alligators, we discover the following:

1. "Pythons versus alligators" is a question of legitimate academic interest; and

2. Yes, it is possible for a snake to swallow something so big, that its stomach explodes.

Nano-Net Liveblog: Sep 16

9:25 AM: A fascinating plenary lecture by Sylvain Martel on nanorobots capable of communicating with the outside world. He's arguing in favor of combining biological "nanodevices" with electronic intelligence. Some interesting ideas on "motors" formed out of bacterial flagella, using magnetotaxis (following an external magnetic field with an onboard magnetite sensor). He argues that this is a communication channel, since one device can influence its neighbor's magnetic field. Magnetic fields are detectable with external equipment. However, devices may need to cooperate in order to communicate with the outside.

2:09 PM: Neil Gershenfeld's plenary has just begun. "Computer science is one of the worst things ever to happen to computing or science." His problem seems to be with abstraction. I guess the massive global information technological infrastructure isn't good enough for Professor Gershenfeld. At this point I'm inclined to stop listening, as I usually am when somebody makes a ridiculous statement to attract attention. He then contradicts himself by referring to a result of computer science to show a linear-time sort.

2:32 PM: Claim: Locally enforcing constraints leads to global convergence ... ? This seems to be what he is saying, while arguing that asynchronous behavior is irrelevant. It's an incredible claim as it implies that his model ends race conditions forever. He's trying to demonstrate examples of this, but his diagrams are tiny and incomprehensible.

2:53 PM: He starts making more sense talking about problem relaxation to message-passing algorithms. This I can buy: you can relax hard problems to easier problems and solve them much more easily.

3:01 PM: In the end it was an occasionally intriguing but more often frustrating talk. Lots of huge claims and grandiose statements but little clear promise that it will lead to a computing paradigm that will be any more successful than what exists today.

Nano-Net Liveblog: Sep 15

11:22 AM: Interesting keynote by Tatsuya Suda on molecular communication. His group is mainly concerned with the mechanics of communication, and the experimental results are very interesting. A couple of good follow-on presentations by Satoshi Hiyama and Frank Walsh on implementational aspects. However, audience questions are concerned with the lack of obvious applications ... perhaps some applications would focus the research.

2:34 PM: Nice paper by Cooper about random walks on random graphs -- could be a routing solution in cell-scale networks with molecular motors.

3:05 PM: Interesting paper by Bogdan et al. on random walks, with the application of on-chip stochastic routing. Looks like a practical application of the previous paper on random graphs, but in a more regular structure and with a view to practical applications -- also, there are possible modeling extensions to diffusion problems for molecular communication.