Fred Kersten with Teddy

15 though early morning of 16 April

I began a reading of "Artemis Fowl". RS said it reminds her of the strangely non-sexual, intense relationship between Lucky and Nrsc. I read to "Ciao, fulletta" in Chapter 3 ("Holly") and by the end of page 61 (The Hummingbird Full Moon Rirual) was too much for me. The time was 1922hrs, I dressed, secured S15 and caught the OL for lemon Grove. I spent the evening and early morning (16 April) in the garage of the Blue Bird Street house mostly doing some non-LEPrecon inter net surfing. The most recent meeting of The Honey Bee Writing Club is scheduled for 1500hrs in The MVL. I thought yesterday it was an ACC meeting. Wrong, it is to be The HBW Club. I cannot even begin to gues what the meeting shall accomplish. RS and I are not in the Club. Beth G is taking care of her little girl plus Dsrvl`s three children. We do not expect her to come, unless Charlene agrees to help. Aldous for unknown reasons is with CFS and Speadtle somewhere near Palomar Mountain.

As NR would say...
Now you know what I know
WS Campbell, Inspector
Duty Officer
  • Current Mood

Divide a circle

I've been member of this community for quite time, and now I need some advise.

Question is how do I devide given circle with radius R into N vertical segments with same area?
And by vertical I mean that devising lines should be parralell to the diametr line of that circle. One more thing - N is always even. Simple example is N = 2 : and we have circle divided vertically into two parts of equal area with deametr line.

I need this to speedup my litlle research on mathematical statistics with parallel GPU eval.

Any help In form of formula, or ref to the known algorithm (if it does exists) or some code on almost any programming language would be g8.

Illustration added. Case: R=1 N=6, areas of all segments are equal.
I need to know OX points marked with question marks.
icon by lj user aaaamory, shamebear

Contributing without even knowing

Flash animations on webpages consume a surprisingly large amount of CPU time, especially if you keep many pages open at once. When you think about it, this is a very fast and efficient way to distribute some software onto a lot of computers. Put up a banner on a major news site and you have your code ticking along on thousands of computers within minutes, and with no user interaction.

It's strange that distributed computing has not leapt onto this. Granted, it's a narrow nieche, with the program running only for a few minutes and with a limited size, but there are still plenty of cases where it could work. I've only found This proof of concept of distributed flash computing. This example require some user interaction and fills a whole screen, but there seems to be no reason why it couldn't run as a banner ad.

Why isn't this more widespread?


Dear lazy web,

Do you know if there exists any keystream algorithms where in which, given an input key, you can request from the algorithm something like "give me slot 433"?

Let me clarify,
so a typical keystream you seed with some key and then are able to request sequential bytes. In my particular application I want to encrypt 8Kbytes xored against a keystream but have it so it can be randomly read and written to. So I guess it would be like a key-block cipher or something like that. I don't fancy re-implementing crypto so I'm wondering if such a technique exists out there.
dangiankit ankit dangi

1st Call for Papers: SIGAI Workshop on Emerging Research Trends in AI (ERTAI-2010)

The Special Interest Group on AI (SIGAI) of Computer Society of India (CSI) announces a *workshop* on "Emerging Research Trends in AI". The workshop will be organised and hosted by CDAC Navi Mumbai, India and is meant to encourage quality research in various aspects of AI, among the Indian academia/industry. For details, refer the first call for papers below (in the LJ Cut), and visit and

[Cross-posted at mumbai , ai_research and _scientists_ ]

Collapse )
  • cr4k

Finding the nearest in a sorted set of int to a given int

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){


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!

Big-O for other parameters?

Is Big-O (and Omega and Theta) ever used for other algorithm cost parameters besides time? Like, could I usefully describe different presentation methodologies in terms of bandwidth consumption per n bytes of content as O (n log n) for example? Or is there a separate notation?