archive for the ‘geek’ category


a tale of linguine (and startups)

Thursday, June 5th, 2008

roasted pumpkin pasta

i stumbled upon a brilliant comparison between cooking pasta and launching a startup a while ago, and it’s been on my mind since then. here it is:

How do you cook linguine? Yesterday, I made linguine. I cooked the pasta while my wife made a delicious lemon basil sauce. After about eight minutes, I tasted the linguine to see if it was done. It wasn’t, so I cooked it for a couple more minutes. Now some people don’t taste pasta to see when it is done. Some people throw it all around the kitchen to see if it sticks on the walls. That seems odd to me. The point of cooking pasta is to make it edible, not sticky.

Attitudes about starting companies, especially web companies, are not unlike methods of cooking linguine. Some people think that you “throw something out there” and see if it sticks. If it sticks, it’s done and you’ve cooked up a startup success. Figuratively speaking, there are a lot of awful-tasking starchy strands of uncooked linguine sticking all over the web.

The best way to get a startup right is to cook it for a reasonable amount of time and then taste it to see if it’s done.

All metaphors break down if you push them too far. So I’m not going to keep stirring the pot here. Startups that make news and make people happy are cooked to taste. The founders are personally interested in the product. They don’t throw the idea out to see if it sticks (i.e. see if millions of people happen to think it’s done). Founders of successful startups know that if it tastes good, people are going to like it.

Here’s a lesson learned. Entrepreneurs need to learn how to cook.

these days of instant startups, it seems to be all about “sticking”, and much less about doing something remarkable, or being the best at something.

sigh. fatigue 2.0, anyone?

moving and shaking

Saturday, March 8th, 2008

meiadeleite is switching to a new server over the weekend. “things might get a little shaky for a couple of days”, my systems administrator tells me. (i forgive him because he’s cute).

see you all on the other side!

postcrossing v2

Saturday, February 16th, 2008

so finally, after 1 year or so on the works (and the meter getting close to the “1 million postcards received” mark), there’s a fresh new face on postcrossing.com, and a ton of new features.

(congratulations!, maybe now we can enjoy a bit of free time? :P )

the only upgrade this mac is getting…

Thursday, January 17th, 2008

… is more stickers! :D

v2.0

click on the image for an overload of notes on flickr. oh, and do you have stickers to trade? let me know! :)

(previous version, a couple of months ago.)

SnūzNLūz

Sunday, January 13th, 2008


snuznluz (to be read “snooze and lose”) is an alarm clock that connects via WiFi to your online bank account, and donates YOUR real money to an organization you HATE when you decide to snooze.

the people at thinkgeek have finally found out a way to make you want to wake up on time. with the snuznluz, everytime you press snooze when the alarm goes off, you donate a minimum of $10 to a charity you hate.

the clock is connected via wifi (or cable) and comes with an embedded configuration browser utility, that lets you set your bank details and to which charity you’d like to donate.

for example they say, if you’re a butcher you might want to donate to PETA, and vice-versa.

i’m more of a morning person, so snoozing doesn’t happen all that often… but how efficient would this be to you?

seen on bb-blog. shame on me that i’m so late on this april fool’s joke… but it would be such a great item! :)

poor postman pat!

Thursday, January 10th, 2008

did you know the most common name for a city in the world is “oktjabrskij”? or that there are 11 cities named “springfield” in the usa, and another 11 named “clinton”? :)

here’s a ranking of the top-20 most frequent names of cities, freshly squeezed from postcrossing’s database (might not be totally accurate):

City name      Country     Total of cities    
Oktjabrskij Russia 23
Springfield USA 11
Clinton USA 11
Pervomajskij Russia 11
Neustadt Germany 9
Madison USA 8
Hidalgo Mexico 8
Komsomolskij Russia 8
Washington USA 8
Lebanon USA 8
Shāhpur India 8
Dmytrivka Ukraine 7
Kamenka Russia 7
Auburn USA 7
Burlington USA 7
Greenville USA 7
Viişoara Romania 7
Áyios Dimítrios Greece 7
Troickoje Russia 7
Farmington USA 7

impressive redundancy if you ask me, but then again, except maybe a couple of countries, all the others on this list are pretty big… perhaps they just ran out of imagination?

anyway, there you go: one more reason never to forget the zip code! 8-)

mr. cook, we have a problem.

Saturday, January 5th, 2008

when i failed to join the air force and had to choose another career, i picked informatics, journalism and astronomy, all in the same application form - that’s how clueless i was towards my future. in the end, informatics won, and 7 years later, here i am, still clueless but with an engineering degree! :)
every now and then, on the most improbable situations, the informatics/mathematics part comes in handy, like for instance (and ironically) when i have to fly.

here’s the formal definition of a common problem, known as packing. the next time your mom tells you to stop procrastinating on your packing duties, you can properly explain her how hard that is - and hopefully delay the task a little longer!

  • you have n kinds of items, 1 through n. each item j has a value (sentimental or of importance) pj and a weight wj. the maximum weight one can carry in the suitcase is c, and according to british airways, c=23 kgs.
  • the number of each kind of item in the suitcase, xj, is restricted to zero or one (for simplicity purposes).
  • mathematically the problem can be formulated as:
    maximize \sum_{j=1}^n p_j x_j.
    subject to \sum_{j=1}^n w_j x_j \le c, \quad \quad x_j = 0\;\mbox{or}\;1, \quad j=1,\dots,n.

this is called a 0-1-knapsack problem, which is known to be a np-complete problem. np stands for non-deterministic polynomial time… and that translates into “very hard & time-consuming problem”.

another np-complete problem is called bin packing, which consists of neatly placing different volumes in as less bins as possible. no time-efficient solution has been discovered for these problems.

so there you go. combine the two and you have packing! :D

(and now, back to the suitcases…)

ps - images from wikipedia, more on the subject here.
ps2 - who was stephen cook?



SparkStats

SparkStats Legend