randomice.net

I’ve just listened to a talk about the DBpedia Relationship Finder and ask myself whether the project Six degrees of Wikipedia is still active. It’s a pitty – it is not (… at least the links server). The algorithm is not the same but it does a good job. Six degrees evaluates the every link in the page and creates an untyped association while DBpedia evaluates only the infoboxes in the sites and gathers also information about the association type (e.g. Johann Sebastian Bach was born in Eisenach and died in Leipzig).

The combination would be more interesting – to have more information – using all links – than DBpedia and to have better information quality – using the info boxes – than Six degrees.

For all those who like the well known Fotomarathon – I’ve put our photo set from yesterday into a flickr album.

Using The Force (which has recently emerged from the Blue Shirt Studio) you now are able to script the forces Luke has already used a long time ago in a galaxy far, far away….

What I have learned today:

“platform-independent” is when two computers behave completely different using the same program.

“to climb” translated into German is “klettern”. The kletterwizard allows you to write nice looking letters in a nice KDE-Wizzard-GUI with a snip of your fingers.

I’ve created a RPM for OpenSuSE 10.2 with another snip of checkinstall‘s fingers.

It is amaising what horrorable error messages g++ is able to generate…

error: could not convert ‘((Parser*)this)->Parser::words. std::map<_Key, _Tp, _Compare, _Alloc>::find [with _Key = std::basic_string<char, std::char_traits<char>, std::allocator<char> >, _Tp = Word*, _Compare = std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, _Alloc = std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Word*> >](((const std::basic_string<char, std::char_traits<char>, std::allocator<char> >&)((const std::basic_string<char, std::char_traits<char>, std::allocator<char> >*)(& sval))))’ to ‘bool’

The code to reproduce it looks like
if (words.find(sval)) {...}
where words is a std::map<std::string, Word*>.

The correct code is:
if (words.find(sval) == words.end()) {...}

… flabbergasting!

You have to watch this realy well made video about web 2.0 made by Mike Wesch. And by the way – the Web-2.0-ish answer made by CoryTheRaven is also very good.