Digital Commons Network^™

Securing The Internet Of Things At Scale, Steven L. Willoughby

Student Research Symposium

The world of the connected “Internet of Things” (IoT), including the "Industrial Internet of Things" (IIoT) is expanding to include more devices which observe and influence our daily lives, routines, locations, and even our state of health. But have the underlying protocols by which they communicate this data kept pace with the need to protect our privacy and security?

My talk will introduce my research into an approach to better secure this information flow using appropriate access controls without sacrificing performance. I will assess the historical challenges and simple access controls applied to IoT networking protocols and how they can …

A Novel Caching Algorithm For Efficient Fine-Grained Access Control In Database Management Systems, Anadi Shakya

Student Research Symposium

Fine-grained access Control (FGAC) in DBMS is vital for restricting user access to authorized data and enhancing security. FGAC policies govern how users are granted access to specific resources based on detailed criteria, ensuring security and privacy measures. Traditional methods struggle with scaling policies to thousands, causing delays in query responses. This paper introduces a novel caching algorithm designed to address this challenge by accelerating query processing and ensuring compliance with FGAC policies. In our approach, we create a circular hashmap and employ different replacement techniques to efficiently manage the cache, prioritizing entries that are visited more frequently. To evaluate …

Improving Tattle-Tale K-Deniability, Nicholas G.E. Morales

Student Research Symposium

Ensuring privacy for databases is an ongoing struggle. While the majority of work has focused on using access control lists to protect sensitive data these methods are vulnerable to inference attacks. A set of algorithms, referred to as Tattle-Tale, was developed that could protect sensitive data from being inferred however its runtime performance wasn’t suitable for production code. This set of algorithms contained two main subsets, Full Deniability and K-Deniability. My research focused on improving the runtime or utility of the K-Deniability algorithms. I investigated the runtime of the K-Deniability algorithms to identify what was slowing the process down. Aside …

Integration Of Agent Models And Meta Reinforcement Learning (Meta-Rl) Algorithms For Car Racing Experiment, Vidyavarshini Holenarasipur Jayashankar

Student Research Symposium

Introduction: Achieving optimal performance in 2D racing games presents unique challenges, requiring adaptive strategies and advanced learning algorithms. This research explores the integration of sophisticated agent models with Meta Reinforcement Learning (Meta-RL) techniques, specifically Model-Agnostic Meta-Learning (MAML) and Proximal Policy Optimization (PPO), to enhance decision-making and adaptability within these simulated environments. We hypothesize that this innovative approach will lead to marked improvements in game performance and learning efficiency.

Methods: In our experimental setup, we applied MAML for its rapid adaptation capabilities and PPO for optimizing the agents' policy decisions within a 2D racing game simulator. The objective was …

Story Of Your Lazy Function’S Life: A Bidirectional Demand Semantics For Mechanized Cost Analysis Of Lazy Programs, Laura Israel, Nicholas Coltharp

Student Research Symposium

Lazy evaluation is a powerful tool that enables better compositionality and potentially better performance in functional programming, but it is challenging to analyze its computation cost. Existing works either require manually annotating sharing, or rely on separation logic to reason about heaps of mutable cells. In this paper, we propose a bidirectional demand semantics that allows for reasoning about the computation cost of lazy programs without relying on special program logics. To show the effectiveness of our approach, we apply the demand semantics to a variety of case studies including insertion sort, selection sort, Okasaki's banker's queue, and the push …

Systematic Comparison Of Reservoir Computing Frameworks, Nihar S. Koppolu, Christof Teuscher

Student Research Symposium

In this poster, we present a systematic evaluation and comparison of five Reservoir computing (RC) software simulation frameworks, namely reservoirpy, RcTorch, pyRCN, pytorch-esn, and ReservoirComputing.jl. RC is a specific machine learning approach that leverages fixed, nonlinear systems to map signals into higher dimensions. Its unique strength lies in training only the readout layer, which reduces the training complexity. RC excels in temporal signal processing and is also well suited for various physical implementations. The increasing interest in RC has led to the proliferation of various RC simulation frameworks. Our RC simulation framework evaluation focuses on a feature comparison, documentation quality, …

Behavioral Intention For Ai Usage In Higher Education, Isaac A. Odai, Elliot Wiley

Student Research Symposium

This study sought to further understand the cognitive factors that influence undergraduate students' behavioral intention to use generative AI. Generative AI's presence in academic spaces opens the door for ethical and pedagogical questions. This study surveyed 51 undergraduate communication students to measure their attitudes, subjective norms, self efficacy and their behavioral intention to use GenAI for school work. The results of this study showed behavioral intent had a positive relationship with attitudes and subjective norms. The implications of these findings show that personal beliefs and the perceived beliefs of others are correlated to undergraduate students’ intent to use GenAI for …