2009 Senior Projects

Abstracts

Abstract: The goal of this project is to provide a tool that any person, with or without a strong mathematical background, could use to quickly gain an understanding of what the fourth dimension is and how it works. The theory is that people learn complex sets of rules much faster when they are associated with goals. The programming portion of my project is a game that requires the player to play by the rules of linear algebra in four dimensions, thus teaching the player to learn to predict how an object in this space will behave.

Abstract: The goal in this project is to alert the users of Jigsaw when they make very specific mistakes that can not be caught simply from the specification of the language. It is necessary to analyze the data flow of the code, a method called Data Flow Analysis. The first problem that is addressed is that of writing to a variable that will never be read again. The second problem is identifying variables which should not be instance variables when they are instance variables.

Abstract: Toves is a logic circuit simulator that allows a user to place inputs, outputs, gates, and wires and replicate properties of logic circuits. In this program, if one has created a connection between two objects, if one of those objects are later moved, the connection will be lost. The user then must manually re-route the wires between these objects to restore the connection. In this project, I implemented an algorithm to automatically re-route connections as a user moves objects within the program, making Toves a more user-friendly environment.

Abstract: The focus of my project is to research how likely Broadcast Amplification Attacks are. This involves researching this type of attack as well as attempting to locate broadcast addresses that can be abused using this technique. I attempted to locate these addresses using information collected by Professor Derek Leonard during his scans of the internet, with the goal of determining if these attacks are currently possible.

Abstract: Recognition of primary colors that appear on a scanned color image plays an important role in data mining since color related information is used for image analysis purposes. But it can be a challenging task as the appearances of colors are affected by various factors such as paper quality, print quality, bleaching, noise during both scanning process and printing process. To address these concerns, we presents the methods and implementations that recognize the primary colors that appear on a scanned page while differentiating noises from useful information. Our algorithm uses the RGB and CMYK color models.

Abstract: None

Abstract: Efficient, rapid computation is crucial to research in a broad spectrum of fields rooted in scientific investigation: from economics to physics. Clusters offer a powerful means of attaining superb computational efficiency. A cluster consists of a network of computers, connected through a fast, local connection. Computations are distributed across this network. Clusters are highly popular in both academic and industrial research. In light of the computational challenges involved in developing a cluster and the central role they play in research, I investigated the details of cluster design by implementing and analyzing a very simple cluster.

Abstract: In my project, I analyzed ICMP messages that were collected as a result of Professor Leonards scan of all routable IP addresses on the Internet. I determined the number of unique firewalls on the Internet, analyzed the network sizes of the firewalls, and analyzed the number of networks that each firewall protected.

Abstract: The recently discovered cache poisoning technique known as the Kaminsky Bug was discovered by computer security researcher Dan Kaminsky in June of 2008. The vulnerability targets the Domain Name System protocol, mainly used to translate human-readable host names into Internet Protocol IP addresses, and makes it possible to "poison" the records kept by DNS resolvers to contain falsified information about host name to IP mappings. Because the Kaminsky bug is a vulnerability in the design of the DNS protocol, it is not limited by vendor implementation or configuration, and remains unpatched as of this publication. My paper seeks to explain how the Kaminsky bug takes advantage of the current architecture of DNS, and also to assess the vulnerability of several local nameservers.

Abstract: A new deck of 96 cards is created, using six suits in two different colors, and sixteen ranks. The ranks are partially ordered, not totally ordered; they are subsets of the set {α, β, π, γ}.The goal of this project is to find probabilities and strategies in dealing with a certain combination of hands given this newly created deck. This new deck of cards will have different hand rankings and probabilities than does a normal deck of 52 cards. This project analyzes the similarities and differences between a normal deck of cards and this newly created deck in dealing with draw poker and Texas Hold'em. A system is also created to help determine the expected value of a certain hand. In turn this system can better determine the strength of your hand to help decide on whether or not to continue the hand and try to win or to fold and get rid of your cards.

Abstract: None

Abstract: In large data processing companies, multiple sources of information are typically used. However, these sources do not always provide reliable data, which results in inconsistencies existing between the sources. In this case, there exist two choices: manipulate the individual sources to maximize results or synchronize the different inputs into a unified input. This project details the process of attempting to optimize such a system utilizing OCR (Optical Character Recognition) technology, with focus on the benefits and problems associated with several different algorithms. These algorithms cover both individual source manipulation and synchronization.

Abstract: In order to test the efficiencies of a variety of traffic control algorithms, I have created a simulation of a city block, populated with simulated automobiles following randomly determined routes. Utilizing this simulation, I simulated the traffic control algorithms in question for predetermined metrics in order to gauge efficiency.

Abstract: Traditional terrain generation methods have a flaw of creating random landscapes that will rarely be mistaken for the real thing. I designed and implemented an algorithm that simulates hydraulic erosion, with the goal of creating more realistic landscapes.

Abstract: By way of its own graphical user interface, this utility allows for the rapid construction and modification of graphical user interfaces, which can be exported in comprehensibly formatted, stand-alone Java files for use in other projects. The Builder also provides an interface for associating black boxes from Dr. Ferrer's Black Box Editor with each GUI component, and with the GUI as a whole. This integration offers a convenient and robust environment for Cleanroom analysis and testing of whether the specification for a constructed GUI has accounted for all potential inputs.

Abstract: With the proper programming, computers can often play board games such as chess or checkers at a skill level beyond the average human player. So, the question arises: How can an artificial intelligence be adapted to seem to naturally match the skill level of its current opponent? Using an artificial intelligence designed to play checkers, this project explores three methods to adapt such an artificial intelligence to the skill of its current opponent.