Computer Sciences Commons^™

Modern Procedural Terrain Generation Techniques And Their Background, Hunter A. Barton

2025 Symposium

Procedural terrain generation has become a staple in many digital environments, enabling the automated creation of large-scale and realistic landscapes for applications such as video games and movies. This paper provides an in-depth look at smooth noise functions and their use for terrain generation, as well as an overview of some more modern methods of generation. A method utilizing machine learning stlye transfer was reproduced for this paper with some alterations to improve visualization and realism.

Exact Sampling Of The Six-Vertex Model Using Coupling From The Past, Malaeka Amir

DePaul Discoveries

This paper aims to explore the six-vertex model through simulations designed to investigate the behavior of configurations under specific domain wall boundary conditions. To generate random configurations, we employ the Markov Chain Monte Carlo method while addressing the challenge of mixing times by utilizing the Coupling from the Past (CFTP) algorithm. Implemented in Python, our approach leverages CFTP to ensure exact sampling, avoiding the uncertainty of convergence in traditional Monte Carlo methods. We explore the monotonicity property within this framework and prove that it is only maintained by the steps of this algorithm for very particular values of the parameters.

Exploring Communication In Multi-Agent Cooperative Reinforcement Learning, Matthew Kalarickal

Math and Computer Science Honors Theses

This work focuses on communication strategies within a cooperative multi-agent reinforcement learning system. The goal is to explore how communication can be used among agents to potentially improve performance. The research operates within the scope of “learning tasks with communication,” where the primary aim is to solve domain-specific tasks through information exchange using explicit communication protocols. Three distinct communication strategies were implemented and explored: Combinatorial Ghost, Feature Sharing Ghost, and Move Sharing Ghost. Fully Centralized Training and Execution and Centralized Training with Decentralized Execution training approaches were based on the different communication strategy used. Performance metrics were recorded for these …

Machine Learning: Neural Networking With Relu And Optimization, Aidan Redmond Brownell

Undergraduate Theses, Capstones, and Recitals

At its core, learning is an algorithmic process: it begins with input data, undergoes a series of transformations or computations, and yields an output intended to solve a specific task. This output is then compared against a target or desired result, and the internal mechanisms are updated based on how well the output aligns with expectations. While this feedback-driven process occurs almost effortlessly in humans, it is a far more structured, deliberate, and computationally intensive undertaking for machines.

Basic Theory And Implementations Of Quantum Error Correction, Derek Rodriguez

Undergraduate Theses, Capstones, and Recitals

The introduction of quantum computing has presented algorithmic solutions to computationally difficult challenges that are far more efficient than those of classical computers. These algorithms leverage the properties of quantum mechanics to manipulate the quantum properties of subatomic particles, requiring immense precision and stability. Current quantum hardware, however, is too noisy and introduces too many errors for these algorithms to be useful in practice, necessitating the use of error correction algorithms. This field survey seeks to introduce various principles of quantum mechanics relevant to quantum computing and quantum error correction (QEC), detail the implementation and motivations of a basic QEC …

Notes On The Invariance Of Tautness Under Lie Sphere Transformations, Thomas E. Cecil

Mathematics and Computer Science Department Faculty Scholarship

An embedding ϕ : V → Sⁿ of a compact, connected manifold V into the unit sphere Sⁿ ⊂ Rⁿ⁺¹ is said to be taut, if every nondegenerate spherical distance function d_p, p ∈ Sⁿ, is a perfect Morse function on V , i.e., it has the minimum number of critical points on V required by the Morse inequalities. In these notes, we give an exposition of the proof of the invariance of tautness under Lie sphere transformations due to ´Alvarez Paiva. First we extend the definition of tautness of submanifolds of S …

Forecasting Influenza Rates Using Machine Learning: A Study Of Chatgpt's Predictive Accuracy, Sara Saleh

University Honors Theses

This study evaluates ChatGPT's ability to forecast influenza rates, such as the number of flu cases, hospitalizations, and death during peak season periods using CDC data, and comparing forecasts against actual results to calculate statistical accuracy and consistency. Influenza forecasting is essential for public health planning, but traditional methods may not always provide timely or accurate predictions. In this research study, ChatGPT was utilized to predict the influenza rates for the following week based on the previous week's data obtained from the FluView surveillance system. The predicted rates were compared to the actual influenza rates to assess the model's overall …

The Other Side Of The Equation: De-Simplification, A Prerequisite For Calculus, Stephen L. Brown

ACMS Conference Proceedings 2005

No abstract provided.

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 …

From Neural Networks To Large Language Models: Innovations In Financial Ai, Mathematical Reasoning, And Structured Data Representation, Junyi Ye

Dissertations

This dissertation explores the evolution and application of artificial intelligence techniques across three critical domains: financial modeling, mathematical reasoning, and structured data analysis. The dissertation presents seven research projects that chart a progression from specialized neural architectures to sophisticated large language models (LLMs), contributing novel methodologies and frameworks at each stage.

In the financial domain, the research first introduces TS-Mixer, a MLP-based architecture for time-series forecasting that captures both feature relationships and temporal dependencies through a simple yet effective design, outperforming more complex models in S&P500 index prediction. The dissertation then presents DySTAGE, a dynamic graph representation learning framework that …

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. …

Modeling Literary Connections: Exploring Transregional Resistance In Dalit Poetry, Antara Bhattacharyay

Mathematics, Statistics, and Computer Science Honors Projects

Structuring socio-political identities, the caste system (a graded form of hierarchy) remains entrenched in contemporary Indian society. Dalits, marginalized by the caste system, have expressed their resistance through literature, envisioning substantive equality and social change. In this thesis, I draw on digital humanities methods to examine regional variation in translated Dalit poetry from Bengali, Hindi/Urdu, Marathi, and Tamil languages. I utilize topic modeling—a machine learning algorithm that detects latent semantic structures in a text—as a point of departure for poetry analysis. I observe how topic modeling enables newer readings of the poems, revealing regionally resonant and broader Dalit themes.

Computer Vision In Soccer: Yolov11 Analytics Engine For Quantifying Game Strategy, Connor S. Maurer

Data Science Undergraduate Honors Theses

Single-shot object detection capabilities significantly reduce computational overhead for real-time computer vision in sports analytics at 60 FPS. YOLO11’s lightweight CNN gives promising accuracy while meeting the low-latency demand of dynamic soccer matches. As data-driven approaches take over the sport of soccer, efficient player tracking systems become critical for informing coach’s strategies. I prototype the ETL (Extract, Transform, Load) process of data collected from a single- shot detection program and evaluate its viability for estimating player fatigue. YOLO11 detects players, the ball, and other characteristics, with the output transformed by homography to estimate the positions in the real world. These …

A Study Of Knots And Quandles, Zhaoqi Wu

Math and Computer Science Honors Theses

We explore the mathematical theory of knots through the lens of algebraic structures known as kei and quandles. We begin by introducing classical knot invariants and then study the fundamental kei of a knot as a tool for distinguishing knot types. We generalize this approach using various kinds of quandles, including Alexander and dihedral quandles, and investigate their associated polynomial invariants. We also examine the connection between quandles and group theory, as well as their algebraic representations in quandle rings. Moreover, we analyze idempotent elements in quandle rings over finite fields, providing both general results and specific examples.

Multiscale Integration Of Receptor-Ligand Dynamics Into Discrete And Continuous Tumor Growth Models With Application To Tyrosine Kinase Inhibitor Treatment, Romasa Qasim

Open Access Theses & Dissertations

The epidermal growth factor (EGF) receptor cascade plays a crucial role in the survival and proliferation of tumor cells. Tyrosine kinase inhibitors (TKIs) are a class of drugs that inhibit epidermal growth factor receptors (EGFRs), thereby preventing the downstream signal transduction. Despite their importance, models that link spatial receptor dynamics to tumor growth remain scarce. Further, TKIs act through selective mechanisms, inhibiting active, inactive, or all receptor states, which poses a challenge to traditional modeling approaches.

We propose to numerically study two mathematical models incorporating receptor-dynamics into cancer models to describe the impact of EGFR overexpression and TKIs. The first …

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 …

Stability Analysis Of Turbulent Fluid Flow, Adam D. Schroeder

Mathematics, Statistics, and Computer Science Honors Projects

Hydrodynamic stability refers to the study of when and how laminar flows transition to turbulence. This includes investigations of the mechanisms of transition, as well as the classification of known flow configurations as either stable or unstable and the identification of critical values of flow parameters at which this bifurcation occurs. In this thesis, we introduce the mathematical theory behind continuum mechanics and fluid dynamics as well as some tools from the study of dynamical systems. We apply these concepts to the linear stability analysis of zero pressure gradient flat plate flow via numerical simulations in OpenFOAM, discussing both the …

2025 Acssc Program, Acssc Planning Committee

Annual Celebration for Student Scholarship and Creativity

No abstract provided.

Designing A Statistical Plan For Measuring Self-Efficacy Using A 2k Factorial Design​, Rachel A. Hart, Eugene H. Thompson

Mathematics, Computer Science & Statistics Presentations

This study focuses on designing a statistical plan that measures the effects of self-efficacy using a 2k factorial design. Specifically, we simulated data on physical, mental, spiritual, and social health, so we could focus on their interaction with self-efficacy. By using ANOVA to see the main and interaction effects, we can see the impact of individual autonomy on health. Our findings show the need for experimental data on the demographic of interest, peri-and post-menopausal women.

Analyzing The Sentiment Of Feminist And Non-Feminist Works, Jasmine Borie, Megan G. Falschlehner

Mathematics, Computer Science & Statistics Presentations

This presentation focuses on a group of texts that advocate for a change in the current belief system. These texts are the Feminist Manifesto, Sojourner Truth: Ain’t I a Woman?, and Civilization and Its Discontents. These first two texts advocate for women’s rights, while Freud’s book is focused on civilization’s decline and how our understanding of community can affect this. Through our presentation, we want to examine the differences in sentiment and language between the feminist texts and Freud’s texts to pinpoint whether or not sentiment changes when advocating for different beliefs.

Analyzing Cie Texts Through History Using R, Rachel A. Hart, Aaron Ditto

Mathematics, Computer Science & Statistics Presentations

In this presentation, we analyzed three separate CIE texts from different time periods. First, “The Allegory of the Cave” from 380 BC, then “The Declaration of Independence” from 1776, and lastly “The Lottery” from 1948. We compared them using tidy text techniques like sentiment lexicons, creating word clouds, and bigram analysis to see if the types of words and sentiments used have changed over time in these short texts.

A Statistical Comparison Of Selected Old Testament And New Testament Books, Branden F. Stahl, Kevin Guan, Adam Denn

Mathematics, Computer Science & Statistics Presentations

The purpose of this project was to discover similarities between sentiments in Old Testament and New Testament books of the Bible, track emotional valence and find the most common words and sentiments in the books. Text analysis was performed on Genesis, Exodus, Matthew and Luke. Word clouds were also created for these texts.

Using Text Mining In R To Explore How Three Cie Related Texts Answer One Of Ursinus College’S Quest Curriculum Questions: “How Should We Live Together?”, Elizabeth Dill

Mathematics, Computer Science & Statistics Presentations

This presentation explores the application of text mining techniques using R programming to analyze literary text. In the process of this project, I performed data cleaning, tokenization, sentiment analysis, and frequency analysis on selected literary works. This study illustrates how R enables the transformation of unstructured textual data into meaningful insights through visualizations and statistical summaries. My presentation highlights both the technical process and the interpretive results, demonstrating how computational methods can be used to explore traditional literary analysis.

A Text Mining And Sentiment Analysis Of Valuable Cie Texts Using R, Eric Sugarman, Ethan Turber-Ortiz, Hannah Quinn

Mathematics, Computer Science & Statistics Presentations

The purpose of this project was to perform a sentiment analysis of three texts used in Ursinus College's Common Intellectual Experience (CIE) course: Between the World and Me by Ta-Nehisi Coates, The New Jim Crow by Michelle Alexander and Discourse on Method by Rene Descartes. Word count and word cloud analysis were also performed on the texts as well as term frequency and bigram analysis.

Volume 16, Maggie Duncan, Madeline Little, Alicia Hoffman, Megan Livesay, Gabrielle Quaresma, Serenity Allen, Laina Pfountz, Ainslie Allred, Sabrina Robles, Nicholas J. Duellman, Trinity L. Deguzman, Melissa H. Savage, Margaret Dudley, Jocelyn Escobar, Olivia Hildreth, Olivia Hopkins, Benjamin Gettier, Lee Kassay, Jade Riddle, Ashley Seiders

Incite: The Journal of Undergraduate Scholarship

Introduction Dr. Amorette Barber, Director, Office of Student Research

From the Editor Dr. Hannah Dudley-Shotwell

Artist’s Statement Maggie Duncan

On Mentoring Dr. Lee Millar Bidwell

The Hujum Campaign in Uzbekistan and its Consequences by Madeline Little

Wet Cupping Compared to Dry Needling for Treatment of Patients with Low Back Pain: A Critically Appraised Topic by Alicia Hoffman and Megan Livesay

Optimization of eDNA Air Sampling Via 3D Printed Fan by Gabrielle Quaresma

Beyond the Classroom: A Qualitative Study of Teacher Attrition and Retention by Serenity Allen and Laina Pfountz

The Treatment of Subacromial Impingement Syndrome with Platelet-Rich plasma Injections Verses …

32 - Nested Two Level Decomposition For Quantum Computing, Andrew Maciejunes, John Stenger, Dan Gunlycke, Nikos Chrisochoides

Undergraduate Research Symposium

Abstract—We present a two-level decomposition strategy for solving the Vehicle Routing Problem (VRP) using the Quantum Approximate Optimization Algorithm (QAOA). A Problem-Level Decomposition (PLD) partitions a 9-node (72-qubit) VRP into smaller Traveling Salesman Problem (TSP) instances. Each TSP is then further simplified via Circuit-Level Decomposition (CLD), enabling execution on near-term quantum devices. Our approach achieves up to 90% reductions in circuit depth and qubit count. These results demonstrate the feasibility of solving VRPs previously too complex for quantum simulators and provide early evidence of potential quantum utility.

7 Plus Minus 2 Law Revisited: Alternative Geometric Explanation, Mayan Arithmetic, And Using 9- And 18-Based Numbers In Jewish Tradition, Julio C. Urenda, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

A recent paper showed that to make sure that the movements in the crowd are not chaotic, the directions of all the motions should deviate from some fixed direction by no more than 13 degrees. We show that this results provides a new geometric explanation for the seven plus minus two law in psychology, according to which we can keep in mind no more than 7 plus minus 2 items. We also show that all this is related to the somewhat mysterious appearance of 9- and 18-based number systems in Jewish and Mayan traditions.

Why Um And U*Log(U) Are The Most Effective Nonlinear Functions In Fuzzy Clustering: Theoretical Explanation Of The Empirical Fact, Olga Kosheleva, Vladik Kreinovich, Yuchi Kanzawa

Departmental Technical Reports (CS)

In fuzzy clustering, we need to have non-linear functions of the membership degrees. Different nonlinear functions have been tried. Empirical evidence shows that for fuzzy clustering, the most effective nonlinear functions are um and u*log(u). In this paper, we provide a theoretical explanation for this empirical fact.