Computer Sciences Commons^™

Lessons From The Club Homeschool Capstone: Testing, Data Discipline, And The Computer Science Curriculum, Shane Brown

University Honors Theses

This thesis looks at the CLUB Homeschool Capstone project to argue that Portland State University's Computer Science curriculum should introduce testing and data quality discipline earlier and more intentionally than it does now. As team lead of a seven-person team, I coordinated sprint planning, communicated with the sponsor, and developed custom Discourse plugins that enhanced an existing forum platform instead of creating a separate application database, as requested by the sponsor. The project's requirements document called for a formal testing plan, but our team lacked the practical experience to implement one. This gap became evident through my internships as a …

Custom Sbc Gps Tracking And Geocaching Carputer Software Development And Implementation, Joshua A. Davis

University Honors Theses

This thesis argues that hardware-integrated capstone projects develop software engineering skills that traditional coursework cannot replicate. A team of eight developers built a GPS tracking system on a Raspberry Pi 4 over two academic terms, integrating real-time position streaming, the APRS amateur radio protocol for network-independent location sharing, and PostGIS spatial queries for "new road" detection. The system implements SmartBeaconing for adaptive GPS data reduction, achieving approximately 80% storage savings while preserving route fidelity. The project exposed challenges absent from classroom assignments: hardware debugging without stack traces, cross-layer integration failures, and coordination overhead when deploying to unfamiliar architecture; demonstrating that …

Beyond The Best Prompt: A Coverage View Of Multilingual Reasoning, Harshiv Mistry

University Honors Theses

Multilingual LLMs reason more accurately in English than in other languages, and recent work links part of this gap to reasoning behavior: native-language traces contain fewer cognitive behaviors (verification, backtracking, subgoal setting, backward chaining) that support effective problem solving. We test whether prompting for these behaviors at inference time narrows the gap, across seven conditions varying chain-of-thought, instruction and reasoning language, and cognitive-behavior descriptions, on two models, three languages. We find that English-scaffolded reasoning is the strongest single strategy on both models, closing the Hindi gap on Qwen, though the explicit scaffold's value over plain chain-of-thought is model-dependent. Beyond aggregate …

A Novel, Embedding-Based Approach To Longitudinal Survey Data Imputation, Julia Rezvani

University Honors Theses

Longitudinal surveys are ubiquitous in the social sciences as a means of tracking changes in behavior and opinions with time and identifying potential causal mechanisms. These surveys are frequently plagued by missing data and semantic drift, both of which limit their effectiveness and scientific utility. Imputation algorithms allow researchers to fill gaps in collected survey datasets, imperfectly reconstructing lost data. Although deep learning algorithms have been used in imputation to great success, approaches which simultaneously leverage the semantic and temporal structure of longitudinal surveys have not yet been developed. We propose a novel imputation architecture which is capable of leveraging …

Uniform Stability Of Katyusha In Strongly-Convex Settings, Don Li

University Honors Theses

Acceleration of convergence and reduction of variance constitute a trade-off in the design of stochastic optimization machine learning algorithms. Katyusha was introduced to address this trade-off, synthesizing Nesterov Accelerated Gradient (NAG) and Stochastic Variance-Reduced Gradient (SVRG) into a single first-order optimizer with promising empirical performance. However, the generalization properties of Katyusha remain largely unexplored. We conjecture that, in the smooth quadratic regime (i.e., under assumptions of strong convexity and smoothness of the loss function, and boundedness of gradients), Katyusha is uniformly stable in the sense of Bousquet and Elisseeff. Instantiating our framework for NAG, we extend the use of Lyapunov …

Applications Of Prior And Novel Computational Tools In Mental Health Treatment, And Their Potential To Uncover The Explanatory Gap, Ambika Vyas

University Honors Theses

The explanatory gap is a widely discussed concept in scientific and philosophical literature. In neuroscience, the solution to the explanatory gap is highly sought out, but the general consensus is that it is unsolvable. Numerous articles discuss the explanatory gap alongside computational tools and how these tools could aid neuroscientists in uncovering the mental health explanatory gap. However, significant developments in machine learning have been made since 2020, coinciding with the rise in Large Language Models (LLMs). This thesis is a literature review on computational methods, tools, and devices developed and utilized by researchers to improve how mental health disorders …

Conello Vendor Marketplace Capstone: A Review On The Capstone Process And Computer Science Degree, Levi Hauck

University Honors Theses

This Capstone Review Thesis discusses the current structure of the Computer Science Degree path and Computer Science Capstone at PSU. This thesis reviews the Conello Vendor Marketplace Capstone, a project designed to help address the issue of teambuilding in the workplace. It points out ways in which teamwork and organization is an underdeveloped skill in Computer Science. During the Capstone project, the project management method of Agile development was recommended and used. However, it became clear that the team, leader included, had a gap in knowledge and skills to be successful, as well as a lack of experience in team …

Agile In The Age Of Ai: Considerations And Improvements For Streamlining Developer Workflows, Stephen Feng

University Honors Theses

This paper examines the integration of AI language models into Agile developer workflows during a six-month software development project. Using the development of SagacityWall, a mindfulness-based social media application built by a team of eight undergraduates, it identifies three key areas in Agile processes where AI provided meaningful leverage: translating business requirements into actionable developer work tickets, accelerating framework research and technology stack decisions, and reducing onboarding friction through AI-assisted code scaffolding and Behavior-Driven Development story formatting. The study finds that AI meaningfully boosted productivity across these stages – not by replacing developer judgment, but by reducing overhead at each …

Comparing The Sensitivity And Degree Of Boolean Functions Via The Hypercube, Anne-Caroline Rupp

University Honors Theses

This thesis studies three complexity measures of total Boolean functions f:{0,1}ⁿ → {0,1}: maximum sensitivity s(f), polynomial degree deg(f), and spectral sensitivity λ(f), where λ(f) is defined as the spectral norm of the adjacency matrix of the sensitivity graph. Building on the results of Aaronson et al., we examine the inequality chain √s(f) ≤ λ(f) ≤ deg(f) and investigate whether all three quantities can be simultaneously equal.

The first part of the thesis reverse engineers the equality cases of the two known inequalities to isolate necessary extremal conditions on both the Fourier structure of f and the local geometry …

An Integrated Framework For Memory-Centric Analysis: From Trace Collection To Co-Design, Dhruv Gajaria, Prajwal Challa, Yasodha Suriyakumar, Joseph Manzano, Nathan Tallent, Andrés Márquez

Computer Science Faculty Publications and Presentations

IntroductionThe memory wall phenomenon—where advances in processor performance significantly outpace those in memory subsystems-poses a fundamental challenge for contemporary computing systems. In memory-bound applications, memory subsystem behavior dominates performance, yet existing analysis approaches present significant limitations: detailed microarchitectural simulators require days to weeks to simulate modest workloads; hardware performance counters provide only aggregate statistics that obscure temporal and spatial access patterns; and scaled simulation approaches face challenges in capturing contention effects, bandwidth saturation, and interference patterns that emerge at larger scales. These limitations reflect a processor-centric design philosophy—in both performance analysis tools and system co-design methodologies—that is increasingly misaligned with …

Agnostic Tomography Of Stabilizer Product States, Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang

Computer Science Faculty Publications and Presentations

We define a quantum learning task called agnostic tomography, where given copies of an arbitrary state ρ and a class of quantum states C, the goal is to output a succinct description of a state that approximates ρ at least as well as any state in C (up to some small error ε). This task generalizes ordinary quantum tomography of states in C and is more challenging because the learning algorithm must be robust to perturbations of ρ. We give an efficient agnostic tomography algorithm for the class C of n-qubit stabilizer product states. Assuming ρ has fidelity at least …

Reasoning In Large Language Models Across Multilingual, Long-Context, And Symbolic Settings, Sina Bagheri Nezhad

Dissertations and Theses

Large Language Models (LLMs) are increasingly deployed as general-purpose reasoners, yet their reliability degrades in three settings that frequently arise in practice: multilingual inputs, long contexts, and symbolic or formally constrained domains. In multilingual settings, uneven training coverage produces substantial performance disparities and uncertain generalization to languages with little or negligible pretraining exposure. In long-context settings, relevant evidence may be sparsely distributed, and models exhibit the "lost-in-the-middle" phenomenon, undermining retrieval and multi-step synthesis. In symbolic settings such as mathematics, small arithmetic or logical slips invalidate solutions, and prose rationales are difficult to verify automatically.

This dissertation first characterizes these failure …

A Cryptographic Perspective On The Verifiability Of Quantum Advantage, Nai-Hui Chia, Honghao Fu, Fang Song, Penghui Yao

Computer Science Faculty Publications and Presentations

In recent years, achieving verifiable quantum advantage on a NISQ device has emerged as an important open problem in quantum information. The sampling-based quantum advantages are not known to have efficient verification methods. This article investigates the verification of quantum advantage from a cryptographic perspective. We establish a strong connection between the verifiability of quantum advantage and cryptographic and complexity primitives, including efficiently samplable, statistically far but computationally indistinguishable pairs of (mixed) quantum states (EFI), pseudorandom states (PRS), and variants of minimum circuit size problems (MCSP). Specifically, we prove that a) a sampling-based quantum advantage is either verifiable or can …

How Agile Became The Design Philosophy Of Ai Fishbowl Under Real-World Constraints, Jad Saad

University Honors Theses

This capstone review examines the development of AI Fishbowl, a public-facing, interactive artificial intelligence system, as a case study in how Agile methods evolve from a project management tool into a design philosophy under real-world constraints. Although the project adopted an Agile workflow early on through a Kanban-style task management approach, the initial system design and architecture were still shaped by a largely plan-first mindset. This created a mismatch between flexible process and rigid design assumptions, which became increasingly apparent as the team moved from high-level architecture into implementation.

A critical turning point occurred when early architectural plans proved difficult …

Bl(U)E Crab: Bluetooth Low Energy Connection Risk Assessment Benchmarking, Dylan Christopher Conklin

Dissertations and Theses

The usage of Bluetooth Low Energy (BLE)-based tracker devices for stalking has become a salient privacy concern. Detecting unwanted or suspicious trackers is challenging due to their cross-platform compatibility issues, inconsistent detection methods, and lack of an industry-wide standard for detecting malicious devices. BL(u)E CRAB, Bluetooth Low Energy Connection Risk Assessment Benchmarking, scans data and generates risk factors about nearby devices to classify them as suspicious or not. These risk factors include the number of encounters the user had with a device, the duration of time a device has been near the user, the distance a device has traveled …

Clustering Of Temporal And Visual Data: Recent Advancements, Priyanka Mudgal

Computer Science Faculty Publications and Presentations

Clustering plays a central role in uncovering latent structure within both temporal and visual data. It enables critical insights in various domains including healthcare, finance, surveillance, autonomous systems, and many more. With the growing volume and complexity of time-series and image-based datasets, there is an increasing demand for robust, flexible, and scalable clustering algorithms. Although these modalities differ—time-series being inherently sequential and vision data being spatial—they exhibit common challenges such as high dimensionality, noise, variability in alignment and scale, and the need for interpretable groupings. This survey presents a comprehensive review of recent advancements in clustering methods that are adaptable …

Wild@Fire2025: Overview Of Word-Level Code-Mixed Language Identification In Dravidian Languages, Ameeta Agrawal, Asha Hegde, Sharal Coelho, Sabur Butt, Fazlourrahman Balouchzahi, Sudha V, Shashirekha Hosahalli Lakshmaiah

Computer Science Faculty Publications and Presentations

Code-mixing is considered as a linguistic phenomenon that combines several languages into one text. It has now become very common in multilingual societies, especially in digital communication. Word-Level Identification of Languages in Dravidian Languages (WILD) - a Code-mixed Language Identification (CoLI) in Dravidian languages shared task, organized as a part of Forum for Information Retrieval and Evaluation (FIRE) 2025, put forward these challenges to the researchers by asking them to develop models capable of classifying words in code-mixed texts involving Dravidian languages - Tamil, Telugu, Malayalam, Kannada, and Tulu, which are interwoven with English. It poses significant challenges due to …

Machine Learning For Economists, John Luke Gallup

Economics Faculty Publications and Presentations

Explication of machine learning algorithms and their usefulness for economic research. The prediction algorithms of Random Forest, Gradient Boost Machines, Neural Networks and Support Vector Machines are built from simple steps applied at large scale to generate surprisingly precise nonlinear estimates. Although useful for processing and interpreting new forms of data, their application to economics research is limited because they do not provide readily interpretable evidence of the causes of outcomes.

Online Decision Mamba, Trenton W. Ruf

Dissertations and Theses

Online in-context reinforcement learning enhances offline-trained policies through online fine-tuning. We introduce Online Decision Mamba (ODM), an architecture that replaces the attention mechanism in Online Decision Transformers (ODT) with the Mamba module to improve long-context sequence modeling and overall RL performance. We performed in-depth evaluations on MuJoCo (OpenAI Gym) and Atari benchmarks, comparing ODM against state-of-the-art offline and online baselines—including Decision Mamba (DM) and ODT. Our results show that ODM achieves competitive or superior performance, with particularly robust gains when initial datasets lack expert demonstrations. In the Qbert Atari environment, ODM shows context-length sensitivity similar to offline DM; however, we …

Systematics And Systems Theory: Reconstructability Analysis Of The Tetrad, Martin Zwick

Complex Systems Faculty Publications and Presentations

This talk discusses the relationship between systems theory, specifically Reconstructability Analysis, and Systematics, a systems theory-like framework of number symbolism developed by John G. Bennett, which he presented in his four-volume magnum opus, The Dramatic Universe. The talk, given to a community of people interested in Bennett's ideas, focuses on Martin Zwick's paper "Ideas and Graphs: the Tetrad of Activity" archived at https://archives.pdx.edu/ds/psu/36249.

Adaptive Image Acquisition Algorithms For Resource-Constrained Single-Photon Cameras, Yeganeh Jalalpour, Wu-Chi Feng

Computer Science Faculty Publications and Presentations

Emerging single-photon camera (SPC) technologies have unique challenges in data acquisition and processing. Unlike conventional sensors that produce a single 8- to 16-bit brightness value per pixel, SPCs record photon arrivals with many more samples per pixel, using high floating-point precision for each photon collected. This means that they must handle potentially millions of timestamps, especially at higher spatial resolutions and in the presence of ambient light, creating bottlenecks within the pixel circuitry. To address these challenges associated with SPCs, this paper proposes adaptive algorithms designed to efficiently distribute hardware resources among groups of pixels. By selectively subsampling the data …

Hint-Guided Video Frame Interpolation For Video Compression, Pan Tan, Wu-Chi Feng

Computer Science Faculty Publications and Presentations

Traditional video compression continues to advance, but the gainsin efficiency are diminishing and come at the cost of higher compu-tational complexity. Despite achieving competitive rate-distortionresults, current neural video codecs (NVCs) generally lack sup-port for a wide range of quality levels, often requiring multiplemodels to achieve flexible rate control, which increases both train-ing cost and deployment complexity. To address the limitations ofboth traditional codecs and current NVCs, we propose a hybridvideo compression framework that integrates traditional codecswith hint-guided video frame interpolation (VFI), a learning-basedtechnique for synthesizing intermediate frames. By using decodedreference frames and leveraging compressed-domain hints to guideinterpolation, our method improves …

Capstone Reflection: Developing A Muslim Prayer App For Psu Students, Jeremiah Su

University Honors Theses

This thesis examines the development process of the Muslim Student Association (MSA) App, a computer science capstone project. The app strives to help the Muslim community at Portland State University (PSU) and the Portland area by consolidating essential information for prayers, such as local prayer times, nearby masjids, and the direction of Qibla. The team behind this project was developed by 6 computer science developers, a majority of whom were from the Muslim culture and background. This paper describes the entire capstone development process from the perspective of a developer who is not rooted in Muslim customs. It also describes …

Experience From A Distance: Improving Transparency For The Multnomah Athletic Club, Matthew Penner

University Honors Theses

Portland is home to the largest and one of the most prestigious athletic clubs in the world: Multnomah Athletic Club. In many ways, it is the pinnacle of luxury and innovation, and over time, it finds any way to entice prospective members to pay the expensive upfront fee of $6000 and monthly membership fees exceeding $300. Due to the previous technological barrier, which was not being able to see the full extent of what amenities the club had to offer, the club faced major challenges in recruitment and marketing. Over two academic terms, a team of six computer science capstone …

Security Vulnerabilities And Defense Tactics For Generative Ai Application Development, Kyle Klein

University Honors Theses

Generative AI (GenAI) applications such as OpenAI's ChatGPT leverage large language models (LLMs) trained on enormous amounts of data to accomplish tasks such as document editing, summarization, and query response. Chatbots and LLM programs that are equipped with retrieval-augmented generation (RAG) have the ability to draw upon data provided by developers and users to improve the quality of the program's responses. LLM technology has even expanded to generate images, audio, and video from user instructions. Designed around unpredictable user input and typically composed of many opaque components, LLM software products face a paradigm shift of new, constantly evolving security challenges. …

Understanding The Role Of Sentiment And Emotion For Predicting Forced Displacement, Helge Marahrens, Ameeta Agrawal, Ali Arab, Katharine Donato, Yaguang Liu, Nathan Wycoff, Mohamed Ahmed, Colin Hwang, Lina Laghzaoui, Kate Liggio, Multiple Additional Authors

Computer Science Faculty Publications and Presentations

Digital trace data play an important role determining where and when people will move during migration crises because of their detailed temporal and spatial granularity. Yet, identifying variables that reliably serve as early indicators of movement remains a challenging task. Within this context, we conduct an in-depth analysis of two types of variables that can be constructed from social media data – sentiment and emotion. Sentiment is conceptually broad and easier to detect from social media posts, while emotion is conceptually nuanced and more difficult to determine. We investigate the potential of both sentiment and emotion of Twitter/X posts as …

A Case Study On The Effectiveness Of Llms In Verification With Proof Assistants, Barış Bayazıt, Yao Li, Xujie Si

Computer Science Faculty Publications and Presentations

Large language models (LLMs) can potentially help with verification using proof assistants by automating proofs. However, it is unclear how effective LLMs are in this task. In this paper, we perform a case study based on two mature Rocq projects: the hs-to-coq tool and Verdi. We evaluate the effectiveness of LLMs in generating proofs by both quantitative and qualitative analysis. Our study finds that: (1) external dependencies and context in the same source file can significantly help proof generation; (2) LLMs perform great on small proofs but can also generate large proofs; (3) LLMs perform differently on different verification projects; …

Digging Deeper With Deep Ram Networks, Andrew J. Wagner

Dissertations and Theses

While Deep Neural Networks (DNNs) have driven major breakthroughs in artificial intelligence, their internal complexity often makes their behavior hard to explain, resulting in the well-known “black box” dilemma. This thesis addresses the challenge of interpretability in DNNs and deep reinforcement learning (DRL) through two main contributions.

In Part I, we revisit and extend the use of Deep RAM Networks (DRNs) within the Arcade Learning Environment (ALE), showing that, with modern architectures and careful hyperparameter tuning, RAM-based agents can achieve performance competitive with established pixel-based baselines on Atari 2600 games, while offering additional advantages for research and analysis. We also …

Improved Fpt Approximation For Sum Of Radii Clustering With Mergeable Constraints, Sayan Bandyapadhyay, Tainzhi Chen

Computer Science Faculty Publications and Presentations

In this work, we study k-min-sum-of-radii (k-MSR) clustering under mergeable constraints. k-MSR seeks to group data points using a set of up to k balls, such that the sum of the radii of the balls is minimized. A clustering constraint is called mergeable if merging two clusters satisfying the constraint, results in a cluster that also satisfies the constraint. Many popularly studied constraints are mergeable, including fairness constraints and lower bound constraints. In our work, we design a (4 + ϵ)-approximation for k-MSR under any given mergeable constraint with runtime 2 O( k ϵ ·log2 k ϵ )n 4 , …

Approximation And Parameterized Algorithms For Covering With Disks Of Two Types Of Radii, Sayan Bandyapadhyay, Eli Mitchell

Computer Science Faculty Publications and Presentations

We study the Discrete Covering with Two Types of Radii problem motivated by its application in wireless networks. In this problem, the goal is to assign either small-range high frequency or large-range low frequency to each access point, maximizing the number of users in high-frequency regions while ensuring that each user is in the range of an access point. Unlike other weighted covering problems, our problem requires satisfying two simultaneous objectives, which calls for novel approaches that leverage the underlying geometry of the problem. In our work, we present two new algorithms: the first is a polynomial-time (2.5 + ϵ)-approximation, …