The Q-Club, which is short for "Quantitative Club," is the departmental student organization, boasting over fifty members. Students speak on their research or share their internship and summer program experiences. Scheduled events take place approximately every other Tuesday 11:50 - 12:30pm Moved to Valentine 103 unless otherwise noted with pizza and beverages being served.
Faculty members occasionally give talks as well, on topics ranging from "Math and Horror" to "An Outrageously Brief History of Mathematics."
If you know of students interested in giving a talk during the semester, please contact Jessica Chapman or Dan Look.
Additional activities planned by the club include Pi Day (held on 3/14) and Euler's Birthday Party, photo gallery.
First Q-Club meeting for the semester
9/9/2014 Dan Look, Associate Professor of Mathematics
"Can authorship of a contested piece be determined by statistics?"
Abstract: No, it can't. However, statistics can provide supporting evidence. Stylometry is the study and quantification of writing style, often using statistical methods. These techniques can be used in conjunction with more conventional analyses to suggest authorship of a contested work. Most notably, this was used to solidify the authorship attribution for the anonymous Federalist Papers and the 15th book of Oz. We'll discuss some past examples and some of the techniques involved.
This is the last Q-Club meeting for the semsester.
4/29/2014 Johnn Balderston
"Foxes, Hipsters, and The Internet Meme: A First-World Social Epidemic"
Abstract: The Internet Meme: a fast spreading, sometimes “viral,” internet fad that is quite possibly the fastest mutating disease known to mankind. The Meme virus threatens the health and abdominal circumference of individuals everywhere. The multiple strains of the virus and its speedy mutation rate have left the grand majority of the human race perpetually infected. For this reason, we create a mathematical SIR model to demonstrate the spread of memes, where individuals can either be Susceptible (S), Addicted (A), or Rehabilitated (R). Our SAR model incorporates social impacts on the spread of this dreaded plague, including personal preference, hipster effects, boredom, and meme mutation. Observing the internet meme in this manner allows for the relevant understanding of social diseases, in which interactions within the population can result in a form of vaccination or devaccination, unseen in typical SIR modeling. Our hope is that our SARs will lend insight into combating the spread of this debilitating disease.
4/22/2014 Dan Mulcahey will provide an introduction to cluster analysis and discuss an application in Economics
"Identifying Groups of Similarly Performing Mutual Funds Using Cluster Analysis"
Abstract: Cluster analysis is an explanatory tool used to identify groups within data. After giving an overview of some clustering algorithms, we use recent percent returns to find clusters of similarly performing mutual funds and demonstrate how Word Clouds can be used to conveniently summarize fund descriptions and quickly identify the similarities among funds in each cluster, and the differences among funds between clusters.
4/8/2014 Brian Kane and Anton Stoychev will be talking about driving a remote control car with Raspberry Pi!
"Using Your Smartphone to Control a RC Car"
Abstract: Computers have seen innumerable advancements over the years, the most noticeable of which being a dramatic increase in power, somewhat paradoxically paired with an equally dramatic reduction in size. The Raspberry Pi mini-computer allows us to hold the power of a desktop quite literally in the palm of our hands. The power, size, and affordability of the Raspberry Pi make it ideal for use in small electronics projects with a “DIY” flavor. Using a bit of engineering, we were able to take advantage of the Pi’s power and size to directly attach it to a RC car. This allowed us to have easy access to the car’s motor and steering functions. We then used Python and the Android Software Development Kit (SDK) to implement a client/server architecture through which we remotely controlled the car using an Android smartphone.
3/25/2014 Eric Budge and Steve Petramale
"On Counting Triangles"
Abstract: Algorithms for counting triangles in massive graphs have been studied intensely. This fundamental tool has been utilized in network analysis for the computation of metrics including clustering coefficients and transitivity ratios. The degree sequence S of a graph G is a list of the degrees of the vertices in G in non-increasing order. A particular degree sequence S is called graphic if and only if a graph G can be created using S. This work focuses on graphs with degree sequences containing a unique triple, a sequence which has three repeated terms and all other terms distinct. Polynomial expressions are given which count the number of triangles in realizations of such graphic unique triple sequences.
3/4/2014 Spencer Timerman
"Teaching AI to Work Together"
Abstract: : Teamwork is hard. It's difficult for humans and its difficult for computers. In this talk we will address computer learning, particularly in the case of a team of learners. Our problem was a simple one: five locations, ten players, with the object of the game to have more of your players at a majority of the locations. We found that certain reward mechanisms worked more effectively than others to teach the learners , and that our agents could not learn against opponents that acted with a certain degree of randomness.
2/18/2014 Jack Holby
"Variations on the Euclidean Steiner Tree Problem"
Abstract: Imagine you are trying to connect a set of cities to a highway. What is the best way to do this? Further, imagine a set of cities wish to build a highway between them. Where is the best place to build it? The Euclidean Steiner Tree Problem (ESTP) attempts to create a minimal spanning network of a set of points by allowing the introduction of new points, called Steiner points. We'll discuss a variation on this classic problem by introducing a single “Steiner line” in addition to the Steiner points, whose weight is not counted in the resulting network. For small sets, we have arrived at a complete geometric solution. We'll also discuss heuristic algorithms for solving this variation on larger sets. We believe that in general, this problem is NP-hard.
2/4/2014 Sam Vandervelde, Associate Professor of Mathematics
The World's Hardest Elementary Domino Tiling Problem
Abstract: : Tiling problems have long delighted recreational mathematicians due to their potential for elementary formulation yet unexpected difficulty and elegance. Join Dr. V for a dizzying survey (literally---have you ever seen a Prezi presentation?) of classic and less well-known tiling puzzles. We'll try out some of these puzzles together, then conclude by examining more closely one such problem that appeared on the 2009 USA Math Olympiad, successfully solved by only a single student in the entire country.
Fall Semester 2013
12/6/2013 Jack Holby and Dan Mulcahey will be speaking about their graph theory project from last Fall. (Last Q club for the semester.)
Steiner Trees: An Introduction and Algorithms
Abstract: We will talk about how Steiner Trees came about (in order to connect points in the plane using the minimum distance possible) and how these particular points can be used in real life applications such as road systems, electric circuits, and other civil engineering projects.
11/15/2013 Robert (Monty) Montgomery will be speaking about his graph theory project from last Fall.
Optimizing Kidney Paired Donation: Optimal and Equitable Matchings in Bipartite Graphs
Abstract: If a donor is not a good match for a kidney transplant recipient, the donor/recipient pair can be combined with other pairs to find a sequence of pairings that is more effective. The group of donor/recipient pairs, with information on how strong a match each donor is to each recipient, forms a weighted bipartite graph. The Hungarian method allows us to find an optimal matching for such a graph.
However, the outcome which is optimal for the group might not be the most equitable for the individual patients involved. We examine several modifications to the Hungarian method which consider a balance between the optimal score for the group and the most uniformly equitable score for the individuals. We examine the strengths and weaknesses of these modifications within the current climate of kidney allocation in the United States. Finally, we expand these findings to other fields where these revised algorithms may also hold particular significance.
11/8/2013 Lara Clemens will be speaking on her summer research experience as part of Research in Industry Projects for Students in Hong Kong.
Robust Low-rank Matrix Factorization
Abstract: Recent advances in signal processing have resulted in new methods for solving the low-rank matrix completion problem (e.g Netflix Prize). Such problems arise in applications involving extremely large data sets that feature redundancy. These data sets can often be modeled by low-rank matrices. As the size of the data grows, solving these problems may become infeasible due to storage requirements. Algorithms which yield factorizations of the low-rank target matrix have been developed and have been proven to be optimal in certain scenarios. However, this method assumes that the matrix to be recovered is not corrupted and satisfies incoherency, or that the observations satisfy the RIP property. In our project, we extend current algorithms to be robust to corruption by sparse noise. We perform numerical tests to support the validity of our methods and apply these algorithms to image colorization and disjoint clique inference.
10/25/2013 Chelsey Legacy will be speaking about her SLU Fellowship (summer research project).
An Interactive Program Using Sums of Rational Functions to Model Correlation Structures
Abstract: Autocorrelation is the correlation between a current observation and a past observation, which is useful to analyze when studying time series data. There are already methods that exist to model autocorrelation structures. However, these structures are not able to model distinct and abnormal features, such as bumps, that occur within an autocorrelation structure. These abnormalities possibly indicate interesting features of the data set that are worth further examination. This project aims to identify the most significant bumps in a series of autocorrelation and model them using sums of rational functions. An interactive R program has been created which allows the user to see a plot of the autocorrelation of a dataset and choose bumps believed to be significant. The program then uses nonlinear regression to calculate the formula used to model the data set with the selected bumps. To illustrate this program, it has been applied to time series data such as data for Disturbance Storm Time Index values, electron flux patterns, and average daily weather temperatures for Anchorage, Alaska.
10/4/2013 Sarah Koallick will tell us about her summer research project integrating Java and R applications.
A Java Graphical User Interface to an R Pareto Front Library
Abstract: A two-stage Pareto front approach is a useful tool when optimizing multiple criteria. In this project, we created a graphical user interface (GUI) that incorporates a collection of R functions written by Dr. Lu Lu and Dr. Christine Anderson-Cook (from the Los Alamos National Laboratory). Their functions find the Pareto front for 2 to 4 criteria and create graphical displays to aid the user in making the best and the most well-informed decision possible. The software we developed presents a GUI for the Pareto front R functions allowing the user, in an understandable way, to input the criteria they want to optimize. The GUI is developed in Java and uses an interface called JRI, the Java/R Interface. JRI allows an instance of R to run inside a Java application.
9/20/2013 Katie Abramski will be speaking about her SLU Fellowship (summer research project).
Improving the Statistical Method for Classifying Geomagnetic Storms
Abstract: Solar storms create disturbances in the Earth’s magnetic field that can damage satellites and cause power grids to fail. In an effort to better understand solar storms, we explore ways to improve the current method for classifying events as storms based on the Disturbance Storm Time (Dst) index. Several methods currently exist for classifying events as storms based on their Dst observation, such as -100nT or -65nT. We investigate how these classification methods were created, and search for a more statistically justified way to define storms. We explore different methods of classifying events as storms based on Dst.
The SLU Fellows program gives students the excellent opportunity to do research and collaborate with others. In addition to presenting my research project, I will talk about the SLU Fellows application process as well as some of the benefits of the program.
9/6/2013 Juan Chang will be speaking about his summer research Project.
Predicting Owner Tendencies in Fantasy Football Drafts
Abstract: Fantasy Football is a popular interactive competition in which participants manage their own virtual National Football League (NFL) teams. This virtual pastime is based on real NFL game statistics. In order to study trends within the Fantasy Football draft, this project uses logistic regression analysis and Classification and Regression Trees (CART). I expect to develop an effective and efficient model that will predict the probability that a position will be chosen given any round and pick in the draft. Ultimately, fantasy football owners may be able to use this model to choose the most successful team in their prospective league.
Spring Semester 2013
5/3/2013 Luke Horton will speak. (Last Q club for the semester.)
Game Development for iPhone
Abstract: The purpose of my senior year experience was to achieve a better understanding of iOS development process, and to publish to the App Store a purchase-worthy mobile game. I began by learning the many tools required for the development process, including the iOS SDK, a proprietary IDE (Xcode), and an open-source game engine (Cocos2d). With a semi-solid understanding of the major concepts driving iOS devices, I started to design and implement a game. Throughout development I met many hurdles and climbed the steep learning curve of app development for iOS. The project successfully concluded with submission to the App Store.
4/12/2013 Luke Reed will be speaking.
Compartmental Models: An Epidemiological Application of Ordinary Differential Equations
Abstract: Ordinary Differential Equations can be used to create epidemiological models to study the spread of infections. The traditional SIR model splits a population into three separate categories: Susceptible, Infected, and Removed. This model provides a basic understanding of the progress of an infection, however, it overlooks important details. By splitting these categories into smaller subgroups, it becomes possible to understand the various stages of the infection and study it within the contexts of populations with varying interaction and transmission rates.
3/29/2013 Spencer Timerman will speak on his research conducted with Dr. Sam Vandervelde.
Divisor Graphs for Egyptian FractionsDescription
Abstract: Exploring simple graphical representations of sums of Egyptian Fractions and obtainable corresponding sets of graphs and fractions.
2/1/2013 Shelley Kandoa will be speaking.
She will be presenting her research with Sam Vandervelde on decomposing the real line (similar to Banach Tarski paradox).
2/1/2013 Dr. Lisa Torrey, Assistant Professor of Computer Science
Artificial Intelligence: Success Stories
Abstract: In science fiction, artificial intelligence (AI) is practically limitless. Space ships communicate with their pilots, robots look and move just like people, and computer programs wrestle with ethical and emotional dilemmas. We're not there yet, but research in AI has produced some exciting and useful things. At this week's Q-club, you'll learn about some of the success stories, both old and new.
Fall Semester 2012
12/7/2012 Dr. Heng Yin of the the Department of Electrical Engineering and Computer Science at Syracuse University will present on Android Malware Analysis.
Abstract: The prevalence of mobile platforms, the large market share of Android, plus the openness of the Android Market makes it a hot target for malware attacks. Once a malware sample has been identified, it is critical to quickly reveal its malicious intent and inner workings. In this talk I will present DroidScope, an Android analysis platform that continues the tradition of virtualization-based malware analysis. Unlike current desktop malware analysis platforms, DroidScope reconstructs both the OS level and Java-level semantics simultaneously and seamlessly. To facilitate custom analysis, DroidScope exports three tiered APIs that mirror the three levels of an Android device: hardware, OS and Dalvik Virtual Machine. On top of DroidScope, we further developed several analysis tools to collect detailed native and Dalvik instruction traces, profile API-level activity, and track information leakage through both the Java and native components using taint analysis. These tools have proven to be effective in analyzing real world malware samples and incur reasonably low performance overheads.
11/9/12 Torrey Hayden will be speaking about her summer REU.
Modeling X-ray Studies of Catalytically Active Surface Sites on Nanocrystals
Abstract: Because x-rays have wavelengths around the length scale of an atom, x-ray diffraction is a useful tool determining distributions of atoms within a material. This can be used in a variety of areas, such as chemistry, materials science, physics and biology. It has been shown that changes in structure of a monolayer of tungsten oxide (WO3) on a bulk hematite (Fe2O3) material are discernible through the use of x-ray techniques. We created a computer model of x-ray kinematic diffraction that determines the intensity of diffraction off a nanocrystal from an incident x-ray beam. Using this tool, we simulated a similar experiment by determining the intensity readings a detector would pick up when x-rays are diffracted off of a hematite nanocrystal with tungsten oxide structures a face. When this crystal was used in the model, the diffraction pattern shifted depending on whether the tungsten oxide structures were in their reduced or oxidized states. Hence, we can predict that the changes in the structure of tungsten oxide during a redox reaction should be detectable.
11/2/12 Brian Thomas will be speaking about his summer REU.
Washboard: An Effective Anaerobic Exercise Game
Abstract: To date, researchers have focused on the intensity of exercise games (exergames) using aerobic workouts. It is important to balance workout programs with anaerobic exercises. Unfortunately, no research has investigated the effectiveness of exergames focusing on anaerobic workouts. Therefore, we have created Washboard. The purpose of Washboard is to perform sit-ups in order to pop balloons. Although our study is currently in progress, preliminary results suggest players are getting a hard to heavy workout, while perceiving an easy workout.
10/19/12 Michael Schuckers, Associate Professor of Statistics
Dr. Schuckers will speak about different summer research opportunities for students and the upcoming Senior Seminar for the Spring semester
10/5/12 Joey Kelley
"Evaluating Ridge Regression with Application to Fantasy Football Data"
Abstract: Ridge regression is a generalization of ordinary least squares regression that is sometimes useful for prediction. It is commonly used in cases of highly correlated (i.e. nearly linearly dependent) predictors. As part of a SLU Fellowship, we studied several estimators for ridge regression parameters. We evaluated their performance compared to ordinary least squares regression using simulated data. Using these results, we applied ridge regression to fantasy football data in order to make better player ratings.
9/21/12 Kevin Angstadt will be speaking about his SLU Fellow.
"Developing Interactive Web Tools for Statistics Students"
Abstract: Advances in computing and computer technology have had a profound effect on statistics and statistics education. These advances have made simulation methods a practical pedagogical tool for teaching basic concepts of statistical inference. For my SLU fellowship project, I worked alongside Professors Ed Harcourt, Patti Frazer Lock, and Robin Lock to develop web-based statistics programs, collectively known as StatKey.
9/7/12 Kerrin Ehrensbeck will be speaking about her SLU Fellow.
"Improving Plutonium Management at the Los Alamos National Laboratory"
Abstract: The Los Alamos National Laboratory (LANL) located in Los Alamos, New Mexico controls and manages most of the remaining nuclear material in the United States. An extremely important job that requires the use of highly accurate measuring devices called calorimeter. A calorimeter is a type of heated water bath in which the heat deficit of the plutonium is measured. Unfortunately the plutonium is leaving behind a heat residual which, in turn correlates future plutonium to past measured items. During my SLU fellowship this summer, I explored possible solution for fixing this correlated data through the use of Bayesian Statistics.