Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 30 of 43

Full-Text Articles in Physical Sciences and Mathematics

Analysis Of Music Genre Clustering Algorithms, Samuel Walter Stern Aug 2021

Analysis Of Music Genre Clustering Algorithms, Samuel Walter Stern

Theses and Dissertations

Classification and clustering of music genres has become an increasingly prevalent focusin recent years, prompting a push for research into relevant algorithms. The most successful algorithms have typically applied the Naive Bayes or k-Nearest Neighbors algorithms, or used Neural Networks to perform classification. This thesis seeks to investigate the use of unsupervised clustering algorithms such as K-Means or Hierarchical clustering, and establish their usefulness in comparison to or conjunction with established methods.


Algorithmic Robot Design: Label Maps, Procrustean Graphs, And The Boundary Of Non-Destructiveness, Shervin Ghasemlou Jul 2020

Algorithmic Robot Design: Label Maps, Procrustean Graphs, And The Boundary Of Non-Destructiveness, Shervin Ghasemlou

Theses and Dissertations

This dissertation is focused on the problem of algorithmic robot design. The process of designing a robot or a team of robots that can reliably accomplish a task in an environment requires several key elements. How the problem is formulated can play a big role in the design process. The ability of the model to correctly reflect the environment, the events, and different pieces of the problem is crucial. Another key element is the ability of the model to show the relationship between different designs of a single system. These two elements can enable design algorithms to navigate through the …


The Non-Mechanical Beam Steering Of Light In Reflective Inverse Diffusion, Eric K. Nagamine Mar 2019

The Non-Mechanical Beam Steering Of Light In Reflective Inverse Diffusion, Eric K. Nagamine

Theses and Dissertations

Wavefront shaping is a technique that uses spatial light modulators to conjugate the phase of light incident on a rough surface, such that the light will refocus after reflection. This refocusing effect is called reflective inverse diffusion. There currently are two different approaches used to achieve reflective inverse diffusion: iterative methods and matrix methods. Iterative methods find one phase mask which allows for reflected light to be focused at a single, specific position, with results that are immediately available and continuously improving. Matrix methods calculate the complex matrix which describes the rough surface and allows for reflected light to be …


Pulse Height Spectra Analysis Of A Neutron Energy Tuning Assembly, Jason R. Stickney Mar 2018

Pulse Height Spectra Analysis Of A Neutron Energy Tuning Assembly, Jason R. Stickney

Theses and Dissertations

An energy tuning assembly (ETA) was previously designed and built for the purpose of irradiating samples with a combination of a thermonuclear and a prompt fission neutron spectrum. Initial research was performed to characterize the performance of the ETA at the Lawrence Berkeley National Laboratory 88-Inch Cyclotron using 33 MeV deuteron breakup on tantalum as the neutron source. This research analyzes detector responses collected from three EJ-309 detectors used to characterize the ETA generated neutron field. A signal processing chain was developed to reduce the full waveform data into a pulse height spectrum. The primary goal was to develop a …


Forecasting Lightning Initiation Utilizing Dual-Polarization Radar Parameters Over Washington, D.C., Sarah A. Olsen Mar 2018

Forecasting Lightning Initiation Utilizing Dual-Polarization Radar Parameters Over Washington, D.C., Sarah A. Olsen

Theses and Dissertations

Accurate forecasts of thunderstorms are vital to space launch, aviation, and public safety. Prior studies by Woodard (2011), Thurmond (2014), and Travis (2015) show that dual-polarization radar can be utilized to identify the presence of hydrometeors necessary for cloud charging. These studies emphasized that a combination of radar reflectivity (Z) and differential reflectivity (ZDR) predictors have the potential to improve forecast skill of lightning initiation over methods that rely on Z alone (Roeder and Pinder, 1998; Yang and King, 2010). Travis (2015) discovered two parameters, when used together, produced the best results: Z ≥ 36.5 dBZ and ZDR …


Partitions Of Finite Frames, James Michael Rosado May 2016

Partitions Of Finite Frames, James Michael Rosado

Theses and Dissertations

An open question stated by Marcus, Spielman, and Srivastava [10] asks "whether one can design an efficient algorithm to find the partitions guaranteed by Corollary 1.5." This corollary states that given a set of vectors in C whose outer products sum to the identity there exists a partition of these vectors such that norms of the outer-product sums of each subset satisfy an inequality bound. Here particular types of vector sets called finite frames are analyzed and constructed to satisfy the inequality described in Corollary 1.5. In this thesis, rigorous proofs and formulations of outer-product norms are utilized to find …


Evaluating And Improving The Efficiency Of Software And Algorithms For Sequence Data Analysis, Hugh L. Eaves Jan 2016

Evaluating And Improving The Efficiency Of Software And Algorithms For Sequence Data Analysis, Hugh L. Eaves

Theses and Dissertations

With the ever-growing size of sequence data sets, data processing and analysis are an increasingly large portion of the time and money spent on nucleic acid sequencing projects. Correspondingly, the performance of the software and algorithms used to perform that analysis has a direct effect on the time and expense involved. Although the analytical methods are widely varied, certain types of software and algorithms are applicable to a number of areas. Targeting improvements to these common elements has the potential for wide reaching rewards. This dissertation research consisted of several projects to characterize and improve upon the efficiency of several …


Quasinovo: Algorithms For De Novo Peptide Sequencing, James Paul Cleveland Jan 2013

Quasinovo: Algorithms For De Novo Peptide Sequencing, James Paul Cleveland

Theses and Dissertations

High-throughput proteomics analysis involves the rapid identification and characterization of large sets of proteins in complex biological samples. Tandem mass spectrometry (MS/MS) has become the leading approach for the experimental identification of proteins. Accurate analysis of the data produced is a computationally challenging process that relies on a complex understanding of molecular dynamics, signal processing, and pattern classification. In this work we address these modeling and classification problems, and introduce an additional data-driven evolutionary information source into the analysis pipeline.

The particular problem being solved is peptide sequencing via MS/MS. The objective in solving this problem is to decipher the …


Determining Angular Frequency From A Video With A Generalized Fast Fourier Transform, Lindsay N. Smith Mar 2012

Determining Angular Frequency From A Video With A Generalized Fast Fourier Transform, Lindsay N. Smith

Theses and Dissertations

Suppose we are given a video of a rotating object and suppose we want to determine the rate of rotation solely from the video itself and its known frame rate. In this thesis, we present a new mathematical operator called the Geometric Sum Transform (GST) that can help one determine the angular frequency of the object in question. The GST is a generalization of the discrete Fourier transform (DFT) and as such, the two transforms have much in common. However, whereas the DFT is applied to a sequence of scalars, the GST can be applied to a sequence of vectors. …


A Multi-Objective Approach To A Bipartite Assignment Matching Problem Using Weighted Values From Multiple Contraints, Greg S. Jeong Mar 2010

A Multi-Objective Approach To A Bipartite Assignment Matching Problem Using Weighted Values From Multiple Contraints, Greg S. Jeong

Theses and Dissertations

US Air Force recruiters routinely assign new recruits to available jobs every month. The goal is to find the best assignments in an efficient manner. Although this problem is modeled as a bipartite assignment matching problem, it is not new to the field of Operations Research. This research presents a new approach to solve assignment matching problems given multiple side constraints. Using two multi-criteria optimization techniques, lexicographic optimization and the elastic constraint method, the assignment matching algorithm efficiently produces an optimal solution in a fraction of the time currently spent. This approach is demonstrated in assigning new USAF recruits to …


Effect Of Advanced Synthetically Enhanced Detector Resolution Algorithm On Specificity And Sensitivity Of Portable High Purity Germanium Gamma Detector Spectra, Latosha M. Bell Jun 2009

Effect Of Advanced Synthetically Enhanced Detector Resolution Algorithm On Specificity And Sensitivity Of Portable High Purity Germanium Gamma Detector Spectra, Latosha M. Bell

Theses and Dissertations

The ability to identify special nuclear material is one of the necessary prevention mechanisms for preventing proliferation of special nuclear materials. Additionally, if a nuclear event were to occur, information about the nuclear material used may be extracted from gamma spectra, provided it is obtained quickly and accurately. This can be made possible with the use of the exceptional resolution of the HPGe detector. This experiment applied the Advanced Synthetically Enhanced Detector Resolution Algorithm (ASEDRA) to a portable HPGe detector's spectra, to investigate whether improvements in specificity and sensitivity can be obtained. This method has been used to improve performance …


Blind Deconvolution Through Polarization Diversity Of Long Exposure Imagery, Steven P. James Mar 2009

Blind Deconvolution Through Polarization Diversity Of Long Exposure Imagery, Steven P. James

Theses and Dissertations

The purpose of the algorithm developed in this thesis was to create a post processing method that could resolve objects at low signal levels using polarization diversity and no knowledge of the atmospheric seeing conditions. The process uses a two-channel system, one unpolarized image and one linearly polarized image, in a GEM algorithm to reconstruct the object. Previous work done by Strong showed that a two-channel system using polarization diversity on short exposure imagery could produce images up to twice the diffraction limit. In this research, long exposure images were simulated and a simple Kolmogorov model used. This allowed for …


Range Estimation Algorithm Comparison In 3-D Flash Ladar Data, Steven P. Jordan Mar 2009

Range Estimation Algorithm Comparison In 3-D Flash Ladar Data, Steven P. Jordan

Theses and Dissertations

Range estimation algorithms have been applied to Laser Detection and Ranging (LADAR) data to test for accuracy and precision. Data was acquired from Matlab® simulations and an experiment using the Advanced Scientific Concepts 3-D flash LADAR camera. Simulated LADAR data was based on a Gaussian pulse shape model with Poisson noise added. Simulations were performed to test range estimation algorithm performance with respect to waveform position within the range gate. The effectiveness of each algorithm is presented in terms of its average root mean square error and standard deviation in 1000 trials. The measured data experiment examined the effectiveness of …


On Graph Isomorphism And The Pagerank Algorithm, Christopher J. Augeri Aug 2008

On Graph Isomorphism And The Pagerank Algorithm, Christopher J. Augeri

Theses and Dissertations

A graph is a key construct for expressing relationships among objects, such as the radio connectivity between nodes contained in an unmanned vehicle swarm. The study of such networks may include ranking nodes based on importance, for example, by applying the PageRank algorithm used in some search engines to order their query responses. The PageRank values correspond to a unique eigenvector typically computed by applying the power method, an iterative technique based on matrix multiplication. The first new result described herein is a lower bound on the execution time of the PageRank algorithm that is derived by applying standard assumptions …


Hardware Algorithm Implementation For Mission Specific Processing, Jason W. Shirley Mar 2008

Hardware Algorithm Implementation For Mission Specific Processing, Jason W. Shirley

Theses and Dissertations

There is a need to expedite the process of designing military hardware to stay ahead of the adversary. The core of this project was to build reusable, synthesizeable libraries to make this a possibility. In order to build these libraries, Matlab® commands and functions, such as Conv2, Round, Floor, Pinv, etc., had to be converted into reusable VHDL modules. These modules make up reusable libraries for the Mission Specific Process (MSP) which will support AFRL/RY. The MSP allows the VLSI design process to be completed in a mere matter of days or months using an FPGA or ASIC design, as …


Statistical Removal Of Shadow For Applications To Gait Recognition, Brian D. Hockersmith Mar 2008

Statistical Removal Of Shadow For Applications To Gait Recognition, Brian D. Hockersmith

Theses and Dissertations

The purpose of this thesis is to mathematically remove the shadow of an individual on video. The removal of the shadow will aid in the rendering of higher quality binary silhouettes than previously allowed. These silhouettes will allow researchers studying gait recognition to work with silhouettes unhindered by unrelated data. The thesis begins with the analysis of videos of solid colored backgrounds. A formulation of the effect of shadow on specified colors will aid in the derivation of a hypothesis test to remove an individual’s shadow. Video of an individual walking normally, perpendicular to the camera will be utilized to …


Algorithms For White-Box Obfuscation Using Randomized Subcircuit Selection And Replacement, Kenneth E. Norman Mar 2008

Algorithms For White-Box Obfuscation Using Randomized Subcircuit Selection And Replacement, Kenneth E. Norman

Theses and Dissertations

Software protection remains an active research area with the goal of preventing adversarial software exploitation such as reverse engineering, tampering, and piracy. Heuristic obfuscation techniques lack strong theoretical underpinnings while current theoretical research highlights the impossibility of creating general, efficient, and information theoretically secure obfuscators. In this research, we consider a bridge between these two worlds by examining obfuscators based on the Random Program Model (RPM). Such a model envisions the use of program encryption techniques which change the black-box (semantic) and white-box (structural) representations of underlying programs. In this thesis we explore the possibilities for white-box transformation. Under an …


A New Application Of The Channel Packet Method For Low Energy 1-D Elastic Scattering, Clint M. Zeringue Sep 2006

A New Application Of The Channel Packet Method For Low Energy 1-D Elastic Scattering, Clint M. Zeringue

Theses and Dissertations

An algorithm is presented which uses the channel packet method (CPM) to simulate low-energy, wave-packet propagation and compute S-matrix elements. A four-by-four matrix containing the momentum, expansion coefficients of the reactants and products is introduced to account for initial and final states having both positive and negative momentum. The approach does not consider scattering from one side or the other, rather it considers both incoming and outgoing wave packets from the left and right simultaneously. Therefore, during one simulation all four S-matrix elements, and elements, S+k,-K, S-k, +k, S+k, +k and S-k,-k are computed. …


Type Ii Quantum Computing Algorithm For Computational Fluid Dynamics, James A. Scoville Mar 2006

Type Ii Quantum Computing Algorithm For Computational Fluid Dynamics, James A. Scoville

Theses and Dissertations

An algorithm is presented to simulate fluid dynamics on a three qubit type II quantum computer: a lattice of small quantum computers that communicate classical information. The algorithm presented is called a three qubit factorized quantum lattice gas algorithm. It is modeled after classical lattice gas algorithms which move virtual particles along an imaginary lattice and change the particles’ momentums using collision rules when they meet at a lattice node. Instead of moving particles, the quantum algorithm presented here moves probabilities, which interact via a unitary collision operator. Probabilities are determined using ensemble measurement and are moved with classical communications …


Toward The Static Detection Of Deadlock In Java Software, Jose E. Fadul Mar 2006

Toward The Static Detection Of Deadlock In Java Software, Jose E. Fadul

Theses and Dissertations

Concurrency is the source of many real-world software reliability and security problems. Concurrency defects are difficult to detect because they defy conventional software testing techniques due to their non-local and non-deterministic nature. We focus on one important aspect of this problem: static detection of the possibility of deadlock - a situation in which two or more processes are prevented from continuing while each waits for resources to be freed by the continuation of the other. This thesis proposes a flow-insensitive interprocedural static analysis that detects the possibility that a program can deadlock at runtime. Our analysis proceeds in two steps. …


Optimization Of A Multi-Echelon Repair System Via Generalized Pattern Search With Ranking And Selection: A Computational Study, Derek D. Tharaldson Mar 2006

Optimization Of A Multi-Echelon Repair System Via Generalized Pattern Search With Ranking And Selection: A Computational Study, Derek D. Tharaldson

Theses and Dissertations

With increasing developments in computer technology and available software, simulation is becoming a widely used tool to model, analyze, and improve a real world system or process. However, simulation in itself is not an optimization approach. Common optimization procedures require either an explicit mathematical formulation or numerous function evaluations at improving iterative points. Mathematical formulation is generally impossible for problems where simulation is relevant, which are characteristically the types of problems that arise in practical applications. Further complicating matters is the variability in the simulation response which can cause problems in iterative techniques using the simulation model as a function …


Multiframe Shift Estimation, Stephen A. Bruckart Mar 2006

Multiframe Shift Estimation, Stephen A. Bruckart

Theses and Dissertations

The purpose of this research was to develop a fundamental framework for a new approach to multiframe translational shift estimation in image processing. This thesis sought to create a new multiframe shift estimator, to theoretically prove and experimentally test key properties of it, and to quantify its performance according to several metrics. The new estimator was modeled successfully and was proven to be an unbiased estimator under certain common image noise conditions. Furthermore its performance was shown to be superior to the cross correlation shift estimator, a robust estimator widely used in similar image processing cases, according to several criteria. …


A Monocular Vision Based Approach To Flocking, Brian Kirchner Mar 2006

A Monocular Vision Based Approach To Flocking, Brian Kirchner

Theses and Dissertations

Flocking is seen in nature as a means for self protection, more efficient foraging, and other search behaviors. Although much research has been done regarding the application of this principle to autonomous vehicles, the majority of the research has relied on GPS information, broadcast communication, an omniscient central controller, or some other form of "global" knowledge. This approach, while effective, has serious drawbacks, especially regarding stealth, reliability, and biological grounding. This research effort uses three Pioneer P2-AT8 robots to achieve flocking behavior without the use of global knowledge. The sensory inputs are limited to two cameras, offset such that the …


An Estimation Theory Approach To Detection And Ranging Of Obscured Targets In 3-D Ladar Data, Charles R. Burris Mar 2006

An Estimation Theory Approach To Detection And Ranging Of Obscured Targets In 3-D Ladar Data, Charles R. Burris

Theses and Dissertations

The purpose of this research is to develop an algorithm to detect obscured images in 3-D LADAR data. The real data used for this research was gathered using a FLASH LADAR system under development at AFRL/SNJM. The system transmits light with a wavelength of 1.55 micrometers and produces 20 128 X 128 temporally resolved images from the return pulse separated by less than 2 nanoseconds in time. New algorithms for estimating the range to a target in 3-D FLASH LADAR data were developed. Results from processing real data are presented and compared to the traditional correlation receiver for extracting ranges …


Pattern Search Ranking And Selection Algorithms For Mixed-Variable Optimization Of Stochastic Systems, Todd A. Sriver Sep 2004

Pattern Search Ranking And Selection Algorithms For Mixed-Variable Optimization Of Stochastic Systems, Todd A. Sriver

Theses and Dissertations

A new class of algorithms is introduced and analyzed for bound and linearly constrained optimization problems with stochastic objective functions and a mixture of design variable types. The generalized pattern search (GPS) class of algorithms is extended to a new problem setting in which objective function evaluations require sampling from a model of a stochastic system. The approach combines GPS with ranking and selection (R&S) statistical procedures to select new iterates. The derivative-free algorithms require only black-box simulation responses and are applicable over domains with mixed variables (continuous, discrete numeric, and discrete categorical) to include bound and linear constraints on …


Shortest Path Problems In A Stochastic And Dynamic Environment, Jae Il Cho Mar 2003

Shortest Path Problems In A Stochastic And Dynamic Environment, Jae Il Cho

Theses and Dissertations

In this research, we consider stochastic and dynamic transportation network problems. Particularly, we develop a variety of algorithms to solve the expected shortest path problem in addition to techniques for computing the total travel time distribution along a path in the network. First, we develop an algorithm for solving an independent expected shortest path problem. Next, we incorporate the inherent dependencies along successive links in two distinct ways to find the expected shortest path. Since the dependent expected shortest path problem cannot be solved with traditional deterministic approaches, we develop a heuristic based on the K-shortest path algorithm for this …


Translation And Rotation Invariant Multiscale Image Registration, Jennifer L. Manfra Mar 2002

Translation And Rotation Invariant Multiscale Image Registration, Jennifer L. Manfra

Theses and Dissertations

The most recent research involved registering images in the presence of translations and rotations using one iteration of the redundant discrete wavelet transform. We extend this work by creating a new multiscale transform to register two images with translation or rotation differences, independent of scale differences between the images. Our two-dimensional multiscale transform uses an innovative combination of lowpass filtering and the continuous wavelet transform to mimic the two-dimensional redundant discrete wavelet transform. This allows us to obtain multiple subbands at various scales while maintaining the desirable properties of the redundant discrete wavelet transform. Whereas the discrete wavelet transform produces …


An Efficient Gps Position Determination Algorithm, Carlos R. Colon Mar 1999

An Efficient Gps Position Determination Algorithm, Carlos R. Colon

Theses and Dissertations

The use of detect, or closed-form solutions of the trilateration equations used to obtain the position fix in GPS receivers is investigated. The paper is concerned with the development of an efficient new position determination algorithm that uses the closed-form solution of the trilateration equations and works in the presence of pseudorange measurement noise and for an arbitrary number of satellites. in addition, an initial position guess is not required and good estimation performance is achieved even under high GDOP conditions. A two step GPS position determination algorithm which 1) entails the solution of a linear regression problem and, 2) …


Automatic Target Cueing Of Hyperspectral Image Data, Terry A. Wilson Sep 1998

Automatic Target Cueing Of Hyperspectral Image Data, Terry A. Wilson

Theses and Dissertations

Modern imaging sensors produce vast amounts data, overwhelming human analysts. One such sensor is the Airborne Visible and Infrared Imaging Spectrometer (AVIRIS) hyperspectral sensor. The AVIRIS sensor simultaneously collects data in 224 spectral bands that range from 0.4µm to 2.5µm in approximately 10nm increments, producing 224 images, each representing a single spectral band. Autonomous systems are required that can fuse "important" spectral bands and then classify regions of interest if all of this data is to be exploited. This dissertation presents a comprehensive solution that consists of a new physiologically motivated fusion algorithm and a novel Bayes optimal self-architecting classifier …


Representations, Approximations, And Algorithms For Mathematical Speech Processing, Laura R. Suzuki Jun 1998

Representations, Approximations, And Algorithms For Mathematical Speech Processing, Laura R. Suzuki

Theses and Dissertations

Representing speech signals such that specific characteristics of speech are included is essential in many Air Force and DoD signal processing applications. A mathematical construct called a frame is presented which captures the important time-varying characteristic of speech. Roughly speaking, frames generalize the idea of an orthogonal basis in a Hilbert space, Specific spaces applicable to speech are L2(R) and the Hardy spaces Hp(D) for p> 1 where D is the unit disk in the complex plane. Results are given for representations in the Hardy spaces involving Carleson's inequalities (and its extensions), …