Theory and Algorithms Commons^™

Time Evolution Is A Source Of Bias In The Wolf Algorithm For Largest Lyapunov Exponents, Kolby Brink, Tyler Wiles, Nicholas Stergiou, Aaron Likens

UNO Student Research and Creative Activity Fair

Human movement is inherently variable by nature. One of the most common analytical tools for assessing movement variability is the largest Lyapunov exponent (LyE) which quantifies the rate of trajectory divergence or convergence in an n-dimensional state space. One popular method for assessing LyE is the Wolf algorithm. Many studies have investigated how Wolf’s calculation of the LyE changes due to sampling frequency, filtering, data normalization, and stride normalization. However, a surprisingly understudied parameter needed for LyE computation is evolution time. The purpose of this study is to investigate how the LyE changes as a function of evolution time …

Toward A Simulation Model Complexity Measure, J. Scott Thompson, Douglas D. Hodson, Michael R. Grimaila, Nicholas Hanlon, Richard Dill

Faculty Publications

Is it possible to develop a meaningful measure for the complexity of a simulation model? Algorithmic information theory provides concepts that have been applied in other areas of research for the practical measurement of object complexity. This article offers an overview of the complexity from a variety of perspectives and provides a body of knowledge with respect to the complexity of simulation models. The key terms model detail, resolution, and scope are defined. An important concept from algorithmic information theory, Kolmogorov complexity, and an application of this concept, normalized compression distance, are used to indicate the possibility of measuring changes …

Fraud Pattern Detection For Nft Markets, Andrew Leppla, Jorge Olmos, Jaideep Lamba

SMU Data Science Review

Non-Fungible Tokens (NFTs) enable ownership and transfer of digital assets using blockchain technology. As a relatively new financial asset class, NFTs lack robust oversight and regulations. These conditions create an environment that is susceptible to fraudulent activity and market manipulation schemes. This study examines the buyer-seller network transactional data from some of the most popular NFT marketplaces (e.g., AtomicHub, OpenSea) to identify and predict fraudulent activity. To accomplish this goal multiple features such as price, volume, and network metrics were extracted from NFT transactional data. These were fed into a Multiple-Scale Convolutional Neural Network that predicts suspected fraudulent activity based …

Self-Learning Algorithms For Intrusion Detection And Prevention Systems (Idps), Juan E. Nunez, Roger W. Tchegui Donfack, Rohit Rohit, Hayley Horn

SMU Data Science Review

Today, there is an increased risk to data privacy and information security due to cyberattacks that compromise data reliability and accessibility. New machine learning models are needed to detect and prevent these cyberattacks. One application of these models is cybersecurity threat detection and prevention systems that can create a baseline of a network's traffic patterns to detect anomalies without needing pre-labeled data; thus, enabling the identification of abnormal network events as threats. This research explored algorithms that can help automate anomaly detection on an enterprise network using Canadian Institute for Cybersecurity data. This study demonstrates that Neural Networks with Bayesian …

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 …

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

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 …

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 …

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 …

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 …

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 …

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

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 …

Combinatorics Syllabus, Tugce Ozdemir

Open Educational Resources

No abstract provided.