Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Accessed (1)
- Accuracy (1)
- Agent (1)
- American Sign Language (1)
- Artificial Neural Networks (1)
-
- Body (1)
- China (1)
- Deep learning (1)
- Difference sets (1)
- Direct coupling analysis (1)
- Distance (1)
- End (1)
- Ensemble learning (1)
- Experiment (1)
- Figure (1)
- Genetic Algorithm (1)
- Group (1)
- Interaction (1)
- Japan (1)
- Left (1)
- NEAT (1)
- Neuroevolution (1)
- Online (1)
- Participants (1)
- Protein residue-residue contact prediction (1)
- Right (1)
- Selections (1)
- Session (1)
- Set theory. (1)
- Similarity (1)
Articles 1 - 16 of 16
Full-Text Articles in Physical Sciences and Mathematics
An Application Programming Interface For Parliamentary Procedure, Grant David Bourque
An Application Programming Interface For Parliamentary Procedure, Grant David Bourque
Honors Theses
No abstract provided.
Protein Residue-Residue Contact Prediction Using Stacked Denoising Autoencoders, Joseph Bailey Luttrell Iv
Protein Residue-Residue Contact Prediction Using Stacked Denoising Autoencoders, Joseph Bailey Luttrell Iv
Honors Theses
Protein residue-residue contact prediction is one of many areas of bioinformatics research that aims to assist researchers in the discovery of structural features of proteins. Predicting the existence of such structural features can provide a starting point for studying the tertiary structures of proteins. This has the potential to be useful in applications such as drug design where tertiary structure predictions may play an important role in approximating the interactions between drugs and their targets without expending the monetary resources necessary for preliminary experimentation. Here, four different methods involving deep learning, support vector machines (SVMs), and direct coupling analysis were …
Computing The (Un)Computable: A Computationally-Augmented Perspective On The Yasukuni Shrine Controversy, Ryan Muther
Computing The (Un)Computable: A Computationally-Augmented Perspective On The Yasukuni Shrine Controversy, Ryan Muther
Honors Theses
Computational methods have been used with increasing frequency in the social sciences and humanities, due to the availability of digital sources and computing power to study everything from changes in the meanings of words in Latin texts to how knowledge was categorized in eighteen century encyclopedias. Recent trends in the fields of digital humanities and computational social science include statistical methods like machine learning, requiring large pre-tagged and annotated sets of documents which in turn necessitates a great deal of prior work to create data to use with such methods. This reliance on large corpora of annotated data limits the …
Effect Of Deictic Gestures On Direction-Giving In Virtual Humans, Anthony Pham
Effect Of Deictic Gestures On Direction-Giving In Virtual Humans, Anthony Pham
Honors Theses
Virtual agents are animated characters that use speech and gesture to interact with human users. They can serve as an intuitive interface for a variety of purposes. I am investigating the use of deictic gestures by a direction-giving agent. Deictic gestures are pointing gestures that humans often use in direction-giving to help clarify the route and destination. In my experiment, I developed a virtual agent to give directions to people to six different locations with the following spatial relationships to the starting point: left, right, left behind, right behind, left up, and right up. Three versions of the virtual agent …
Approaching Humans For Help: A Study Of Human-Robot Proxemics, Eric Rose
Approaching Humans For Help: A Study Of Human-Robot Proxemics, Eric Rose
Honors Theses
In order for a robot to be effective when interacting with a person, it is important for the robot to choose the correct person. Consider an example where a robot is trying to perform a task but it isn’t capable of doing a subtask, like going up a flight of stairs. In this case, the robot would need to ask a person for help with the elevator, in a socially appropriate way. We have conducted an experiment to determine who would be the best candidate to approach in a situation like this. Should the robot choose to approach someone who …
Blending Two Automatic Playlist Generation Algorithms, James Curbow
Blending Two Automatic Playlist Generation Algorithms, James Curbow
Honors Theses
We blend two existing automatic playlist generation algorithms. One algorithm is built to smoothly transition between a start song and an end song (Start-End). The other infers song similarity based on adjacent occurrences in expertly authored streams (EAS). First, we seek to establish the effectiveness of the Start-End algorithm using the EAS algorithm to determine song similarity, then we propose two playlist generation algorithms of our own: the Unbiased Random Walk (URW) and the Biased Random Walk (BRW). Like the Start-End algorithm, both the URW algorithm and BRW algorithm transition between a start song and an end song; however, issues …
A Graph Based Departmental Spoken Dialogue System, Julia Isaac
A Graph Based Departmental Spoken Dialogue System, Julia Isaac
Honors Theses
Spoken dialogue systems are automatic, computer based systems that are a great way for people to receive important information. In this project, I created a spoken dialogue system that people can use to learn about the Computer Science Department at Union College. The system was built by populating an open source dialogue system using a graph based dialogue manager. I improved upon a previous working dialogue system by making the conversations sound more natural, improving the flexibility of the system and making the system more robust. To help with this process a corpus was created using about 200 different dialogues …
The Effects Of Early Confidence Interval Training On User Efficacy In A P300 Brain-Computer Interface Spelling Task, Adam Starkman
The Effects Of Early Confidence Interval Training On User Efficacy In A P300 Brain-Computer Interface Spelling Task, Adam Starkman
Honors Theses
Brain-computer interface (BCI) technology can provide communication for individuals suffering from degenerative neuromuscular disorders. The present study sought to demonstrate improved BCI performance in healthy individuals using confidence interval training with a P300 BCI spelling program. In this BCI interface, electroencephalographic (EEG) activity was recorded as participants attended to a specific target character within a matrix of flashing letters and numbers presented on a computer screen. The BCI uses the P300 Event Related Potential to select the intended character. In a prior patient case, use of a confidence measure that rejected questionable selections improved that user’s spelling efficiency. The present …
Which Language(S) Are Best (For Web Development), Jackson A. Stone
Which Language(S) Are Best (For Web Development), Jackson A. Stone
Honors Theses
This thesis is intended to shine light on the complex nature of the online software ecosystem, in the hopes that it may help students who wish to pursue web development determine how to best spend their time researching and learning varying technologies.
Audio Software (Vst Plugin) Development With Practical Application, Zachary Hummel
Audio Software (Vst Plugin) Development With Practical Application, Zachary Hummel
Honors Theses
Audio engineers around the world routinely utilize small pieces of software, known as “plugins,” to help shape the sound of the media they are working with. These plugins are inserted into a digital audio workstation (DAW) and contain digital signal processing (DSP) algorithms that can affect audio in a number of ways limited only by the creativity of the software developer. Common implementations of plugins include equalizers, compressors and limiters, gain, phase rotation or polarity inversion algorithms, reverb and delay, and emulation of the non-linearities of analog audio equipment. The intent of this thesis project is to design and produce …
Software Improvements To Parint, A Parallel Integration Software Package, Lawrence Cuneaz
Software Improvements To Parint, A Parallel Integration Software Package, Lawrence Cuneaz
Honors Theses
The best software is easy to configure and compile, is expandable and is well tested. Development of the ParInt software package for parallel integration stopped a number of years ago. When handed the software, parts of the package no longer configured or compiled consistently. Furthermore it relied on one random number generator and had no functional testing. The team tuned the auto configuration so that the program would configure and build on current systems, created expandable functionality to add new random number generators and created two functional test packs. Now ParInt can be developed with confidence knowing that it compiles …
Implementation Of An Enhanced System Of Motion Tracking For Virtual Reality Using 'Common Off-The-Shelf' Items, Sean M. O'Hara
Implementation Of An Enhanced System Of Motion Tracking For Virtual Reality Using 'Common Off-The-Shelf' Items, Sean M. O'Hara
Honors Theses
My project was tasked and guided by Dr. Adam Jones of the University of Mississippi's Computer Science Department to design and implement an improved system of infrared motion tracking for virtual reality. The enhancements allow Dr. Jones to use motion tracking for VR in ways that he previously could not, and these improvements include the ability to track multiple objects along with a foundation for expanding my project's use to work with a multiple camera setup for motion tracking. The hardware used in my project made use of Dr. Jones' supply of technology for development and research within the area …
Nonexistence Of Nonquadratic Kerdock Sets In Six Variables, John Clikeman
Nonexistence Of Nonquadratic Kerdock Sets In Six Variables, John Clikeman
Honors Theses
Kerdock sets are maximally sized sets of boolean functions such that the sum of any two functions in the set is bent. This paper modifies the methodology of a paper by Phelps (2015) to the problem of finding Kerdock sets in six variables containing non-quadratic elements. Using a computer search, we demonstrate that no Kerdock sets exist containing non-quadratic six- variable bent functions, and that the largest bent set containing such functions has size 8.
Cameron-Liebler Line Classes And Partial Difference Sets, Uthaipon Tantipongipat
Cameron-Liebler Line Classes And Partial Difference Sets, Uthaipon Tantipongipat
Honors Theses
The work consists of three parts. The first is a study of Cameron-Liebler line classes which receive much attention recently. We studied a new construction of infinite family of Cameron-Liebler line classes presented in the paper by Tao Feng, Koji Momihara, and Qing Xiang (rst introduced in 2014), and summarized our attempts to generalize this construction to discover any new Cameron-Liebler line classes or partial difference sets (PDSs) resulting from the Cameron-Liebler line classes. The second is our approach to finding PDS in non-elementary abelian groups. Our attempt eventually led to the same general construction of PDS presented in John …
Real-Time Translation Of American Sign Language Using Wearable Technology, Jackson Taylor
Real-Time Translation Of American Sign Language Using Wearable Technology, Jackson Taylor
Honors Theses
The goal of this work is to implement a real-time system using wearable technology for translating American Sign Language (ASL) gestures into audible form. This system could be used to facilitate conversations between individuals who do and do not communicate using ASL. We use as our source of input the Myo armband, an affordable commercially-available wearable technology equipped with on-board accelerometer, gyroscope, and electromyography sensors. We investigate the performance of two different classification algorithms in this context: linear discriminant analysis and k-Nearest Neighbors (k-NN) using various distance metrics. Using the k-NN classifier and windowed dynamic time …
Using Genetic Algorithms To Evolve Artificial Neural Networks, William T. Kearney
Using Genetic Algorithms To Evolve Artificial Neural Networks, William T. Kearney
Honors Theses
This paper demonstrates that neuroevolution is an effective method to determine an optimal neural network topology. I provide an overview of the NeuroEvolution of Augmenting Topologies (NEAT) algorithm, and describe how unique characteristics of this algorithm solve various problem inherent to neuroevolution (namely the competing conventions problem and the challenges associated with protecting topological innovation). Parallelization is shown to greatly speed up efficiency, further reinforcing neuroevolution as a potential alternative to traditional backpropagation. I also demonstrate that appropriate parameter selection is critical in order to efficiently converge to an optimal topology. Lastly, I produce an example solution to a medical …