October 24th, 2011
John Donaldson, Emma Conner, Zach Levine, and Joaquim Ruales
This past weekend 3 Oberlin students competed as a team in the 2011 ACM Regional Programming Contest. They were competing among 122 teams from 60 colleges and universities throughout western Pennsylvania, Ohio, Michigan, eastern Ontario, and Indiana. Team O(Bees) took 10th out of 46 teams at the Youngstown State University site.
[nggallery id=28]
October 12th, 2011
Vim Rocks!
The CSMC proudly presents…
No experience necessary, learn the basics of Vim, hands-on!
Thursday, October 13 at 9pm in King 135
October 4th, 2011
Monday October 10, King 221 4:30 p.m.
An operating system is the software that provides the connection between application software and the underlying hardware. As such, its development is challenging and its correctness is critical. Linux is an open source operating system, developed by programmers around the world, who have a widely varying degree of expertise. These factors have implied that the introduction of bugs is continuous, and indeed seems inevitable. Adequate tools are thus needed to help programmers find these bugs in their code. Such tools furthermore need to be suited to the expertise and working style of the programmers that should use them.
In recent work, we have developed the program matching and transformation tool Coccinelle. Coccinelle makes it possible to match and transform code according to specifications that looks like the processed code itself. Concretely, Coccinelle provides the notion of a “semantic patch”, which is like the patch (diff) familiar to Linux developers, but is more general, allowing a single specification to match code found all over the Linux
kernel. In this talk, we will introduce Coccinelle and present a number of bugs recently found in Linux code by using this tool.
Joint work with Gilles Muller, INRIA
Sponsored by the Computer Science Department, College Leading Edge Fund, and the Alumni Office ASOC Program
September 12th, 2011
Want to be as cool as these guys? The CSMC will be hosting Unix Night on Thursday, September 15th, from 6 to 8 p.m. in the downstairs computer lab (King 135). There will be a scavenger hunt to get familiar with common Unix commands, plus brief introductions to the Emacs and Vim editors and some tips to make working in the shell easier and more productive. Pizza (vegetarian and vegan options) will be provided. Feel free to contact isaac.mccreery@oberlin.edu with questions. We hope to see you there!
Ken Thompson and Dennis Ritchie - Inventors of Unix!!!
September 12th, 2011
The Computer Science department is looking to fill a one-semester, non-continuing faculty position for Spring 2012. Applicants can specialize in any area of CS and may be ABD.
For dates and application details, please see the official college job posting: Visiting Assistant Professor of Computer Science
September 7th, 2011
Do you wanna be 1337?
Wann learn new skillz and show them off in the glory of combat?
Then check out the Competitive Computer Programming ExCo at the ExCo fair!
If you miss the ExCo fair, you can still sign up online here!
No need to be competitive, just show up and learn how its done!
Class time to be determined by attendees.August 22nd, 2011
Join us for a Welcome Back Ice Cream Social.
Wed September 7, 4:30pm
Rice Courtyard (rainsite – King 2nd Floor Common Area)
Ice Cream!
May 19th, 2011
In Honor of the 2011 Computer Science Graduates
join us on Sunday, May 29, 2:00-4:00 p.m. in King 223 for refreshments
to congratulate our Computer Science Major Graduates.
Brendan Chambers, Michael Craig, Kriti Godey, Sean Hanson, Jason Kimmel, Sam Lawton, Nitun Poddar, Thomas Ramfjord, Garrett Robinson, Kiron Roy, Daniel Spencer.
We wish all of them a bright and prosperous future!
May 3rd, 2011
Prof. David Liben-Nowell, Carleton College
David Liben-Nowell, Associate Professor of Carleton College
” You Can Pick Your (Best) Friends”
FRIDAY May 6 4:30 King 221
In this talk, he will present some results from a recent collaboration with evolutionary psychologists and computer scientists on questions of how people choose friends and prioritize among those friends. Specifically, he will describe analysis of large samples of MySpace profiles containing “Top Friends” lists, in which an individual selects a small subset of his or her friends and organizes them into a ranked order of that individual’s choice. Different classes of behavioral hypotheses give rise to very different graph-theoretic structures in the best-friend network, and we can use these ranking data to provide supporting evidence for some of these theories.