Meetup - 2011 August

[Shantanu Kumar]

Hey folks,

Who all are up for a meetup tomorrow, Saturday, 06 Aug? Time 3:00pm
and venue Mr Beans, Koramangala - please confirm.

http://bangalore.burrp.com/listing/mrbeans_koramangala_bangalore_fast-food-shops-dessert-shops-ice-cream-parlours/1825020227

If you have alternative time/venue in mind, please suggest before it's
late.

Regards,
Shantanu

[isaac praveen]

Shantanu,

Sounds good.
Not sure if others are joining as well. Let us hold the thought till
others confirm.

-
isaac

--
isaac
http://icylisper.in

[isaac praveen]

We have not heard from others yet.

I was wondering if we can have the meet next week with some agenda:

* Shantanu would give a tutorial on writing lein plugins
* jark 0.4 (nrepl OCaml client) release and demo
* Exploring Graph libraries in clojure (Borneo, Jiraph)

Other ideas welcome.

So next Saturday at 3pm.
-
isaac

--
isaac
http://icylisper.in

[Sunil S Nandihalli]

Hey icy

 I think that would be better. we should have it next week. I think I have a decent solution to the following problem. I can present it if people are interested.

Sunil.

BitVector Genealogy

The BitVectors are an ancient and immortal race of 10,000, each with a 10,000 bit genome. The race evolved from a single individual by the following process: 9,999 times a BitVector chosen at random from amongst the population was cloned using an error-prone process that considers each bit independently, and flips it with 20% probability. Write a program to guess the reproductive history of BitVectors from their genetic material. The randomly-ordered file bitvectors-genes.data.gzcontains a 10,000 bit line for each individual. Your program's output should be, for each input line, the 0-based line number of that individual's parent, or -1 if it is the progenitor. Balance performance against probability of mistakes as you see fit. To help you test your program, here is a much smaller 500 x 500 input dataset:bitvectors-genes.data.small.gz, along with its solution file:bitvectors-parents.data.small.

Sunil.

[abhi]

Sounds good. And generally we need to revitalize the meetups. It has become nothing more than a social event as of now.

[abhi]

Sounds interesting sunil. Looking forward to it.

On Aug 6, 2011 1:08 PM, "Sunil S Nandihalli" <sunil.na...@gmail.com> wrote:
> Hey icy
> I think that would be better. we should have it next week. I think I have a
> decent solution to the following problem. I can present it if people are
> interested.
> Sunil.
>

> *
> *
>
> *BitVector Genealogy*

>
>
> The BitVectors are an ancient and immortal race of 10,000, each with a
> 10,000 bit genome. The race evolved from a single individual by the
> following process: 9,999 times a BitVector chosen at random from amongst the
> population was cloned using an error-prone process that considers each
> bit independently, and flips it with 20% probability.
>
>
> Write a program to guess the reproductive history of BitVectors from their
> genetic material. The randomly-ordered file

> bitvectors-genes.data.gz<http://www.itasoftware.com/careers/work-at-ita/PuzzleFiles/bitvectors-genes.data.gz>contains

> a 10,000 bit line for each individual. Your program's output should be, for
> each input line, the 0-based line number of that individual's parent, or -1
> if it is the progenitor. Balance performance against probability of mistakes
> as you see fit.
>
>
> To help you test your program, here is a much smaller 500 x 500 input

> dataset:bitvectors-genes.data.small.gz<http://www.itasoftware.com/careers/work-at-ita/PuzzleFiles/bitvectors-genes.data.small.gz>,
> along with its solution
> file:bitvectors-parents.data.small<http://www.itasoftware.com/careers/work-at-ita/PuzzleFiles/bitvectors-parents.data.small.txt>