Theory and Algorithms Commons^™

A Virtual-Reality-Based Dental Simulator For Endodontics With Automated Formative Feedback, Yousef Salah Abo El Ela

Theses and Dissertations

Advancements in virtual reality (VR) and haptic technology are transforming the landscape of medical and dental education, offering new avenues for safe, immersive, and repeatable training experiences. Within dentistry, endodontics presents unique challenges for preclinical education due to anatomical complexity, limited access to extracted teeth, ethical concerns, and the shortcomings of conventional plastic models. Despite endodontics specific plastic teeth being available, they fall short of replicating the hardness of real extracted teeth, are relatively costly compared to generic plastic teeth, and are ultimately a disposable item which makes them inadequate as a sustainable long-term solution. Extracted teeth do a much …

Towards Sample-Efficient Deep Reinforcement Learning, Guang Yang

Theses and Dissertations

Deep reinforcement learning (DRL), combining reinforcement learning and high-performance function approximations such as deep neural networks (DNN), is a powerful approach to solving complex sequential decision-making problems. However, due to the complex solution space of the sequential decision-making problems and the inefficient design of the DRL algorithms, DRL algorithms usually require a prohibitively large number of data samples to train effective strategies. Consequently, it is difficult to apply these DRL algorithms to complex real-world problems that require high costs to collect a large volume of data samples. This dissertation proposes new mechanisms to address this sample inefficiency issue, realizing sample-efficient …

Evaluating Hybrid Quantum-Classical Models For Image Classification In The Nisq Era, Utku Binkanat

Theses and Dissertations

This thesis presents a systematic empirical evaluation of quantum machine learning performance under noisy intermediate-scale quantum (NISQ) era constraints. Through 670 controlled experiments, it evaluated quantum kernel support vector machines and variational quantum classifiers against classical baselines on MNIST binary and multiclass classification tasks with systematic variation of problem difficulty, feature dimensionality (4, 8 qubits), and training set size (n ∈{100, 250, 400, 500, 2000, 4000}). Statistical rigor was ensured through five random seeds per condition and comprehensive significance testing. During the testing with binary datasets, classical methods (SVM, logistic regression, k-NN, neural networks) achieved 85.9% to 99.6% accuracy with …

Advancing Real-World Implementation Of The Well Optimized Linear Finder (Wolf) High-Speed Atmospheric Turbulence Compensation Method, Timothy Evan Coon

Theses and Dissertations

This dissertation advances the real-world implementation of the Well Optimized Linear Finder (WOLF) method for high-speed Atmospheric Turbulence Compensation (ATC). Atmospheric turbulence introduces phase aberrations into optical wavefronts and degrades image quality in terrestrial imaging systems. Traditional phase diversity methods are computationally intensive and poorly suited to real-time operation. The WOLF method addresses these limitations through a novel, point-wise formulation of the optical transfer function (OTF) as a structured autocorrelation of the generalized pupil function (GPF). This formulation enables the estimation of phase aberrations at individual spatial coordinates with distributed computational complexity.

The research begins by developing a MATLAB-based simulation …

Applications Of The Mathieu Groups And Information Theory In Dna Encoding Functions, Juan C. Nava Jr

Theses and Dissertations

A foundational idea in mathematics lies in breaking down existing components into their bare fundamentals. As evidenced by prime numbers and composites, we learn this idea at an early age. Categorizing these broken-down components into their simplest form allows mathematicians to construct proofs from emergent patterns. John Conway’s Atlas of Finite Groups in the 1990s was particularly concerned with the categorization of structures known as groups. There are certain axioms a group must adhere to, which amount to the retention of symmetry; ultimately a group helps us to better understand symmetric actions performed on a set with a binary operation. …

Intuiting Interaction: Meta-Reasoning And Meta-Learning As Foundations For Intelligent User Interfaces, Jeffrey Hsu

Theses and Dissertations

This research presents MARCO—a cognitive framework for Intelligent User Interfaces that uses meta-reasoning for context-aware adaptation across diverse tasks. It integrates multiple reasoning modules coordinated by a Meta-Cognitive Unit that selects strategies based on evolving demands. Evaluations show MARCO outperforms baselines in reasoning accuracy and computational efficiency.

Advancing Precision And Autonomy In Agriculture And Medical Imaging Through Ai And Computer Visions, Tan-Hanh Pham

Theses and Dissertations

Deep learning has revolutionized numerous fields by enhancing precision, automation, and decision-making capabilities. This dissertation explores its applications in agriculture and medical image processing, introducing novel methodologies to improve accuracy and efficiency in these domains. These fields hold critical societal importance -- agriculture underpins global food security and sustainability, while medical imaging drives advancements in diagnostics and personalized healthcare, both benefiting significantly from data-driven innovations. In agriculture, deep learning is applied to precision spray systems through droplet analysis. Specifically, a generative model is designed to create synthetic droplet images, addressing the challenge of limited training samples, which are expensive …

Towards Visual Inertial Navigation With Fixed Tetrahedral Targets, Joao Leonardo Silva Cotta

Theses and Dissertations

This dissertation presents a robust method for 6DoF position estimation under impaired visual conditions utilizing a minimum 4-point Perspective-n-Point (P4P) solver designed for tetrahedral targets. Using SO(3) × R 3 instead of SE(3), the method uses a Lie group-based formulation to discriminate between rotation and translation, thereby enabling computationally efficient, resource-conscious op- optimization while preserving correct geometric behavior. Designed using the contemporary C++17 library ShomerTarget, the solver is analytically formulated and assessed under pragmatic robotic conditions. Particularly in low-light and high-dynamic environments, experiments on embedded systems, UAVs, and NASA’s Astrobee show that the proposed solver attains enhanced accuracy compared to …

Analyzing And Comparing Refinement Indicators For Rbf-Fd Adaptive Algorithms, Anders R. Johnson

Theses and Dissertations

Recent progress has been made in the development of collocation-based iterative algorithms that approximate solutions to PDEs. These algorithms rely on the ability to identify regions within a domain where a finer discretization is required. Such iterative algorithms are beneficial particularly when solution functions have highly localized behavior. This thesis proposes an indicator for node refinement that is constructed by approximating the forward error. This proposed indicator also helps to establish confidence in the accuracy of a given solution estimate. The proposed error estimator is theoretically examined and compared with contemporary refinement indicators. It is shown that an iterative algorithm, …

Exploratory Data Analysis (Eda) And Predictive Machine Learning (Ml) For Buildings’ Energy Fault Detection, Akshith Nukala

Theses and Dissertations

Building energy load fault detection is a critical challenge in energy usage analysis. It helps uncover energy wastage, machinery/appliance degradation or inefficiency, and failures or faults in buildings’ HVAC (heating, ventilation, and air conditioning) systems. Early identification of machinery failure and energy wastages due to operational maintenance negligence in large sites such as campus buildings is indispensable for achieving energy efficiency. This is crucial for saving patrol and minimizing the response time to restore the building appliances or systems to their optimal state.

Advancements in state-of-the-art AI/ML data-driven algorithms and techniques enabled us to build accurate, efficient and scalable fault …

Exploring Brent-Kung Adders In Balanced Ternary Cmos Logic, Astrea J.C. Rojas

Theses and Dissertations

The modern computer operates on a 64-bit architecture. These devices can store large numbers and precise decimals, but more advanced devices are needed to support progressing technologies every day. A more efficient system with higher speeds and larger operable numbers would be a key to optimization of computation as we know it. The ternary device, operating in base-3, has the potential to be that optimization. However, binary technology has such precedent and research that it is a difficult gap to span to compare the ternary system to the modern binary system. With a more advanced adder and optimized gates using …

Decoding Neural Networks: An Information-Theoretic Guide To Interpretability, Error Analysis And Efficiency, Mackenzie J. Meni

Theses and Dissertations

This dissertation addresses critical challenges in neural network design by leveraging entropy-based techniques to improve model efficiency, interpretability, and bias reduction. Focusing on the unique demands of computer vision applications, particularly object detection and classification for real-time systems, this work introduces a series of innovative methods centered on information theory. At the core of these methods is the Probabilistic Explanations of Entropic Knowledge (PEEK) framework, a tool developed to analyze and visualize entropy distributions across feature maps. PEEK offers insights into information flow within neural networks, making it possible to pinpoint layers that contribute meaningfully to decision-making or identify those …

Graph Coloring Reconfiguration, Reem Mahmoud

Theses and Dissertations

Reconfiguration is the concept of moving between different solutions to a problem by transforming one solution into another using some prescribed transformation rule (move). Given two solutions s₁ and s₂ of a problem, reconfiguration asks whether there exists a sequence of moves which transforms s₁ into s₂. Reconfiguration is an area of research with many contributions towards various fields such as mathematics and computer science.
The k-coloring reconfiguration problem asks whether there exists a sequence of moves which transforms one k-coloring of a graph G into another. A move in this case is a type …

Signings Of Graphs And Sign-Symmetric Signed Graphs, Ahmad Asiri

Theses and Dissertations

In this dissertation, we investigate various aspects of signed graphs, with a particular focus on signings and sign-symmetric signed graphs. We begin by examining the complete graph on six vertices with one edge deleted ($K_6$\textbackslash e) and explore the different ways of signing this graph up to switching isomorphism. We determine the frustration index (number) of these signings and investigate the existence of sign-symmetric signed graphs. We then extend our study to the $K_6$\textbackslash 2e graph and the McGee graph with exactly two negative edges. We investigate the distinct ways of signing these graphs up to switching isomorphism and demonstrate …

Eddy Current Defect Response Analysis Using Sum Of Gaussian Methods, James William Earnest

Theses and Dissertations

This dissertation is a study of methods to automatedly detect and produce approximations of eddy current differential coil defect signatures in terms of a summed collection of Gaussian functions (SoG). Datasets consisting of varying material, defect size, inspection frequency, and coil diameter were investigated. Dimensionally reduced representations of the defect responses were obtained utilizing common existing reduction methods and novel enhancements to them utilizing SoG Representations. Efficacy of the SoG enhanced representations were studied utilizing common Machine Learning (ML) interpretable classifier designs with the SoG representations indicating significant improvement of common analysis metrics.

Bayesian Recurrent Neural Networks For Real Time Object Detection, Stephen Z. Kimatian

Theses and Dissertations

Neural networks have become increasingly popular in real time object detection algorithms. A major concern with these algorithms is their ability to quantify their own uncertainty, leading to many high profile failures. This research proposes three novel real time detection algorithms. The first of leveraging Bayesian convolutional neural layers producing a predictive distribution, the second leveraging predictions from previous frames, and the third model combining these two techniques together. These augmentations seek to mitigate the calibration problem of modern detection algorithms. These three models are compared to the state of the art YOLO architecture; with the strongest contending model achieving …

Air Force Cadet To Career Field Matching Problem, Ian P. Macdonald

Theses and Dissertations

This research examines the Cadet to Air Force Specialty Code (AFSC) Matching Problem (CAMP). Currently, the matching problem occurs annually at the Air Force Personnel Center (AFPC) using an integer program and value focused thinking approach. This paper presents a novel method to match cadets with AFSCs using a generalized structure of the Hospitals Residents problem with special emphasis on lower quotas. This paper also examines the United States Army Matching problem and compares it to the techniques and constraints applied to solve the CAMP. The research culminates in the presentation of three algorithms created to solve the CAMP and …

Simulation And Analysis Of Dynamic Threat Avoidance Routing In An Anti-Access Area Denial (A2ad) Environment, Dante C. Reid

Theses and Dissertations

This research modeled and analyzed the effectiveness of different routing algorithms for penetration assets in an A2AD environment. AFSIM was used with different configurations of SAMs locations and numbers to compare the performance of AFSIM’s internal zone and shrink algorithm routers with a Dijkstra algorithm router. Route performance was analyzed through computational and operational metrics, including computational complexity, run-time, mission survivability, and simulation duration. This research also analyzed the impact of the penetration asset’s ingress altitude on those factors. Additionally, an excursion was conducted to analyze the Dijkstra algorithm router’s grid density holding altitude constant to understand its impact on …

Face Anti-Spoofing And Deep Learning Based Unsupervised Image Recognition Systems, Enoch Solomon

Theses and Dissertations

One of the main problems of a supervised deep learning approach is that it requires large amounts of labeled training data, which are not always easily available. This PhD dissertation addresses the above-mentioned problem by using a novel unsupervised deep learning face verification system called UFace, that does not require labeled training data as it automatically, in an unsupervised way, generates training data from even a relatively small size of data. The method starts by selecting, in unsupervised way, k-most similar and k-most dissimilar images for a given face image. Moreover, this PhD dissertation proposes a new loss function to …

A Novel Method For Sensitivity Analysis Of Time-Averaged Chaotic System Solutions, Christian A. Spencer-Coker

Theses and Dissertations

The direct and adjoint methods are to linearize the time-averaged solution of bounded dynamical systems about one or more design parameters. Hence, such methods are one way to obtain the gradient necessary in locally optimizing a dynamical system’s time-averaged behavior over those design parameters. However, when analyzing nonlinear systems whose solutions exhibit chaos, standard direct and adjoint sensitivity methods yield meaningless results due to time-local instability of the system. The present work proposes a new method of solving the direct and adjoint linear systems in time, then tests that method’s ability to solve instances of the Lorenz system that exhibit …

Autonomous And Resilient Management Of All-Source Sensors For Navigation Integrity: A Comparison And Analysis, Niles A. Tate

Theses and Dissertations

When navigating using Global Navigation Satellite Systems (GNSS), multiple/redundant, synchronous pseudorange measurements are readily available. However, when navigating in a GNSS degraded and/or denied region, this is not guaranteed. In response to this challenge, the ANT Center developed a framework known as Autonomous and Resilient Management of All-source Sensors (ARMAS). The ARMAS framework is designed to be resilient towards data corruption caused from mismodeled, uncalibrated, and faulty sensors. This thesis further expands on this work by performing a comparison against a Residual-Based Receiver Autonomous Integrity Monitoring (RBRAIM) scheme using simulated and real flight data to evaluate each systems performance.

Laser Illuminated Imaging: Beam And Scene Deconvolution Algorithm, Benjamin W. Davis

Theses and Dissertations

Laser illuminated imaging systems deal with several physical challenges that must be overcome to achieve high-resolution images of the target. Noise sources like background noise, photon counting noise, and laser speckle noise will all greatly affect the imaging systems ability to produce a high-resolution image. An even bigger challenge to laser illuminated imaging systems is atmospheric turbulence and the effect that it will have on the imaging system. The illuminating beam will experience tilt, causing the beam to wander off the center of the target during propagation. The light returning to the detector will similarly be affected by turbulence, and …

Amplitude Estimation For The Large Clutter Discrete Removal Algorithm, Hannah Gjermo Chomitz

Theses and Dissertations

A large clutter discrete (LCD) is spectrally bright localized clutter that can cause a false alarm or missed target detection in space-time adaptive processing (STAP) radar data. For passive bistatic STAP, the four step LCD removal (LCDR) algorithm estimates the spatial/Doppler frequency and complex amplitude of the LCD and then removes it from the data. Once the LCD is removed from the data, homogeneous clutter suppression techniques can be used to process the data and search for targets. This research focuses on reducing the complexity of estimating the LCDs complex amplitude. This research proposes a method that directly solves for …

K-Nearest Neighbors Density-Based Clustering, Avory C. Bryant

Theses and Dissertations

Traditional density-based clustering approaches rely on a distance-based parameter to define data connectivity and density. However, an appropriate value of this parameter can be difficult to determine as it is highly dependent on the underlying distribution of the data. In particular, distribution parameters affect the scale of inter-group distances (e.g., variance); this dependence leads to a well-known inability to simultaneously detect clusters at varying levels of density. In this work, connectivity and density are defined according to the rank-order induced by the distance metric (i.e., invariant to the expected scale of the distances). Connectivity by k-nearest neighbors and density by …

Learning From Multi-Class Imbalanced Big Data With Apache Spark, William C. Sleeman Iv

Theses and Dissertations

With data becoming a new form of currency, its analysis has become a top priority in both academia and industry, furthering advancements in high-performance computing and machine learning. However, these large, real-world datasets come with additional complications such as noise and class overlap. Problems are magnified when with multi-class data is presented, especially since many of the popular algorithms were originally designed for binary data. Another challenge arises when the number of examples are not evenly distributed across all classes in a dataset. This often causes classifiers to favor the majority class over the minority classes, leading to undesirable results …

Electro-Optic Satellite Constellation Design Using Multi-Objective Genetic Algorithm, Yasin Tamer

Theses and Dissertations

Satellite constellation design is a complex, highly constrained, and multidisciplinary problem. Unless optimization tools are used, tradeoffs must be conducted at the subsystem level resulting in feasible, but not necessarily optimal, system designs. As satellite technology advances, new methods to optimize the system objectives are developed. This study is based on the development of a representative regional remote sensing constellation design. This thesis analyses the design process of an electrooptic satellite constellation with regional coverage considerations using system-level optimization tools. A multi objective genetic algorithm method is used to optimize the constellation design by utilizing MATLAB and STK integration. Cost, …

Improving Closely Spaced Dim Object Detection Through Improved Multiframe Blind Deconvolution, Ronald M. Aung

Theses and Dissertations

This dissertation focuses on improving the ability to detect dim stellar objects that are in close proximity to a bright one, through statistical image processing using short exposure images. The goal is to improve the space domain awareness capabilities with the existing infrastructure. Two new algorithms are developed. The first one is through the Neighborhood System Blind Deconvolution where the data functions are separated into the bright object, the neighborhood system, and the background functions. The second one is through the Dimension Reduction Blind Deconvolution, where the object function is represented by the product of two matrices. Both are designed …

Artificial Intelligence In Pursuit-Evasion Games, Specifically In The Scotland Yard Game, Arif M. Alamri

Theses and Dissertations

This research provides a heuristic algorithm for the detectives, who try to collectively capture a criminal known as Mr. X, in the Scotland Yard pursuer-evasion game. In Scotland Yard, a team of detectives attempts to converge on and capture a criminal known as Mr. X. The heuristic algorithm developed in this thesis is designed to emulate human strategies when playing the game. The algorithm uses the current state of the board at each time step, including the current positions of the detectives as well as the last known position of Mr. X. The heuristic algorithm then analyses all of the …

Comparison Of Visual Simultaneous Localization And Mapping Methods For Fixed-Wing Aircraft Using Slambench2, Patrick R. Latcham

Theses and Dissertations

Visual Simultaneous Localization and Mapping (VSLAM) algorithms have evolved rapidly in the last few years, however there has been little research evaluating current algorithm's effectiveness and limitations when applied to tracking the position of a fixed-wing aerial vehicle. This research looks to evaluate current monocular VSLAM algorithms' performance on aerial vehicle datasets using the SLAMBench2 benchmarking suite. The algorithms tested are MonoSLAM, PTAM, OKVIS, LSDSLAM, ORB-SLAM2, and SVO, all of which are built into the SLAMBench2 software. The algorithms' performance is evaluated using simulated datasets generated in the AftrBurner Engine. The datasets were designed to test the quality of each …

Meta Learning Recommendation System For Classification, Clarence O. Williams Iii

Theses and Dissertations

A data driven approach is an emerging paradigm for the handling of analytic problems. In this paradigm the mantra is to let the data speak freely. However, when using machine learning algorithms, the data does not naturally reveal the best or even a good approach for algorithm choice. One method to let the algorithm reveal itself is through the use of Meta Learning, which uses the features of a dataset to determine a useful model to represent the entire dataset. This research proposes an improvement on the meta-model recommendation system by adding classification problems to the candidate problem space with …