|St. Lawrence University||Mathematiacs, Computer Science, and Statistics|
Hudson River Undergraduate
April 30, 2005
Williams College - Williamstown , MA
Other photo links Presentation Photos / Group & Dinner Photos
To view abstracts, click on the student name listed or scroll down the page.
"On a Conjecture of Erdos"
|ABSTRACT: The Erdos-Gyarfas conjecture, made in 1995, is that every graph with minimum degree greater than or equal to three has a cycle with length a power of 2. I will discuss progress made on this conjecture. I am considering the special case of cubic bipartite graphs and hoping to show that all such graphs contain cycles with length a power of 2|
"Language-Based Hardware Design Using SystemC"
ABSTRACT: Abstract: SystemC is a C++ library for modeling hardware. SystemC supports an incremental and iterative design process. The design of the hardware components starts with modeling standard, combinational and sequential components which are then tested. The next step involves combining these components to build smaller subsystems. Thus, the process of combining subsystems to build larger subsystems continues followed by respective quality assurance tests until we create the hardware system we set out to model. The reason behind the research was to investigate hardware simulation and modeling at the undergraduate-level using SystemC. The research concludes that SystemC is quite capable of designing hardware as well as other systems. The model that was generated at the culmination of the research was a subset of a MIPS microprocessor.
Raluca E. Dragusanu
"Get Connected: Understanding Reality
Through Small World Graphs"
ABSTRACT: How can it be possible that there are six people or less separating you from any other human being in our 6 billion people world? How can the brain, the Internet, the social network we are part of, the U.S power grid and an ecosystem have anything in common? Graph theory offers the answers to all these questions. It seems that, whether natural or man-made, complex networks exhibit the same underlying structure, which can be represented through what mathematicians now call a “small world” graph. It is obvious that complex networks are not perfectly ordered. But they are neither random. The small world graph captures the middle reality between order and randomness. My talk will look at the properties of the small world graph using relevant concrete examples and will explain why understanding the structure of complex networks could be the key to understanding how the world works.
ABSTRACT: In this talk we discuss Wald`s theory of sequential testing as it applies to testing of proportions. Sequential testing differs from traditional hypothesis testing in that it allows for three possible conclusions to be drawn after a subset of samples have been drawn. These three are: reject the null hypothesis, accept the null hypothesis, and continue testing. We derive the appropriate tests for comparing a proportion against a one-sided alternative and we present Monte Carlo simulation results of these tests.
Nicole L. Lopez
"Analysis of Biometric Authentication"
ABSTRACT: Biometric authentication has recently received a good deal of attention as a way to bind an individual and their information, often secure information. Until recently there has been little publicly available data to assess the performance of such biometric authentication devices. Recently, the National Institute for Standards and Technology released the Biometric Score Set Release 1 (BSSR1). This data includes matching scores for both those who are enrolled in the system and those who are not. Here we present an analysis of the BSSR1 to assess the change in performance of these device over time. In particular we are interested in whether or not the error rates for these devices change over time and whether or those differences are significant.
Created: May 26, 2005
Math, Computer Science
& Statistics Department