Theory and Algorithms Commons^™

Differentiating Opioid Use Disorder From Healthy Controls Via Ml Analysis Of Rs-Fmri Networks, Ahmed Temtam, Megan A. Witherow, Liangsuo Ma, M. Shibly Sadique, F. Gerard Moeller, C. Kenneth, Dianne Wright, Khan M. Iftekharuddin

Electrical & Computer Engineering Faculty Publications

Objectives/Goals: This work aims to identify functional brain networks that differentiate opioid use disorder (OUD) subjects from healthy controls (HC) using machine learning (ML) analysis of resting-state fMRI (rs-fMRI). We investigate the default mode network (DMN), salience network (SN), and executive control network (ECN), as well as demographic features. Methods/Study Population: This work uses high-resolution rs-fMRI data from a National Institute on Drug Abuse study (IRB #HM20023630) with 31 OUD and 45 HC subjects. We extract rs-fMRI blood oxygenation level-dependent (BOLD) features from the DMN, SN, and ECN. The Boruta ML algorithm identifies statistically significant features and brain activity mapping …

Deep Reinforcement Learning With Explicit Context Representation, Francisco Munguia-Galeano, Ah-Hwee Tan, Ze Ji

Research Collection School Of Computing and Information Systems

Though reinforcement learning (RL) has shown an outstanding capability for solving complex computational problems, most RL algorithms lack an explicit method that would allow learning from contextual information. On the other hand, humans often use context to identify patterns and relations among elements in the environment, along with how to avoid making wrong actions. However, what may seem like an obviously wrong decision from a human perspective could take hundreds of steps for an RL agent to learn to avoid. This article proposes a framework for discrete environments called Iota explicit context representation (IECR). The framework involves representing each state …

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 …

Quantifying The Transfer Effectiveness Of An Artificial Intelligence-Based Simulator Pre-Training Program For Student Pilots, Ryan Guthridge

Journal of Aviation/Aerospace Education & Research

Since the airline pilot shortage was initially studied in 2016, the pilot hiring model has been significantly impacted, with airlines hiring qualified pilots at unprecedented rates. The COVID-19 pandemic has slowed this hiring rate, however it is expected that airline hiring will soon increase to a rate higher than initially expected (Bureau of Transportation Statistics, 2022). With this dynamic, certified flight instructors are often the most qualified recruits for airlines, due to the number of hours and experience they have gained in the flight training organization. In turn, certified flight instructors are in short supply for flight training organizations worldwide. …

Sampling Balanced High-Quality Data To Train An Automatic Mesh Generator, Jie Pan, Jingwei Huang, Gengdong Cheng, Yong Zeng

Engineering Management & Systems Engineering Faculty Publications

In real-world scenarios, high-quality data are often scarce and imbalanced, yet it is essential for the optimal performance of data-driven algorithmic models. Data synthesis methods are commonly used to address this issue; however, they typically rely heavily on the original dataset, which limits their ability to significantly improve performance. This article presents a quality function-based method for directly generating high-quality data and applies it to a mesh generation algorithm to demonstrate its efficiency and effectiveness. The proposed approach samples input-output pairs of the algorithm based on their feature spaces, selects high-quality samples using a defined quality function that evaluates the …

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 …

Two Computational Problems On String Rewriting Systems, Wei Du

Electronic Theses & Dissertations (2024 - present)

String rewriting systems are widely used computational models in theoretical computer science research such as artificial intelligence, software and hardware verification, and symbolic cryptographic protocol analysis. In this dissertation, we investigate two interesting problems concerning these systems, namely the common left multiplier problem and the SYMBOL-ORDER problem.

First, we consider the common left multiplier problem for forward-closed convergent string rewriting systems. The task is to discover, given two distinct strings α and β, a target string W such that W α and W β will be equivalent with respect to the provided forward-closed convergent string rewriting system. We describe an …

Multi-Objective Bike Routing Problem: A Survey And Comparative Evaluation, Dominic Peter Macisaac

EWU Masters Thesis Collection

Multi-objective routing has been studied for over forty years, yet its application to the bike routing problem is a relatively recent development. The Multi-Objective Bike Routing Problem (MOBRP) seeks to optimize a set of bike routes from a single source to a single destination, given multiple cost criteria. This paper makes two primary contributions. First, it consolidates existing research on the MOBRP, including the criteria chosen and associated cost functions, the search algorithms used, and the testing setups and metrics used for evaluation. Second, it implements the most promising search algorithms and evaluates these approaches through comprehensive cross-testing, a topic …

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 …

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 …

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 …

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 …

Demo2test: Transfer Testing Of Agent In Competitive Environment With Failure Demonstrations, Jianming Chen, Yawen Wang, Junjie Wang, Xiaofei Xie, Dandan Wang, Qing Wang, Fanjiang Xu

Research Collection School Of Computing and Information Systems

The competitive game between agents exists in many critical applications, such as military unmanned aerial vehicles. It is urgent to test these agents to reduce the significant losses caused by their failures. Existing studies mainly are to construct a testing agent that competes with the target agent to induce its failures. These approaches usually focus on a single task, requiring much more time for multi-task testing. However, if the previously tested tasks (source tasks) and the task to be tested (target task) share similar agents or task objectives, the transferable knowledge in source tasks can potentially increase the effectiveness of …