Theory and Algorithms Commons^™

Establishing The Legal Framework To Regulate Quantum Computing Technology, Kaya Derose

Catholic University Journal of Law and Technology

No abstract provided.

Assessing Univariate And Multivariate Normality In Pls-Sem, Kathy Qing Ma, Weiyong Zhang

Information Technology & Decision Sciences Faculty Publications

Partial least squares structural equation modeling (PLS-SEM) has gained popularity among researchers in part due to its relaxed requirement for multivariate normality. One important step in performing structural equation modeling (SEM) is to test the normality assumption. In this paper, we illustrate how to assess univariate and multivariate normality in PLS-SEM using WarpPLS.

Visualization Teaching Tool For Computational Geometry Algorithms, Seth Spire

Honors Projects

Computational geometry is a branch of computer science dedicated to the study and development of algorithms that solve geometric problems. These algorithms are often complex, so this project involves the development of a teaching tool for various computational geometry algorithms. A Node app was developed which allows a user to create their own inputs for an algorithm and watch a visualization of how an algorithm solves one of the various problems. There is highlighted pseudocode matching the steps of the visualization along with more in-depth writeups of the inner workings of the algorithm. 4 algorithms have been implemented in the …

Ant Colony-Based Approach For Solving An Unmanned Aerial Vehicle Routing Problem, Youssef Harrath Dr., Jihene Kaabi Dr.

Research & Publications

Waste management issues are affecting the economic and environmental aspects of modern societies. Thus, growing the interest of academic and industrial research and development in optimizing the process of waste management. As these issues greatly impact human health and environmental aspects and impose a threat, hazardous waste management requires even much more attention. The problem studied in this research is a variant of the vehicle routing problem using an unmanned aerial vehicle (UAV). The focus of this research is on planning the routes for waste collection and disposal using a UAV. The aim is to collect all the waste as …

Patch-Wise Training With Convolutional Neural Networks To Synthetically Upscale Cfd Simulations, John P. Romano, Alec C. Brodeur, Oktay Baysal

Mechanical & Aerospace Engineering Faculty Publications

This paper expands the authors’ prior work[1], which focuses on developing a convolutional neural network (CNN) model capable of mapping time-averaged, unsteady Reynold’s-averaged Navier-Stokes (URANS) simulations to higher resolution results informed by time-averaged detached eddy simulations (DES). The authors present improvements over the prior CNN autoencoder model that result from hyperparameter optimization, increased data set augmentation through the adoption of a patch-wise training approach, and the predictions of primitive variables rather than vorticity magnitude. The training of the CNN model developed in this study uses the same URANS and DES simulations of a transonic flow around several NACA 4-digit airfoils …

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

Properties Of (Claw, 4k₁, Bridge)-Free Graphs, Taite Lagrange

Theses and Dissertations (Comprehensive)

Given a set H of graphs, a graph G is H-free if it does not contain any graph in H as an induced subgraph. The complexity of the colouring problem is known when H is a set of graphs on four vertices, with three exceptions. One of those exceptions is the case of {claw, 4K₁}-free graphs, for which our classes of {claw, 4K₁, bridge}-free and {claw, 4K₁, bridge,C₄-twin}-free graphs are subclasses.

The original goal of this work was to prove that {claw, 4K₁, …

Machine Learning-Based Jet And Event Classification At The Electron-Ion Collider With Applications To Hadron Structure And Spin Physics, Kyle Lee, James Mulligan, Mateusz Płoskoń, Felix Ringer, Feng Yuan

Physics Faculty Publications

We explore machine learning-based jet and event identification at the future Electron-Ion Collider (EIC). We study the effectiveness of machine learning-based classifiers at relatively low EIC energies, focusing on (i) identifying the flavor of the jet and (ii) identifying the underlying hard process of the event. We propose applications of our machine learning-based jet identification in the key research areas at the future EIC and current Relativistic Heavy Ion Collider program, including enhancing constraints on (transverse momentum dependent) parton distribution functions, improving experimental access to transverse spin asymmetries, studying photon structure, and quantifying the modification of hadrons and jets in …

Improving Connectivity For Remote Cancer Patient Symptom Monitoring And Reporting In Rural Medically Underserved Regions, Esther Max-Onakpoya

Theses and Dissertations--Computer Science

Rural residents are often faced with many disparities when compared to their urban counterparts. Two key areas where these disparities are apparent are access to health and Internet services. Improved access to healthcare services has the potential to increase residents' quality of life and life expectancy. Additionally, improved access to Internet services can create significant social returns in increasing job and educational opportunities, and improving access to healthcare. Therefore, this dissertation focuses on the intersection between access to Internet and healthcare services in rural areas. More specifically, it attempts to analyze systems that can be used to improve Internet access …

Small Approximate Pareto Sets With Quality Bounds, William Bailey

Theses and Dissertations--Computer Science

We present and empirically characterize a general, parallel, heuristic algorithm for computing small ε-Pareto sets. The algorithm can be used as part of a decision support tool for settings in which computing points in objective space is computationally expensive. We use the graph clearing problem, a formalization of indirect organ exchange markets, as a prototypical example setting. We characterize the performance of the algorithm through ε-Pareto set size, ε value provided, and parallel speedup achieved. Our results show that the algorithm's combination of parallel speedup and small ε-Pareto sets is sufficient to be appealing in settings requiring manual review (i.e., …

The Basil Technique: Bias Adaptive Statistical Inference Learning Agents For Learning From Human Feedback, Jonathan Indigo Watson

Theses and Dissertations--Computer Science

We introduce a novel approach for learning behaviors using human-provided feedback that is subject to systematic bias. Our method, known as BASIL, models the feedback signal as a combination of a heuristic evaluation of an action's utility and a probabilistically-drawn bias value, characterized by unknown parameters. We present both the general framework for our technique and specific algorithms for biases drawn from a normal distribution. We evaluate our approach across various environments and tasks, comparing it to interactive and non-interactive machine learning methods, including deep learning techniques, using human trainers and a synthetic oracle with feedback distorted to varying degrees. …

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 …

Cooperative Deep Q -Learning Framework For Environments Providing Image Feedback, Krishnan Raghavan, Vignesh Narayanan, Sarangapani Jagannathan

Publications

In this article, we address two key challenges in deep reinforcement learning (DRL) setting, sample inefficiency, and slow learning, with a dual-neural network (NN)-driven learning approach. In the proposed approach, we use two deep NNs with independent initialization to robustly approximate the action-value function in the presence of image inputs. In particular, we develop a temporal difference (TD) error-driven learning (EDL) approach, where we introduce a set of linear transformations of the TD error to directly update the parameters of each layer in the deep NN. We demonstrate theoretically that the cost minimized by the EDL regime is an approximation …

Peer-To-Peer Energy Trading In Smart Residential Environment With User Behavioral Modeling, Ashutosh Timilsina

Theses and Dissertations--Computer Science

Electric power systems are transforming from a centralized unidirectional market to a decentralized open market. With this shift, the end-users have the possibility to actively participate in local energy exchanges, with or without the involvement of the main grid. Rapidly reducing prices for Renewable Energy Technologies (RETs), supported by their ease of installation and operation, with the facilitation of Electric Vehicles (EV) and Smart Grid (SG) technologies to make bidirectional flow of energy possible, has contributed to this changing landscape in the distribution side of the traditional power grid.

Trading energy among users in a decentralized fashion has been referred …

Architectural Design Of A Blockchain-Enabled, Federated Learning Platform For Algorithmic Fairness In Predictive Health Care: Design Science Study, Xueping Liang, Juan Zhao, Yan Chen, Eranga Bandara, Sachin Shetty

VMASC Publications

Background: Developing effective and generalizable predictive models is critical for disease prediction and clinical decision-making, often requiring diverse samples to mitigate population bias and address algorithmic fairness. However, a major challenge is to retrieve learning models across multiple institutions without bringing in local biases and inequity, while preserving individual patients' privacy at each site.

Objective: This study aims to understand the issues of bias and fairness in the machine learning process used in the predictive health care domain. We proposed a software architecture that integrates federated learning and blockchain to improve fairness, while maintaining acceptable prediction accuracy and minimizing overhead …

Efficient Maritime Object Detection And Validation For Enhancing Safety Of Uncrewed Marine Systems, Ahmed Saglam, Yiannis Papelis

VMASC Publications

Safe operation of uncrewed maritime systems is a major concern in the presence of other vehicles or obstacles. Typically, perception algorithms utilize sensor data to identify obstacles that must be avoided, and AI algorithms are used to interpret raw sensor data for use in navigation and object avoidance algorithms. However, perception algorithms are typically computationally expensive. In this paper, we present an efficient method for detecting obstacles using raw lidar data in the form of range or Point Cloud, employing computationally efficient techniques that do not depend on trained models or AI matching. The approach
converts the sensor readings into …

Crosshair Optimizer, Jason Torrence

All Master's Theses

Metaheuristic optimization algorithms are heuristics that are capable of creating a "good enough'' solution to a computationally complex problem. Algorithms in this area of study are focused on the process of exploration and exploitation: exploration of the solution space and exploitation of the results that have been found during that exploration, with most resources going toward the former half of the process. The novel Crosshair optimizer developed in this thesis seeks to take advantage of the latter, exploiting the best possible result as much as possible by directly searching the area around that best result with a stochastic approach. This …

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 …

Joint Congestion And Contention Avoidance In A Scalable Qos-Aware Opportunistic Routing In Wireless Ad-Hoc Networks, Ali Parsa, Neda Moghim, Sasan Haghani

VMASC Publications

Opportunistic routing (OR) can greatly increase transmission reliability and network throughput in wireless ad-hoc networks by taking advantage of the broadcast nature of the wireless medium. However, network congestion is a barrier in the way of OR's performance improvement, and network congestion control is a challenge in OR algorithms, because only the pure physical channel conditions of the links are considered in forwarding decisions. This paper proposes a new method to control network congestion in OR, considering three types of parameters, namely, the backlogged traffic, the traffic flows' Quality of Service (QoS) level, and the channel occupancy rate. Simulation results …