Numerical Analysis and Scientific Computing Commons^™

Scalable Parallel-In-Time Integration For Equations Of Motion, Nathan W. Chapman

All Master's Theses

Physical simulations always need to balance accuracy and run-time. This work implements the Parareal Algorithm using graphics processing units across a distributed system to accurately simulate time-dependent physics while attempting to minimize runtime. Data-transfer latency is identified as the primary bottleneck, for which mitigation methods are provided. Benchmarks comparing single-GPU and distributed implementations on a spectrum of coarse and fine discretizations are analyzed.

Adaptive Neh With Constrained Nearest Neighbor Subtours For The Electric Vehicle Routing Problem With Time Windows, Andrew Struthers

All Master's Theses

The development of electric vehicles is currently considered one of the most innovative areas in manufacturing. Largely driven by the desire to reduce greenhouse emissions, electric vehicles are seen as a viable alternative to internal combustion engine cars. Starting from consumer cars, a dedicated effort is being made to translate this into commercial vehicles for freight and delivery. This research introduces a novel adaptive Nawaz, Enscore, Ham (NEH) algorithm with constrained nearest neighbor subtour (NEH-NN). This algorithm is tested on the standard benchmark problems in literature and used as a seed solution for the Genetic Algorithm (GA). The performance and …

Automated Morgan Keenan Classification Of Observed Stellar Spectra Collected By The Sloan Digital Sky Survey Using A Single Classifier, Michael J. Brice, Răzvan Andonie

All Faculty Scholarship for the College of the Sciences

The classification of stellar spectra is a fundamental task in stellar astrophysics. Stellar spectra from the Sloan Digital Sky Survey are applied to standard classification methods, k-nearest neighbors and random forest, to automatically classify the spectra. Stellar spectra are high dimensional data and the dimensionality is reduced using astronomical knowledge because classifiers work in low dimensional space. These methods are utilized to classify the stellar spectra into a complete Morgan Keenan classification (spectral and luminosity) using a single classifier. The motion of stars (radial velocity) causes machine-learning complications through the feature matrix when classifying stellar spectra. Due to the nature …

Classification Of Stars From Redshifted Stellar Spectra Utilizing Machine Learning, Michael J. Brice

All Master's Theses

The classification of stellar spectra is a fundamental task in stellar astrophysics. There have been many explorations into the automated classification of stellar spectra but few that involve the Sloan Digital Sky Survey (SDSS). Stellar spectra from the SDSS are applied to standard classification methods such as K-Nearest Neighbors, Random Forest, and Support Vector Machine to automatically classify the spectra. Stellar spectra are high dimensional data and the dimensionality is reduced using standard Feature Selection methods such as Chi-Squared and Fisher score and with domain-specific astronomical knowledge because classifiers work in low dimensional space. These methods are utilized to classify …

Data Visualization And Classification Of Artificially Created Images, Dmytro Dovhalets

All Master's Theses

Visualization of multidimensional data is a long-standing challenge in machine learning and knowledge discovery. A problem arises as soon as 4-dimensions are introduced since we live in a 3-dimensional world. There are methods out there which can visualize multidimensional data, but loss of information and clutter are still a problem. General Line Coordinates (GLC) can losslessly project n-dimensional data in 2- dimensions. A new method is introduced based on GLC called GLC-L. This new method can do interactive visualization, dimension reduction, and supervised learning. One of the applications of GLC-L is transformation of vector data into image data. This novel …

Spike-Based Classification Of Uci Datasets With Multi-Layer Resume-Like Tempotron, Sami Abdul-Wahid

All Master's Theses

Spiking neurons are a class of neuron models that represent information in timed sequences called ``spikes.'' Though predominantly used in neuro-scientific investigations, spiking neural networks (SNN) can be applied to machine learning problems such as classification and regression. SNN are computationally more powerful per neuron than traditional neural networks. Though training time is slow on general purpose computers, spike-based hardware implementations are faster and have shown capability for ultra-low power consumption. Additionally, various SNN training algorithms have achieved comparable performance with the State of the Art on the Fisher Iris dataset. Our main contribution is a software implementation of the …

Applying Machine Learning To Predict Stock Value, Joseph Lemley, Yishui Liu, Dipayan Banik, Sadia Afroze

Symposium Of University Research and Creative Expression (SOURCE)

The purpose of this study was to compare machine learning techniques for short term stock prediction and evaluate their effectiveness. Stock value analysis is an important element of modern economies. The ability to predict future stock prices from historical price values is of tremendous interest to investors. The prediction of stock performance is still an unsolved problem with a variety of techniques being proposed. Real stock values are affected by many elements, some of which cannot be measured. In this study, we limit our analysis to stock closing prices. We use these prices to predict the future stock value using …

Intentional Recruiting: Using Business Intelligence, Data Mining, And Predictive Analytics To Identify Characteristics Of Those Students Who Enroll, And Graduate; In Support Of University Enrollment Management, Stephanie L. Harris

All Master's Theses

Using business intelligence (BI) and archival data from a division II, public comprehensive, university in Washington State, the researcher identified specific characteristics of those students who enrolled, persisted and completed to undergraduate degree attainment. These characteristics created an applicant profile to be used in future enrollment management activities for intentional recruiting, while the predictive models for enrollment and completion inform administration to improve tuition revenue planning and budgeting, and to forecast future enrollment yield.

Computing Mountain Passes, Garret Bolton

All Master's Theses

There are many equations in the applied sciences whose solutions correspond to critical points of a function describing specific phenomenon. For example, molecules have a unique potential energy, and one stable conformation of a molecule can be thought of as a low point on a potential energy surface. Finding the mountain pass point between two confirmations of a molecule is analogous to finding the energy of a biological structure that is an intermediate conformation between two stable states. Mathematicians have developed theorems and abstract techniques to find these mountain pass points. However, using such approaches is often difficult, especially because …

A Conservation And Rigidity Based Method For Detecting Critical Protein Residues, Bahar Akbal-Delibas, Filip Jagodzinski, Nurit Haspel

All Faculty Scholarship for the College of the Sciences

Background

Certain amino acids in proteins play a critical role in determining their structural stability and function. Examples include flexible regions such as hinges which allow domain motion, and highly conserved residues on functional interfaces which allow interactions with other proteins. Detecting these regions can aid in the analysis and simulation of protein rigidity and conformational changes, and helps characterizing protein binding and docking. We present an analysis of critical residues in proteins using a combination of two complementary techniques. One method performs in-silico mutations and analyzes the protein's rigidity to infer the role of a point substitution to Glycine …