Physical Sciences and Mathematics Commons^™

Text Anomaly Detection With Arae-Anogan, Tec Yan Yap

Honors Projects

Generative adversarial networks (GANs) are now one of the key techniques for detecting anomalies in images, yielding remarkable results. Applying similar methods to discrete structures, such as text sequences, is still largely an unknown. In this work, we introduce a new GAN-based text anomaly detection method, called ARAE-AnoGAN, that trains an adversarially regularized autoencoder (ARAE) to reconstruct normal sentences and detects anomalies via a combined anomaly score based on the building blocks of ARAE. Finally, we present experimental results demonstrating the effectiveness of ARAE-AnoGAN and other deep learning methods in text anomaly detection.

Encoding Lexicographical Ordering Constraints In Sat, Wenting Zhao

Honors Projects

Symmetry occurs in many constraint satisfaction problems, and it is important to deal with it efficiently and effectively, as it often leads to an exponential number of isomorphic assignments. Symmetric rows and columns in matrices are an important class of symmetries in constraint programming. In this work, we develop a new SAT encoding for partial lexicographical ordering constraints to break symmetries in such places. We also survey all the previous complete lex-leader encodings in literature and translate them into SAT encodings. We perform experimental analysis on how these lex-leader constraints impact the solving of Balanced Incomplete Block Design (BIBD) instances. …

Analyzing And Extending An Infeasibility Analysis Algorithm, Ammar Malik

Honors Projects

Constraint satisfaction problems (CSPs) involve finding assignments to a set of variables that satisfy some mathematical constraints. Unsatisfiable constraint problems are CSPs with no solution. However, useful characteristic subsets of these problems may be extracted with algorithms such as the MARCO algorithm, which outperforms the best known algorithms in the literature. A heuristic choice in the algorithm affects how it traverses the search space to output these subsets. This work analyzes the effect of this choice and introduces three improvements to the algorithm. The first of these improvements sacrifices completeness in terms of one type of subset in order to …

Native Cardinality Constraints: More Expressive, More Efficient Constraints, Jordyn C. Maglalang

Honors Projects

Boolean cardinality constraints are commonly translated (encoded) into Boolean CNF, a standard form for Boolean satisfiability problems, which can be solved using a standard SAT solving program. However, cardinality constraints are a simple generalization of clauses, and the complexity entailed by encoding them into CNF can be avoided by reasoning about cardinality constraints natively within a SAT solver. In this work, we compare the performance of two forms of native cardinality constraints against some of the best performing encodings from the literature. We designed a number of experiments, modeling the general use of cardinality constraints including crafted, random and application …

Rapid Face Detection Using Independent Component Analysis, Aditya Rajgarhia '07

Honors Projects

Face detection is the task of determining the locations and sizes of human faces in arbitrary digital images, while ignoring any other objects to the greatest possible extent. A fundamental problem in computer vision, it has important applications in fields ranging from surveillance-based security to autonomous vehicle navigation. Although face detection has been studied for almost a decade, the results are not satisfactory for a variety of practical applications, and the topic continues to receive attention.

A commonly used approach for detecting faces is based on the techniques of "boosting" and "cascading", which allow for real-time face detection. However, systems …

Unsupervised Learning To Improve Anomaly Detection, Daniel H. Garrette '06

Honors Projects

An intrusion detection system (IDS) is used to determine when a computer or computer network is under attack. Most contemporary IDSs operate by defining what an intrusion looks like and checking traffic for matching patterns in network traffic. This approach has unavoidable limitations including the inability to detect novel attacks and the maintenance of a rule bank that must grow with every new intrusion discovered. An anomaly detection scheme attempts to define what is normal so that abnormal traffic can be distinguished from it. This thesis explores the ways that an unsupervised technique called "clustering" can be used to distinguish …

Limits Of Diagonalization And The Polynomial Hierarchy, Kyle Barkmeier '06

Honors Projects

Determining the computational complexity of problems is a large area of study. It seeks to separate these problems into ones with "efficient" solutions, and those with "inefficient" solutions. Of course, the strata is much more fine-grain than this. Of special interest are two classes of problems: P and NP. These have been of much interest to complexity theorists for quite some time, because both contain many instances of important real-world problems, and finding efficient solutions for those in NP would be beneficial for computing applications. Yet with all this attention, there are still important unanswered questions about the two classes. …

Using Binary Space Subdivision To Optimize Primary Ray Processing In Ray-Tracing Algorithms, Mark Portolese '05

Honors Projects

Ray-tracing algorithms have the potential to create extremely realistic three-dimensional computer graphics. The basic idea is to trace light rays from the user through the computer screen into the hypothetical three-dimensional world. This is done to determine what objects should be displayed on the screen. Furthermore, these rays are traced back to the light sources themselves to determine shading and other photorealistic effects. However, without optimization these algorithms are slow and impractical. This paper explores the use of the classic binary space subdivision algorithm in order to speed up the process. Binary space subdivision is the use of binary trees …

Automated Annotation Of Heegaard Diagrams, Dmitry Mogilevsky '03

Honors Projects

No abstract provided.

P-Fastus: Information Extraction System Implemented In A Constraint Programming Language -Sicstus Prolog, Rajen Subba '03

Honors Projects

P-FASTUS is an Information Extraction system developed in SICStus Prolog based on the implementation of FASTUS. It is program that extracts prespecified information such as the name of the companny, location and the position being advertised from" Job PostingIs'' in text files. The system is composed of different levels of processing phases that are implemented using finite-state transducers.

The Virtual Beta: An Interactive Fish Using Java Script And Css, Lauren B. Carroll '03

Honors Projects

My first version of the fish was written in C, because it was the language I was studying at the time. I wanted something that more people could view easily, however and one that could manage images more simply than C. I ended up choosing ]avaScript. At first I tried to translate my C program directly to ]avaScript, but I soon found this was too complex a task.

The Use Of A Genetic Algorithm To Evolve Networks For A Natural Language Processing Task, Alexander E. Dimov '02

Honors Projects

In this project a novel approach was taken for performing a natural language task. The task requires a neural network to predict the grammatical category of the next word in a stream of sentences. There are two main reasons why this task is interesting. In natural language processing, it is sometimes very difficult to determine the grammatical category of a word in a sentence when that word could belong to different grammatical categories depending on the context. For example, the word "run" can either be a noun or a verb in a certain sentence. The ability to correctly determine the …

Computer Vision: Object Recognition, Michael Zalokar '00

Honors Projects

One of the growing fields in computer science is that of Artificial Intelligence or AI. Many theories have evolved to make a computer intelligent and so far no one has succeeded (Dreyfus 1992). One of the methods used by the Shelley Project in the past has been to use a back propagation neural network that is the backbone of the GNU Neural Network Visualizer (GNNV). GNNV uses a neural network to try to identify known objects, like faces, in the field of view. A different method, that is the focus of this research, is to identify objects in the image. …

Designing An Integrated Environment For Artificial Intelligence, Andrew B. Ritger '99

Honors Projects

The SHELLEY RESEARCH GROUP (part of the Illinois Wesleyan Intelligence Network on Knowledge -IWINK) has been in existence for several years, and has benefited immensely from various student contributors who have added such components as robotic arm control, cross platform networking, an artificially intelligent tic-tac-toe player, and an interactive teaching tool demonstrating the functionality of artificial neural networks. What is lacking, however, amidst these undergraduate contributions to the SHELLEY Project, is an effective means of integrating existing components into a single cohesive functional unit, let alone any easy means of making further contributions within a simple unified context. The focus …

Powerfaids: Building A Road To Financial Aid Efficiency, Lauri Nichols '96

Honors Projects

To most students, the Financial Aid office is a small room in the basement of Holmes Hall where they are occasionally sent to sign over a paper or two. It has something to do with money, and every so often, these students get something in the mail that tells them just how much it's going to cost them to continue their education here at Illinois Wesleyan. They know that papers are filled out, usually by their parents, and then in a couple of months, a figure jumps out of nowhere and becomes "Your Financial Aid Package."

Improved Data Migration And Processing For Projecting The Financial Aid Budget, Jeffery L. Olson '96

Honors Projects

Last fall, I again resumed work on the budget projection model that encompassed five spreadsheets. Four of these sheets generated a set of statistical averages for each class. Each one consisted of 101 columns containing data for the four-to five-hundred students(rows) in each class. In addition, a fifth sheet used these averages to generate a highly accurate prediction for expenditures in the upcoming year. However, there were two main areas of improvement that became readily apparent: importing data and the sheets themselves.

Quickadvise - The Search For A More Efficient Method Of Advising, Gregory G. Pengiel '94

Honors Projects

In order to choose courses both efficiently and properly, a student and advisor must look at which courses have been taken, and also which ones are necessary. They must then determine whether or not the student is qualified to take the necessary courses. Unfortunately, there is no easy way to record and maintain this work so that it may be used throughout the college career.
Hence, even though the student and advisor recently determined which classes were headed, they must once again look up all relevant information and determine which courses are best. This is exactly the type of problem …

Course Scheduling Software: Reference Manual, Saadatu Gobir

Honors Projects

Welcome to version 1.0 of the Course Scheduling software. Course Scheduling is designed to meet needs of anyone who is tying to create a course schedule. This software is a product that compiles, links, and runs in C++; although it has C extension. It has been specifically designed to work In C++ exclusively. I had mixed a little of C++ functions with C structure programming to complete this package and make it more efficient. It is versatile, quick, and efficient. This instruction manual is brief, due to fact that the software is well documented. It only covers the basic functions …

Financial Aid Budget Projection Methodology, Amy N. Baird '94

Honors Projects

The nature of this research project is to make a very strong contribution toward the final goal of completely automating the Financial Aid Office at Illinois Wesleyan University over the next five years.

The State Of Computer Science Facilities Of Schools Across The United States That Are Comparable To Illinois Wesleyan University, Sarah A. Bartz '93

Honors Projects

The purpose of this study is to compare Illinois Wesleyan's academic computer facilities with those at other comparable U.S. colleges and universities. This study also investigates factors affecting these facilities such as the methods other institutions use to deal with and plan for the constantly changing computer world. To obtain this information a survey was mailed to over 250 institutions across the U.S. that were considered comparable to IWU. These institutions include the Associated Colleges of the Midwest, the Oberlin Group, and some of the top colleges and universities in the U.S. as ranked in U.S. News and World Report's …

Computer Program: General University Requirements Package, Abhishek Kejriwal '93

Honors Projects

The objective of my research project was to write a computer program in Turbo Pascal which would determine how many general university requirements a student has completed and what requirements he or she needs to complete in order to graduate. There are six degrees offered at Illinois Wesleyan University. They are: BA (Bachelor of Arts); BS (Bachelor of Science); BFA (Bachelor of Fine Arts); BSN (Bachelor of Science in Nursing); BM (Bachelor of Music) and BME (Bachelor of Music Education). There is a different set of criteria to be met for the completion of each of these degrees. The program …

Cystic Fibrosis: Cluster Analysis Of Microbiology And Pulmonary Function, Lori Lee M. Larson '91

Honors Projects

In an attempt to find a relationship between pulmonary infection and pulmonary function in cystic fibrosis (CF) patients, microbiology data and pulmonary function test (PFT) data for clinic patients' visits were obtained from the University of Minnesota Relational Database. The two files were merged, totaling 12,193 cases, and then analyzed using a quick cluster subroutine of SPSSX on the University of Illinois IBM Mainframe System. QUICK CLUSTER analysis showed a relationship between the virulence of the microorganisms, the amount of growth of the microorganisms, and the pulmonary function test scores of CF patients