March 17, 2010

Portishead, The Rip

(And in my thoughts I have bled, for the riddles I’ve been fed)

March 16, 2010

The cat came back

(best animated short film oscar nomination in 1989)

March 16, 2010

bjornstar:

Piano Improv ChatRoulette

Share the love.

March 14, 2010

klevin:

Eclectic 3.0: The Roads Less Traveled on Vimeo (via Vimeo)

un bel video trovato tempo fa

Stunning time lapse landscape video

March 13, 2010

spaam:

eXistenZ - trailer

March 13, 2010

The Big Lebowsky typography

(your opinion, man)

March 13, 2010

alienato:

ze-violet:

cornerlist:

skiribilla:

Joan Jett - I love rock’n’roll

Questa canzone vanta la cover più incongrua della storia (quella di Britney Spears). Joan Jett invece è rock anche quando mastica la cicca.

albertoragni

Ne esiste anche una versione a colori.

March 13, 2010
The Lady and The Reaper - La Dama y La Muerte, via pensierispettinati
just watch

The Lady and The Reaper - La Dama y La Muerte, via pensierispettinati

just watch

March 13, 2010

el-hereje:

You Are A Pirate (Lazy Town) (via Calebdaguy)

YAR HAR FIDDLE DI DEE

OMG! LOL limewire extended version!

March 11, 2010

aubreymcfato:emilator:

Ok Go - This Too Shall Pass - Rube Goldberg Machine version

Il video gira pure su facebook da qualche giorno. Io l’ho visto da un’amico che aveva letto un buzz di Terry Tao, un tizio che ha vinto la medaglia Fields nel 2006. Il buzz dice così:

Suppose one needs to accomplish n tasks. These tasks can be done in any order, but each require a unit of time to perform. Also, each task i has an independent failure probability p_i, and if any one of the tasks fail, one has to immediately start over and do all the tasks again. What is the optimal strategy to minimise the amount of time required to accomplish all n tasks?

It is intuitively plausible (and a good exercise to rigorously show) that the optimal strategy is to arrange the tasks in decreasing order of failure, i.e. to do the most risky task first. This is a typical example of a rearrangement inequality , of which Chebyshev’s sum inequality is perhaps the most well-known.

This inequality was used when creating the following Rube Goldberg video below (which required 60 takes over 2 days - but most takes failed after just 30 seconds).

Se vi andate a leggere l’originale trovate altri commenti interessanti. Questa è la principale differenza tra un matematico (più in generale, uno scienziato) e uno che non lo è. Uno dice “Wow, ma come funziona?”, l’altro solo “Wow!”. Poi ci sono gli estremi, cioè quelli che riescono a darsi delle risposte corrette, e purtroppo anche quelli che neanche il “Wow!”

March 11, 2010

puscic:kmonk:

Memoirs of a Scanner (Martinibomb Version)

March 10, 2010

emmanuelnegro:

BOOMZILLA: autonomous scavenger bot (Lego Mindstorms)

This robot searches an area for objects, tests to see if they are grabbable, then returns them to base (the light), then continues searching. Made with Lego Mindstorms NXT

Scendo un attimo a raccogliere la mandibola che m’è caduta.

March 9, 2010

viaelle:

Spot delle elezioni rivisto. gromish

March 8, 2010

reifrak:

fuckyeahlost:

From the same YouTuber who brought you the Hurley / Party in the USA clip, comes a new opening sequence for LOST…if it were Baywatch!

All of you. Reblog. This. NOW.

March 8, 2010

imod:

Decervellamento (P.Rossi & V.Capossela)