Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Other Computer Sciences (3)
- Programming Languages and Compilers (3)
- Artificial Intelligence and Robotics (2)
- Biomechanics and Biotransport (2)
- Biomedical Engineering and Bioengineering (2)
-
- Engineering (2)
- Mathematics (2)
- Numerical Analysis and Scientific Computing (2)
- Software Engineering (2)
- Architectural Technology (1)
- Architecture (1)
- Bioinformatics (1)
- Biomechanical Engineering (1)
- Business (1)
- Cybersecurity (1)
- Databases and Information Systems (1)
- Discrete Mathematics and Combinatorics (1)
- Dynamical Systems (1)
- Education (1)
- Educational Methods (1)
- Graphics and Human Computer Interfaces (1)
- Information Security (1)
- Interior Architecture (1)
- Life Sciences (1)
- Management Information Systems (1)
- Mechanical Engineering (1)
- OS and Networks (1)
- Keyword
-
- Algorithm (1)
- Analysis (1)
- Answer set programming (1)
- Artificial Intelligence (1)
- Biological signal (1)
-
- Boltzmann (1)
- Collision (1)
- Computational logic (1)
- Computer science (1)
- Correlation networks (1)
- Crowd Simulation (1)
- Deterrence (1)
- Dilithium (1)
- Education (1)
- Evolutionary Algorithm (1)
- Floor Plan (1)
- Game Theory (1)
- Game-engine (1)
- Genetic Algorithm (1)
- Godot (1)
- Graph algorithms (1)
- High performance computing (1)
- Kyber (1)
- Lattice (1)
- MARL (1)
- ML-DSA (1)
- ML-KEM (1)
- Minimax-Q (1)
- Navier-stokes (1)
- Network filters (1)
- Publication Year
- Publication
- Publication Type
- File Type
Articles 1 - 15 of 15
Full-Text Articles in Theory and Algorithms
Teaching Machines To Deter: Exploring Strategic Deterrence In Ai Models, Will Taylor
Teaching Machines To Deter: Exploring Strategic Deterrence In Ai Models, Will Taylor
Theses/Capstones/Creative Projects
This capstone project investigates whether deterrence can emerge as a meaningful strategy within a zero-sum stochastic game using multi-agent reinforcement learning (MARL). After outlining core concepts in game theory and deterrence, the study models a simplified deterrence environment in which two minimax-Q agents repeatedly interact under uncertainty and adversarial incentives. The agents learn from rewards shaped by escalation costs, unilateral vulnerability, and the stabilizing benefits of restraint. Results show that both agents consistently converge toward a conservative, status-quo strategy, overwhelmingly selecting the Maintain action while avoiding both escalation and restraint in most scenarios. This behavior reflects the risk-averse logic of …
Post-Quantum Cryptography Encryption Implementation For Messaging App, Callum S. Ward
Post-Quantum Cryptography Encryption Implementation For Messaging App, Callum S. Ward
Theses/Capstones/Creative Projects
This paper and complementary capstone project aim to explore the state of post-quantum cryptography today by defining the algorithms with which quantum computers can decipher modern asymmetric cryptographic algorithms in exponentially accelerated time, exploring national standards body NIST’s recommendations to circumvent these weaknesses with post-quantum solutions, and implementing recommended algorithms in my group’s project for the UNO Computer Science Capstone course, LockTalk. After having decided on ML-KEM for quantum-resistant asymmetric key transfer and AES-256 for symmetric message encryption and decryption, I was able to cryptographically encode messages to obscure their plaintext values from communication interceptions without any discernible increase in …
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.
Time Evolution Is A Source Of Bias In The Wolf Algorithm For Largest Lyapunov Exponents, Kolby Brink, Tyler Wiles, Nicholas Stergiou, Aaron Likens
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 …
Obstacles In Learning Algorithm Run-Time Complexity Analysis, Bailey Licht
Obstacles In Learning Algorithm Run-Time Complexity Analysis, Bailey Licht
Theses/Capstones/Creative Projects
Algorithm run-time complexity analysis is an important topic in data structures and algorithms courses, but it is also a topic that many students struggle with. Commonly cited difficulties include the necessary mathematical background knowledge, the abstract nature of the topic, and the presentation style of the material. Analyzing the subject of algorithm analysis using multiple learning theories shows that course materials often leave out key steps in the learning process and neglect certain learning styles. Students can be more successful at learning algorithm run-time complexity analysis if these missing stages and learning styles are addressed.
Reducing Loading On The Contralateral Limb Using Human-In-The-Loop Optimization, Siena Senatore
Reducing Loading On The Contralateral Limb Using Human-In-The-Loop Optimization, Siena Senatore
UNO Student Research and Creative Activity Fair
In most everyday activities, we head towards a specific goal by updating our choices for a more direct path. However, there are specific clinical tasks where taking the direct path is more challenging. Clinical investigations of optimizing a prosthesis involve the assessment of multiple parameter settings through trial and error rather than goal-directed optimization. We investigate if a human-in-the-loop optimization algorithm can guide manual alterations to a prosthesis-simulating device to reduce the ground reaction force on the contralateral limb. In most participants, the optimal condition reduced the loading rate on the contralateral limb compared to the initial condition tested. These …
Evolving Efficient Floor Plans For Hospital Emergency Rooms, Alex Ramsey
Evolving Efficient Floor Plans For Hospital Emergency Rooms, Alex Ramsey
Theses/Capstones/Creative Projects
Genetic Algorithms find wide use in optimization problems across many fields of research, including crowd simulation. This paper proposes that genetic algorithms could be used to create better floor plans for hospital emergency rooms, potentially saving critical time in high risk situations. The genetic algorithm implemented makes use of a hospital-specific crowd simulation to accurately evaluate the effectiveness of produced layouts. The results of combining genetic algorithms with a crowd simulation are promising. Future work may improve upon these results to produce better, more optimal hospital floor plans.
Optimizing Networking Topologies With Shortest Path Algorithms, Jordan Sahs
Optimizing Networking Topologies With Shortest Path Algorithms, Jordan Sahs
UNO Student Research and Creative Activity Fair
Communication networks tend to contain redundant devices and mediums of transmission, thus the need to locate, document, and optimize networks is increasingly becoming necessary. However, many people do not know where to start the optimization progress. What is network topology? What is this “Shortest Path Problem”, and how can it be used to better my network? These questions are presented, taught, and answered within this paper. To supplement the reader’s understanding there are thirty-eight figures in the paper that are used to help convey and compartmentalize the learning process needed to grasp the materials presented in the ending sections.
In …
Dynamic Lazy Grounding In Answer Set Programming, Brian Hodges
Dynamic Lazy Grounding In Answer Set Programming, Brian Hodges
Computer Science Graduate Research Workshop
No abstract provided.
Automatic Program Rewriting For Non-Ground Answer Set Programs, Nicholas Hippen
Automatic Program Rewriting For Non-Ground Answer Set Programs, Nicholas Hippen
Computer Science Graduate Research Workshop
No abstract provided.
Use Of Exploratory Data Analysis And Visualization In Identification Of Commingled Human Remains, Vivek Bhat Hosmat
Use Of Exploratory Data Analysis And Visualization In Identification Of Commingled Human Remains, Vivek Bhat Hosmat
UNO Student Research and Creative Activity Fair
The field of Exploratory data analysis and Visualization is revolutionizing the way we perceive things. At times, Visualization is seen as a subset of Exploratory data analysis and then there are branches in Visualization, types, technologies, tools which makes one feel that Visualization is a standalone pillar. Either way, they both work well together to extract meaningful information from almost any kind of data. These fields can very well be the stepping stone for in-depth or conclusive research. They can direct research based on facts and observations rather than one’s intuition or even a brute force technique. This project was …
Cora: Commingled Remains And Analytics – An Open Community Ecosystem, Nicole Mcelroy, Ryan Ernst
Cora: Commingled Remains And Analytics – An Open Community Ecosystem, Nicole Mcelroy, Ryan Ernst
UNO Student Research and Creative Activity Fair
Anthropologists at organizations such as the DPAA (Defense POW/MIA Accounting Agency) have the tough job of sorting through commingled remains of fallen soldiers. Under the direction of Professor Pawaskar at the College of IS&T, Ryan Ernst and I are currently developing a web application for the DPAA that will help them inventory the bones and record all the appropriate associations. After the inventory web application is built we will begin the analysis process using graph theory and other mathematical algorithms. This will ultimately help organizations like the DPAA get closer to the end goal of identifying fallen soldiers from commingled …
Optimizing Campus Mobility With A Focus On Sustainability: A Graph Theory Approach To Intra-Campus Transportation Networks, Quinn M. Nelson
Optimizing Campus Mobility With A Focus On Sustainability: A Graph Theory Approach To Intra-Campus Transportation Networks, Quinn M. Nelson
UNO Student Research and Creative Activity Fair
The idea of public transportation is supported by most in theory but often heavily criticized by users when put into application. There are common tensions that are related to public transportation, as described by frequent users: unreliable, too crowded, and slow. The University of Nebraska-Omaha (UNO) is a growing metropolitan institution that uses a shuttle system to transport students among their three campuses daily. As of 2015, the current total student enrollment is approximately 16,000; UNO plans to enroll 20,000 students by 2020. The expected student growth is also reflected by the current construction of new buildings and expansion of …
What Is Answer Set Programming To Propositional Satisfiability, Yuliya Lierler
What Is Answer Set Programming To Propositional Satisfiability, Yuliya Lierler
Computer Science Faculty Publications
Propositional satisfiability (or satisfiability) and answer set programming are two closely related subareas of Artificial Intelligence that are used to model and solve difficult combinatorial search problems. Satisfiability solvers and answer set solvers are the software systems that find satisfying interpretations and answer sets for given propositional formulas and logic programs, respectively. These systems are closely related in their common design patterns. In satisfiability, a propositional formula is used to encode problem specifications in a way that its satisfying interpretations correspond to the solutions of the problem. To find solutions to a problem it is then sufficient to use a …
A Parallel Template For Implementing Filters For Biological Correlation Networks, Kathryn Dempsey Cooper, Vladimir Ufimtsev, Sanjukta Bhowmick, Hesham Ali
A Parallel Template For Implementing Filters For Biological Correlation Networks, Kathryn Dempsey Cooper, Vladimir Ufimtsev, Sanjukta Bhowmick, Hesham Ali
Interdisciplinary Informatics Faculty Publications
High throughput biological experiments are critical for their role in systems biology – the ability to survey the state of cellular mechanisms on the broad scale opens possibilities for the scientific researcher to understand how multiple components come together, and what goes wrong in disease states. However, the data returned from these experiments is massive and heterogeneous, and requires intuitive and clever computational algorithms for analysis. The correlation network model has been proposed as a tool for modeling and analysis of this high throughput data; structures within the model identified by graph theory have been found to represent key players …