Theory and Algorithms Commons^™

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 …

Cyclic Mixed-Radix Dense Gray Codes, Jessica Cheng

Computer Science Senior Theses

A Gray code is a sequence of n binary integers in the range 0 to n-1 that has the Gray-code property: each integer in the sequence differs from the integer before it in a single digit. Gray codes have many applications, ranging from rotary encoders to Boolean circuit minimization. We refer to Gray codes where the first and last
codewords in the sequence fulfill the Gray-code property as cyclic. Additionally, we refer to a Gray code as dense if the sequence of n numbers consists of a permutation of ⟨0, 1, . . . , n − 1⟩. This thesis …

Solving Fjssp With A Genetic Algorithm, Michael John Srouji

Computer Science and Software Engineering

The Flexible Job Shop Scheduling Problem is an NP-Hard combinatorial problem. This paper aims to find a solution to this problem using genetic algorithms, and discuss the effectiveness of this. Initially, I did exploratory work on whether neural networks would be effective or not, and found a lot of trade offs between using neural networks and chromosome sequencing. In the end, I decided to use chromosome sequencing over neural networks, due to the scope of my problem being on a small scale rather than on a large scale.

Therefore, the genetic algorithm was implemented using chromosome sequencing. My chromosomes were …

Bayesian Recurrent Neural Networks For Real Time Object Detection, Stephen Z. Kimatian

Theses and Dissertations

Neural networks have become increasingly popular in real time object detection algorithms. A major concern with these algorithms is their ability to quantify their own uncertainty, leading to many high profile failures. This research proposes three novel real time detection algorithms. The first of leveraging Bayesian convolutional neural layers producing a predictive distribution, the second leveraging predictions from previous frames, and the third model combining these two techniques together. These augmentations seek to mitigate the calibration problem of modern detection algorithms. These three models are compared to the state of the art YOLO architecture; with the strongest contending model achieving …

Air Force Cadet To Career Field Matching Problem, Ian P. Macdonald

Theses and Dissertations

This research examines the Cadet to Air Force Specialty Code (AFSC) Matching Problem (CAMP). Currently, the matching problem occurs annually at the Air Force Personnel Center (AFPC) using an integer program and value focused thinking approach. This paper presents a novel method to match cadets with AFSCs using a generalized structure of the Hospitals Residents problem with special emphasis on lower quotas. This paper also examines the United States Army Matching problem and compares it to the techniques and constraints applied to solve the CAMP. The research culminates in the presentation of three algorithms created to solve the CAMP and …

Simulation And Analysis Of Dynamic Threat Avoidance Routing In An Anti-Access Area Denial (A2ad) Environment, Dante C. Reid

Theses and Dissertations

This research modeled and analyzed the effectiveness of different routing algorithms for penetration assets in an A2AD environment. AFSIM was used with different configurations of SAMs locations and numbers to compare the performance of AFSIM’s internal zone and shrink algorithm routers with a Dijkstra algorithm router. Route performance was analyzed through computational and operational metrics, including computational complexity, run-time, mission survivability, and simulation duration. This research also analyzed the impact of the penetration asset’s ingress altitude on those factors. Additionally, an excursion was conducted to analyze the Dijkstra algorithm router’s grid density holding altitude constant to understand its impact on …

Prudex-Compass: Towards Systematic Evaluation Of Reinforcement Learning In Financial Markets, Shuo Sun, Molei Qin, Xinrun Wang, Bo An

Research Collection School Of Computing and Information Systems

The financial markets, which involve more than $90 trillion market capitals, attract the attention of innumerable investors around the world. Recently, reinforcement learning in financial markets (FinRL) has emerged as a promising direction to train agents for making profitable investment decisions. However, the evaluation of most FinRL methods only focuses on profit-related measures and ignores many critical axes, which are far from satisfactory for financial practitioners to deploy these methods into real-world financial markets. Therefore, we introduce PRUDEX-Compass, which has 6 axes, i.e., Profitability, Risk-control, Universality, Diversity, rEliability, and eXplainability, with a total of 17 measures for a systematic evaluation. …

Machine Learning Methods For Computational Phenotyping Using Patient Healthcare Data With Noisy Labels, Praveen Kumar

Computer Science ETDs

Positive and Unlabeled (PU) learning problems abound in many real-world applications. In healthcare informatics, diagnosed patients are considered labeled positive for a specific disease, but being undiagnosed does not mean they can be labeled negative. PU learning can improve classification performance, and estimate the positive fraction, α, among unlabeled samples. However, algorithms based on the Selected Completely At Random (SCAR) assumption are inadequate when the SCAR assumption fails (e.g., severe cases overrepresented), and when class imbalance is substantial. This dissertation presents and evaluates new algorithms to overcome these limitations. The proposed methods outperform the state-of-art for α-estimation, enhance classification performance, …

Session11: Skip-Gcn : A Framework For Hierarchical Graph Representation Learning, Jackson Cates, Justin Lewis, Randy Hoover, Kyle Caudle

SDSU Data Science Symposium

Recently there has been high demand for the representation learning of graphs. Graphs are a complex data structure that contains both topology and features. There are first several domains for graphs, such as infectious disease contact tracing and social media network communications interactions. The literature describes several methods developed that work to represent nodes in an embedding space, allowing for classical techniques to perform node classification and prediction. One such method is the graph convolutional neural network that aggregates the node neighbor’s features to create the embedding. Another method, Walklets, takes advantage of the topological information stored in a graph …

Solving Large-Scale Pursuit-Evasion Games Using Pre-Trained Strategies, Shuxin Li, Xinrun Wang, Youzhi Zhang, Wanqi Xue, Jakub Cerny, Bo An

Research Collection School Of Computing and Information Systems

Pursuit-evasion games on graphs model the coordination of police forces chasing a fleeing felon in real-world urban settings, using the standard framework of imperfect-information extensive-form games (EFGs). In recent years, solving EFGs has been largely dominated by the Policy-Space Response Oracle (PSRO) methods due to their modularity, scalability, and favorable convergence properties. However, even these methods quickly reach their limits when facing large combinatorial strategy spaces of the pursuit-evasion games. To improve their efficiency, we integrate the pre-training and fine-tuning paradigm into the core module of PSRO -- the repeated computation of the best response. First, we pre-train the pursuer's …

Layout Generation As Intermediate Action Sequence Prediction, Huiting Yang, Danqing Huang, Chin-Yew Lin, Shengfeng He

Research Collection School Of Computing and Information Systems

Layout generation plays a crucial role in graphic design intelligence. One important characteristic of the graphic layouts is that they usually follow certain design principles. For example, the principle of repetition emphasizes the reuse of similar visual elements throughout the design. To generate a layout, previous works mainly attempt at predicting the absolute value of bounding box for each element, where such target representation has hidden the information of higher-order design operations like repetition (e.g. copy the size of the previously generated element). In this paper, we introduce a novel action schema to encode these operations for better modeling the …

Mirror: Mining Implicit Relationships Via Structure-Enhanced Graph Convolutional Networks, Jiaying Liu, Feng Xia, Jing Ren, Bo Xu, Guansong Pang, Lianhua Chi

Research Collection School Of Computing and Information Systems

Data explosion in the information society drives people to develop more effective ways to extract meaningful information. Extracting semantic information and relational information has emerged as a key mining primitive in a wide variety of practical applications. Existing research on relation mining has primarily focused on explicit connections and ignored underlying information, e.g., the latent entity relations. Exploring such information (defined as implicit relationships in this article) provides an opportunity to reveal connotative knowledge and potential rules. In this article, we propose a novel research topic, i.e., how to identify implicit relationships across heterogeneous networks. Specially, we first give a …

Generalizing Math Word Problem Solvers Via Solution Diversification, Zhenwen Liang, Jipeng Zhang, Lei Wang, Yan Wang, Jie Shao, Xiangliang Zhang

Research Collection School Of Computing and Information Systems

Current math word problem (MWP) solvers are usually Seq2Seq models trained by the (one-problem; one-solution) pairs, each of which is made of a problem description and a solution showing reasoning flow to get the correct answer. However, one MWP problem naturally has multiple solution equations. The training of an MWP solver with (one-problem; one-solution) pairs excludes other correct solutions, and thus limits the generalizability of the MWP solver. One feasible solution to this limitation is to augment multiple solutions to a given problem. However, it is difficult to collect diverse and accurate augment solutions through human efforts. In this paper, …

Scalable And Globally Optimal Generalized L1 K-Center Clustering Via Constraint Generation In Mixed Integer Linear Programming, Aravinth Chembu, Scott Sanner, Hassan Khurran, Akshat Kumar

Research Collection School Of Computing and Information Systems

The k-center clustering algorithm, introduced over 35 years ago, is known to be robust to class imbalance prevalent in many clustering problems and has various applications such as data summarization, document clustering, and facility location determination. Unfortunately, existing k-center algorithms provide highly suboptimal solutions that can limit their practical application, reproducibility, and clustering quality. In this paper, we provide a novel scalable and globally optimal solution to a popular variant of the k-center problem known as generalized L_1 k-center clustering that uses L_1 distance and allows the selection of arbitrary vectors as cluster centers. We show that this clustering objective …

Scalable And Globally Optimal Generalized L1 K-Center Clustering Via Constraint Generation In Mixed Integer Linear Programming, Aravinth Chembu, Scott Sanner, Hassan Khurram, Akshat Kumar

Research Collection School Of Computing and Information Systems

The k-center clustering algorithm, introduced over 35 years ago, is known to be robust to class imbalance prevalent in many clustering problems and has various applications such as data summarization, document clustering, and facility location determination. Unfortunately, existing k-center algorithms provide highly suboptimal solutions that can limit their practical application, reproducibility, and clustering quality. In this paper, we provide a novel scalable and globally optimal solution to a popular variant of the k-center problem known as generalized L1 k-center clustering that uses L1 distance and allows the selection of arbitrary vectors as cluster centers. We show that this clustering objective …

Combinatorics Syllabus, Tugce Ozdemir

Open Educational Resources

No abstract provided.

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 …

Generalized Sparse Bayesian Learning And Application To Image Reconstruction, Jan Glaubitz, Anne Gelb, Guohui Song

Mathematics & Statistics Faculty Publications

Image reconstruction based on indirect, noisy, or incomplete data remains an important yet challenging task. While methods such as compressive sensing have demonstrated high-resolution image recovery in various settings, there remain issues of robustness due to parameter tuning. Moreover, since the recovery is limited to a point estimate, it is impossible to quantify the uncertainty, which is often desirable. Due to these inherent limitations, a sparse Bayesian learning approach is sometimes adopted to recover a posterior distribution of the unknown. Sparse Bayesian learning assumes that some linear transformation of the unknown is sparse. However, most of the methods developed are …

Algorithms And Variations On The Positional Burrows-Wheeler Transform And Their Applications, Ahsan Sanaullah

Electronic Theses and Dissertations, 2020-2023

In this dissertation, we develop algorithms and variations on the Positional Burrows-Wheeler Transform (PBWT). The PBWT is a data structure that stores M binary strings of length N while allowing efficient search. We develop the dynamic-PBWT (d-PBWT). The d-PBWT is a variation of the PBWT that allows its relevant algorithms to run with unchanged time complexity, but also allows efficient insertion and deletion of haplotypes. We provide insertion and deletion algorithms on the PBWT with average case O(N) time complexity. We also improve upon the query algorithms for the PBWT. Durbin described a set maximal match query algorithm on 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 …

An Empirical Analysis Of Approximation Algorithms For The Unweighted Tree Augmentation Problem, Jacob Thomas Restanio

Graduate Theses, Dissertations, and Problem Reports (ETD)

In this thesis, we perform an experimental study of approximation algorithms for the tree augmentation problem (TAP). TAP is a fundamental problem in network design. The goal of TAP is to add the minimum number of edges from a given edge set to a tree so that it becomes 2-edge connected. Formally, given a tree T = (V, E), where V denotes the set of vertices and E denotes the set of edges in the tree, and a set of edges (or links) L ⊆ V × V disjoint from E, the objective is to find a set of edges …

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

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

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 …

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 …

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 …