smart stuff

10 of 13 articles ⇒

Hbase freelancer wanted		04 May 09
		[print link all ]
Apx needs an experienced hbase developer to help us to define the cluster size, equipement to use, etc. for a particular project. This would be done remotely with the possibility for a long term contract, or permanent position. If interested, drop me a short summary of your hbase experience (please no word docs, txt or pdf only) at m94asr at gmail dot com.

smaz: small strings encryption library		06 Apr 09
		[print link all ]
github.com/antirez/smaz/tree/master github.com/antirez/smaz/blob/45c64a774fa62ed9d8cd37b4157cf63be8c6137d/README

Cool hypertable freelance projects or permanent jobs		01 Apr 09
		[print link all ]
If you are a hypertable expert and want a true challenge .. onsite (DFW, TX, USA) or via remote contact me at armin at personifi dot com. Looking forward to build a great team to kick ass!

Task boundaries using a classifier		26 Nov 08
		[print link all ]
Also worth reading: glinden.blogspot.com/2008/11/finding-task-boundaries-in-search-logs.html

Near duplicate detection		26 Nov 08
		[print link all ]
Clever. Recommended reading. glinden.blogspot.com/2008/08/clever-method-of-near-duplicate.html

Wikipedia saturated		11 Aug 08
		[print link all ]
oc-co.org/?p=124

Six Degrees of Wikipedia

28 May 08

[print link all ]

Ever heard of the game Six Degrees of Kevin Bacon? If you haven’t, it works like this: Every actor gets a Kevin Bacon number. Kevin Bacon has a Kevin Bacon number of 0, actors who were in a movie with Kevin Bacon get a Kevin Bacon number of 1, actors who were in a movie with someone who has a Kevin Bacon number 1 get a 2, and so on (Everybody always gets the smallest number possible, so if you were in a film with two people, one with a 4 and one with a 6, your Kevin Bacon number would be 5).

The same idea could apply to the articles Wikipedia. Instead of taking "in the same film" as the relation, you can take "is linked to by". We’ll call the "Kevin Bacon number" from one article to another the "distance" between them. It’s then possible to work out the "closeness" of an article in Wikipedia as its average distance to any other article. I wanted to find the centre of wikipedia, that is, the article that is closest to all other articles (has minimum closeness).

www.netsoc.tcd.ie/~mu/wiki

R Graph Gallery

20 Jun 06

[print link all ]

I came across this useful posting by Gregor Gorjanc in the r-help ML.

R graphical manuals (this is awesome page as there are all help pages of all packages on CRAN and probably even more and all graphics examples are displayed! - more than 8000 images!)

bg9.imslab.co.jp/Rhelp/

This is a very nice addition to already existing R graph and movies galleries

R Graph Gallery

addictedtor.free.fr/graphiques/

R Movies Gallery

addictedtor.free.fr/movies/

Estraier 1.2.26

06 Feb 05

[print link all ]

Estraier is a full-text search system for personal use. Its principal purpose is to realize a full-text search system for a Web site. It functions similarly to Google, but for a personal Web site or sites in an intranet. It has fast searching, conspicuous results, relational document search, the ability to handle Japanese text, and support for handling a large number of documents. Installation is easy.

Changes: A plug-in to show spelling alternation of the search phrase was added. A bug in the search server was fixed

estraier.sf.net

10x10: 100 Words and Pictures that Define the Time

04 Dec 04

[print link all ]

A big thx to Sven C. Koehler for the link.

Every hour, 10x10 scans the RSS feeds of several leading international news sources, and performs an elaborate process of weighted linguistic analysis on the text contained in their top news stories. After this process, conclusions are automatically drawn about the hour’s most important words. The top 100 words are chosen, along with 100 corresponding images, culled from the source news stories. At the end of each day, month, and year, 10x10 looks back through its archives to conclude the top 100 words for the given time period. In this way, a constantly evolving record of our world is formed, based on prominent world events, without any human input.

link

10 of 13 articles ⇒

• Syndicate: full/short