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 with pizza and beverages being served. Q-Club will meet in Brown 122 (Bloomer Auditorium) on Sept. 23rd. Permanent location is still being decided.
Faculty members occasionally give talks as well, on topics ranging from "Math and Horror" to "An Outrageously Brief History of Mathematics."
All are welcome to attend; please contact Mitch Joseph, club president, or Sam Vandervelde, club advisor.
Additional activities planned by the club include a Piathlon (held on or near 3/14) and Euler's Birthday Party (on 4/15).
9/23/2014 Danny Driscoll, Jenna Street and Son Vuong
"Careers in Actuarial Science"
Abstract: Actuaries are leading business professionals who manage the impact of risk and uncertainty. They use mathematical and analytical skills on the job at a variety of industries to help businesses protect themselves against loss. Come learn about the process of becoming an actuary, including the exam process and the classes SLU offers to satisfy requirements. Hear about students’ experiences at actuary internships this past summer and discover this exciting but relatively unknown career path.
10/7/2014 Skyler Ng
PHOENIX, a Helping Hand
Abstract: With today's technological advances, people spend increasing amounts of time working on computers. To help people work efficiently, this project aims to create an intelligent software assistant that will help automate tedious commands that users often do on a desktop computer. The main task of this program is to search files or documents by the name or content. The software process can be broken down into three different sections. In the first section, the program will analyze an English command, tag each word with its part of speech, and parse it to determine its grammatical structure. The second section will focus on processing the parsed command into a command that the computer can understand. The final section will return the output to the user interface in a readable format. This program will be written in Python because it is a useful tool for string manipulation, has easy-to-read syntax, and contains the Natural Language Processing Toolkit (NLTK), which provides functions that deal with text processing. Archive Page
10/21/2014 Mitchell Joseph
"The Budapest Semester in Mathematics"
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.