The Fixing Number of a Graph

The fixing number of a graph is the order of the smallest subset of its vertex set such that assigning distinct labels to all of the vertices in that subset results in the trivial automorphism; this is a recently introduced parameter that provides a measure of the non-rigidity of a graph. We provide a survey of elementary results about fixing numbers. We examine known algorithms for computing the fixing numbers of graphs in general and algorithms which are applied only to trees. We also present and prove the correctness of new algorithms for both of those cases. We examine the distribution of fixing numbers of various classifications of graphs

Open Source Natural Language Processing

Our MQP aimed to introduce finite state machine based techniques for natural language processing into Hunspell, the world's premiere Open Source spell checker used in several prominent projects such as Firefox and Open Office. We created compact machine-readable finite state transducer representations of 26 of the most commonly used languages on Wikipedia. We then created an automata based spell checker. In addition, we implemented an transducer based stemmer, which will be used in the future of transducer based morphological analysis

Venetian Mobility on Land and Sea

This project quantified, qualified, and analyzed pedestrians in Venice, Italy through counting and observing Venetians and tourists at bridges and boat stops throughout the city. Data was collected manually and electronically at bridges, and solicited from the Venetian public transit authority and the Venetian Census Bureau. This project also qualified, quantified, and analyzed three high-profile public events to assist Venetian city officials with emergency planning. An autonomous-agent computer model was developed to analyze and display the collected data, and to extrapolate usable information to assist city officials with municipal planning in a safe, controlled, and realistic environment