Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Publication
- Publication Type
Articles 1 - 12 of 12
Full-Text Articles in Physical Sciences and Mathematics
Computing The Rank Of Braids, Justin Meiners
Computing The Rank Of Braids, Justin Meiners
Theses and Dissertations
We describe a method for computing rank (and determining quasipositivity) in the free group using dynamic programming. The algorithm is adapted to computing upper bounds on the rank for braids. We test our method on a table of knots by identifying quasipositive knots and calculating the ribbon genus. We consider the possibility that rank is not theoretically computable and prove some partial results that would classify its computational complexity. We then present a method for effectively brute force searching band presentations of small rank and conjugate length.
Increasing The Computational Efficiency Of Combinatoric Searches, Wiley Spencer Morgan
Increasing The Computational Efficiency Of Combinatoric Searches, Wiley Spencer Morgan
Theses and Dissertations
A new algorithm for the enumeration of derivative superstructures of a crystal is presented. The algorithm will help increase the efficiency of computational material design methods such as cluster expansion by increasing the size and diversity of the types of systems that can be modeled. Modeling potential alloys requires the exploration of all possible configurations of atoms. Additionally, modeling the thermal properties of materials requires knowledge of the possible ways of displacing the atoms. One solution to finding all symmetrically unique configurations and displacements is to generate the complete list of possible configurations and remove those that are symmetrically equivalent. …
The Bioluminescence Heterozygous Genome Assembler, Jared Calvin Price
The Bioluminescence Heterozygous Genome Assembler, Jared Calvin Price
Theses and Dissertations
High-throughput DNA sequencing technologies are currently revolutionizing the fields of biology and medicine by elucidating the structure and function of the components of life. Modern DNA sequencing machines typically produce relatively short reads of DNA which are then assembled by software in an attempt to produce a representation of the entire genome. Due to the complex structure of all but the smallest genomes, especially the abundant presence of exact or almost exact repeats, all genome assemblers introduce errors into the final sequence and output a relatively large set of contigs instead of full-length chromosomes (a contig is a DNA sequence …
Generating Derivative Structures From Multilattices: Algorithm And Application To Hcp Alloys, Gus L. W. Hart, Rodney W. Forcade
Generating Derivative Structures From Multilattices: Algorithm And Application To Hcp Alloys, Gus L. W. Hart, Rodney W. Forcade
Faculty Publications
We present an algorithm for generating all derivative superstructures of a nonprimitive parent lattice. The algorithm has immediate application in important materials design problems such as modeling hexagonal-close-packed (hcp) alloys. Extending the work of Hart and Forcade [Phys. Rev. B 77, 224115 (2008)] (which applies only to Bravais lattices), this approach applies to arbitrary multilattices. The algorithm enumerates superlattices and atomic configurations using permutation groups rather than direct geometric comparisons. The key concept is to use the quotient group associated with each superlattice to determine all unique atomic configurations. The algorithm is very efficient; the run time scales linearly with …
Algorithm For Generating Derivative Structures, Gus L. W. Hart, Rodney W. Forcade
Algorithm For Generating Derivative Structures, Gus L. W. Hart, Rodney W. Forcade
Faculty Publications
We present an algorithm for generating all derivative superstructures--for arbitrary parent structures and for any number of atom types. This algorithm enumerates superlattices and atomic configurations in a geometry-independent way. The key concept is to use the quotient group associated with each superlattice to determine all unique atomic configurations. The run time of the algorithm scales linearly with the number of unique structures found.
Improving Performance Of The Filtered-X Least Mean Square Algorithm For Active Control Of Noise Contatining Multiple Quasi-Stationary Tones, Stephan P. Lovstedt
Improving Performance Of The Filtered-X Least Mean Square Algorithm For Active Control Of Noise Contatining Multiple Quasi-Stationary Tones, Stephan P. Lovstedt
Theses and Dissertations
The Filtered-X Least-Mean-Square (FXLMS) algorithm is widely used in active noise control due to its robustness, simplicity, and ability to be implemented in real time. In a feedforward implementation of the FXLMS algorithm, a reference signal that is highly correlated with the noise to be controlled is filtered with an estimate of the transfer function of the secondary path. The convergence characteristics of the FXLMS algorithm have been well studied. A convergence parameter is used to optimize the convergence of the algorithm. However, the optimal value for the convergence parameter is frequency dependent. Thus for noise containing multiple tones at …
Simulation And Visualization Of Environments With Multidimensional Time, Luther A. Tychonievich
Simulation And Visualization Of Environments With Multidimensional Time, Luther A. Tychonievich
Theses and Dissertations
This work introduces the notion of computational hypertime, or the simulation and visualization of hypothetical environments possessing multidimensional time. An overview of hypertime is provided,including an intuitive visualization paradigm and a discussion of the failure of common simulation techniques when extended to include multidimensional time. A condition for differential equations describing hypertime motion to be amenable to standard time-iterative simulation techniques is provided,but is not satisfied by any known model of physics. An alternate simulation algorithm involving iterative refinement of entire equations of motion is presented,with an example implementation to solve elastic collisions in hypertime. An artificial intelligence algorithm for …
Limitations And Extensions Of The Wolf-Phc Algorithm, Philip R. Cook
Limitations And Extensions Of The Wolf-Phc Algorithm, Philip R. Cook
Theses and Dissertations
Policy Hill Climbing (PHC) is a reinforcement learning algorithm that extends Q-learning to learn probabilistic policies for multi-agent games. WoLF-PHC extends PHC with the "win or learn fast" principle. A proof that PHC will diverge in self-play when playing Shapley's game is given, and WoLF-PHC is shown empirically to diverge as well. Various WoLF-PHC based modifications were created, evaluated, and compared in an attempt to obtain convergence to the single shot Nash equilibrium when playing Shapley's game in self-play without using more information than WoLF-PHC uses. Partial Commitment WoLF-PHC (PCWoLF-PHC), which performs best on Shapley's game, is tested on other …
An Improved Distance Heuristic Function For Directed Software Model Checking, Eric G. Mercer, Neha Rungta
An Improved Distance Heuristic Function For Directed Software Model Checking, Eric G. Mercer, Neha Rungta
Faculty Publications
State exploration in directed software model checking is guided using a heuristic function to move states near errors to the front of the search queue. Distance heuristic functions rank states based on the number of transitions needed to move the current program state into an error location. Lack of calling context information causes the heuristic function to underestimate the true distance to the error; however, inlining functions at call sites in the control flow graph to capture calling context leads to an exponential growth in the computation. This paper presents a new algorithm that implicitly inlines functions at call sites …
Edge Inference For Image Interpolation, Bryan S. Morse, Neil Toronto, Dan A. Ventura
Edge Inference For Image Interpolation, Bryan S. Morse, Neil Toronto, Dan A. Ventura
Faculty Publications
Image interpolation algorithms try to fit a function to a matrix of samples in a "natural-looking" way. This paper presents edge inference, an algorithm that does this by mixing neural network regression with standard image interpolation techniques. Results on gray level images are presented, and it is demonstrated that edge inference is capable of producing sharp, natural-looking results. A technique for reintroducing noise is given, and it is shown that, with noise added using a bicubic interpolant, edge inference can be regarded as a generalization of bicubic interpolation. Extension into RGB color space and additional applications of the algorithm are …
An Exposition Of The Deterministic Polynomial-Time Primality Testing Algorithm Of Agrawal-Kayal-Saxena, Robert Lawrence Anderson
An Exposition Of The Deterministic Polynomial-Time Primality Testing Algorithm Of Agrawal-Kayal-Saxena, Robert Lawrence Anderson
Theses and Dissertations
I present a thorough examination of the unconditional deterministic polynomial-time algorithm for determining whether an input number is prime or composite proposed by Agrawal, Kayal and Saxena in their paper [1]. All proofs cited have been reworked with full details for the sake of completeness and readability.
Prioritized Soft Constraint Satisfaction: A Qualitative Method For Dynamic Transport Selection In Heterogeneous Wireless Environments, Heidi R. Duffin, Michael A. Goodrich, Charles D. Knutson
Prioritized Soft Constraint Satisfaction: A Qualitative Method For Dynamic Transport Selection In Heterogeneous Wireless Environments, Heidi R. Duffin, Michael A. Goodrich, Charles D. Knutson
Faculty Publications
This paper presents Prioritized Soft Constraint Satisfaction (PSCS), a novel approach to selecting the “best” transport in dynamic wireless transport switching systems. PSCS maintains a satisfying connection to another endpoint by choosing transports based on a user-established range of preferences and priority for criteria such as speed, power, range and cost. Additionally, feedback is provided regarding tradeoffs among the criteria, thus enabling the user to adjust inputs according to the capabilities of the system. We also recommend guidelines for setting preferences and priorities.