Theory and Algorithms Commons^™

Comparative Predictive Analysis Of Stock Performance In The Tech Sector, Asaad Sendi

LSU New Orleans Theses and Dissertations

This study compares the performance of deep learning models, including Long Short-Term Memory (LSTM), Gated Recurrent Unit (GRU), and Transformer, in predicting stock prices across five companies (AAPL, CSCO, META, MSFT, and TSLA) from July 2019 to July 2023. Key findings reveal that GRU models generally exhibit the lowest Mean Absolute Error (MAE), indicating higher precision, particularly notable for CSCO with a remarkably low MAE. While LSTM models often show slightly higher MAE values, they outperform Transformer models in capturing broader trends and variance in stock prices, as evidenced by higher R-squared (R2) values. Transformer models generally exhibit higher MAE …

Choreographing The Rhythms Of Observation: Dynamics For Ranged Observer Bipartite-Unipartite Spatiotemporal (Robust) Networks, Edward A. Holmberg Iv

LSU New Orleans Theses and Dissertations

Existing network analysis methods struggle to optimize observer placements in dynamic environments with limited visibility. This dissertation introduces the novel ROBUST (Ranged Observer Bipartite-Unipartite SpatioTemporal) framework, offering a significant advancement in modeling, analyzing, and optimizing observer networks within complex spatiotemporal domains. ROBUST leverages a unique bipartite-unipartite approach, distinguishing between observer and observable entities while incorporating spatial constraints and temporal dynamics.

This research extends spatiotemporal network theory by introducing novel graph-based measures, including myopic degree, spatial closeness centrality, and edge length proportion. These measures, coupled with advanced clustering techniques like Proximal Recurrence, provide insights into network structure, resilience, and the effectiveness …

Asteroidal Sets And Dominating Targets In Graphs, Oleksiy Al-Saadi

School of Computing: Dissertations, Theses, and Student Research

The focus of this PhD thesis is on various distance and domination properties in graphs. In particular, we prove strong results about the interactions between asteroidal sets and dominating targets. Our results add to or extend a plethora of results on these properties within the literature. We define the class of strict dominating pair graphs and show structural and algorithmic properties of this class. Notably, we prove that such graphs have diameter 3, 4, or contain an asteroidal quadruple. Then, we design an algorithm to to efficiently recognize chordal hereditary dominating pair graphs. We provide new results that describe the …

Formalization Of A Security Framework Design For A Health Prescription Assistant In An Internet Of Things System, Thomas Rolando Mellema

Electronic Theses and Dissertations

Security system design flaws will create greater risks and repercussions as the systems being secured further integrate into our daily life. One such application example is incorporating the powerful potential of the concept of the Internet of Things (IoT) into software services engineered for improving the practices of monitoring and prescribing effective healthcare to patients. A study was performed in this application area in order to specify a security system design for a Health Prescription Assistant (HPA) that operated with medical IoT (mIoT) devices in a healthcare environment. Although the efficiency of this system was measured, little was presented to …

Learning, Optimizing, And Simulating Fermions With Quantum Computers, Andrew Zhao

Physics & Astronomy ETDs

Fermions are fundamental particles which obey seemingly bizarre quantum-mechanical principles, yet constitute all the ordinary matter that we inhabit. As such, their study is heavily motivated from both fundamental and practical incentives. In this dissertation, we will explore how the tools of quantum information and computation can assist us on both of these fronts. We primarily do so through the task of partial state learning: tomographic protocols for acquiring a reduced, but sufficient, classical description of a quantum system. Developing fast methods for partial tomography addresses a critical bottleneck in quantum simulation algorithms, which is a particularly pressing issue for …

Quantum Machine Learning For Credit Scoring, Nikolaos Schetakis, Davit Aghamalyan, Micheael Boguslavsky, Agnieszka Rees, Marc Rakotomalala, Paul Robert Griffin

Research Collection School Of Computing and Information Systems

This study investigates the integration of quantum circuits with classical neural networks for enhancing credit scoring for small- and medium-sized enterprises (SMEs). We introduce a hybrid quantum–classical model, focusing on the synergy between quantum and classical rather than comparing the performance of separate quantum and classical models. Our model incorporates a quantum layer into a traditional neural network, achieving notable reductions in training time. We apply this innovative framework to a binary classification task with a proprietary real-world classical credit default dataset for SMEs in Singapore. The results indicate that our hybrid model achieves efficient training, requiring significantly fewer epochs …

An Adaptive Large Neighborhood Search For The Multi-Vehicle Profitable Tour Problem With Flexible Compartments And Mandatory Customers, Vincent F. Yu, Nabila Yuraisyah Salsabila, Aldy Gunawan, Anggun Nurfitriani Handoko

Research Collection School Of Computing and Information Systems

The home-refill delivery system is a business model that addresses the concerns of plastic waste and its impact on the environment. It allows customers to pick up their household goods at their doorsteps and refill them into their own containers. However, the difficulty in accessing customers’ locations and product consolidations are undeniable challenges. To overcome these issues, we introduce a new variant of the Profitable Tour Problem, named the multi-vehicle profitable tour problem with flexible compartments and mandatory customers (MVPTPFC-MC). The objective is to maximize the difference between the total collected profit and the traveling cost. We model the proposed …

Knowledge Enhanced Multi-Intent Transformer Network For Recommendation, Ding Zou, Wei Wei, Feida Zhu, Chuanyu Xu, Tao Zhang, Chengfu Huo

Research Collection School Of Computing and Information Systems

Incorporating Knowledge Graphs (KGs) into Recommendation has attracted growing attention in industry, due to the great potential of KG in providing abundant supplementary information and interpretability for the underlying models. However, simply integrating KG into recommendation usually brings in negative feedback in industry, mainly due to the ignorance of the following two factors: i) users' multiple intents, which involve diverse nodes in KG. For example, in e-commerce scenarios, users may exhibit preferences for specific styles, brands, or colors. ii) knowledge noise, which is a prevalent issue in Knowledge Enhanced Recommendation (KGR) and even more severe in industry scenarios. The irrelevant …

Reinforcement Nash Equilibrium Solver, Xinrun Wang, Chang Yang, Shuxin Li, Pengdeng Li, Xiao Huang, Hau Chan, Bo An

Research Collection School Of Computing and Information Systems

Nash Equilibrium (NE) is the canonical solution concept of game theory, which provides an elegant tool to understand the rationalities. Computing NE in two- or multi-player general-sum games is PPAD-Complete. Therefore, in this work, we propose REinforcement Nash Equilibrium Solver (RENES), which trains a single policy to modify the games with different sizes and applies the solvers on the modified games where the obtained solution is evaluated on the original games. Specifically, our contributions are threefold. i) We represent the games as ��-rank response graphs and leverage graph neural network (GNN) to handle the games with different sizes as inputs; …

Algorithms For Canvas-Based Attention Scheduling With Resizing, Yigong Hu, Ila Gokarn, Shengzhong Liu, Archan Misra, Tarek Adbelzaher

Research Collection School Of Computing and Information Systems

Canvas-based attention scheduling was recently pro-posed to improve the efficiency of real-time machine perception systems. This framework introduces a notion of focus locales, referring to those areas where the attention of the inference system should “allocate its attention”. Data from these locales (e.g., parts of the input video frames containing objects of interest) are packed together into a smaller canvas frame which is processed by the downstream machine learning algorithm. Compared with processing the entire input data frame, this practice saves resources while maintaining inference quality. Previous work was limited to a simplified solution where the focus locales are quantized …

Subject Analysis Ex Machina: Developing A Subject Heading Recommendation Service For Jmu Libraries, Steven W. Holloway

Libraries

Results of a 2022 evaluation of ANNIF, open-source software designed to generate controlled vocabulary subject headings, using James Madison University Libraries resources.

Techniques To Detect Fake Profiles On Social Media Using The New Age Algorithms – A Survey, A K M Rubaiyat Reza Habib, Edidiong Elijah Akpan

ATU Scholars Symposium

This research explores the growing issue of fake accounts in Online Social Networks [OSNs]. While platforms like Twitter, Instagram, and Facebook foster connections, their lax authentication measures have attracted many scammers and cybercriminals. Fake profiles conduct malicious activities, such as phishing, spreading misinformation, and inciting social discord. The consequences range from cyberbullying to deceptive commercial practices. Detecting fake profiles manually is often challenging and causes considerable stress and trust issues for the users. Typically, a social media user scrutinizes various elements like the profile picture, bio, and shared posts to identify fake profiles. These evaluations sometimes lead users to conclude …

Rescape: Transforming Coral-Reefscape Images For Quantitative Analysis, Zachary Ferris, Eraldo Ribeiro, Tomofumi Nagata, Robert Van Woesik

Ocean Engineering and Marine Sciences Faculty Publications

Ever since the first image of a coral reef was captured in 1885, people worldwide have been accumulating images of coral reefscapes that document the historic conditions of reefs. However, these innumerable reefscape images suffer from perspective distortion, which reduces the apparent size of distant taxa, rendering the images unusable for quantitative analysis of reef conditions. Here we solve this century-long distortion problem by developing a novel computer-vision algorithm, ReScape, which removes the perspective distortion from reefscape images by transforming them into top-down views, making them usable for quantitative analysis of reef conditions. In doing so, we demonstrate the …

Towards Erasing The Distinction Between The Computational And Syntactic Accounts Of Scientific Theories, Timothy Luft

Theses

One of the main goals of philosophy of science is to give a proper account of scientific theories and their structure. One way that accounts of the structure of scientific theories can be distinguished is by the mathematical or logical structures that they involve. For instance, syntactic accounts of scientific theories hold that theories are axioms in a logical framework, whereas semantic accounts are more liberal in the range of mathematical and logical structures they take as pertinent to the structure of scientific theories. Paul Thagard (1988) offers a computational account of scientific theories, which holds that theories are complex …

Mathematically Rigorous Deep Learning Paradigms For Data-Driven Scientific Modeling, Owen Nicholas Davis

Mathematics & Statistics ETDs

This dissertation explores the crucial role of data-driven modeling in science and engineering, with a focus on developing surrogate models to accelerate large-scale computational tasks, aiding in both outer-loop functions like uncertainty quantification and expensive inner-loop tasks within broader computational frameworks. Challenges arise with increased problem dimension and sparse, noisy training data, particularly significant when constructing surrogates for very expensive computational models where acquiring sufficient high-fidelity training data is unfeasible. In such scenarios, training surrogates from an ensemble of multifidelity information sources of varying accuracy and cost becomes essential. We emphasize neural network-based modeling paradigms, which are flexible in integrating …

Predicting Biomolecular Properties And Interactions Using Numerical, Statistical And Machine Learning Methods, Elyssa Sliheet

Mathematics Theses and Dissertations

We investigate machine learning and electrostatic methods to predict biophysical properties of proteins, such as solvation energy and protein ligand binding affinity, for the purpose of drug discovery/development. We focus on the Poisson-Boltzmann model and various high performance computing considerations such as parallelization schemes.

Gradual Memory Safety, Jack Phillips

All NMU Master's Theses

This paper extends the theory of Gradual Types to include memory safe Region-Types and Region-Based Memory Management. It also makes advancements in the capabilities of Region-Based systems. Lastly, it presents the Svejk language and Hasek Type System.

Enabling Sustainable Mining Via Ai-Based Techniques, Nurul Asyikeen Binte Azhar

Dissertations and Theses Collection (Open Access)

The precedence-constrained production scheduling problem (PCPSP) in Long-Term Mine Planning (LTMP) is NP-hard and conventionally prioritizes the Net Present Value (NPV) of profits. Even so, heightened sustainability concerns necessitate heightened sustainable practices. Yet, research still lags. This dissertation addresses this paucity by integrating sustainability elements through Multi-Objective Optimization (MOO), introducing novel algorithms and proposing an uncertainty assessment within a dual Multi-Objective Evolutionary Algorithm (MOEA) setup.

Firstly, our systematic review of past LTMP research focused on the PCPSP and highlighted sustainability elements. Overall, it furnished real-world components incorporated into mathematical formulations, trends, quality of solutions (efficacy) and computation time (efficiency) of …

On Adaptivity And Randomness For Streaming Algorithms, Manuel Stoeckl

Dartmouth College Ph.D Dissertations

A streaming algorithm has a limited amount of memory and reads a long sequence (data stream) of input elements, one by one, and computes an output depending on the input. Such algorithms may be used in an online fashion, producing a sequence of intermediate outputs corresponding to the prefixes of the data stream. Adversarially robust streaming algorithms are required to give correct outputs with a desired probability even when the data stream is adaptively generated by an adversary that can see all intermediate outputs of the algorithm. This thesis binds together research on a variety of problems related to the …

Towards Low-Resource Rumor Detection: Unified Contrastive Transfer With Propagation Structure, Hongzhan Lin, Jing Ma, Ruichao Yang, Zhiwei Yang, Mingfei Cheng

Research Collection School Of Computing and Information Systems

The truth is significantly hampered by massive rumors that spread along with breaking news or popular topics. Since there is sufficient corpus gathered from the same domain for model training, existing rumor detection algorithms show promising performance on yesterday's news. However, due to a lack of substantial training data and prior expert knowledge, they are poor at spotting rumors concerning unforeseen events, especially those propagated in different languages (i.e., low-resource regimes). In this paper, we propose a simple yet effective framework with unified contrastive transfer learning, to detect rumors by adapting the features learned from well-resourced rumor data to that …