What's new: A friend of mine and I are working on a replacement for the overaged and iconsistent VHDL (virtual hardware description language).
A draft of our documentation can be found here: http://blog.the-leviathan.ch/wp-content/uploads/2014/10/Towards-Type-Safety-in-asynchronous-Hardware-Description.pdf
Still gotta fix the issue with small perimeters... And the temperature still variates too much.
Calibration progesses (from left to right)
My todays lunch, from my own balcony. Blue potatoes!
Since the GPLed dating platform code out there is crappy PHP work and not suited to help geeks meet each other either, I started designing a new matching algorithm in course of the rewrite of geekdarling.ch as a Ruby application.
Basically the idea is quite easy. First I travel the bipartite tree and cut it into subtrees matching the basic requirement of matching sexual orientation and this way saving CPU power by checking for bidirectional preferences.
Second step: I will then value additional attributes based on a two way connection and average the weight of every forth and back arrow.
For the example on the upper graphics that would mean: R=(((6+1)/2)+((3+4)/2)+0)/3=2.3
Another practical example: Let's say I choose under "preferred editor" select that it's absolutely important to me that my partner like vim too, then anyone who likes vim as well will be given 100 additional points when being weighted in our matching algorithm, and so all the vim using geek girls are listed first (followed by the emacs users ;-)).
I'm not quite done yet, but that's where I'm going
Please gimme feedback.
The following branch contains my attempts to develop support for the intel atom z2760 clovertrail platform.