2015 Senior Projects

Spring 2015
Monday, April 13, MCRey 315
3:10 Kyle Wilshusen, Accurate Apple Detection by Piecing Together the Segmentation Puzzle
3:40 Gary DeClerk, Factoring Groups into Primes
4:10 Bryan Urban, An Analysis of Swarm-Based Bio-Inspired Algorithms in the Game Go
Tuesday, April 14, MCRey 315
2:45 Andrei Ndindabahizi, FileWatcher
3:15 Quan Nguyen, The Existence of Perfect Numbers in Different Sets of Numbers
3:45 Buzurg Arjmandi, Converting Images of Text to Encoded Text
4:15 Barrett Deming, A Dynamic Poker Bot Strategy
Wednesday, April 15, MCRey 315
3:10 Luke Lasley, A Better Way to Program Python Together
3:40 Luke Evans, Newton's Method in the Complex Plane
4:10 Mark Woodard, Hendrix Online Kiln Monitor
Thursday, April 16, MCRey 315
2:45 Graham Empey, Topological Quantum Computing: An Application of Knot Theory
3:15 Rebecca Perez, Remote Controlled Robot
3:45 Anna Phan, Pierre de Fermat's Number Theory
4:15 Hunter Lewis, Emoji Maker Android Application

Abstracts

Presenter: Kyle Wilshusen
Title: Accurate Apple Detection by Piecing Together the Segmentation Puzzle
Presentation:Mon 13 Apr, 3:10pm, MCRey 315
Advisor: Dr. Gabriel Ferrer

Abstract: The problem of apple detection in orchards is still a relatively new problem, and a solution that has accurate performance across green apple datasets and costs less than $50,000 is not available. This work aims to build a computer vision apple detection system that is processing intensive, but more accurate than previous apple detection approaches. The talk will show that green apples can be segmented with a high degree of accuracy. The talk will also discuss the challenges that are involved in the detection of individual apples, after apple pixels have been segmented from the background. Finally, occlusion reasoning concepts are adapted from grape detection algorithms, which increase apple detection performance to be comparable to state-of-the-art methods in crop detection.

Presenter: Gary DeClerk
Title: Factoring Groups into Primes
Presentation:Mon 13 Apr, 3:40pm, MCRey 315
Advisor: Dr. Duff Campbell

Abstract: In this paper we define primeness of a group via a set of group products, examining in particular the direct product and generalizations of it.

Presenter: Bryan Urban
Title: An Analysis of Swarm-Based Bio-Inspired Algorithms in the Game Go
Presentation:Mon 13 Apr, 4:10pm, MCRey 315
Advisor: Dr. Mark Goadrich

Abstract: Many natural processes are optimization problems, and by studying and attempting to mimic these processes, a new class of learning algorithms has arisen: Swarm Based Bio-Inspired Algorithms (SB-BIA). One of the most interesting features of an SB-BIA is how the algorithm represents natural occurrences in the form of objects and their interactions between each other. The goal of this project is to analyze the ability of SB-BIAs to intelligently play the game of Go.

Presenter: Andrei Ndindabahizi
Title: FileWatcher
Presentation:Tue 14 Apr, 2:45pm, MCRey 315
Advisor: Dr. Mark Goadrich

Abstract: In this electronic era we live in, cloud storage becomes more relevant everyday as many people find themselves using one computer at home, another one at work, a smartphone and a tablet on a daily basis. Most current cloud storage service providers synchronize users’ computer files by providing a ‘sync’ folder where each file ‘dropped’ in will be available in the cloud. This project explores a new approach, one that simply simply synchronizes selected folders with no need to move them in a special folder.

Presenter: Quan Nguyen
Title: The Existence of Perfect Numbers in Different Sets of Numbers
Presentation:Tue 14 Apr, 2:45pm, MCRey 315
Advisor: Dr. Duff Campbell

Abstract: The abundancy index of a natural number n is defined as the ratio σ(n)/n where σ is the divisor function. Two distinct natural numbers with the same abundancy index are called friendly numbers. In the cases where the abundancy index of a number is a natural number, the number is called a perfect number. In particular, if the abundancy index of the number is exactly 2, the number is called a perfect number. In this research. I will investigate the properties of the abundancy index and the existence of perfect numbers in famous number sequences such as Catalan, Fibonacci and Lucas sequences. Lastly, I attempt to extend the concept of abundancy index and perfect number to the set of Gaussian integers.

Presenter: Buzurg Arjmandi
Title: Converting Images of Text to Encoded Text
Presentation:Tue 14 Apr, 3:45pm, MCRey 315
Advisor: Dr. Gabriel Ferrer

Abstract: Image to text conversion allows one to take images that contain text, e.g. a photo of an essay, and convert it to encoded text that one could manipulate (cut, paste, etc.). Over the past year I have been engaged in creating an effective and usable software with which one could take any image containing text and, with user input guiding the segmentation and extraction process, extract the component text while maintaining the original document’s structure. This process has involved a set of image segmentation algorithms to identify lines, words, and then extract individual letter images, as well as OCR training on a multitude of fonts that allow font-identification and final conversion to encoded text. The final step in the process was tying all the algorithms together in a packaged user-interface that provides users with a level of control over the process for optimal results.

Presenter: Barrett Deming
Title: A Dynamic Poker Bot Strategy
Presentation:Tue 14 Apr, 4:15pm, MCRey 315
Advisor: Dr. Mark Goadrich

Abstract: This project involves the development and analysis of a poker bot with a dynamic strategy. The poker bot is a program which plays heads-up limit Texas hold'em with a strategy that adjusts according to the opponent's choices. The presentation includes a brief overview of the rules of poker, technical details of the theory and development of the bot, and results of a comparison with a control bot.

Presenter: Luke Lasley
Title: A Better Way to Program Python Together
Presentation:Wed 15 Apr, 3:10pm, MCRey 315
Advisor: Dr. Gabriel Ferrer

Abstract: When programming on a team it is often useful to use a repository to keep everyone's code up to date. This however synchronization takes a lot of work especially if two users are editing a file at the same time. To fix this I wanted to design an application where multiple users could edit a program at the same time, on different computers. My project is a distributed Python IDE that allows users to connect to each other and edit files at the same time. Since the IDE uses a distributed system, a user does not need to set up their own server or rely on a server existing, because they are the server.

Presenter: Luke Evans
Title: Newton's Method in the Complex Plane
Presentation:Wed 15 Apr, 3:40pm, MCRey 315
Advisor: Lars Seme

Abstract: Past research has shown that Newton's method produces chaotic behavior in certain regions of the complex plane. We expand on this research by describing the dynamics of Newton's method for polynomials with all real roots over the complex plane. To show chaotic behavior, we introduce symbolic dynamics for Newton's Method. We also estimate the dimension of the Julia set with computer-generated box-counting.

Presenter: Mark Woodard
Title: Hendrix Online Kiln Monitor
Presentation:Wed 15 Apr, 4:10pm, MCRey 315
Advisor: Dr. Gabriel Ferrer

Abstract:

Presenter: Graham Empey
Title: Topological Quantum Computing: An Application of Knot Theory
Presentation:Thu 16 Apr, 2:45pm, MCRey 315
Advisor: Lars Seme

Abstract: We begin by answering the question, "what is quantum computing, and what is its importance to the theory of computation?" as well as discussing the motivation behind the theory of topological quantum computing. We then introduce the basic concepts of knot theory including the definition of a knot and what it means for two knots to be considered equivalent before discussing a variety of knot invariants, which help to distinguish knots from one another. To conclude, we introduce the fundamentals of quantum mechanics and describe how a quantum computer operates, and then discuss topological quantum computing and how one knot invariant factors into this computing paradigm.

Presenter: Rebecca Perez
Title: Remote Controlled Robot
Presentation:Thu 16 Apr, 3:15pm, MCRey 315
Advisor: Dr. Gabriel Ferrer

Abstract: The overarching goal of this project is to reduce the introduction of human error during the learning period of a machine learning algorithm in a robot. This error is a result of unanticipated physical issues found through first-hand experience. By creating a remote control with live video streaming, a user can train their algorithms without any of the issues that physically handling a robot entails while also avoiding the capturing themselves in the image. The robot for this project will be created with a Raspberry Pi and will be remote controlled via an Android Application.

Presenter: Anna Phan
Title: Pierre de Fermat's Number Theory
Presentation:Thu 16 Apr, 3:45pm, MCRey 315
Advisor: Dr. Ze'ev Barel

Abstract: Pierre de Fermat is the founder of many great Number Theory’s findings such as Fermat numbers, the Infinite Descent Method, Two-Square theorem, Polygonal Number theorem, the Little theorem, the Last theorem, etc. These findings will be introduced in this project along with proofs or justifications by various other mathematicians. Fermat’s only published proof will also be discussed.

Presenter: Hunter Lewis
Title: Emoji Maker Android Application
Presentation:Thu 16 Apr, 4:15pm, MCRey 315
Advisor: Dr. Mark Goadrich

Abstract: I will start by discussing what Emoji are, their meaning in Japanese, and a quick overview of their progression since their conception. During that, I will specify the addition of Emoji to the Unicode standard and point out the sheer number of Emoji today. With the ever present need for more Emoji, it logically makes sense that there is some merit in giving users the ability to make their own Emoji. I will then go into why it is typically impossible to change that part of a system's operating system, and lead into rooting permissions and the act of rooting. After that, I will give images and flowcharts communicating the design of this application. Then, I will finish by talking about the successes and failures of the project.