Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (535)
- Artificial Intelligence and Robotics (489)
- Databases and Information Systems (355)
- Numerical Analysis and Scientific Computing (217)
- Software Engineering (204)
-
- Electrical and Computer Engineering (202)
- Computer Engineering (200)
- Other Computer Sciences (191)
- Mathematics (178)
- Social and Behavioral Sciences (155)
- Data Science (150)
- Information Security (136)
- Graphics and Human Computer Interfaces (134)
- OS and Networks (124)
- Medicine and Health Sciences (110)
- Systems Architecture (108)
- Applied Mathematics (103)
- Programming Languages and Compilers (102)
- Operations Research, Systems Engineering and Industrial Engineering (95)
- Statistics and Probability (87)
- Life Sciences (80)
- Physics (74)
- Digital Communications and Networking (63)
- Business (60)
- Discrete Mathematics and Combinatorics (59)
- Public Affairs, Public Policy and Public Administration (52)
- Computer and Systems Architecture (51)
- Institution
-
- Singapore Management University (513)
- Old Dominion University (324)
- Air Force Institute of Technology (95)
- University of Dayton (60)
- University of Nevada, Las Vegas (53)
-
- City University of New York (CUNY) (51)
- Portland State University (48)
- California Polytechnic State University, San Luis Obispo (44)
- University of Arkansas, Fayetteville (40)
- Claremont Colleges (30)
- Southern Methodist University (29)
- University of Nebraska - Lincoln (28)
- Loyola University Chicago (26)
- University of Kentucky (26)
- Dartmouth College (23)
- San Jose State University (23)
- Technological University Dublin (19)
- Virginia Commonwealth University (19)
- California State University, San Bernardino (18)
- University of Denver (18)
- University of Malaya (18)
- University of New Mexico (17)
- Edith Cowan University (16)
- Purdue University (16)
- East Tennessee State University (15)
- Georgia Southern University (15)
- Rose-Hulman Institute of Technology (15)
- University of Nebraska at Omaha (15)
- Chapman University (14)
- Institute of Business Administration (14)
- Keyword
-
- Algorithms (150)
- Machine learning (100)
- Artificial intelligence (47)
- Machine Learning (45)
- Algorithm (44)
-
- Deep learning (37)
- Classification (34)
- Computer algorithms (31)
- Image processing (30)
- Genetic algorithms (29)
- Graph theory (29)
- Optimization (29)
- Clustering (27)
- Computer science (27)
- Computer Science (25)
- Neural networks (23)
- Reinforcement learning (23)
- Artificial Intelligence (22)
- Simulation (19)
- Cryptography (18)
- Deep Learning (18)
- Genetic algorithm (18)
- Computational complexity (17)
- Computer vision (17)
- Data mining (17)
- Online learning (16)
- Accuracy (13)
- Big data (13)
- Feature selection (13)
- Graph (12)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (493)
- Theses and Dissertations (122)
- Electrical & Computer Engineering Theses & Dissertations (81)
- Computer Science Faculty Publications (79)
- Electrical & Computer Engineering Faculty Publications (49)
-
- Electronic Theses and Dissertations (33)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (30)
- Master's Theses (28)
- Computer Science: Faculty Publications and Other Works (25)
- Dissertations, Theses, and Capstone Projects (22)
- Theses and Dissertations--Computer Science (21)
- Dissertations (20)
- Publications and Research (20)
- Computer Science and Computer Engineering Undergraduate Honors Theses (19)
- Computer Science Theses & Dissertations (17)
- Graduate Theses and Dissertations (17)
- SMU Data Science Review (17)
- Honors Theses (16)
- Faculty Publications (15)
- VMASC Publications (15)
- Computer Science Faculty Publications and Presentations (14)
- Dissertations and Theses (14)
- International Conference on Information and Communication Technologies (14)
- Mathematical Sciences Technical Reports (MSTR) (14)
- Engineering Management & Systems Engineering Faculty Publications (13)
- Mathematics & Statistics Faculty Publications (13)
- LSU New Orleans Theses and Dissertations (12)
- MAICS: The Modern Artificial Intelligence and Cognitive Science Conference (12)
- Master's Projects (12)
- Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal (11)
- Publication Type
- File Type
Articles 151 - 180 of 2159
Full-Text Articles in Theory and Algorithms
Adapting Large Language Models For Parameter-Efficient Log Anomaly Detection, Ying Fu Lim, Jiawen Zhu, Guansong Pang
Adapting Large Language Models For Parameter-Efficient Log Anomaly Detection, Ying Fu Lim, Jiawen Zhu, Guansong Pang
Research Collection School Of Computing and Information Systems
Log Anomaly Detection (LAD) seeks to identify atypical patterns in log data that are crucial to assessing the security and condition of systems. Although Large Language Models (LLMs) have shown tremendous success in various fields, the use of LLMs in enabling the detection of log anomalies is largely unexplored. This work aims to fill this gap. Due to the prohibitive costs involved in fully fine-tuning LLMs,we explore the use of parameter-efficient fine-tuning techniques (PEFTs) for adapting LLMs to LAD.To have an in-depth exploration of the potential of LLM-driven LAD, we present a comprehensive investigation of leveraging two of the most …
On The Design Of A Framework For Large-Scale Exploratory Graph Analytics, Oliver Andres Alvarado Rodriguez
On The Design Of A Framework For Large-Scale Exploratory Graph Analytics, Oliver Andres Alvarado Rodriguez
Dissertations
Large-scale exploratory graph analytics merges data science with high-performance computing to extract critical insights from network-representable data. Data scientists routinely analyze data from the natural, social, and computing sciences by representing it as networks, or graphs, where objects become vertices and their relationships become edges. This representation allows data scientists to add graph analytics to their toolbox. However, designing tools for large-scale exploratory graph analytics is challenging due to the complexities of graph algorithms, such as high communication in distributed systems and large memory demands. These challenges can lead to overly complex software, which limits usability and development to a …
Tree Story, Jia Hu
Tree Story, Jia Hu
Masters Theses
What is Nature?
Nature is a system of intelligence. It means designing for efficiency—often by learning from strategies that have evolved over time. In my research, I use patterns to interpret and decode nature.
To explore nature, I began with the red cedar tree, aiming to simulate and predict its growth patterns—forms shaped by both internal biology and external forces. By analyzing its geometry, I sought to understand how trees embody the dynamic relationship between organism and environment. These patterns reveal the adaptive logic of life.
Patterns are central to understanding nature. While tree geometry may appear chaotic, it follows …
Towards Practical And Real-Time Decoding Of Quantum Hypergraph Codes, Binghong (Leo) Li
Towards Practical And Real-Time Decoding Of Quantum Hypergraph Codes, Binghong (Leo) Li
Computer Science Theses
Quantum error correction (QEC) enables scalable quantum computation by detecting and correcting physical errors. However, decoding remains a key bottleneck—particularly for quantum low-density parity-check (qLDPC) codes, whose hypergraph structures demand complex reasoning. Most existing decoders are either too slow for real-time use or lack formal guarantees, and often struggle to generalize across diverse quantum hardware.
This thesis introduces the Minimum-Weight Parity Factor (MWPF) algorithm, a unified and certifiable decoding formulation that extends minimum-weight perfect matching to general hypergraph-based stabilizer codes. We focus on making MWPF practical and performant through a two-phase decoding architecture, consisting of a fast search phase and …
Data Encoding, Compilation, And Algorithms For Quantum Machine Learning, Aviraj Sinha
Data Encoding, Compilation, And Algorithms For Quantum Machine Learning, Aviraj Sinha
Computer Science and Engineering Theses and Dissertations
Quantum computing enables new approaches to data processing, especially in quantum machine learning. Unlike classical systems, quantum data must be synthesized through operations and can exist in superposition. Encoding choices affect efficiency, noise resilience, and trainability—key factors in quantum machine learning models. This dissertation enhances quantum data encodings by extending quantum read-only memory (QROM) beyond binary representations, improving efficiency and parallelism. It introduces new compilation methods for quantum random number generators (QRNGs), supporting non-parametric distributions for post-quantum cryptography. Additionally, it explores Cayley graph-based encodings to extract spectral features for quantum machine learning.
Noise-Embedded Image Processing Based On Quantum Data Encodings, Yayu Mo
Noise-Embedded Image Processing Based On Quantum Data Encodings, Yayu Mo
Multidisciplinary Studies Theses and Dissertations
Advancements in quantum information have significantly impacted the field of image processing, although challenges remain. Especially in the edge detection and image encoding area, distorted feature and noises would affect the further classification or super resolution tasks. In our work, we conduct researches on two stages to both evaluate the potential of Quantum-based Convolutional Structure in extracting distorted feature and further explore the effects of quantum noise channels on quantum image encodings.
In the first stage, we propose a method to extract distorted edge features by applying shallow layers in quantum convolutional neural networks (QCNN). By combining the advantages of …
Algorithms To Estimate Contours: Two Applications Of Analytical Tools In Differential Geometry And Topology, Mohammad Abirul Islam
Algorithms To Estimate Contours: Two Applications Of Analytical Tools In Differential Geometry And Topology, Mohammad Abirul Islam
Computer Science ETDs
We develop distributed robotics algorithms with analytical tools needed to define and analyze angle turned and distance traversed by robots executing geometric algorithms. We then use these analytical tools to obtain information, via sensor measurements, about an a priori unknown surface. Our contributions are threefold. First, we develop the Sketch Algorithm, which estimates the boundary of any unknown contour and is asymptotically optimal in terms of distance traversed and angle turned. Second, we present experimental field work that validates the Sketch Algorithm. Finally, we propose an approach to find multiple sources of a surface with potential applications to approximate that …
Applications Of The Mathieu Groups And Information Theory In Dna Encoding Functions, Juan C. Nava Jr
Applications Of The Mathieu Groups And Information Theory In Dna Encoding Functions, Juan C. Nava Jr
Theses and Dissertations
A foundational idea in mathematics lies in breaking down existing components into their bare fundamentals. As evidenced by prime numbers and composites, we learn this idea at an early age. Categorizing these broken-down components into their simplest form allows mathematicians to construct proofs from emergent patterns. John Conway’s Atlas of Finite Groups in the 1990s was particularly concerned with the categorization of structures known as groups. There are certain axioms a group must adhere to, which amount to the retention of symmetry; ultimately a group helps us to better understand symmetric actions performed on a set with a binary operation. …
Computational Complexity Of Soundness Verification For Neural Networks, Scott Sirri
Computational Complexity Of Soundness Verification For Neural Networks, Scott Sirri
McKelvey School of Engineering Graduate Student Theses & Dissertations
Neural networks are an increasingly ubiquitous tool in systems of varying complexity across a range of domains. While these tools can be used to learn and predict complex functions, their opaque nature limits the scope of their acceptable applications. In particular, a lack of performance guarantees means that they are unsuitable for safety-critical applications such as self-driving cars and scheduling systems. Neural networks trained to solve NP-complete problems, in particular, are unlikely to be able to solve the problem exactly. However, a weaker soundness guarantee may be sufficient for some systems, e.g., that positive instances of the problem may be …
Optimized Student Grouping For Enhanced Classroom Performance, Kathryn E. Reardon
Optimized Student Grouping For Enhanced Classroom Performance, Kathryn E. Reardon
Honors Theses
Effective grouping methods enhance classroom collaboration and allow for a student-centered teaching approach; however, traditional grouping methods are time-consuming, subjective, and can create inconsistent group dynamics. This project addresses these challenges by employing a data-driven approach to optimize student groups based on academic performance, behavior, attendance, language barriers, and teacher preferences. The minimum viable product is a web application with an algorithm-driven system to group students and a database storage for group results. During the initiation phase, a problem was defined with a proposed solution. During the planning phase, potential design choices and grouping methods were researched and assessed. During …
Praxly: An Online Ide For The Praxis Cs Test Pseudocode, Benjamin Saupp
Praxly: An Online Ide For The Praxis Cs Test Pseudocode, Benjamin Saupp
James Madison Undergraduate Research Journal (JMURJ)
No abstract provided.
Intuiting Interaction: Meta-Reasoning And Meta-Learning As Foundations For Intelligent User Interfaces, Jeffrey Hsu
Intuiting Interaction: Meta-Reasoning And Meta-Learning As Foundations For Intelligent User Interfaces, Jeffrey Hsu
Theses and Dissertations
This research presents MARCO—a cognitive framework for Intelligent User Interfaces that uses meta-reasoning for context-aware adaptation across diverse tasks. It integrates multiple reasoning modules coordinated by a Meta-Cognitive Unit that selects strategies based on evolving demands. Evaluations show MARCO outperforms baselines in reasoning accuracy and computational efficiency.
Current Wind Simulation Techniques, Keegan J. Sims
Current Wind Simulation Techniques, Keegan J. Sims
Theses/Capstones/Creative Projects
Not much exists in the realm of wind simulation. For what does exist involves tornadoes, and even then that is stretched far and few between. Due to this we have a lot of room to explore, and figure things out. How do we simulate real time wind? My capstone project involves a simple wind algorithm, how does it compare to what does currently exist? This paper covers the papers about wind and how it it interacts with objects and itself.
Maximal Independent Set Algorithms Within Procedural Planar Maps: A Large-Scale Evaluation, Chaucer Ihrig
Maximal Independent Set Algorithms Within Procedural Planar Maps: A Large-Scale Evaluation, Chaucer Ihrig
Honors College Theses
Analysis of a childhood game has led us to the problem of maximum independent sets in planar graphs. We wrote a graph creation utility using R to generate a random planar map and its dual graph. This utility then finds a graph’s maximal independent set using a variety of six algorithms. We investigate statistical connections between graph structure, colorability, and the maximal independent sets found using these algorithms over an incredibly large and procedurally generated dataset. We find one can always win the coloring game if the resultant graph is two-colorable. The algorithms perform statistically and practically significantly better on …
Comparative Analysis Of Classical And Machine Learning Pathfinding Approaches, Miguel Gapud
Comparative Analysis Of Classical And Machine Learning Pathfinding Approaches, Miguel Gapud
Honors Theses
Pathfinding is an essential task for any autonomous robot. Graph-based classical pathfinding algorithms and machine learning approaches have both been used for this end, but they are often not compared against each other. An implementation of end-to-end (E2E) pathfinding using Proximal Policy Optimization (PPO) and an Alexnet architecture is compared against an implementation of Hybrid A*. A digital twin in Unity3D is used as the testing environment with the Clearpath Dingo as the pathfinding robot. In machine learning, the robot is controlled using PPO through ROS-Noetic with a camera as its sensor. Hybrid A* and its controls are implemented directly …
Advancing Precision And Autonomy In Agriculture And Medical Imaging Through Ai And Computer Visions, Tan-Hanh Pham
Advancing Precision And Autonomy In Agriculture And Medical Imaging Through Ai And Computer Visions, Tan-Hanh Pham
Theses and Dissertations
Deep learning has revolutionized numerous fields by enhancing precision, automation, and decision-making capabilities. This dissertation explores its applications in agriculture and medical image processing, introducing novel methodologies to improve accuracy and efficiency in these domains. These fields hold critical societal importance -- agriculture underpins global food security and sustainability, while medical imaging drives advancements in diagnostics and personalized healthcare, both benefiting significantly from data-driven innovations. In agriculture, deep learning is applied to precision spray systems through droplet analysis. Specifically, a generative model is designed to create synthetic droplet images, addressing the challenge of limited training samples, which are expensive …
Towards Visual Inertial Navigation With Fixed Tetrahedral Targets, Joao Leonardo Silva Cotta
Towards Visual Inertial Navigation With Fixed Tetrahedral Targets, Joao Leonardo Silva Cotta
Theses and Dissertations
This dissertation presents a robust method for 6DoF position estimation under impaired visual conditions utilizing a minimum 4-point Perspective-n-Point (P4P) solver designed for tetrahedral targets. Using SO(3) × R 3 instead of SE(3), the method uses a Lie group-based formulation to discriminate between rotation and translation, thereby enabling computationally efficient, resource-conscious op- optimization while preserving correct geometric behavior. Designed using the contemporary C++17 library ShomerTarget, the solver is analytically formulated and assessed under pragmatic robotic conditions. Particularly in low-light and high-dynamic environments, experiments on embedded systems, UAVs, and NASA’s Astrobee show that the proposed solver attains enhanced accuracy compared to …
Quantifying The Transfer Effectiveness Of An Artificial Intelligence-Based Simulator Pre-Training Program For Student Pilots, Ryan Guthridge
Quantifying The Transfer Effectiveness Of An Artificial Intelligence-Based Simulator Pre-Training Program For Student Pilots, Ryan Guthridge
Journal of Aviation/Aerospace Education & Research
Since the airline pilot shortage was initially studied in 2016, the pilot hiring model has been significantly impacted, with airlines hiring qualified pilots at unprecedented rates. The COVID-19 pandemic has slowed this hiring rate, however it is expected that airline hiring will soon increase to a rate higher than initially expected (Bureau of Transportation Statistics, 2022). With this dynamic, certified flight instructors are often the most qualified recruits for airlines, due to the number of hours and experience they have gained in the flight training organization. In turn, certified flight instructors are in short supply for flight training organizations worldwide. …
Graphtreemed: A Hybrid Graph-Tree Rag Architecture For Mission-Critical Medical Applications, Joshit Mohanty, Sandeep Kumar Nayak, Sumit Lahiri
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
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 …
Algorithms For Order Statistics In Farey Sequences: A Computational Study, Connor Weyers
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
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
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
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
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
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
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 …
Detecting Sensor Data Manipulation, Ricky Green, Michael Black
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 …
Adversarial Attacks And Defense Methods In Robotic Systems, Thanh D. Le
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.
Analyzing And Comparing Refinement Indicators For Rbf-Fd Adaptive Algorithms, Anders R. Johnson
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, …