Busy? That is an understatement!

These days I am so busy that I really do not know what to do first. I need to finish my tasks for IPSC, optimally today's evening. I need to read 3 more scientific articles (5 done so far) and watch several presentations for tomorrow's exam from my networking class. Next Friday we are submitting a paper to CoNEXT. On 13th, I need to submit the final version of my candidacy exam proposal. On 20th, there is my candidacy exam for which I need to prepare (and beta-test) my presentation. One day after, I am submitting my networking class miniproject report. Finally, on 6th June I need to submit my project report. Did I forgot something? Oh well, there will be Java class exam (I do not know yet) for which I will need to judge a hundred sheets of paper handwritten in French, probably with the deadline roughly 10 days.

So, can you beat me? Do you have more (or more tighter) deadlines?

Rejected!

My paper to HotSDN about why rules should not rule was rejected. Certainly I am not in so bad mood as after the rejection from my first love. But that is maybe because I was prepared for paper rejections -- it is certainly not easy to get into a conference/workshop. So should I divorce with the idea? Maybe. It seems that I am playing on somebody else's ground and maybe there is not enough space. Anyway, I will let it be for now -- I have a lot of other things to do.

EPFL Vivapoly's RLC run

Le jeudi j'ai participé à Vivapoly course à pied. La longueur était 3.5km, assez court. Mon plan était de terminer dans 16 minutes. Mais ce n'était pas possible. J'ai terminé et 17 minutes et 30 secondes -- exactement 5 minutes par kilomètre.

Codejam fail

Comme d'habitude, mes competences en programmation ne sont pas satisfaisants. J'ai fini sur 806e place et je n'ai pas avancer à 3e ronde. Mais j'ai gagné un tee-shirt :-)

Vous povuvez voir les problèmes et résultats.

P=NP?

Based on the http://www.win.tue.nl/~gwoegi/P-versus-NP.htm I would like to take a new approach on deciding P=NP. Indeed, after sketching through the list, it seems that P=NP does not have a definite answer and its validity depends on some random variable.
Thus, the P=NP holds approximately 50% of the time.

Want to re-check my findings?

> wget 'http://www.win.tue.nl/~gwoegi/P-versus-NP.htm'
> NO=`cat P-versus-NP.htm | grep '\[Not equal\]' | wc -l`
> YES=`cat P-versus-NP.htm | grep '\[Equal\]' | wc -l`
> echo "100*$YES/($YES+$NO)" | bc -l

The result is that P=NP for approximately 51.7% of the papers, therefore under the assumption of uniform distribution we may conclude that P=NP holds roughly half of the times you try to solve it :-)

Google translate

Google translate vous donne parfois des résultats étranges. Mais cette traduction est beaucoup trop.

Jour férié? Pas pour moi.

Aujourd'hui est un jour férié en Suisse. Mais je n'ai pas eu le temps. Je prépare des problèmes de IPSC tout le jour. IPSC est une internationale compétition de programmation et je suis l'un des organisateurs. Vous êtes invités à participer le Samedi 2er juillet.