Monthly Archives: January, 2007

No comment

John quotes from Joel Stein’s lovely rant in the LA Times. Here’s another bit:

Huge portions of my e-mails come from people who haven’t even read my article. They’re just assuming, based on a headline or an excerpt on a blog, that I’m unpatriotic or irreligious or lecherous. Sure, they happen to be right, but it would have been nice if they had clicked on my column and moved me up on that “most-read articles” list.

A lot of e-mail screeds argue that, in return for the privilege of broadcasting my opinion, I have the responsibility to listen to you. I don’t. No more than you have a responsibility to read me. I’m not an elected servant. I’m an arrogant, solipsistic, attention-needy freak who pretends to have an opinion about everything. I don’t have time to listen to you. I barely have time to listen to me.

Part of the problem is that no etiquette has yet been established for the hyper-interactive world. And I, born before MySpace and e-mail, don’t feel comfortable getting a letter and not answering it. And then, if I do, suddenly, we’re pen pals, with all those pen pal responsibilities.

Full piece here. (Free registration needed)

Possibly-related posts:

How to find happiness, and achieve justice

I’ve written before about some of the great talks available online from the TED conference. Here are a couple I’ve just watched, and would definitely recommend:

  • Dan Gilbert talks about what really makes us happy, and the research that shows how bad we are at predicting what really makes us happy.
  • Oxford Statistician Peter Donnelly explores the common mistakes humans make in interpreting statistics, and the devastating impact these errors can have on the outcome of criminal trials.

Both good stuff. And the wonderful thing about having a Mac Mini sitting under my TV as a PVR is that I can use iTunes to subscribe to the RSS feeds of things like this and watch them from the comfort of my sofa…

Possibly-related posts:

Quicksort

Paul Bissex has a lovely example of the power of Python – a Quicksort implementation in 99 bytes.

>>> q=lambda s:s if len(s)<2 else q([x for x in s[1:]if x<s [0]])+[s[0]]+q([x for x in s[1:]if x>=s[0]])
>>> print q([9,7,5,3,1,8,6,4,2])
[1, 2, 3, 4, 5, 6, 7, 8, 9]
>>>

If you unwrap it to make it a bit more readable, it’s doing this:

q=lambda s:
   s if len(s)<2 
   else 
      q( [ x for x in s[1:] if x<s[0] ] )
     +[ s[0] ]
     +q( [ x for x in s[1:] if x>=s[0] ] )

Very nice! Needs Python 2.5. If you don’t know the Quicksort algorithm, here’s how it works.

Possibly-related posts:

  • [untitled] From “Import This: the Tenth International Python Conference”: "Tim [Berners-Lee]...
  • Strong Typing vs. Strong Testing [Original Link] Bruce Eckel on why Python programs, even fairly...
  • Groovy [Original Link] Groovy is a scripting language for Java, and...
  • Good indentations I saw and liked this Python / Google T-shirt at...

In which we serve…

2007 is starting in an interesting way for me – with jury service.

I can’t, of course, say anything to anybody about the cases I may be involved with, but I can still communicate with the outside world thanks to the 3G connection on my phone, at least while I’m in the jury lounge waiting to be called.

I wonder if this is the first blog entry to be posted from within Cambridge Crown Court?

Possibly-related posts:

Feeds

RSS  RSS feed

Categories

January 2007
M T W T F S S
1234567
891011121314
15161718192021
22232425262728
293031  

© Copyright Quentin Stafford-Fraser