Spring 2013

The Use of Survival Analysis Techniques Among Highly Censored Data Sets
Shelby Cummings '14, Wittenberg University

Creating Art with Math
Ernie Heyder '14, Wittenberg University

Automated Identification of Chord Progression in Classical Music Abstract
Peiqian Li '14, Wittenberg University

​Unicorns and Design Patterns
Brittany Rickards '14, Wittenberg University

April 22, 2013 Room 319 Science, 4:10 pm.

 

Measuring Instead of Speculating
Dan Saks, M.S.E. President of Saks & Associates
February 25, 2013 Room 319 Science, 4:10 pm.

 C is the most widely-used language for programming embedded  systems.  It offers various ways to represent and manipulate hardware devices.  C++ offers everything that C does, plus additional facilities that provide higher levels of abstraction.  Many C programmers assert that using C++ for hardware access is too costly, yet they can offer no measurements to back that claim.  This session explains how to actually measure such claims.  It also presents results from some measurements that show, at least for some processors, that some widely-used C techniques are actually slower than straightforward C++ techniques.

 

 

How well do students estimate their exam scores?  AND
What can and can't you learn from `error bars'?
Dr. Doug Andrews, Wittenberg University
February 11, 2013 Room 319 Science, 4:10 pm.

When students estimate their exam scores, do they tend to over- or underestimate?  To what extent is the estimation bias related to the class year and sex of the students, or to the students’ actual exam scores?  Does the estimation bias change over a sequence of exams?  Do trends persist from class to class?

and...

Why do people use error bars?  What are the more common types of error bars, and how are they constructed?  What can legitimately be learned from error bars, and what are some of the common misuses and misinterpretations?  Why don’t statisticians ever use the term “error bars”?

 

Completeness properties and topological games
Dr. Lynne Yengulalp, University of Dayton
January 28, 2013 Room 319 Science, 4:10 pm.

The word "complete" has different meanings in different areas of mathematics, and there are even several notions of completeness within topology. Certain completeness properties can be formulated in terms of topological games. In topological games, two players alternate choosing certain subsets of a topological space according to some rules. The winner of a game is determined by whether the intersection of the chosen sets is empty or not. In this talk, I will discuss topological games and how strategies for players of topological games give completeness properties of topological spaces.

 

Public-Key Cryptography: Applications
Dr. Steve Bogaerts, Wittenberg University
January 14, 2013 Room 319 Science, 4:10 pm.

Public-key cryptography requires the use of both a public and a private key.  For many applications, this arrangement makes secure communication more convenient than with symmetric cryptosystems.  Furthermore, the mathematics of the public-key cryptosystem RSA allows application not only in message confidentiality but also in integrity.  While there are no known fundamental security holes in RSA, there is much research in mathematical and implementation attacks.  This presentation will consider these topics in detail.

Fall 2012

Artificial Intelligence for Combinatorial Games
Colin Claytong & Tyler Radley, Wittenberg University
December 3, 2012 Room 319 Science, 4:10 pm.

Combinatorial Games are two-player games with a state in which the players take turns changing the game state in defined ways or moves to achieve a defined winning condition. In addition, in these games all of the information of both players position is known and every state and move combination can be represented by a game tree. We chose a set of five combinatorial games and added multiple difficulties of artificial intelligence for each game. To create artificial intelligences that play each of the games well, we used both self-designed algorithms and the minimax implementation of adversarial search on the game tree. We will describe our focus on primarily identifying an optimal method for each artificial intelligence to play each game and on the process of software development.

Exploitation and Prevention of Buffer Overflow in C
Ernie Heyder & Brandon Nesiba Wittenberg University
December 3, 2012 Room 319 Science, 4:10 pm.

Buffer overflow is an anomaly where a program, while writing data to a buffer, overruns the buffer's boundary and overwrites adjacent memory. First there is an analysis of how the program uses memory, such as the stack. Next we explore the dangers of using unsafe programming practices in the programming language C. This includes using unsafe functions and improper use of safe functions.  Our discussion concludes with safe programming practices for the common programmer.

 

Fair Dictatorships:  A Fundamental Voting Paradox
Dr. Kyle Burke, Wittenberg University
November 19, 2012 Room 319 Science, 4:10 pm.

In 1950, Kenneth Arrow proved an amazing paradox in social choice:  any voting system that follows some logical “fairness” requirements must be a dictatorship!  We will discuss these fairness constraints, then prove both that a dictator exists as well as how to find that person.  Potential problems with the fairness requirements will be covered, including a discussion of alternative voting systems.  If time permits, a two-player voting game will be presented.

 

Cybersecurity and the Center for Cyberspace Research
Dr. Rusty Baldwin, Associate Professor of Computer Engineering and Director of the Research Center for Cyberspace Research
November 5, 2012 Room 319 Science, 4:10 pm.

Dr. Baldwin will give an overview of the Center for Cyberspace Research at the Air Force Institute of Technology. He will describe the context of global cybersecurity today, including current research of the center in offensive and defensive cyberwarfare. He will also discuss the graduate curriculum in cyber operations at the center, and the CyberCorp fellowship.

 

Building a Naive Bayes Classifier
Eric Wilson, Ph.D., Manta Media
October 1, 2012 Room 319 Science, 4:10 pm.

Our world is full of text that needs to be classified:  emails, comments, tweets, reviews, and more.  We don't have time to do it manually, and it isn't obvious how to automate the process. I will introduce a simple and powerful probabilistic machine learning technique -- a Naive Bayes Classifier -- and discuss some practical details involved in implementing such a classifier.  Along the way we will learn a few things about the interesting field of Natural Language Processing.

 

The ENIAC's 1949 Determination of Pi
Brian Shelburne, Wittenberg University
September 17, 2012 Room 319 Science, 4:10 pm.

In January 1950, George W. Reitwiesner published “An ENIAC Determination of π and e to more than 2000 Decimal Places” in Mathematical Tables and Other Aides to Computation describing the first use of a computer, the ENIAC, to calculate the decimal expansion of π. Because the history of π stretches back over thousands of years, the use of the ENIAC to determine π is an important historical and technological milestone.  The ENIAC was not designed to perform this type of calculation; it could only store 200 decimal digits while the determination of e and π required manipulating numbers 2000+ digits long.  Starting with Reitwiesner’s description of the calculation, the known architecture of the ENIAC, how it was programmed, and the mathematics used, we examine why the calculation was undertaken, how it had to be done, and what was subsequently learned.

 

Spring 2012

Ohio Weather: Too Fickel to Predict, or is it?
Arianna Hamilton, Wittenberg University 

Mancala: A Java Rendition
Andre Harvey & Nathan Rutter, Wittenberg University

Parallelizing Alpha-Beta Pruning in the Context of Connect-4
Jordan Hildebrandt, Deanna Fink, & Patrick Copeland, Wittenberg University
April 30, 2012 Room 319 Science, 4:10 pm.

 

Survival Analysis of Liver Transplantation in Pediatric Patients
Shelby Cummings, Wittenberg University 

The Distribution of Prime Numbers
Trang Ha, Wittenberg University

Creating an Intuitive User Interface
Will Herrmann, Wittenberg University
April 16, 2012 Room 319 Science, 4:10 pm.

 

Predicting Change In Our World
Moez Ben-Azzouz, Wittenberg University
April 2, 2012 Room 319 Science, 4:10 pm.

Have you ever wondered how mathematics can be leveraged to study, analyze, and predict change in our world?  The field of Dynamical systems is one major branch of mathematics research that aims to do so.  In this talk I will introduce the audience to dynamical systems and provide some examples and applications.  Further, I will provide a brief history of how the field evolved and discuss some of the intriguing behaviors of certain types of dynamical systems.

 

Modeling with Brownian Motion
Dr. Flavia Sancier-Barbosa, Visiting Assistant Professor of Mathematics, Wittenberg University
Feb. 27, 2012 Room 319 Science, 4:10 pm

As a physical process, Brownian Motion has been the subject of much investigation since its first observations in the 19th century.  As a mathematical model (also called Wiener process or "mathematical Brownian Motion"), it has been widely used to describe real-world problems that exhibit random behavior.  The presentation will give a brief historical overview of this interesting process and will describe the mathematical Brownian Motion as a modeling tool, giving its use in finance as an example.

 

Developing Teaching Tools for Implementing Parallel Processing into Research
Zach Hedges, Computational Science Minor, Wittenberg University

Refining the Parallel Prefix Sum Algorithm
Ernie Heyder, Math and Computer Science Major

Improving Roommate Assignment
Sven Isaacson, Math major.
Feb. 13, 2012 Room 319 Science, 4:10 pm

 

Fall 2011

 

Cybersecurity and the Center for Cyberspace Resaerch 
Dr. Rusty Baldwin, Associate Professor of Computer Engineering and Direcor of the Research Center for Cyberspace Research, AFIT.
Dec. 5, 2011 Room 319 Science, 4:10 pm

Dr. Baldwin will give an overview of the Center for Cyberspace Resarch at the Air Force Institute of Technology.  He will describe the context of global cybersecurity today, including current research of the center in offensive and defensive cyberwarfare.  He will also discuss the graduate curriculum in cyber operations at the center, and the CyberCorp fellowship. 

 

 

MIS-Calculations: You just can't count on your graphing calculator. 
Dr. Al Stickney, Wittenberg University
Nov. 14, 2011 Room 319 Science, 4:10 pm

Be prepared to be amazed.  The enitre talk consists of examples where a numerical graphing calculator gets it wrong.  I'll be using a TI-84, but the difficulties I'll be demonstrating are universal.  Most of the examples are at the level or precalculus, but some use a bit of calculus.  I'll begin the talk by disproving something you learned in elementary school (or middle school?)  

 

Neighboring Nim: a Nim Game on Graphs 
Dr. Kyle Burke, Wittenberg University
Oct. 10, 2011 Room 319 Science, 4:10 pm

Neighboring Nim is a new variant of NimG in which Nim heaps are embedded in a graph.  In this talk, the game will be described as well as its relationship to different forms of Vertex Geography.  A reduction from Directed Geography to Neighboring Nim will be presented, along with the computational ramifications of this transformation.

 

Recreational Mathematics
Dr. Bill Higgins, Wittenberg University
Sept 26, 2011 Room 319 Science, 4:10 pm

Recreational Mathematics must sound like an oxymoron to most people, yet there is a long history of doing mathematics just for fun.  Rubik's cube, Sudoku and minesweeper are modern examples of puzzles with a mathematical flavor. We'll talk a bit about the history of recreational mathematics but will spend most of our time tackling a few problems - just for fun.  We hope you will share at least one of the problems presented with your friends to show them how much you enjoy math.

 

Every Number is the Sum of Four Squares 
Marshall Zarecky, Wittenberg University class of '09
Sept 12, 2011 Room 319 Science, 4:10 pm

Number theory has historically been the one field of mathematics where problems are easy to state and notoriously difficult to solve.Problems like the Goldbach conjecture, Collatz conjecture, Beal's Conjecture, and Waring's Problem remain important subjects of research today. We will begin with an overview of a few interesting problems in this field, and finish with a proof of the Lagrange Four-Square theorem which states that every positive integer is the sum of at most four square numbers. The background required is a high school understanding of prime factors and divisibility.

 

The Architecture of the ENIAC
Dr. Brian Shelburne, Wittenberg University
Aug 29, 2011 Room 319 Science, 4:10 pm

Announced to the public in February 1946, able to perform 5000 additions per second, the room sized ENIAC (Electronic Numerical Integrator and Computer) at 30 tons and 18,000 vacuum tubes was the world’s first electronic computer.  Yet despite its size and speed, it could only store twenty 10 digit decimal numbers and programs had to be literally wired into it.  In this talk we’ll examine the architecture of the ENIAC in more detail and show how it was actually programmed to perform a calculation.

Spring 2011

Computational Alchemy: Determining the Relative Binding Affinty of Galactose to Glucose for the Glucose/ Galactose Binding Protein
Alaina Engdahl, Wittenberg University
March 21, 2011 Room 319 Science, 4:10 pm

Ever since medieval times, the concept of alchemy--the transformation of one chemical to another --has garnered much attention.  However, while no one has ever physically transformed a base metal into gold, anything is possible on a computer.  By applying the free energy perturbation method to molecular dynamics simulations, the sugar galactose was alchemically transformed to glucose and the associated energy change was determined.  This energy value was in turn used to determine how strong the two sugars bind to the glucose/galactose binding protein.

Application of Artificial Neural Networks to Predict Matriculation Probability
Trang Ha, Wittenberg University
March 21, 2011 Room 319 Science, 4:10 pm

Using de-identified data on financial aid awards of Wittenberg University’s students provided by Financial Aid Office, we build a program to determine the probability of matriculation rate based on the implementation of artificial neural network. Inputs for the network are some chosen variables in student's data and output is the predicted of matriculation of that student. The system is written in Mathematica 7 and gets improved by running on cluster. 

Black-Scholes for Dummies: How to evaluate your options.
Dang Mai, Wittenberg University
March 21, 2011 Room 319 Science, 4:10 pm

In the financial world, option has long been a major instrument to hedge against changes in security prices. The Black-Scholes model, articulated by Fischer Black and Myron Scholes, is the classic model for evaluating option prices and is widely used for European-style options. This presentation looks at the basic concept of options, how the Black-Scholes model is derived, and looks at the scalability of different programming languages for a Monte-Carlo simulation of the Black-Scholes model.

Derranged Mathematics
Dr. Adam Parker, Wittenberg University
February 7, 2011 Room 319 Science, 4:10 pm

Imagine you have a deck of cards and you shuffle them as many times as you wish.  What's the liklihood no card remains in the position that it started in?    The answer we find in this talk may surprise you!  No background will be assumed, so we'll develp all the necessary terminology to tanslate this question into a mathematical formula and solve it during the talk.  Bring a deck of cards if you have one.

 

Recursion Everywhere
Dr. Steve Bogaerts, Wittenberg University
January 24, 2011 Room 319 Science, 4:10 pm

Recursion is repetition through self-reference--- defining something in terms of itself.  This makes for some fun and useful ideas on a variety of topics.  We'll consider ordinary things like mountains, Dutch tea, and grammar, along with math /computer science things like factorials, sequences, and the Y Combinator.  For more information about this talk, please see the abstract.

 

Fall 2010

Free Rides: An Introduction to Stream Ciphers and Algebraic Cryptanalysis
Alex Griffith, Wittenberg University
Nov 29, 2010, Room 320 Science, 4:10 pm

Stream ciphers play a critical role in a variety of electronic communications.  In this talk I'll demonstrate how stream ciphers work and how they can be attacked using algebra and logic.  I'll focus on two lightweight stream ciphers that have very similar structures and differing levels of security.  Furthermore, these two particular ciphers are used in the transportation industry, so I'll show you how to use math to score a free ride.

 

Gene Set Consistency: An Evaluation of Different Gene Set Sources
Alex Sitarik, Wittenberg University
Nov 29, 2010, Room 320 Science, 4:10 pm

A significant issue in the analysis of genetic data is the number of statistical tests being conducted, each of which has a probability of being in error. When many tests are being conducted, it becomes difficult to identify true associations between an organism’s genes and its phenotypes. Another significant limitation of traditional approaches to the analysis of genetic data is that implicated genes may not tell a clear biological story. One approach to more clearly identify true associations is the use of “gene set” or “pathway” analysis, whereby sets of genes rather than individual genes are analyzed. This not only prevents multiple testing penalties, but also yields meaningful statistical results based on biologically related sets.  Researchers use a variety of different biological repositories in order to obtain these sets of genes, but little work has been done to evaluate the efficiency of these sources.  This project seeks to assess and compare the effectiveness of these sources of sets to ensure accurate genotype/phenotype association.

 

The Likelihood of Timelines - with Magnets!
Jordan Hildebrandt, Wittenberg University
Nov 29, 2010, Room 320 Science, 4:10 pm

The Earth's magnetic field has regularly reversed polarity, and these reversals are recorded in the oceanic rock record.  However, data sets are sparse, uncombined, and have high degrees of uncertainty.  This fun presentation shows how one can use statistical likelihood to quantify uncertainties for geologic timescales.

 

Statistical Consulting: Helping the World with Data-Based Insight, One Client at a Time
Dr. Doug Andrews, Wittenberg University
Nov 8, 2010, Room 320 Science, 4:10 pm

Statistical consulting is the art and science of using data to help other people solve their problems in the real world.  I'll give an overview of the stat consulting process, the typical environments in which stat consultants work, they typical qualificaiton and salaries, and some of the ethics involved.  I'll also illustrate what stat consultants do, using examples from industry, academia, health care, law enforcement, and non-profits - all from my own work, as well as work done with Witt students.

 

The Mathematics of Fairness
Dr. Bill Higgins, Wittenberg University
Oct 25, 2010, Room 320 Science, 4:10 pm

The settlement of an estate among heirs, division of property following a divorce, subdivision of land among competing claimants and dividing a cake or candy among children are all problems of fair division.  In this talk, we'll discuss how to define fairness and present some "fair division schemes" developed by Polish mathematician Hugo Steinhaus and others to tackle such problems.

 

The Cyber Corp Graduate Fellowship
Dr. Rusty Baldwin, Air Force Institute of Technology
Oct 11, 2010, Room 320 Science, 4:00 pm

Dr. Baldwin will be speaking about the Cyber Corp Graduate Fellowships at the Air Force Institute of Technology.

 

Multivariable Parametric Cost Analysis for Space-Based Telescopes
Courtnay Dollinger, Wittenberg University
Sept 27, 2010, Room 320 Science, 4:00 pm

This project analyzes data from over 1000 sources and focuses on data from over thirty different space-based telescopes in order to determine a cost estimating relationship. Due to the increased availability of cost data from recent space-telescope construction, we have been able to begin testing for a comprehensive cost model of space telescopes. By separating the variables that effect cost, we advance the goal to better understand the cost drivers of space telescopes. Advanced mathematical techniques have the ability to improve the accuracy of cost models and the potential to help society make informed decisions about proposed scientific projects.

Parellization of the Protein Database Search Program MassMatrix Through the Use of OpenMP ?
Zach Hedges, Wittenberg University
Sept 27, 2010, Room 320 Science, 4:00 pm

In today’s medical research field, it is important to be able to gather accurate results from diagnostic procedures in as little time as possible.  Luckily, with the advent of multi-core computers and API’s such as OpenMP, computationally-expensive analyses can be run in parallel, drastically reducing runtime.  The goal of this project was to parallelize and accelerate the peptide database search algorithm, MassMatrix, utilizing OpenMP.  In order to achieve this, the code was profiled and several time-consuming calculations were rewritten for parallelization.  This technique proved, however, to increase run-time due to increased overhead.  Further strategies for parallelization are currently being researched

Do I know you?  Cryptography and Authentication Protocols
Deanna Fink, Wittenberg University
Sept 27, 2010, Room 320 Science, 4:00 pm

In the age of technology, people rely more and more on computers and the internet to accomplish tasks.  The military is no exception to this.  But as the use of technology increases, so must the ability to protect information.  Cryptography is one of the most common ways of doing this and it is being improved every day to make defenses stronger.  Problems surrounding cryptography include balancing effectiveness with costs (not necessarily in terms of money).  There is no way yet to create perfect cryptography techniques, but research is being done to try to keep up with or hopefully stay ahead of those trying to invade the privacy of internet users.

P vs NP: Solved?
Dr. Kyle Burke, Wittenberg University
Sept 13, 2010, Room 320 Science, 4:00 pm

The P -versus - NP problem, one of the seven famed "Millenium Problems" , is perhaps the greatest unsolved problem in Computer Science today.  Or is it?  At the end of this summer, a potential solution made a lot of news, even in mainstream media.  This talk will shed some light on what P vs NP means, as well as comments on the recent action.

A Mathematical Potpourri, Conundrumbs, Puzzles, Tricks and Other Trivia!
Dr. Brian Shelburne, Wittenberg University
August 30, 2010, Room 320 Science, 4:00 pm

Spring 2009

 CyberCorp Graduate Fellowships at the Air Force Institute of Technology 
Dr. Rusty Baldwin, Associate Director of the Center for Cyberspace Research 
February 4, 2009

Software Engineering for a Web-Based Educational Image Repository 
Aaron Holloway ('09) and Jonathan Wantz ('09), Senior Seminar Project 
January 22, 2009

Fall 2008

Bringing Characters to Life: An Independent Study in 3D Modeling and Animation 
Laura Barnard ('08), Independent Study 
December 15, 2008

Virtual Education: Identifying and Creating Content 
Molly Dannaher ('10), Summer Research 
December 4, 2008

VIPER: Virtual Imaging for Pathology, Education, and Research 
Molly Tingley ('10), Summer Research 
December 4, 2008

Computational Methods to Determine Solvent Effects on the Reaction of Phenol and Bicarbonate 
Janelle Mahowald ('10), Summer Research 
November 20, 2008

Analysis of Chemotherapy Drugs Genetic Effects on Pancreatic cancer vs. the effect of the progression of the disease 
Rebecca Atkins ('10), Summer Research 
November 13, 2008

Hydrogen Abstraction-Induced Ring Opening In Thiazolo[5,4-d]thiazole, Benzthiazole, and Thiazole 
Adeline Brym ('10), Summer Research 
November 13, 2008

Improvement of the Trap Assisted Tunneling Model Solution for Leakage Currents in Heterostructure Field Effect Transistors 
Hannah Scherger ('09), Summer Research 
October 29, 2008

Describing a Combinatorics Problem with a System of Polynomial Equations 
Marshall Zarecky ('09), Summer Research 
October 29, 2008

Programmers and Truthiness 
Dan Saks, President of Saks & Associates 
October 23,2008

3-D Modeling Using Autodesk Maya 2008 
Laura Linden Barnard ('08), Summer Research 
October 15, 2008

Reflections on a Semester in Budapest 
Alyssa Armstrong ('09), Cultural Exchange 
October 15, 2008

Heat Transfer in Polymers 
Melissa Cederquvist ('10), Summer Research 
September 30, 2008

Reaction Functions in the US and Chinese Contexts 
Nam Vu ('10), Summer Research 
September 30, 2008

Applications of Computing Across Science and Industry 
Dave Strenski, Applications Engineer for Cray Inc. 
September 22, 2008

What I Did On My Summer Vacation: Statistics Graduate Student Research 
Dr. Elizabeth Stasny, Graduate Studies Chair in the Department of Statistics at Ohio State University 
September 17, 2008

Spring 2008

Game Development for the PC and Xbox360 using XNA 
Nick Kovach ('08), Independent Study 
April 24, 2008

Cyberspace Research and Internships 
Dr. Rusty Baldwin, Associate Director for the Air Force Institute of Technology 
March 13, 2008

Hydrogen Abstraction-Induced Ring Opening in Thiazoles 
Tim Verrilli ('08), Summer Research 
February 28, 2008

The Role of Molecular Dynamics Simulations in the Search for Advanced Energy Materials 
Joe Fritchman ('08), Summer Research 
February 28, 2008

Semi-Empirical Molecular Dynamics Study of Polyene Isomerization Through Protonation 
Steven Koppenhafer ('09), Summer Research 
February 19, 2008

Investigating Micellization Using Monte Carlo Simulations 
Thao Nguyen ('08), Summer Research 
February 19, 2008

Ice Cubes to Stock Options: Free Boundary Problems Across the Disciplines 
John Davenport, Adjunct Instructor of Mathematics 
January 23, 2008

Fall 2007

Mathematica for Computational Science 
Jim Noyes, Emeritus Professor of Computer Science 
december 18, 2007

Computational Modeling of Advanced Energy Materials 
Adam Jara ('08), Summer Research 
December 6, 2007

Predicting Error in HTS Data Using LeadScope Software 
David Mowrey ('08), Summer Research 
December 6, 2007

Scientific Visualization 
Laura Linden ('08), Summer Research 
November 8, 2007

Preliminary Sequencing and Analysis of a Genomic DNA Amplification Product from a Population of Wall Lizards (Podarcis muralis) Cincinati, OH 
Alex Silvis ('08), Summer Research 
October 29, 2007

Virtual Microscopy: A Tool to Cancer Research 
Fadi Michael ('08), Summer Research 
October 29, 2007

Between a Rook and a Hard Place: A Study of Column Strict Rook Placements of the q-File Polynomial 
Alyssa Armstrong ('09), Summer Research 
September 27, 2007

Spring 2007

Virtual Reidemeister Moves 
Emily List ('07), Senior Honors Thesis 
April 18, 2007

More than Meets the Eye: An Invitation to Moduli Spaces 
Adam Parker, Assistant Professor of Mathematics 
March 29, 2007

Artificial Intelligence: What and Why 
Steven Bogaert, Candidate for Computer Science Faculty Position 
February 27, 2007

Fall 2006

Characterization of C60S Isomers: A Theoretical Study 
Adam Jara ('08), Summer Research 
November 15, 2006

Ab initio Study of Polysulfides Sn, Their Anions Sn-, and Their Dianions Sn-2 
Joe Fritchman ('08), Summer Research 
November 15, 2006

Infinite Trees 
Jennifer Brown, Kenyon College 
November 3, 2006

Representing Fractals on Parallel Systems 
Indraroop Roy Mohanti ('08), Summer Research 
October 12, 2006

A Computational Study: The Formation of a Useful Thiazole Monomer 
Tim Verrilli ('08), Summer Research 
October 12, 2006

Stereo Visualization and its Application for Fun and Viewing Scientific Data 
Dr. Mark Turner, AVETeC/University of Cincinnati 
September 28, 2006

On Polynomial Knots 
Emily List ('07), Summer Research 
September 13, 2006