Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 8 of 8
Full-Text Articles in Physical Sciences and Mathematics
Determining Angular Frequency From A Video With A Generalized Fast Fourier Transform, Lindsay N. Smith
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
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 …
On Graph Isomorphism And The Pagerank Algorithm, Christopher J. Augeri
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
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
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 …
A New Application Of The Channel Packet Method For Low Energy 1-D Elastic Scattering, Clint M. Zeringue
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. …
Shortest Path Problems In A Stochastic And Dynamic Environment, Jae Il Cho
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 …
Improved Mathematical Modeling For Gps Based Navigation, Salvatore Nardi
Improved Mathematical Modeling For Gps Based Navigation, Salvatore Nardi
Theses and Dissertations
This thesis is concerned with the development of new closed form GPS position determination algorithms that work in the presence of pseudorange measurement noise. The mathematical derivation of two closed form algorithms, based on stochastic modeling and estimation techniques, is presented. The algorithms provide an estimate of the GPS solution parameters (viz., the user position and the user clock bias) as well as the estimation error covariance. The experimental results are analyzed by comparison to the baseline results from the conventional Iterative Least Squares (ILS) algorithm. In typical GPS scenarios, the closed form algorithms are extremely sensitive to noise, making …