Theory and Algorithms Commons^™

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 …

Flux-Weakening Control Methods For Permanent Magnet Synchronous Machines In Electric Vehicles At High Speed, Samer Alwaqfi, Mohamad Alzayed, Hicham Chaoui

Electrical & Computer Engineering Faculty Publications

Permanent magnet synchronous motors (PMSMs) are widely favored by manufacturers for use in electric vehicles (EVs) because of their many benefits, which include high power density at high speeds, ruggedness, potential for high efficiency, and reduced control complexity. However, since the Back Electromotive Force (EMF) increases proportionally with the motor’s rotational speed, it must be carefully controlled at high speeds. Flux-weakening (FW) control is required to avoid excessive electromagnetic flux beyond the power source and inverter’s voltage restrictions. This paper aims to compare various FW control strategies and analyze their effectiveness in maximizing the speed of PMSMs in EV applications …

Neuron Semantic-Guided Test Generation For Deep Neural Networks Fuzzing, Li Huang, Weifeng Sun, Meng Yan, Zhongxin Liu, Yan Lei, David Lo

Research Collection School Of Computing and Information Systems

In recent years, significant progress has been made in testing methods for deep neural networks (DNNs) to ensure their correctness and robustness. Coverage-guided criteria, such as neuron-wise, layer-wise, and path-/trace-wise, have been proposed for DNN fuzzing. However, existing coverage-based criteria encounter performance bottlenecks for several reasons: Testing Adequacy: Partial neural coverage criteria have been observed to achieve full coverage using only a small number of test inputs. In this case, increasing the number of test inputs does not consistently improve the quality of models. Interpretability: The current coverage criteria lack interpretability. Consequently, testers are unable to identify and understand which …

Applying Machine Learning And Optimization Algorithms To Perform Feature Selection, Shizhao Yu

Theses and Dissertations (Comprehensive)

The objective of feature selection in the realms of machine learning and data mining is integral, serving as an efficient mechanism to eradicate redundant or irrelevant features, and subsequently augmenting the performance of predictive models. In the contemporary landscape of big data, with the escalating dimensionality of datasets, the efficacy of traditional feature selection methodologies is compromised, due to their computational complexity and ineptitude in addressing the curse of dimensionality. This thesis posits a pioneering feature selection framework that amalgamates machine learning with advanced optimization algorithms. The methodology employs a Support Vector Machine (SVM), in conjunction with a cutting-edge metaheuristic …

Studies On Convexity Of Dnf Formulae, Josue A. Ruiz

Electronic Theses & Dissertations (2024 - present)

In this dissertation, we investigate the problem of determining whether a Boolean formula given in disjunctive normal form (DNF) is convex. Although Boolean formulas have various applications, our research focuses on the practical application for rule-based access control policies, where policies are often expressed as a set of Boolean rules. Understanding the structural properties of such formulas is crucial for determining whether a policy can be efficiently represented within a specific access control model.

The main contribution of this research is the conception and analysis of convexity derived from the “gap problem.” In this context, convexity is characterized by the …

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 …

Reinforcement Learning For Scheduling And Routing: Electric Vehicles Charging And Patrol Scheduling, Majid Ghasemi

Theses and Dissertations (Comprehensive)

This thesis offers a comprehensive exploration of Reinforcement Learning (RL), beginning with fundamental theoretical constructs, Markov Decision Processes, Dynamic Programming, Monte Carlo, and Temporal Difference methods, and extending into state-of-the-art deep RL approaches such as Deep Q-Networks (DQN) and policy-gradient algorithms. Through analytical experiments in controlled environments, the thesis demonstrates how distinct algorithmic choices (e.g., exploration techniques, eligibility traces, or network architectures) influence convergence and stability. These foundational insights pave the way for two in-depth case studies, which apply RL techniques to critical, real-world scheduling and routing challenges.

The first case study tackles the Electric Vehicle (EV) routing and charging …

Three-Sided Skyline Counting Queries, Suruchi Kushwaha

Dissertations, Master's Theses and Master's Reports

A two-dimensional point p=(p.x,p.y) dominates another point p'=(p'.x,p'.y) if p.x ≥ p'.x and p.y>p'.y or p.x>p'.x and p.y ≥ p'.y. The skyline of a point set P is a subset P' ⊆ P such that every point in P' is not dominated by any other point in P. An orthogonal skyline counting query Q on a set of points P asks for the number of points on the skyline of P ⋂ Q.

In this work we study data structures that support orthogonal skyline counting queries in the special case when the query range is bounded on three …

Harnessing The Power Of Gradient-Based Simulations For Multi-Objective Optimization In Particle Accelerators, Kishansingh Rajput, Malachi Schram, Auralee Edelen, Jonathan Colen, Armen Kasparian, Ryan Roussel, Adam Carpenter, He Zhang, Jay Benesch

Data Science Faculty Publications

Particle accelerator operation requires simultaneous optimization of multiple objectives. Multi-objective optimization (MOO) is particularly challenging due to trade-offs between the objectives. Evolutionary algorithms, such as genetic algorithms (GAs), have been leveraged for many optimization problems, however, they do not apply to complex control problems by design. This paper demonstrates the power of differentiability for solving MOO problems in particle accelerators using a deep differentiable reinforcement learning (DDRL) algorithm. We compare the DDRL algorithm with model-free reinforcement learning (MFRL), GA, and Bayesian optimization (BO) for simultaneous optimization of heat load and trip rates in the continuous electron beam accelerator facility. The …

Fares On Fairness: Using A Total Error Framework To Examine The Role Of Measurement And Representation In Training Data On Model Fairness And Bias, Patrick Oliver Schenk, Christoph Kern, Trent D. Buskirk

Data Science Faculty Publications

Data-driven decisions, often based on predictions from machine learning (ML) models are becoming ubiquitous. For these decisions to be just, the underlying ML models must be fair, i.e., work equally well for all parts of the population such as groups defined by gender or age. What are the logical next steps if, however, a trained model is accurate but not fair? How can we guide the whole data pipeline such that we avoid training unfair models based on inadequate data, recognizing possible sources of unfairness early on? How can the concepts of data-based sources of unfairness that exist in the …

Optiselect And Enshap: Integrating Machine Learning And Game Theory For Ischemic Stroke Prediction, Pritam Chakraborty, Anjan Bandyopadhyay, Sricheta Parul, Sujata Swain, Partha Sarathy Banerjee, Tapas Si, Hong Qin, Saurav Mallik

Computer Science Faculty Publications

Stroke analysis using game theory and machine learning techniques. The study investigates the use of the Shapley value in predictive ischemic brain stroke analysis. Initially, preference algorithms identify the most important features in various machine learning models, including logistic regression, K-nearest neighbor, decision tree, support vector machine (linear kernel), support vector machine ( RBF kernel), neural networks, etc. For each sample, the top 3, 4, and 5 features are evaluated and selected to evaluate their performance. The Shapley value method was used to rank the models using their best four features based on their predictive capabilities. As a result, better-performing …

Ai For Nuclear Physics: The Exclaim Project, S. Liuti, D. Adams, M. Boër, G. W. Chern, M. Cuic, M. Engelhardt, G. R. Goldstein, B. Kriesten, Y. Li, H. W. Lin, M. Sievert, D. Sivers

Computer Science Faculty Publications

An overview of the recent activity of the newly funded EXCLusives with AI and Machine learning (EXCLAIM) collaboration is presented. The main goal of the collaboration is to develop a framework to implement AI and machine learning techniques in problems emerging from the phenomenology of high energy exclusive scattering processes from nucleons and nuclei, maximizing the information that can be extracted from various sets of experimental data, while implementing theoretical constraints from lattice QCD. A specific perspective embraced by EXCLAIM is to use the methods of theoretical physics to understand the working of ML, beyond its standardized applications to physics …

Large Scale Machine Learning Over Knowledge Graphs, Bedirhan Gergin

Electronic Theses & Dissertations (2024 - present)

Knowledge graphs (KGs) have become popular across various fields, providing convenient access to web-based knowledge while storing and formalizing domain-specific information. By analyzing KGs, patterns, connections, and dependencies can be identified across different data sources, enabling the inference of new knowledge from given facts. As the use of KGs expands, the size of modern KGs has grown significantly, making them impossible to process within the main memory of a single computer. Distributed computing offers a viable solution to this challenge by leveraging the combined capabilities of multiple servers within a cluster. This thesis explores how distributed computing can be effectively …

Further Results On Learning Quantum Measurement Classes: Quantum Pac Model For Povm Hypothesis Classes, Arka Prabha Das

Electronic Theses & Dissertations (2024 - present)

This thesis investigates the problem of learning from quantum systems, where each example consists of a quantum state paired with a classical outcome. The task centers on choosing an effective measurement rule from a fixed set to enable accurate prediction of the classical outcome from the quantum state. A central focus lies in understanding whether joint measurement strategies that cannot be separated into local operations offer a real benefit in terms of the number of examples needed for successful learning. We examine conditions under which a non-separable measurement within a given hypothesis class achieves strictly better sample complexity bounds compared …

Schedulability Analysis Of Multi-Phase Limited-Preemption Tasks, Benjamin Standaert

McKelvey School of Engineering Graduate Student Theses & Dissertations

This work addresses hard real-time systems, in which tasks must be scheduled so that they are guaranteed to meet deadlines. In particular, when tasks execute across multiple domains with high preemption costs, the combined cost of these preemptions can cause the system to become unschedulable. The number of preemptions must therefore be bounded to limit the overall task execution time, while ensuring that task blocking times are small enough to allow the system to be schedulable. Prior work introduces the Multi-Phase Secure model, which describes a more exact version of this scenario, and an algorithm to determine schedulability of sporadic …

Optimal Algorithm For Managing On-Campus Student Transportation, Youssef Harrath, Jood Alyusuf, Zeena Ghulam, Muna Aldoseri

Research & Publications

This study analyzed the transportation issues at the University of Bahrain Sakhir campus, where a bus system with an unorganized and fixed number of buses allocated each semester was in place. Data was collected through a survey, onsite observations, and student schedules to estimate the number of buses needed. The study was limited to students who require to move between buildings for academic purposes and not those who choose to ride buses for other reasons. An algorithm was designed to calculate the optimal number of buses for each time slot, and for each day. This solution could improve transportation efficiency, …

Visualization Of Paleocurrents On A Web Application Using Gplates, Anjan Sapkota

MS in Computer Science Theses

Paleocurrents are flow directions derived from features of sedimentary rocks that reveal the direction of the current of wind or water that deposited the sediment. In 2015, Brand et al. created a global database of paleocurrents, which contains over 1,000,000 measurements worldwide: North America, South America, Australia, Great Britain, parts of Western Europe, China, Africa are fairly well represented; Antarctica, Eastern Europe, and Asia are modestly represented and Russia is poorly represented. The contribution of this thesis is a web application that uses the GPlates’ Application Programming Interface (API) to visualize global paleocurrents through time in an interactive way based …

Universal Shape Replication Via Self-Assembly With Signal-Passing Tiles, Andrew Alseth, Daniel Hader, Matthew J. Patitz

Computer Science and Computer Engineering Faculty Publications and Presentations

In this paper, we investigate shape-assembling power of a tile-based model of self-assembly called the Signal-Passing Tile Assembly Model (STAM). In this model, the glues that bind tiles together can be turned on and off by the binding actions of other glues via “signals”. Specifically, the problem we investigate is “shape replication” wherein, given a set of input assemblies of arbitrary shape, a system must construct an arbitrary number of assemblies with the same shapes and, with the exception of size-bounded junk assemblies that result from the process, no others. We provide the first fully universal shape replication result, namely …

Q-Learning In Starclash, Hanani Pankaj

2024 Fall Honors Capstone Projects - Archive

Developers create video games using Artificial Intelligence (AI) agents to provide a challenging opponent in a single-player game. However, studies show that when Reinforcement Learning (RL) agents are used, they outperform the AI agents. This project sought to test how RL agents would perform in StarClash, a video game without RL agents, using Q-Learning. This was done by creating two Q-Learning agents: a Simple agent and an Advanced (more complex) agent. These two agents were tested against each other and a Random AI agent. As expected, the Advanced agent did better than the Simple agent but only performed slightly better, …

Counting Catalan: An Experimental Evaluation Of The Mixing Time For The Triangulation Markov Chain, Roy Gotlieb

Master's Theses

Monte Carlo Markov chains (MCMCs) are used in many areas as a way to model a system’s behavior. By running a probabilistic simulation on a system’s state space, we can estimate properties of the system that could be untenable to directly compute. It is of interest to determine how quickly a Markov chain mixes\textemdash that is, settles into its stationary distribution. One such chain is induced by taking a binary search tree and performing a rotation or flip on one of its edges. We know that this chain eventually settles into the uniform distribution, but the time complexity bounds on …