St. Lawrence University
Mathematics, Computer Science, and Statistics Department
FOS 2005
To view Complete Itinerary CLICK HERE
To view photos, click on the names
Matthew Norton Here we are interested in exploring further the Wilson confidence intervals(CI). In particular the aim is to develop Wilson intervals for random variables that have variances which are a quadratic function of the mean of the random variable, θ = E[X]. Example of this type of random variable include the Poisson, Binomial, Beta-binomial. Having derived a Wilson CI for the generic case, say V[X] = a + bθ +cθ2, then we will compare how this new interval performs relative to standard CI approaches using Monte Carlo simulation. Particular interest will be paid to more commonly used distributions such as the Poisson and Gamma. |
Petya Madzharova
|
Nicole Lopez 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. |
Hilary Hartson 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. |
Raluca Dragusanu Power Point Presentation: Graph Theory studies the proprieties of graphs – sets of objects (vertices) connected by links (edges). Among its numerous applications, graph theory has proved to be a powerful tool in understanding the structure of complex networks, of both nature and human design. A large number of complex networks, from a social network to the human neural network, the U.S power grid, or the Internet, have the same underlying structure, which mathematicians call a “small world” graph. The name evidences a phenomenon prevalent in our social network and famous as “six degrees of separation.” A small world graph exhibits a high degree of clustering and a short characteristic path length between vertices. Before discovering the “small world” structure, mathematicians believed that high clustering is associated with ordered networks while short global separation is common for random graphs. As an intermediary between order and randomness, which was before thought to be nonexistent, the “small world graph” becomes even more fascinating. My presentation will first examine how mathematicians were able to formalize and explain phenomena sociologists were observing in our social network. It will proceed by introducing several graph theory concepts and employing them in understanding properties of graphs. The final part of the presentation will look at the most current research in network theory which is mostly concerned with dynamic networks – assuming growth in the number of nodes and preferential attachment. The presentation will end with one of the most fascinating applications of the recent research results, which is the structure of the Internet and the World Wide Web. |
Justin Keller Avariste Galois gave a proof that there was no general solution by radicals to polynomial equations of degree five or higher. To do so, he established what is today known as the Galois correspondence, allowing him to apply methods from group theory to problems involving polynomial fields. I will give a brief overview of Galois\' proof, in terms of the polynomials he worked with (polynomoials over subfields of the complex field). I will also show how the theory can be used to produce an insoluble quintic. |
Ben Carr A graph is defined to be a collection of points (vertices) and lines (edges) between vertices. A cycle in a graph is a path that returns to where it started without repeating any vertices other than the last one. In 1995 the Hungarian mathematicians Paul Erdos and Andras Gyarfas suggested that every graph with at least three edges connected to each vertex must contain a cycle with length a power of 2. I will discuss progress made on this conjecture, with a focus on a class of graphs known as cubic bipartite graphs. I will also include a result on the number of edges required to guarantee a cycle of length 4 in any graph. |
St. Lawrence University Homepage /--/ Academics Page |
Created May 13, 2005
Peg Barkley
Math, CS &
Statistics Dept.