
The discipline of computer science is concerned with the design, development, and characterization of algorithms and their realization as computer programs. However, at Allegheny College there is more to computer science than writing programs. We believe that majoring in computer science promotes the skills normally associated with a liberal arts education -- the abilities to generate and analyze ideas, to think logically, and to communicate with clarity and precision. Consequently, our graduates are prepared for much more than positions as programmers. Some of them have pursued careers as college professors, neurologists, consultants, graphic designers, data managers, Web developers, educational technologists, and presidents of corporations. Inside these Web pages you will learn more about the programs and courses we offer, the opportunities available to our students, and some of their achievements.
Announcements:
DNA Sequencing: Algorithms for DNA Replication
Presentedt by: Computer Science Faculty Candidate, Dr. Christopher Taylor
Date: Friday, April 4, 2008
Time: 4:00 pm Alden Hall
Location: Room 101
Lecture Abstract:
We are entering an exciting era of genomic research that is being driven by constantly evolving DNA sequencing technologies. In just the last decade we have witnessed the completion of the human genome sequence (Human Genome Project 2001), nearly 1000 bacterial genomes, and over 165 eukaryotic species. The advent of DNA microarrays has significantly decreased the cost of many resequencing applications and a number of emerging ultra high-throughput sequencing technologies promise to move us ever closer to the much sought-after $1,000 genome.
This talk will present recent work using DNA microarray technology that investigates human DNA replication timing. The focus will be on algorithms developed to classify, visualize, and simulate the process of DNA replication and its timing. Due to the sheer size of the full human genome, efficiency of our algorithms are a paramount concern in terms of both time-complexity and memory requirements.
The Computational challenges involved with anticipated ultra high-throughout sequencing technologies provide an ideal realm for future research which can build on the same algorithmic techniques we use to analyze and process microarray data.
SIMPLE LANGUAGAES FOR COMPLEX ROBOTS
Presentedt by: Computer Science Faculty Candidate, Prof. Matthew Jadud
Date: Monday, March 24, 2008
Time: 4:00 pm Alden Hall
Location: Room 101
Lecture Abstract:
Today, turning off most computers involves pushing a button called "Start." Programming languages are every bit as unusable---it is rarely the case that simple things can be expressed with simple programs. As we move towards increasingly complex robotic applications, the complexity of the languages we use to program them will get in our way of writing robust, maintainable, and reliable software. In this talk, I will discuss the role of human-centered design and parallel-safe languages in the pursuit of my ultimate design goal of a robotic shortstop, one of the most active and challenging positions on a baseball diamond.
A COMPUTATIONAL ENVIRONMENT FOR LANGUAGE ACQUISITION : KING ALFRED
Presented by: Computer Science Faculty Candidate, Prof. Lisa Michaud
Date: Friday, March 14, 2008
Time: 3:00 pm Alden Hall
Location: Room 101
Lecture Abstract:
Students can study Anglo-Saxon (Old) English with the help of King Alfred, a tutoring environment that applies the benefits of a computational environment to the age-old task of translating phrases from an ancient language. King Alfred efficiently models the feature-rich source language and tracks the user’s successes and failures in order to provide feedback, guiding self-reflection and further study. Ongoing work explores how King Alfred can effectively give feedback to specific translation errors through a pedagogically-motivated automated analysis.
Refreshments Served
