Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 6 of 6

Full-Text Articles in Entire DC Network

A Mathematical Analysis Of The Game Of Santorini, Carson Clyde Geissler Jan 2020

A Mathematical Analysis Of The Game Of Santorini, Carson Clyde Geissler

Senior Independent Study Theses

Santorini is a two player combinatorial board game. Santorini bears resemblance to the graph theory game of Geography, a game of moving and deleting vertices on a graph. We explore Santorini with game theory, complexity theory, and artificial intelligence. We present David Lichtenstein’s proof that Geography is PSPACE-hard and adapt the proof for generalized forms of Santorini. Last, we discuss the development of an AI built for a software implementation of Santorini and present a number of improvements to that AI.


Modeling Community Resource Management: An Agent-Based Approach, Maya M. Lapp Jan 2020

Modeling Community Resource Management: An Agent-Based Approach, Maya M. Lapp

Senior Independent Study Theses

As the human population continues increasing rapidly and climate change accelerates, resource depletion is becoming an international problem. Community-based natural resource management (CBNRM) has been suggested as a method to conserve resources while simultaneously empowering traditionally marginalized communities. Because classical equation-based modeling methods fail to capture the complexity of CBNRM, Agent-Based Modeling (ABM) has emerged as a primary method of modeling these systems. In this investigation, we conduct a sensitivity analysis and thorough evaluation of an existing ABM of community forest management. We then modify the original model by providing a new enforcement mechanism that improves the validity of both …


The Planar Rook Algebra, Henry Potts-Rubin Jan 2020

The Planar Rook Algebra, Henry Potts-Rubin

Senior Independent Study Theses

No abstract provided.


Cheat Detection Using Machine Learning Within Counter-Strike: Global Offensive, Harry Dunham Jan 2020

Cheat Detection Using Machine Learning Within Counter-Strike: Global Offensive, Harry Dunham

Senior Independent Study Theses

Deep learning is becoming a steadfast means of solving complex problems that do not have a single concrete or simple solution. One complex problem that fits this description and that has also begun to appear at the forefront of society is cheating, specifically within video games. Therefore, this paper presents a means of developing a deep learning framework that successfully identifies cheaters within the video game CounterStrike: Global Offensive. This approach yields predictive accuracy metrics that range between 80-90% depending on the exact neural network architecture that is employed. This approach is easily scalable and applicable to all types of …


A Theory Of Fire Service Provision: With An Empirical Analysis Of Response Time, Suppression Time, And Service Output, Hyong-Gu Hwang Jan 2020

A Theory Of Fire Service Provision: With An Empirical Analysis Of Response Time, Suppression Time, And Service Output, Hyong-Gu Hwang

Senior Independent Study Theses

We introduce a two-stage theoretical framework of fire services that justifies the status of response time as a factor input. In the first stage, the provincial government distributes a budget to its cities, resulting in varied numbers of firefighters and fire engines in each city. In the second stage, each city fire department places its fire stations at spatially optimal locations that minimize expected response times. When a fire occurs, the outputs from these two stages are actualized into dispatch level, response time, and suppression time. These intermediate outputs are then transformed into inputs for producing service output, which is …


Developing A Web-Based Application For Finding Meeting Places, Aedan D. Pettit Jan 2020

Developing A Web-Based Application For Finding Meeting Places, Aedan D. Pettit

Senior Independent Study Theses

Midway: Meeting Place Finder is a web application which allows users to supply three or more locations and provides them with a place to meet that minimizes their total driving time. Using techniques from graph theory, an algorithm is developed in order to make this service possible. Then, using Python, this algorithm is implemented into the backend of the web application along with a simple, user-friendly interface. This application has exciting potential to be continually expanded and improved in the future beyond this initial version.