Theory and Algorithms Commons^™

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 Time-Domain Boundary Integral Equation For Moving Acoustic Sources In Uniform Flow And Its Solution By An Advanced Time Propagation Approach, Fang Q. Hu, Douglas M. Nark

Mathematics & Statistics Faculty Publications

This paper presents a time-domain boundary integral equation (TDBIE) formulation for predicting acoustic scattering from moving sources in a uniform mean flow. This work is motivated by the increasing need for accurate aeroacoustic modeling of modern aircraft configurations, including VTOL and eVTOL systems with rotating components. A key challenge in time-domain scattering simulations with moving sources is the determination of retarded time for a given observer time, which involves solving an implicit equation at each time step. This can be computationally costly, particularly for numerical solution of the TDBIE where every surface element on the scattering body acts as an …

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 …

Analysis Of Bin Packing Variants, Kyle T. Ambrose

UNF Graduate Theses and Dissertations

The Bin Packing problem is a classic and widely studied optimization problem that arises naturally in applications like manufacturing, logistics, and memory allocation, where space and resource constraints are critical. In this thesis, we first demonstrate the NP-completeness of Bin Packing via a reduction from Three-Dimensional Matching, establishing its foundational complexity. We then survey core heuristics for the one-dimensional case and extend our analysis to two and three-dimensional variants, including both offline and online strategies. Special attention is given to stochastic bin packing, where item sizes are modeled as random variables drawn from distributions such as uniform, truncated normal, and …

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 …

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 …

Motion Artifacts Removal From Measured Arterial Pulse Signals At Rest: A Generalized Sdof-Model-Based Time-Frequency Method, Zhili Hao

Mechanical & Aerospace Engineering Faculty Publications

Motion artifacts (MA) are a key factor affecting the accuracy of a measured arterial pulse signal at rest. This paper presents a generalized time–frequency method for MA removal that is built upon a single-degree-of-freedom (SDOF) model of MA, where MA is manifested as time-varying system parameters (TVSPs) of the SDOF system for the tissue–contact-sensor (TCS) stack between an artery and a sensor. This model distinguishes the effects of MA and respiration on the instant parameters of harmonics in a measured pulse signal. Accordingly, a generalized SDOF-model-based time–frequency (SDOF-TF) method is developed to obtain the instant parameters of each harmonic in …

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

Mechanical & Aerospace Engineering Faculty Publications

This paper, the first of two parts, presents an analytical model of motion artifacts (MAs) in measured pulse signals by accelerometers and photoplethysmography (PPG) sensors. As the transmission path from the true pulse signal in an artery to the sensor output (measured pulse signal), the tissue-contact-sensor (TCS) stack is modeled as a 1DOF (degree-of-freedom) system. MAs cause baseline drift of the mass and simultaneously time-varying system parameters (TVSPs) of the TCS stack. With arterial wall displacement and pulsatile pressure serving separately as the true pulse signal, an analytical model is developed to mathematically relate baseline drift and TVSP to a …

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 …

Motion Artifacts (Ma) At-Rest In Measured Arterial Pulse Signals: Time-Varying Amplitude In Each Harmonic And Non-Flat Harmonic-Ma Coupled Baseline, Md Mahfuzur Rahman, Mamun Hasan, Zhili Hao

Mechanical & Aerospace Engineering Faculty Publications

Motion artifacts (MA) cause great variability in a measured arterial pulse signal, and treatment of MA solely as a baseline drift (BD) fails to eliminate its effect on the measured signal. This paper presents a study on the effect of MA at rest (< 0.7 Hz) on measured arterial pulse signals using a microfluidic-based tactile sensor. By taking full account of the dynamic behavior of the transmission path from the true pulse signal in an artery to a measured pulse signal at the sensor, the tissue-contact-sensor (TCS) stack, an analytical model of MA in a measured pulse signal is developed. In this model, the TCS stack is treated as a 1DOF system for its dynamic behavior; MA is quantified as the displacement (i.e., BD) and time-varying system parameters (TVSP) of the TCS stack. The mathematical expression of MA in a measured pulse signal reveals that while BD remains as low-frequency additive noise, TVSP causes time-varying harmonics in a measured pulse signal. Further time-frequency analysis (TFA) of measured pulse signals validates the existence of TVSP and, for the first time, reveals its effect on a measured pulse signal: time-varying amplitude in each harmonic and non-flat harmonic-MA-coupled baseline.

A Two-Phase Learning Approach Integrated With Multi-Source Features For Cloud Service Qos Prediction, Fuzan Chen, Jing Yang, Haiyang Feng, Harris Wu, Minqiang Li

Information Technology & Decision Sciences Faculty Publications

Quality of Service (QoS) is a key factor for users when choosing cloud services. However, QoS values are often unavailable due to insufficient user evaluations or provider data. To address this, we propose a new QoS prediction method, Multi-source Feature Two-phase Learning (MFTL). MFTL incorporates multiple sources of features influencing QoS and uses a two-phase learning framework to make effective use of these features. In the first phase, coarse-grained learning is performed using a neighborhood-integrated matrix factorization model, along with a strategy for selecting high-quality neighbors for target users. In the second phase, reinforcement learning through a deep neural network …

Age Of Information-Based Optimal Scheduling With Energy Cost Trade-Off For Smart Warehouse: A Deep Reinforcement Learning-Based Approach, Sandip Roy, Abhishek Bisht, Ashok Kumar Das, Sachin Shetty

VMASC Publications

Recent advances in the integration of high-speed mobile networks and real-time IoT devices have facilitated in building of smart warehouses, where a set of beacons and Internet of Things (IoT) devices (or source nodes) can monitor the status of various physical processes in a time-critical way. In real-time status monitoring systems, like smart warehouses, quantifying the freshness of the Internet of Things (IoT) data based on the age of information (AoI) metrics becomes quite crucial. As source nodes are battery-constrained, a balanced trade-off between AoI minimization and preservation of source node battery energy is essential. In this paper, in a …

Faithful Narratives From Complex Conceptual Models: Should Modelers Or Large Language Models Simplify Causal Maps, Tyler J. Gandee, Philippe J. Giabbanelli

VMASC Publications

(1) Background: Comprehensive conceptual models can result in complex artifacts, consisting of many concepts that interact through multiple mechanisms. This complexity can be acceptable and even expected when generating rich models, for instance to support ensuing analyses that find central concepts or decompose models into parts that can be managed by different actors. However, complexity can become a barrier when the conceptual model is used directly by individuals. A ‘transparent’ model can support learning among stakeholders (e.g., in group model building) and it can motivate the adoption of specific interventions (i.e., using a model as evidence base). Although advances in …

5g-Practical Byzantine Fault Tolerance: An Improved Pbft Consensus Algorithm For The 5g Network, Xin Liu, Xing Fan, Baoning Niu, Xianrong Zheng

Information Technology & Decision Sciences Faculty Publications

The consensus algorithm is the core technology of blockchain systems to maintain data consistency, and its performance directly affects the efficiency and security of the whole system. Practical Byzantine Fault Tolerance (PBFT) plays a crucial role in blockchain consensus algorithms by providing a robust mechanism to achieve fault-tolerant and deterministic consensus in distributed networks. With the development of 5G network technology, its features of high bandwidth, low latency, and high reliability provide a new approach for consensus algorithm optimization. To take advantage of the features of the 5G network, this paper proposes 5G-PBFT, which is an improved practical Byzantine fault-tolerant …

Physics-Informed Deep Learning With Kalman Filter Mixture For Traffic State Prediction, Niharika Deshpande, Hyoshin (John) Park

Engineering Management & Systems Engineering Faculty Publications

Accurate traffic forecasting is crucial for understanding and managing congestion for efficient transportation planning. However, conventional approaches often neglect epistemic uncertainty, which arises from incomplete knowledge across different spatiotemporal scales. This study addresses this challenge by introducing a novel methodology to establish dynamic spatiotemporal correlations that captures the unobserved heterogeneity in travel time through distinct peaks in probability density functions, guided by physics-based principles. We propose an innovative approach to modifying both prediction and correction steps of the Kalman Filter (KF) algorithm by leveraging established spatiotemporal correlations. Central to our approach is the development of a novel deep learning model …