Theory and Algorithms Commons^™

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 …

Outperforming The Best With Minimal Effort: Algorithm Selection For Constrained Multi-Objective Optimization, Mustafa Misir, Aldy Gunawan

Research Collection School Of Computing and Information Systems

The present study performs algorithm selection on a suite of optimization algorithms targeting the constrained multi-objective optimization problems. The idea is to utilize the existing, relevant algorithmic experience in the literature to deliver an improved solver with limited effort. The reason being that algorithm development, in general, is a challenging and time-consuming process, especially with the goal of outperforming the existing methods from varying perspectives such as performance, speed, and robustness. Concerning the multi-objective optimization problems, the required development efforts happen to be even harder than addressing the single-objective ones. Furthermore, referring to the fact that the number of candidate …

Dupin: A Parallel Framework For Densest Subgraph Discovery In Fraud Detection On Massive Graphs, Jiaxin Jiang, Siyuan Yao, Yuchen Li, Qiange Wang, Bingsheng He, Min Chen

Research Collection School Of Computing and Information Systems

Detecting fraudulent activities in financial and e-commerce transaction networks is crucial. One effective method for this is Densest Subgraph Discovery (DSD). However, deploying DSD methods in production systems faces substantial scalability challenges due to the predominantly sequential nature of existing methods, which impedes their ability to handle large-scale transaction networks and results in significant detection delays. To address these challenges, we introduce Dupin, a novel parallel processing framework designed for efficient DSD processing in billion-scale graphs. Dupin is powered by a processing engine that exploits the unique properties of the peeling process, with theoretical guarantees on detection quality and efficiency. …

Community Detection In Heterogeneous Information Networks Without Materialization, Jiaxin Jiang, Siyuan Yao, Yuhang Chen, Bingsheng He, Yudong Niu, Yuchen Li, Shixuan Sun, Yongchao Liu

Research Collection School Of Computing and Information Systems

Community detection in heterogeneous information networks (HINs) poses significant challenges due to the diversity of entity types and the complexity of their interrelations. While traditional algorithms may perform adequately in some scenarios, many struggle with the high memory usage and computational demands of large-scale HINs. To address these challenges, we introduce a novel framework, SCAR, which efficiently uncovers community structures in HINs without requiring network materialization. SCAR leverages insights from meta-paths to interpret multi-relational data through compact vertex-based sketches, significantly reducing computational overhead and materialization overhead. We propose a sketch-based technique for estimating changes in modularity, improving both the precision …

Specialization Or Diversification? Creators’ Strategies On User-Generated Content Platforms, Ziwei Ye

Theses and Dissertations in Business Administration

Recent advancements in digital platforms have reshaped content creation and distribution. User-generated content (UGC), created and shared by internet users, is transforming entertainment, communication, and information sharing. The rise of UGC has fueled the growth of the "creator economy"—an ecosystem of creators, users, and advertisers facilitated by platforms such as YouTube and TikTok. While prior research has primarily explored how UGC platforms incentivize content quantity and quality, this study advances the literature by examining how creators' content strategies influence consumer attention and how platform mechanisms shape this relationship, offering new insights into the interplay between creator behavior and platform design. …

Property Testing Ai: An Efficient Frontier, Paul Sopher Lintilhac

Dartmouth College Ph.D Dissertations

In this dissertation, we take a step towards addressing the major problem of a lack of standardized and rigorous approaches to testing and evaluation of AI systems. Taking inspiration from both the fields of Property Testing and Property Based Testing (for programs), we develop a novel taxonomy of partially overlapping classes of properties of AI systems, including simple properties, compound properties, higher order properties, data relation properties, and architecture-utility properties. We argue that this taxonomy categorizes a diverse set of AI traits -- including accuracy, fairness, robustness, monotonicity, point-wise and global privacy properties, sensitivity, and more -- according to the …

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

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

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

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

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

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

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

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

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

James Madison Undergraduate Research Journal (JMURJ)

No abstract provided.

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

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

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

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 …