Theory and Algorithms Commons^™

Largest 2-Regular Subgraphs In Complete S-Partite Graphs, Yiyang Jiang

McKelvey School of Engineering Graduate Student Theses & Dissertations

In this thesis, we focus on the class of complete $S$-partite graphs, for $S$ an undirected graph possibly with self-loops, and address the problem of finding largest $2$-regular subgraphs of these graphs, which can be formulated as an integer linear program. Roughly speaking, a complete $S$-partite graph is obtained by replacing every single node of $S$ with a number of nodes, preserving the edge/non-edge relations of $S$. Our motivation in studying largest $2$-regular subgraphs is rooted in the structural systems theory, particularly in the problem of finding largest subnetworks that can sustain controllability or asymptotic stability of the corresponding subsystems. …

Design And Analysis Of Modern Quantum Neural Network Architectures For Intelligent Systems, Lakshmi Chandrakanth Kasireddy, Prabhakara Rao Kapula, Dineshkumar Rajendran, Neha Bharani, Srikanth Pulipeti, Islombek Khushvaktov

Computer Science Faculty Publications

Quantum neural networks (QNNs) offer a principled pathway for integrating quantum computation with machine learning through superposition- and entanglement-based representations. This chapter proposes an architecture-aware design and evaluation framework for modern QNNs, emphasizing robustness and system feasibility alongside predictive performance. Multiple architectures variational QNNs, quantum convolutional neural networks, tensor-network hybrids, and fully quantum models—are assessed under a unified protocol. Experimental analysis shows that the proposed architecture-search–guided QNN achieves 91.8% classification accuracy and an F1-score of 0.914, outperforming fixed-template variational QNNs by approximately 5.6 percentage points. Under depolarizing noise with probability p = 0.10, the proposed model retains 85.3% accuracy, whereas …

Beyond Full Fine-Tuning: The New Playbook For Adapting Deep Neural Networks, Cristian S. Mcgee

Honors Undergraduate Theses

Fine-tuning is the process of teaching and specializing a pre-trained neural network on a downstream task. Fine-tuning is a rapidly growing topic in artificial intelligence domains; however, many fine-tuning endeavors are highly specialized without a coherent framework connecting them. This work presents a unified perspective on fine-tuning methods and performance metrics. Our perspective organizes the methods in terms of how they are applied to fine-tuning. This framework showcases methods that (i) update effective subspaces of the pre-trained model, (ii) change the adaptation optimization procedure, and (iii) alter the representations of the embedded input. Additionally, we present unconventional metrics such as …

Coupled Machine Learning Models: Combining Observations And Numerical Analysis In A Physics-Regularized Approach, Austin B. Schmidt

LSU New Orleans Theses and Dissertations

This dissertation investigates surrogate modeling for fixed-location environmental forecasting using novel data-combination techniques. The work surveys the landscape of observational measurements and numerically generated data, identifying similar research and gaps in current methodologies. The ratio-coupled training framework is introduced to combine two data sources per predicted feature through a tunable parameter that weights training signal strength. An optimization scheme is developed to simultaneously tune surrogate weights and the coupled signal ratio, allowing relative influence between signals to act as an explicit regularizer. Three case studies demonstrate the methodology and approach in a variety of contexts. The first study is based …

Universal Systems Simulation Via Constraint Hypergraphs With Applications To Digital Twins, John Morris

All Dissertations

The characterization of systems encompasses a variety of modeling frameworks designed to capture specific behaviors and components of various system domains. Whatever the framework, the core elements of a system representation are the information of the system and a description of how that information is related. The relations in deterministic systems are functions, which, when composed to form executable processes, can be used to simulate system data. A declarative modeling framework is one that encodes mechanisms for preparing these simulations within the model structure, allowing an external agent to form the execution processes required for a given context. To date, …

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 …

Algebraic Multigrid Methods For Nonsymmetric And Indefinite Problems: Theory And Applications, Ahsan Ali

Mathematics & Statistics ETDs

Algebraic multigrid (AMG) is a well-established and highly efficient solver for symmetric positive definite (SPD) systems arising from elliptic and parabolic PDEs, while nonsymmetric systems from hyperbolic PDEs remain a significant challenge. This dissertation develops AMG methods and theory for nonsymmetric problems. First, we develop a novel approach combining mode constraints from energy-minimization AMG with local approximations of ideal restriction in $\ell$AIR, resulting in constrained $\ell$AIR (C$\ell$AIR), which demonstrates scalable convergence across advective and diffusive problems. Second, we extend optimal AMG theory by deriving spectral radius estimates for the two-grid error transfer operator using matrix-induced orthogonality, enabling convergence predictions for …

Property Testing Ai: An Efficient Frontier, Paul Sopher Lintilhac

Dartmouth College Ph.D Dissertations

In this dissertation, we take a step towards addressing the major problem of a lack of standardized and rigorous approaches to testing and evaluation of AI systems. Taking inspiration from both the fields of Property Testing and Property Based Testing (for programs), we develop a novel taxonomy of partially overlapping classes of properties of AI systems, including simple properties, compound properties, higher order properties, data relation properties, and architecture-utility properties. We argue that this taxonomy categorizes a diverse set of AI traits -- including accuracy, fairness, robustness, monotonicity, point-wise and global privacy properties, sensitivity, and more -- according to the …

Filling Gaps In Scientific Data Sets Using Physics Informed Neural Networks: A Case Study In Velocity Fields, Ellen Saunders

Master's Theses

Gaps in scientific data sets are a persistent issue for researchers in a variety of fields, and while nothing makes up for missing out on real data, well-simulated synthetic data can be a useful tool. In the world of image processing, machine learning techniques have become quite sophisticated at taking an image with a missing component and filling in that space with something believable. The aim of this thesis is to take machine learning techniques similar to what gets used in image processing and repurpose them to infill gaps in scientific data sets in a realistic manner. This thesis compares …

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. …

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, …

Optimizing Decision-Making In A Cerebral Palsy Model Using Reinforcement Learning, Richard Ampah

Pitzer Senior Theses

This study presents an original interdisciplinary investigation into how reinforcement learning (RL) can model motor and cognitive defects and potentially improve motor and cognitive functions in individuals with cerebral palsy (CP), a non-progressive neurological disorder that impairs movement and adaptability. Integrating computational neuroscience and machine learning, the research applies policy gradient methods and Markov Decision Processes (MDPs) to simulate adaptive learning in agents with and without CP-related constraints.

The central aim is to compare the cumulative rewards of optimal policies, derived from value iteration, and human-like learning policies using the REINFORCE algorithm, both with and without the Bellman baseline. The …

Time-Marching Quantum Algorithm For Simulation Of Nonlinear Lorenz Dynamics, Efstratios Koukoutsis, George Vahala, Min Soe, Kyriakos Hizanidis, Linda Vahala, Abhay K. Ram

Electrical & Computer Engineering Faculty Publications

Simulating nonlinear classical dynamics on a quantum computer is an inherently challenging task due to the linear operator formulation of quantum mechanics. In this work, we provide a systematic approach to alleviate this difficulty by developing an explicit quantum algorithm that implements the time evolution of a second-order time-discretized version of the Lorenz model. The Lorenz model is a celebrated system of nonlinear ordinary differential equations that has been extensively studied in the contexts of climate science, fluid dynamics, and chaos theory. Our algorithm possesses a recursive structure and requires only a linear number of copies of the initial state …

A Time-Domain Boundary Integral Equation For Moving Acoustic Sources In Uniform Flow And Its Solution By An Advanced Time Propagation Approach, Fang Q. Hu, Douglas M. Nark

Mathematics & Statistics Faculty Publications

This paper presents a time-domain boundary integral equation (TDBIE) formulation for predicting acoustic scattering from moving sources in a uniform mean flow. This work is motivated by the increasing need for accurate aeroacoustic modeling of modern aircraft configurations, including VTOL and eVTOL systems with rotating components. A key challenge in time-domain scattering simulations with moving sources is the determination of retarded time for a given observer time, which involves solving an implicit equation at each time step. This can be computationally costly, particularly for numerical solution of the TDBIE where every surface element on the scattering body acts as an …

Analysis Of Bin Packing Variants, Kyle T. Ambrose

UNF Graduate Theses and Dissertations

The Bin Packing problem is a classic and widely studied optimization problem that arises naturally in applications like manufacturing, logistics, and memory allocation, where space and resource constraints are critical. In this thesis, we first demonstrate the NP-completeness of Bin Packing via a reduction from Three-Dimensional Matching, establishing its foundational complexity. We then survey core heuristics for the one-dimensional case and extend our analysis to two and three-dimensional variants, including both offline and online strategies. Special attention is given to stochastic bin packing, where item sizes are modeled as random variables drawn from distributions such as uniform, truncated normal, and …

Solving Fractional Differential Equations On A Quantum Computer: A Variational Approach, Fong Yew Leong, Dax Enshan Koh, Jian Feng Kong, Siong Thye Goh, Jun Yong Khoo, Wei Bin Ewe, Hongying Li, Jayne Thompson, Dario Poletti

Research Collection School Of Computing and Information Systems

We introduce an efficient variational hybrid quantum-classical algorithm designed for solving Caputo time-fractional partial differential equations. Our method employs an iterable cost function incorporating a linear combination of overlap history states. The proposed algorithm is not only efficient in terms of time complexity but also has lower memory costs compared to classical methods. Our results indicate that solution fidelity is insensitive to the fractional index and that gradient evaluation costs scale economically with the number of time steps. As a proof of concept, we apply our algorithm to solve a range of fractional partial differential equations commonly encountered in engineering …

A Comparative Analysis Of Source Identification Algorithms, Pablo A. Curiel

Biology and Medicine Through Mathematics Conference

No abstract provided.

Mathematically Rigorous Deep Learning Paradigms For Data-Driven Scientific Modeling, Owen Nicholas Davis

Mathematics & Statistics ETDs

This dissertation explores the crucial role of data-driven modeling in science and engineering, with a focus on developing surrogate models to accelerate large-scale computational tasks, aiding in both outer-loop functions like uncertainty quantification and expensive inner-loop tasks within broader computational frameworks. Challenges arise with increased problem dimension and sparse, noisy training data, particularly significant when constructing surrogates for very expensive computational models where acquiring sufficient high-fidelity training data is unfeasible. In such scenarios, training surrogates from an ensemble of multifidelity information sources of varying accuracy and cost becomes essential. We emphasize neural network-based modeling paradigms, which are flexible in integrating …

Predicting Biomolecular Properties And Interactions Using Numerical, Statistical And Machine Learning Methods, Elyssa Sliheet

Mathematics Theses and Dissertations

We investigate machine learning and electrostatic methods to predict biophysical properties of proteins, such as solvation energy and protein ligand binding affinity, for the purpose of drug discovery/development. We focus on the Poisson-Boltzmann model and various high performance computing considerations such as parallelization schemes.

The Computational Search For Unidentified Central Configurations Of The Newtonian N-Body Problem, Hannah G. Havel

CURE Proceedings

The N-body problem is a field of study in mathematics and physics that involves predicting the motion of particles moving under their mutual gravitational attraction. It is vital in celestial mechanics, such as planning collision-free satellite orbit trajectories. When beginning to understand the N-body problem, we can start by looking at equal masses of these particles or celestial bodies. As particles move, their position and velocity change, both energy and angular momentum are conserved. Sets of constant energy and angular momentum, known as integral manifolds, are higher-dimensional figures that represent constraints of movement to a system. Integral manifolds are described …

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 …

Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia

Journal of Nonprofit Innovation

Urban farming can enhance the lives of communities and help reduce food scarcity. This paper presents a conceptual prototype of an efficient urban farming community that can be scaled for a single apartment building or an entire community across all global geoeconomics regions, including densely populated cities and rural, developing towns and communities. When deployed in coordination with smart crop choices, local farm support, and efficient transportation then the result isn’t just sustainability, but also increasing fresh produce accessibility, optimizing nutritional value, eliminating the use of ‘forever chemicals’, reducing transportation costs, and fostering global environmental benefits.

Imagine Doris, who is …

Machine Learning-Based Data And Model Driven Bayesian Uncertanity Quantification Of Inverse Problems For Suspended Non-Structural System, Zhiyuan Qin

All Dissertations

Inverse problems involve extracting the internal structure of a physical system from noisy measurement data. In many fields, the Bayesian inference is used to address the ill-conditioned nature of the inverse problem by incorporating prior information through an initial distribution. In the nonparametric Bayesian framework, surrogate models such as Gaussian Processes or Deep Neural Networks are used as flexible and effective probabilistic modeling tools to overcome the high-dimensional curse and reduce computational costs. In practical systems and computer models, uncertainties can be addressed through parameter calibration, sensitivity analysis, and uncertainty quantification, leading to improved reliability and robustness of decision and …

Chatgpt As Metamorphosis Designer For The Future Of Artificial Intelligence (Ai): A Conceptual Investigation, Amarjit Kumar Singh (Library Assistant), Dr. Pankaj Mathur (Deputy Librarian)

Library Philosophy and Practice (e-journal)

Abstract

Purpose: The purpose of this research paper is to explore ChatGPT’s potential as an innovative designer tool for the future development of artificial intelligence. Specifically, this conceptual investigation aims to analyze ChatGPT’s capabilities as a tool for designing and developing near about human intelligent systems for futuristic used and developed in the field of Artificial Intelligence (AI). Also with the helps of this paper, researchers are analyzed the strengths and weaknesses of ChatGPT as a tool, and identify possible areas for improvement in its development and implementation. This investigation focused on the various features and functions of ChatGPT that …

A Hierarchical Approach To Improve The Ant Colony Optimization Algorithm, Bryan J. Fischer

EWU Masters Thesis Collection

The ant colony optimization algorithm (ACO) is a fast heuristic-based method for finding favorable solutions to the traveling salesman problem (TSP). When the data set reaches larger values however, the ACO runtime increases dramatically. As a result, clustering nodes into groups is an effective way to reduce the size of the problem while leveraging the advantages of the ACO algorithm. The method for recombining groups of nodes is explored by treating the graph as a hierarchy of clusters, and modifying the original ACO heuristic to operate on a hypergraph. This method of using hierarchical clustering is significantly faster than the …

Dynamic Function Learning Through Control Of Ensemble Systems, Wei Zhang, Vignesh Narayanan, Jr-Shin Li

Publications

Learning tasks involving function approximation are preva- lent in numerous domains of science and engineering. The underlying idea is to design a learning algorithm that gener- ates a sequence of functions converging to the desired target function with arbitrary accuracy by using the available data samples. In this paper, we present a novel interpretation of iterative function learning through the lens of ensemble dy- namical systems, with an emphasis on establishing the equiv- alence between convergence of function learning algorithms and asymptotic behavior of ensemble systems. In particular, given a set of observation data in a function learning task, we …

Clusters, Curves, And Centroids: Stellar Flare Morphology In The Ultraviolet, Vera Berger

Pomona Senior Theses

With a novel sample of 495 high-cadence light curves for stellar flares in the near-ultraviolet, I explore similarity measures, clustering algorithms, averaging methods, and curve fitting techniques for time series. This work seeks to provide insight into whether stellar flares are similar across stars, if we can identify physically meaningful patterns in their light curves, and how to construct a comprehensive model for flares. I construct the first empirical template for flare light curves in the ultraviolet, and compute ``average elements" of flares displaying complex features such as quasi-periodic oscillations and multipeak structures. Developing accurate models for flares in the …

Analysis Of A Quantum Attack On The Blum-Micali Pseudorandom Number Generator, Tingfei Feng

Mathematical Sciences Technical Reports (MSTR)

In 2012, Guedes, Assis, and Lula proposed a quantum attack on a pseudorandom number generator named the Blum-Micali Pseudorandom number generator. They claimed that the quantum attack can outperform classical attacks super-polynomially. However, this paper shows that the quantum attack cannot get the correct seed and provides another corrected algorithm that is in exponential time but still faster than the classical attack. Since the original classical attacks are in exponential time, the Blum-Micali pseudorandom number generator would be still quantum resistant.

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 …

The Primitive Root Problem: A Problem In Bqp, Shixin Wu

Mathematical Sciences Technical Reports (MSTR)

Shor’s algorithm proves that the discrete logarithm problem is in BQP. Based on his algorithm, we prove that the primitive root problem, a problem that verifies if some integer g is a primitive root modulo p where p is the largest prime number smaller than 2n for a given n, which is assumed to be harder than the discrete logarithm problem, is in BQP by using an oracle quantum Turing machine.