[kwlug disc.] ICFP Programming Contest

[Brad Smith]

I'm still trying to set up a team for this contest. Is there anyone
out there who would like to learn some amazing new technology while
competing for honor and glory? Maybe we could solve the problem in
Erlang, the concurrent programming language, and link together all of
the computers we can get our hands on into a skunkworks supercomputer.
Wouldn't that be cool?

On 5/9/07, Richard Weait <richard at weait.com> wrote:
> On 5/9/07, Brad Smith <bnsmith at gmail.com> wrote:
> > As I mentioned during the last meeting, I'd like to set up a team for
> > the upcoming ICFP Programming Contest.
>
> Here's another programming challenge.  I saw a presentation by the
> 2006 winner and it was fascinating.
> DFRWS 2007 Forensics Challenge
> http://www.dfrws.org/2007/challenge/index.shtml
>
> The DFRWS 2007 Challenge is about data carving, which is a file
> recovery technique that is frequently used during digital
> investigations. Files are "carved" from the unallocated space using
> file type-specific information, such as footers, headers, and internal
> structures.
>
> The previous DFRWS 2006 Challenge focused on carving basic file types
> in basic scenarios. The result was the development of new tools and
> techniques to carve files using more internal structure than only the
> header and footer values. This year, DFRWS expands on that challenge
> by introducing more file types and more complex fragmentation
> scenarios. The goal of this challenge is to design and develop
> automated file carving algorithms that have high true positive and low
> false positive rates.
>
> Submissions are due by July 9, 2007.
> _______________________________________________
> KWLUG-Disc mailing list
> KWLUG-Disc at kwlug.org
> http://listserv.kwlug.org/mailman/listinfo/kwlug-disc
>