Theory and Algorithms Commons^™

A Specification-Driven Framework For Self-Supervised Learning In Specialized Vision Domains, Mahmut S. Gokmen

Theses and Dissertations--Computer Science

Self-supervised learning (SSL) has emerged as a principled approach to visual representation learning that derives supervisory signal directly from unlabeled data, enabling foundation models to be trained at scale without manual annotation. Deployments in medical imaging and biometric recognition have demonstrated the potential of this paradigm, yet the assumptions that make SSL effective on natural image benchmarks fail systematically in specialized domains. Generic SSL pipelines encode a tacit assumption that the most informative correspondence is spatial proximity within a single acquisition. In specialized domains this assumption breaks at the level of the data-generating process: the signal that carries domain-specific information …

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 …

The Excess Path Length Distribution: A Stochastic Model For Sample-Based Path Planners, Chaz B. Cornwall

Dissertations, Master's Theses and Master's Reports

Through random sampling, sample-based path planners enable autonomous agents to quickly find paths without human intervention. However, due to the paths' randomness, sample-based path planners currently require additional verification, partially nullifying agents' ability to act autonomously. I set out to characterize this uncertainty so humans know what to expect from these path planners and know how to alter the path planner to desired specifications. To ensure the results are theoretical as well as practical, I first create a stochastic model of path length uncertainty using the trade-off between sampling time and optimality. By leveraging this model, my proposed algorithm reduces …

Using Automotive Lidar To Reduce The Energy Consumption Of An Ego Autonomous Vehicle, Logan P. Schexnaydre

Dissertations, Master's Theses and Master's Reports

There is significant potential to reduce the energy consumption of the transportation sector through autonomous vehicles. Prior work on autonomous vehicle energy efficiency focuses on the whole system or the control subsystem. Yet, the sensing and processing components, which have direct and indirect effects on net energy use, are less explored. This dissertation fills this gap by modeling and evaluating these effects for lidar sensors, which provide high-resolution spatial data at the cost of high power and processing demands. I apply lidar to the energy-saving tasks of automated vehicle following and road surface profiling. For automated vehicle following, I model …

Distilling The Complexity Of Agent-Based Simulations Into Textual Explanations Via Large Language Models, Noé Y. Flandre, Philippe J. Giabbanelli

VMASC Publications

Communicating the design and results of agent-based models (ABMs) to subject matter experts is challenging, which hinders participation and limits trust in simulation-based decision support. Large language models (LLMs) can communicate ABMs as textual summaries, thus complementing traditional disclosure through statistical and visualization techniques. While prior work translated the structure of conceptual models into narratives via LLMs, our extension covers the dynamics of simulation models via an automated simulation-to-text method that extracts contextual information from NetLogo ABMs, performs repeated simulations, and generates narrative descriptions (including the model’s purpose, parameters, and simulation dynamics) using mutimodal LLMs. Furthermore, four summarization algorithms spanning …

Multi-Objective Optimization Of Energy Costs And Ev Battery Health In V2g Enabled Homes, Dzifa M. Hodey

Theses and Dissertations--Computer Science

Electric vehicles (EVs) and rooftop solar photovoltaic (PV) systems are increasingly being integrated into residential settings, creating new opportunities for vehicle-to-grid (V2G) and vehicle-to-home (V2H) operations. In these systems, the EV battery functions as a controllable energy storage unit that can charge from the grid or PV and discharge energy to supply household load or export to the grid for a profit. By intelligently scheduling this bidirectional power exchange, households can reduce electricity costs and enhance PV utilization. Realizing these benefits requires optimization strategies that balance cost reduction with EV battery health preservation. However, existing V2G/V2H studies largely emphasize cost …

Toward Efficient And Scalable Scientific Data Management Through Quality-Oriented Data Compression, Pu Jiao

Theses and Dissertations--Computer Science

Scientific simulations and instruments now produce data at rates that overwhelm the storage, memory, and network subsystems of modern high-performance computing (HPC) facilities. Error-bounded lossy compression reduces data movement costs while bounding reconstruction error, yet three barriers limit its adoption in mission-critical workflows: existing compressors cannot guarantee the accuracy of domain-specific quantities of interest (QoIs) derived from compressed data; compression-induced artifacts such as posterization, blocking, and interpolation banding erode user confidence in decompressed fields; and significant compressibility in the quantization index arrays of interpolation-based pipelines remains unexploited. This dissertation addresses all three barriers through four contributions, with the artifact barrier …

Machine Learning-Based Lifetime Prediction Of Lithium Batteries: A Comparative Assessment For Electric Vehicle Applications, Abdelilah Hammou, Raffaele Petrone, Demba Diallo, Boubekeur Tala-Ighil, Philippe Makany Boussiengue, Hicham Chaoui, Hamid Gualous

Electrical & Computer Engineering Faculty Publications

This paper evaluates and compares four data-driven methods (Gaussian Process Regression (GPR), echo state network (ESN), gated recurrent unit (GRU), and long short-term memory (LSTM)) for lithium-ion capacity prognostics adapted to electric vehicle conditions. This comparison aims to find the most efficient prognosis method considering two constraints: the limitation of computational power and the unavailability of on-board capacity measurement that requires full charge and discharge conditions. The machine learning models are trained using capacity values estimated under vehicle conditions. The ageing data is collected from cycling tests of two battery chemistries, Lithium Fer Phosphate (LFP) and Nickel Manganese Cobalt (NMC), …

Qubit Lattice Algorithm Simulations Of The Scattering Of A Bounded Two Dimensional Electromagnetic Pulse From The Infinite Planar Dielectric Interface, Min Soe, George Vahala, Linda Vahala, Efstratios Koukoutsis, Abhay K. Ram, Kyriakos Hizanidis

Electrical & Computer Engineering Faculty Publications

Qubit lattice algorithm (QLA) simulations are performed for a two-dimensional spatially bounded pulse propagating onto a plane interface between two dielectric slabs. QLA is an initial value scheme that consists of a sequence of unitary collision and streaming operators, with appropriate potential operators, that recover Maxwell equations in inhomogeneous dielectric media to the second order in the lattice discreteness. For the case of total internal reflection, there is transient energy transfer into the second medium due to the evanescent fields as the Poynting unit vector of the pulse is rotated from its incident to reflected direction. Because of the finite …

Machine Learning Classification Of Prostate Cancer Genomic Sequences Using K-Mer And Sequence-Derived Features, Kuldeep Rawat, Hirendra Nath Banerjee, Jamie Noble, Saa Naudia Deloatch, Satyendra Banerjee, Sachin Shetty, Soumya Banerjee

VMASC Publications

Prostate cancer disproportionately impacts African American men, who experience significantly higher mortality rates and earlier disease onset than other populations. Current diagnostic approaches, including prostate-specific antigen testing and biopsy, lack sufficient specificity and sensitivity, underscoring the need for accurate, molecular-level classification tools. This paper presents a machine learning framework for binary classification of genomic DNA sequences as cancerous or healthy. A dataset of 1684 FASTA-formatted sequences obtained from the National Library of Medicine - GenBank was analyzed, with 1662 sequences retained after quality control filtering. Feature engineering yielded 67 attributes, including GC content, Shannon entropy, sequence length, and trinucleotide k-mer …

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 …

Clinical Subtypes Of Co-Morbid Insomnia And Obstructive Sleep Apnea (Comisa): Results Of A Cluster Analysis, Yuan Shi, Xujun Feng, Fengyi Hao, Yuru Nie, Yihui Zhang, Zhaohua Chen, Siqi Guan, Larry D. Sanford, Michael V. Vitiello, Xiangdong Tang

Department of Pathology & Anatomy Faculty Publications

Background

Variations in the bidirectional relationship between obstructive sleep apnea (OSA) and insomnia in co-morbid insomnia and OSA (COMISA) may form distinct subtypes of COMISA, which have not been previously characterized. This study aims to identify and characterize subtypes of COMISA.

Methods

From a community-recruited COMISA cohort 256 individuals who met diagnosis for COMISA were used to identify subtypes using a two-step clustering methodology. Demographics and multidimension clinical characteristics were collected and compared among obtained subtypes. Logistic models were used to evaluate whether these subtypes were associated with cardiometabolic and mental disorders. A clinical cohort of 1816 COMISA patients was …

Reconstructing Lost Voices, Lana Tamim

Williams Honors College, Honors Research Projects

This project uses digital text mining tools (OCR, NLP, sentiment analysis, and topic modeling) to analyze 19th–20th-century newspaper archives, focusing on how marginalized groups (women, immigrants, or labor workers) were historically portrayed. Many historical newspapers were dominated by elite voices, so this project aims to recover silenced or misrepresented perspectives by identifying hidden patterns in language, frequency of coverage, sentiment, and shifts in public perception over time. Using machine learning and visualization tools, the project will create interactive maps and timelines showing how representation evolved across regions.

Machine Learning For Economists, John Luke Gallup

Economics Faculty Publications and Presentations

Explication of machine learning algorithms and their usefulness for economic research. The prediction algorithms of Random Forest, Gradient Boost Machines, Neural Networks and Support Vector Machines are built from simple steps applied at large scale to generate surprisingly precise nonlinear estimates. Although useful for processing and interpreting new forms of data, their application to economics research is limited because they do not provide readily interpretable evidence of the causes of outcomes.

Explainable Physics-Based Constraints On Reinforcement Learning For Accelerator Optimization, Jonathan Colen, Malachi Schram, Kishansingh Rajput, Armen Kasparian

Data Science Faculty Publications

We present a reinforcement learning (RL) framework for optimizing particle accelerator experiments that builds explainable physics-based constraints on agent behavior. The goal is to increase transparency and trust by letting users verify that the agent’s decision-making process incorporates suitable physics. Our algorithm uses a learnable surrogate function for physical observables, such as energy, and uses them to fine-tune how actions are chosen. This surrogate can be represented by a neural network or by an interpretable sparse dictionary model. We test our algorithm on a range of particle accelerator optimization environments designed to emulate the Continuous Electron Beam Accelerator Facility at …

To Print A Remake: An Analysis Of Hollywood Remakes And Their Cultural Value, Connor F. Seaton

Honors Undergraduate Theses

In recent years, audiences and movie critics have expressed concern that Hollywood’s growing reliance on remakes, sequels, franchises, and similar adaptations has led to a broader worry that originality is fading from modern cinema and that the industry is instead focused on using adaptations to maximize profits. Although adaptation is often seen as a commercially driven framework for reproducing existing intellectual property in a new media format, this thesis argues that it should be recognized as an autonomous cultural category with its own artistic, historical, and social significance and merit. By analyzing adaptation scholarship and reviewing its complex historical development, …

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 …

Mg-Spair: Multi-Grade Sparse-Guided Implicit Representation For Training-Data-Free Image Restoration, Jianmin Liao, Lei Huang, Ronglong Fang, Ashley Prater-Bennette, Lixin Shen, Yuesheng Xu

Mathematics & Statistics Faculty Publications

MG-SpaIR is a training-data-free framework for restoring a clean image from a single observation corrupted by a mixture of blur, downsampling, noise, and missing pixels. Building on implicit neural representations (INRs), we introduce a multi-grade residual hierarchy that progressively refines the reconstruction from low to high spatial frequencies across grades, improving representational fidelity and mitigating spectral limitations. To stabilize reconstruction optimization and suppress INR-induced artifacts, we further propose an explicit sparse proximal regularization (e.g., ℓ0 type) applied directly in the high-resolution image domain, which discourages spurious high-frequency patterns while preserving sharp structures. The resulting optimization is solved efficiently via a …

Making Unsafe Sequences Unexecutable: Formal Protocol Enforcement For Cyber-Physical Systems, Arthur Amorim

Graduate Studies Theses and Dissertations 2026

Cyber-physical systems execute physical actions in response to software commands, making their communication protocols a primary attack surface. A stealthy attack is a sequence of individually valid messages that violates a required ordering, driving the system into an unsafe state without malware or protocol violation. Existing defenses examine messages or physical state in isolation, not protocol level sequences, and cannot prevent them. Preventing them requires enforcement that makes unsafe sequences unexecutable at the communication boundary.

Formal methods offer a principled path to enforcement, but no tool spans specification to safe deployed hardware. Model checking automates proofs but has no certified …

Optimizing Maintenance Routes For Highway Infrastructure Using Leader-Follower Autonomous Vehicles, Qing Tang, Chenxi Chen, Xianbiao Hu, Yuxin Ding, Tianjia Yang

Civil & Environmental Engineering Faculty Publications

The Autonomous Truck Mounted Attenuator (ATMA), a leader–follower style connected and automated vehicle system, enhances safety during transportation infrastructure maintenance in work zones. However, the significantly lower speed of ATMA, compared to regular vehicles, causes moving bottlenecks that reduce roadway capacity and prolong queuing, leading to further delays. Different ATMA routes lead to varying patterns of time-dependent capacity drop, affecting the user equilibrium traffic assignment and resulting in differing system costs. This study aims to optimize ATMA routing within a network to minimize the system cost associated with its slow-moving operation. To this end, a queuing-based traffic assignment approach is …