F.r.I.e.N.d.S.

You don't have to be a dog lover to appreciate the moving, powerful short film by Atsushi Sanada - "Say, Marimo."

Beautifully shot.

Tweetup :: Tweetup on Improving Collective Intelligence (via @dhempe, @dorait, @santoshp) #twtvite

Posted using ShareThis

If you really, really want to see things heat up in a room full of scientists, there are only two words one need utter (and, surprise, they're not "I'm naked")...

Global warming

The worst part is, unlike most other things I complain about (e.g., high-fructose corn syrup being bad for you; the need for stem-cell research), my fellow educated scientists are actually divided about this topic.

And, in other news, this has to be the fifth time in as many weeks I've heard an MD or PhD actually refer to Wikipedia to define a term or settle an argument.

When I was a kid, I never dreamed grown-ups would pull out hand-held devices and use them to instantly access a bottomless font of information and opinion from satellites up in spa--


We need to listen to Star Trek nerds more.

Hi guys,

I'm in the middle of writing a connector to some accounting software and I've been implementing a lazy loading list of proxies because I'm dealing with huge lists of items which load slowly (even the item id s load slowly).

That's not important to the question I am asking though, basically, I want an algorithm which finds either the given search int in my sorted set (of indexes) or the nearest int contained in the list (it doesn't matter, but we can say that the algorithm has a preference for lower numbers if 2 values are equally near)

The essence of the problem is outlined here:


import java.util.TreeSet;

public class Search {
static TreeSet sorted = new TreeSet();

public static void main(String...args){

sorted.add(1);
sorted.add(3);
sorted.add(5);
sorted.add(7);
sorted.add(10);

findNearest(2); // return 1
findNearest(8); // return 7
findNearest(10); // return 10
}

private static Integer findNearest(Integer search) {
return null; //TODO halp pls!
}
}


Thanks for any advice in advance!