Theory and Algorithms Commons^™

Graphtreemed: A Hybrid Graph-Tree Rag Architecture For Mission-Critical Medical Applications, Joshit Mohanty, Sandeep Kumar Nayak, Sumit Lahiri

Graduate Student Government Association Research Conference

Studies within engineering management indicate that decision-making is often based on the cognitive processing of grouped and pictographic information clusters entangled with high-level pattern recognition. Similarly, graph-based retrieval-augmented generation (RAG) architectures substantially improve diagnostic accuracy and interpretability, while tree-structured systems reduce critical misses through hierarchical reasoning. However, existing solutions often lack a unified framework that seamlessly integrates these two paradigms to address the multifaceted demands of mission-critical healthcare settings. This proposal introduces GraphTreeMed, a novel hybrid RAG architecture designed to harness the complementary strengths of graph-based and tree-based retrieval mechanisms, thereby advancing the safety and efficacy of clinical decision support …

Leveraging Benford’S Law And Machine Learning For Financial Fraud Detection, Benjamin R. Fu

Cybersecurity Undergraduate Research Showcase

Financial fraud, particularly credit card fraud, continues to pose substantial challenges to financial institutions due to its increasing frequency and impact on consumer trust. While traditional rule-based methods have provided foundational defenses, their limitations in scalability and adaptability have accelerated the adoption of machine learning (ML) techniques. Concurrently, Benford’s Law—a statistical principle often used in forensic accounting—has demonstrated efficacy in detecting anomalies within naturally occurring numerical datasets. This study explores a hybrid fraud detection approach that integrates Benford’s Law with supervised machine learning algorithms, including Logistic Regression, Random Forest, and k-Nearest Neighbors. Using the publicly available European credit card fraud …

36 - Investigation Of The Digital Footprint Of Scientific Research In Social Media – Preliminary Findings, Lee Logan, Dominik Soos, Sean Baker, Jian Wu

Undergraduate Research Symposium

Title: Investigation of The Digital Footprint of Scientific Research in Social Media – Preliminary Findings

Authors: Lee Logan, Sean Baker, Dominik Soos, Jian Wu

The spread of scientific information and research beyond the confines of academic institutions plays a central role in how the public understands and trusts modern sciences. Social media has become an essential means of dissemination for scholarly news, papers, and other forms of engagement. This research aims to explore how scientific research is disseminated over social media to understand its role as a bridge between peer-reviewed research and the public's overall understanding. To support the research …

32 - Nested Two Level Decomposition For Quantum Computing, Andrew Maciejunes, John Stenger, Dan Gunlycke, Nikos Chrisochoides

Undergraduate Research Symposium

Abstract—We present a two-level decomposition strategy for solving the Vehicle Routing Problem (VRP) using the Quantum Approximate Optimization Algorithm (QAOA). A Problem-Level Decomposition (PLD) partitions a 9-node (72-qubit) VRP into smaller Traveling Salesman Problem (TSP) instances. Each TSP is then further simplified via Circuit-Level Decomposition (CLD), enabling execution on near-term quantum devices. Our approach achieves up to 90% reductions in circuit depth and qubit count. These results demonstrate the feasibility of solving VRPs previously too complex for quantum simulators and provide early evidence of potential quantum utility.

Algorithms For Order Statistics In Farey Sequences: A Computational Study, Connor Weyers

School of Computing: Dissertations, Theses, and Student Research

Farey sequences are the sets of irreducible fractions in increasing order with denominator less or equal to some integer n. They are a well-known concept in number theory problems and are related to many other concepts in number theory including integer factoring, Fibonacci sequences, and Riemann’s Zeta function. In this paper, we investigate some known algorithms to solve certain problems in Farey sequences from a computational perspective. In particular, we implement established algorithms that have not been previously implemented with the goal of creating a package that can be used more broadly. We also develop a new algorithm for rational …

Open-Set Graph Anomaly Detection Via Normal Structure Regularisation, Qizhou Wang, Guansong Pang, Mahsa Salehi, Xiaokun Xia, Christopher Leckie

Research Collection School Of Computing and Information Systems

This paper considers an important Graph Anomaly Detection (GAD) task, namely open-set GAD, which aims to train a detection model using a small number of normal and anomaly nodes (referred to as *seen anomalies*) to detect both seen anomalies and *unseen anomalies* (*i.e*., anomalies that cannot be illustrated the training anomalies). Those labelled training data provide crucial prior knowledge about abnormalities for GAD models, enabling substantially reduced detection errors. However, current supervised GAD methods tend to over-emphasise fitting the seen anomalies, leading to many errors of detecting the unseen anomalies as normal nodes. Further, existing open-set AD models were introduced …

Ai Models By Boodlebox: Purpose-Built Intelligence, Kyle Horn

SACAD: Scholarly Activities

Generative AI has transformed the way we interact with technology, enabling dynamic and intelligent conversations through AI-driven bots. This project explores my experience with BoodleBox, a platform that hosts AI chatbots, offering users access to leading AI models such as ChatGPT, Gemini, DALL·E, and DeepSeek. Through the FHSU Generative AI Initiative, I was granted access to experiment with these models and create my own custom AI bot tailored to specific needs. This poster highlights the process of developing a custom bot, including defining instructions, enforcing rules, and sharing the bot for others to use. Additionally, it discusses the background of …

Robust Spacecraft Autonomy For Deep Space Exploration In Special Euclidean Group Se(3), Matthew Wittal

Doctoral Dissertations and Master's Theses

Over the past half-century, humanity has gained extensive experience conducting manned spaceflight near Earth. Arguably, "near Earth" could even include the Moon — the most distant destination humans have reached. However, "near" in this work primarily refers low Earth orbit (LEO). One could argue that we have not truly left Earth since the Apollo, as spacecraft in some LEOs remain subject to atmospheric drag thus emphasizing their continued connection to Earth's immediate environment. Reflecting on this, it becomes clear that humanity has largely remained bound to Earth’s immediate vicinity since the Apollo missions reached the Moon. However, that is set …

Role Of Eye-Tracking Technology And Software Algorithms In Enhancing Adhd Detection And Diagnosis: A Systematic Literature Review, Lauren E. Perkins

Honors College Theses

This systematic literature review explores the role of eye-tracking technology and software algorithms in enhancing the detection and diagnosis of ADHD. ADHD, a neurodevelopmental disorder affecting both children and adults, is traditionally diagnosed through behavioral assessments, which may lack objectivity. Recent studies suggest that eye-tracking, specifically focusing on saccades, fixations, and blink rates, offers the potential for more accurate and objective measures of ADHD. The review examines clinical trials, observational studies, and machine learning research to assess the correlation between ADHD and eye movement patterns. Results indicate that individuals with ADHD exhibit distinct eye movement patterns, which can be quantified …

Investigating Key Structures In Protective Scenes For Llms, Eben M. Weisman

University Honors Theses

This research delves into the realm of "protective scenes" within Large Language Models (LLMs), exploring their impact on bias mitigation, deception, and context preservation. The study investigates the use of roleplay prompting human-like behavior and reasoning in LLMs, focusing on the Character-LLM framework's concept of protective scenes with graduated levels of protection. By combining insights from psychology, cognitive science, and computational analysis, this research aims to develop a framework for understanding how protective scenes influence roleplay performance in LLMs, ultimately contributing to the development of more reliable and ethical AI systems.

Unraveling Genetic Links Between Diabetes And Heart Failure-A Machine Learning Approach, Sunakhi Sahoo, Marzieh Ayati

Research Symposium

Background: Diabetic heart failure (DHF) is defined as a chronic and progressive disease which is associated with both diabetes and heart failure (HF). Even though there have been many developments in the knowledge of these diseases, there is still much to learn about the genetic crossovers between the two. In this study, we identified genes that are associated with diabetic heart failure and heart failure by using gene expression data from patients with DHF, HF, and a control group of patients who died of natural causes. We sought to identify genes that had altered expression levels which could possibly play …

Analyzing And Comparing Refinement Indicators For Rbf-Fd Adaptive Algorithms, Anders R. Johnson

Theses and Dissertations

Recent progress has been made in the development of collocation-based iterative algorithms that approximate solutions to PDEs. These algorithms rely on the ability to identify regions within a domain where a finer discretization is required. Such iterative algorithms are beneficial particularly when solution functions have highly localized behavior. This thesis proposes an indicator for node refinement that is constructed by approximating the forward error. This proposed indicator also helps to establish confidence in the accuracy of a given solution estimate. The proposed error estimator is theoretically examined and compared with contemporary refinement indicators. It is shown that an iterative algorithm, …

Adversarial Attacks And Defense Methods In Robotic Systems, Thanh D. Le

Shelby Hall Graduate Research Forum Presentations

Presentation slides for a presentation given at the 1st annual Shelby Hall Graduate Research Forum at the University of South Alabama.

Detecting Sensor Data Manipulation, Ricky Green, Michael Black

Shelby Hall Graduate Research Forum Posters

The integration of Information Technology (IT) and Operational Technology (OT) have made OT devices vulnerable to threats that have been successfully exploited with devastating results. Many modern techniques for hardening and securing enterprise IT systems are either incompatible with OT components in an Industrial Control System (ICS), reduce the efficiency of processes, or are prohibitively expensive to implement. Research in the area of ICS security focuses on a top-down approach, such as intrusion prevention by securing the perimeter of the network and hardening computer systems. This approach is useful in business IT systems, but full compatibility with OT components in …

Bloom: Behavioral Learning And Outcome Observation In Microbes, Sean Sarwar Haque, Luke Compton Wharton, Ming Lin, Razvan Voicu

Symposium of Student Scholars

Understanding how pathogens respond to physical changes in their environment is crucial for developing effective treatments and preventative measures. Current research often relies on static models or experimental data that either fail to capture the dynamic interactions within cellular environments or are not generalizable to other types of pathogens. This project aims to address this gap by creating a comprehensive cell simulation that models pathogens and their response to chemical, physical, and physiological changes. The proposed solution is a simulation that integrates biological data and computational modeling to replicate the behavior of pathogens in real time as they are affected …

Toward Quantifying Interpolation Uncertainty In Set-Line Spacing Hydrographic Surveys, Elias Adediran, Christos Kastrisios, Kim Lowell, Glen Rice, Qi Zhang

Faculty Publications

The oceans remain one of Earth’s last great unknowns, with about 74% still unmapped to modern standards. Consequently, interpolation is employed to create seamless digital bathymetric models (DBMs) from incomplete hydrographic datasets, but this introduces unquantified depth uncertainties. This study aims to estimate and characterize uncertainties arising from set-line spacing hydrographic surveys, which are important for nautical charting, navigational safety, and many other applications. By sampling at different line spacings four complete coverage testbeds that vary in slope and roughness, the study interpolates across entire testbed areas using Spline, Inverse Distance Weighting, and Linear interpolation. The resulting interpolation uncertainties are …

Exploring & Exploiting High-Order Graph Structure For Sparse Knowledge Graph Completion, Tao He, Ming Liu, Yixin Cao, Zekun Wang, Zihao Zheng, Bing Qin

Research Collection School Of Computing and Information Systems

Sparse Knowledge Graph (KG) scenarios pose a challenge for previous Knowledge Graph Completion (KGC) methods, that is, the completion performance decreases rapidly with the increase of graph sparsity. This problem is also exacerbated because of the widespread existence of sparse KGs in practical applications. To alleviate this challenge, we present a novel framework, LR-GCN, that is able to automatically capture valuable long-range dependency among entities to supplement insufficient structure features and distill logical reasoning knowledge for sparse KGC. The proposed approach comprises two main components: a GNN-based predictor and a reasoning path distiller. The reasoning path distiller explores high-order graph …

Computing In The Commonwealth: Specialized Education In Computer Science And Information Technology For High School Students In Virginia – An Environmental Scan, Amy Corning, Jonathan D. Becker, Jon Graham, James Carrigan, Keisha Tennessee

ICRE Publications

Over the past two decades, Virginia has invested substantially in STEM education, in part through specialized programs focused on computer science and information technology (CS/IT). This study represents the first effort to identify Virginia’s specialized secondary CS/IT programs and examine them collectively. Findings from the statewide environmental scan indicate that the programs are delivered through a wide variety of institutional structures, including Governor’s STEM Academies, Governor’s Schools, specialty centers, and academies, but most often through Career and Technical Education (CTE) centers. Programs tend to be concentrated in metropolitan areas, and some rural divisions may not be served. The programs provide …

Analysis And Authentication Of An Optical Method For Early Detection Of Harmful Algal Blooms, Cody Schumacher

Theses, Dissertations and Capstones

The proliferation and frequency of harmful algal blooms (HABs) attributed to eutrophication, storm events and a changing climate have been an increasing concern in both lotic and lentic freshwater ecosystems. Methods of detecting HABs have been explored through fluorescent measurement and sample analysis, but are often expensive and time-consuming. A novel smart device application is in development to detect HABs based on images captured and analyzed by machine learning algorithms trained to distinguish potential cyanobacterial blooms. The HABs App model accurately detected cyanobacteria in strong relationship with biovolume concentrations (R² = 0.996) within the Greenup Pool of the Ohio …

A Proof Of Np-Completeness For The K-Means Clustering Algorithm, Brooke C. Feinberg

Scripps Senior Theses

The k-means clustering algorithm is one of the most widely used clustering techniques in data analysis and machine learning, yet its exact computational complexity remains subject to ongoing theoretical investiga- tion. This work establishes the NP-completeness of k-means by proving (1) it is NP-hard and (2) it lies in NP. To demonstrate NP-hardness, we construct a series of polynomial-time reductions from well-known NP-complete problems. Specifically, we reduce 3sat to Vertex Cover, and then reduce Vertex Cover to k-means, thereby establishing the computational hardness of the k-means clustering problem. We then prove k-means is in NP, and thus conclude it is …

Understanding Misinformation On Social Media Through Truthfulness Stance, Zhengyuan Zhu

Computer Science and Engineering Dissertations - Archive

Misinformation on social media has become a pervasive issue that profoundly influences public opinion and decision-making. As false or misleading claims circulate widely online, there is a critical need for analytical tools to understand how people react to such claims. This dissertation introduces the concept of truthfulness stance as a key lens for social sensing. In essence, truthfulness stance assesses whether a textual utterance believes a factual claim to be true, false, or expresses a neutral stance or no stance toward the claim. Leveraging stance in this manner fills an important gap in misinformation research: it enables us to gauge …

Towards Smart Farming: Image-Based Crop Health Assessment And Disease Diagnosis Using Deep Learning Techniques, Kristina Botova

Master's Theses or Doctor of Nursing Practice

Accurate crop monitoring is essential for optimizing agricultural productivity and ensuring food security. This study presents a comprehensive deep learning framework for image crop type recognition, health status prediction, and disease detection using multiple Convolutional Neural Network (CNN) models. The proposed approach uses open-source datasets consisting of five crop types (apple, corn, grape, potato, tomato), varying health conditions, and common diseases. By deploying specialized CNN architecture focused on each task, the system achieves a high accuracy of 99.25% in classifying crop types, identifying health status, and detecting specific diseases. Compared to a single CNN model, the use of the proposed …

Ai For Nuclear Physics: The Exclaim Project, S. Liuti, D. Adams, M. Boër, G. W. Chern, M. Cuic, M. Engelhardt, G. R. Goldstein, B. Kriesten, Y. Li, H. W. Lin, M. Sievert, D. Sivers

Computer Science Faculty Publications

An overview of the recent activity of the newly funded EXCLusives with AI and Machine learning (EXCLAIM) collaboration is presented. The main goal of the collaboration is to develop a framework to implement AI and machine learning techniques in problems emerging from the phenomenology of high energy exclusive scattering processes from nucleons and nuclei, maximizing the information that can be extracted from various sets of experimental data, while implementing theoretical constraints from lattice QCD. A specific perspective embraced by EXCLAIM is to use the methods of theoretical physics to understand the working of ML, beyond its standardized applications to physics …

Fares On Fairness: Using A Total Error Framework To Examine The Role Of Measurement And Representation In Training Data On Model Fairness And Bias, Patrick Oliver Schenk, Christoph Kern, Trent D. Buskirk

Information Technology & Decision Sciences Faculty Publications

Data-driven decisions, often based on predictions from machine learning (ML) models are becoming ubiquitous. For these decisions to be just, the underlying ML models must be fair, i.e., work equally well for all parts of the population such as groups defined by gender or age. What are the logical next steps if, however, a trained model is accurate but not fair? How can we guide the whole data pipeline such that we avoid training unfair models based on inadequate data, recognizing possible sources of unfairness early on? How can the concepts of data-based sources of unfairness that exist in the …

Optimizing Decision-Making In A Cerebral Palsy Model Using Reinforcement Learning, Richard Ampah

Pitzer Senior Theses

This study presents an original interdisciplinary investigation into how reinforcement learning (RL) can model motor and cognitive defects and potentially improve motor and cognitive functions in individuals with cerebral palsy (CP), a non-progressive neurological disorder that impairs movement and adaptability. Integrating computational neuroscience and machine learning, the research applies policy gradient methods and Markov Decision Processes (MDPs) to simulate adaptive learning in agents with and without CP-related constraints.

The central aim is to compare the cumulative rewards of optimal policies, derived from value iteration, and human-like learning policies using the REINFORCE algorithm, both with and without the Bellman baseline. The …

An Analytical Model Of Motion Artifacts In A Measured Arterial Pulse Signal—Part Ii: Tactile Sensors, Md Mahfuzur Rahman, Subodh Toraskar, Mamun Hasan, Zhili Hao

Mechanical & Aerospace Engineering Faculty Publications

This paper, the second of two parts, presents an analytical model of motion artifacts (MA) in measured pulse signals by a tactile sensor, which contains a deformable microstructure sitting on a substrate. While the tissue-contact-sensor (TCS) stack and the sensor are both treated as a 1DOF (degree-of-freedom) system, tissue–sensor contact joins their mass together to form a 1DOF system with springs and dampers on both sides. MA on the sensor substrate causes baseline drift and time-varying system parameters (TVSP) of the TCS stack simultaneously. An analytical model is developed to mathematically relate baseline drift and TVSP to a measured pulse …

Ripples: An Automated Embedding Generation Algorithm For The Forward-Forward Algorithm, Spencer Connolly

All Graduate Theses, Dissertations, and Other Capstone Projects

The Forward-Forward algorithm (FF) is yet another novel invention by Geoffrey Hinton, the creator of the famous backpropagation algorithm (BP). Since its proposal, many papers have been published exploring its potential, and good progress has been made in increasing its viability. Though FF continually falls short of BP, its purpose is not to replace BP and preliminary research shows that there is plenty of room for growth. In this paper, we present a literature review for FF algorithms applied to Convolution Neural Networks (CNN) for image classification tasks and set the stage for applying FF to more complex datasets. The …

Empirical Analysis Of Political Districting Splitability Via Uniform Spanning Trees In Polynomial Time, Brooke C. Feinberg

Scripps Senior Theses

This work expands a recently proven conjecture that a polynomial fraction of all uniform spanning trees (USTs) are splittable into k balanced partitions on grid graphs to real-world political districting plans. We investigate whether similar structural properties hold for the planar dual graphs of U.S. counties (cnty) and tracts (t), using Wilson’s algorithm to generate uniform random spanning trees and Breadth- First Search (BFS) to check for splitability into balanced partitions. Our empirical findings suggest that real-world districting plans can be split into 2-balanced, connected partitions in a fraction of polynomial time. This result highlights the potential for scalable redistricting …

Analyzing Political Sentiment On Micro-Blogging Data: A Lexicon And Machine Learning Approach To The 2024 U.S. Presidential Election, Ava Grey

CMC Senior Theses

This paper explores the trends in sentiment towards U.S. presidential candidates Kamala Harris and Donald Trump through micro-blogging social media text during the five months leading up to the election. Two datasets of varying sizes and origins were used to contextualize and validate analysis findings. The analyses include both a lexicon-based approach and a machine learning predictive method. Common sentiment analysis techniques like term frequency, term frequency inverse, various lexicons, and n-grams were utilized during the lexicon approach. During the modeling, a random forest was utilized in addition to the methods used during the lexicon approach. Results showed that overall …

Exploratory Data Analysis (Eda) And Predictive Machine Learning (Ml) For Buildings’ Energy Fault Detection, Akshith Nukala

Theses and Dissertations

Building energy load fault detection is a critical challenge in energy usage analysis. It helps uncover energy wastage, machinery/appliance degradation or inefficiency, and failures or faults in buildings’ HVAC (heating, ventilation, and air conditioning) systems. Early identification of machinery failure and energy wastages due to operational maintenance negligence in large sites such as campus buildings is indispensable for achieving energy efficiency. This is crucial for saving patrol and minimizing the response time to restore the building appliances or systems to their optimal state.

Advancements in state-of-the-art AI/ML data-driven algorithms and techniques enabled us to build accurate, efficient and scalable fault …