���ϲ�����

Abstract: It has been shown that the general decoding problem is NP-complete. McEliece has shown that this serves as a suitable one-way function with which to build an encryption scheme. We evaluate the scheme here, discussing the necessary background topics in coding theory, cryptography, and cryptanalysis, concluding with a demonstration of its usefulness against quantum computing attacks.

Abstract: Embedded control systems are one way that energy consumption and cost can be reduced for both business expenditures and increased efficiency. In such a system, microprocessors address the specific task of controlling one aspect of the environment. One implementation, a light sensor system to incorporate natural light with artificial light, can work to dim artificial light in accordance to natural light in order to better manage resources.

In designing this control system, there are several steps which must be addressed. First, inexpensive and easily replaceable components work to increase reliability while keeping costs down. An appropriate microprocessor that can accomplish the tasks must be selected. Finally, software must be developed which takes input from the sensors, calculates a control effort, and outputs the control effort to the actuator. A straightforward implementation might use C or a C- like language innate to the microprocessor. However, other considerations as to what the best software should look like must be made. By using the occam-pi language and exploring what changes can be made to the software environment to best accommodate control systems, this research looks to answer the question: what does a reasonable solution for an embedded control system managing artificial light levels look like?

Abstract: TBA

Abstract: The red-blue intersection problem involves identifying intersections between sets of red and blue line segments in the plane. In 2011, Cortes presented an algorithm for finding intersections in O(n²) time. We attempt an extension of this algorithm to R³ as well as analyze the extension's complexity.

Abstract: Networking technologies, especially those adopted in professional settings, require security measures in order to keep our conversations and other information private. The Off-the- Record Messaging Protocol provides a novel means of securing instant messages over an insecure network. Unfortunately, the OTR protocol currently only supports instant messaging between two parties. This thesis studies and analyzes three proposed methods of extending the OTR protocol for group messaging support.

Abstract: Twitter today has become a very popular microblogging and communication tool among internet users. Users share opinions on different aspects of life. Therefore, Twitter is a rich source of data for opinion mining and sentiment analysis. Results found can be used in marketing and social studies. Previous work have used a corpus of tweets to train machine learning algorithms like Naive Bayes and Maximum entropy that can then classify a new tweet as either positive or negative. The purpose of this research is to study and compare those two methods and see if we can improve their accuracy by considering the full Twitter Object.

Abstract: This project provides a proof stating that ratios of prime numbers of dense in the real line. Following this proof, this project explores density of ratios of other sets. The ultimate goal is to see if there is a specific set, whose ratios are dense, that can accurately express the spacing between prime numbers.

Abstract: This paper addresses the issue of Euclidean distance when used for image comparison by suggesting a different approach to image distance calculation. The Euclidean distance does not account for minor transformations between two images. We present two algorithms, FAST feature extraction and the Stable Marriage Algorithm, in conjunction that base image distance on a stabilized match of extracted features. By using feature distances as our output, we hope to eliminate the flaw of the Euclidean distance for image comparison. First, we explain how each algorithm works individually. Then, we explain how they are joined together to approach the problem. Finally, we present the results of our output compared against the Euclidean distance output.

Abstract: Public key cryptography has recently become integrated in our lives through the necessity for secure internet communication. This paper explores the most common current public key cryptosystem, RSA. It also explores a relatively new, more efficient cryptosystem that will soon come into common use both alongside and as a replacement for RSA, Elliptic Curve Cryptography.

Abstract: The index function for a positive integer n is the divisor function divided by the integer. In number theory, a positive integer is said to be friendly if there exists a different positive integer with the same index value. An integer whose index value is unique is said to be solitary. This project focuses on integers who have yet to be characterized as friendly or solitary. The smallest element of this set of unknown integers is 10. Although a friend of 10 has not yet been discovered, a lower bound for the value of 10's friend can be established.

Abstract: TBA