Physical Sciences and Mathematics Commons^™

Hiking Trail Generation In Infinite Landscapes, Matthew Jensen

MS in Computer Science Project Reports

This project procedurally generates an infinite wilderness populated with deterministic hiking trails. Our approach recognizes that hiking trails depend on contextual information beyond the location of the path itself. To address this, we implemented a layered procedural system that orchestrates the generation process. This helps ensure the availability of contextual data at each stage. The first layer handles terrain generation, establishing the foundational landscape upon which trails will traverse. Subsequent layers handle point of interest identification and selection, trail network optimization through proximity graphs, and efficient pathfinding across the terrain. A notable feature of our approach is the deterministic nature …

Quantum Computing And Quantum Algorithms, Daniel Serban

Senior Honors Theses

The field of quantum computing and quantum algorithms is studied from the ground up. Qubits and their quantum-mechanical properties are discussed, followed by how they are transformed by quantum gates. From there, quantum algorithms are explored as well as the use of high-level quantum programming languages to implement them. One quantum algorithm is selected to be implemented in the Qiskit quantum programming language. The validity and success of the resulting computation is proven with matrix multiplication of the qubits and quantum gates involved.

Validation Study Of Image Recognition Algorithms, Jacob Miller, Jeremy Evert

Student Research

Developments in machine learning in recent years have created opportunities that previously never existed. One such field with an explosion of opportunity is image recognition, also known as computer vision; the process in which a machine analyzes a digital image.

In order for a machine to ‘see’ as a human does, it must break down the image in a process called image segmentation. The way the machine goes about doing this is important, and many algorithms exist to determine just how a machine will decide to group the pixels in an image.

This research is a validation study of related …

In-Degree Dynamics Of Large-Scale P2p Systems, Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov

Computer Science Faculty Publications

This paper builds a complete modeling framework for understanding user churn and in-degree dynamics in unstructured P2P systems in which each user can be viewed as a stationary alternating renewal process. While the classical Poisson result on the superposition of n stationary renewal processes for n→∞ requires that each point process become sparser as n increases, it is often difficult to rigorously show this condition in practice. In this paper, we first prove that despite user heterogeneity and non-Poisson arrival dynamics, a superposition of edge-arrival processes to a live user under uniform selection converges to a Poisson process when …