Digital Commons Network^™

A Computer Programming Intervention For Second Grade Math Students, Eric B. Bagley

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The multiplication algorithms taught to elementary students are made to help students find answers quickly, but why the algorithm works and how it relates to multiplication is not widely known. For example, one intuitive meaning of multiplication is that of iterated, or, repeated, addition. In this paper, we look at the ways a visual, block-based, programming activity uses the concept of iteration to help second-graders learn multiplication. The results of the study observing second-grade students use visual programming and iteration to setup and solve multiplication story problems. We found that generally students enjoyed these activities and found them helpful during …

Local-Global Results On Discrete Structures, Alexander Lewis Stevens

Electronic Theses and Dissertations

Local-global arguments, or those which glean global insights from local information, are central ideas in many areas of mathematics and computer science. For instance, in computer science a greedy algorithm makes locally optimal choices that are guaranteed to be consistent with a globally optimal solution. On the mathematical end, global information on Riemannian manifolds is often implied by (local) curvature lower bounds. Discrete notions of graph curvature have recently emerged, allowing ideas pioneered in Riemannian geometry to be extended to the discrete setting. Bakry- Émery curvature has been one such successful notion of curvature. In this thesis we use combinatorial …

Fourth-Dimensional Education In Virtual Reality, Jesse P. Hamlin-Navias

Senior Projects Spring 2022

This project was driven by an interest in mathematics, visualization, and the budding field of virtual reality. The project aimed to create virtual reality software to allow users to interact and play with three-dimensional representations of four-dimensional objects. The chosen representation was a perspective projection. Much like three-dimensional shapes cast two-dimensional shadows, four-dimensional shapes cast three-dimensional shadows. Users of the software developed in this project could interact and experiment with these three-dimensional shadows using hand controlled inputs. The hypothesis put forward is that virtual reality is currently the best medium to teach three-dimensional and four-dimensional geometry.

Highlights Generation For Tennis Matches Using Computer Vision, Natural Language Processing And Audio Analysis, Alon Liberman

Senior Independent Study Theses

This project uses computer vision, natural language processing and audio analysis to automatize the highlights generation task for tennis matches. Computer vision techniques such as camera shot detection, hough transform and neural networks are used to extract the time intervals of the points. To detect the best points, three approaches are used. Point length suggests which points correspond to rallies and aces. The audio waves are analyzed to search for the highest audio peaks, which indicate the moments where the crowd cheers the most. Sentiment analysis, a natural language processing technique, is used to look for points where the commentators …

Stroke Clustering And Fitting In Vector Art, Khandokar Shakib

Senior Independent Study Theses

Vectorization of art involves turning free-hand drawings into vector graphics that can be further scaled and manipulated. In this paper, we explore the concept of vectorization of line drawings and study multiple approaches that attempt to achieve this in the most accurate way possible. We utilize a software called StrokeStrip to discuss the different mathematics behind the parameterization and fitting involved in the drawings.

On Implementing And Testing The Rsa Algorithm, Kien Trung Le

Senior Independent Study Theses

In this work, we give a comprehensive introduction to the RSA cryptosystem, implement it in Java, and compare it empirically to three other RSA implementations. We start by giving an overview of the field of cryptography, from its primitives to the composite constructs used in the field. Then, the paper presents a basic version of the RSA algorithm. With this information in mind, we discuss several problems with this basic conception of RSA, including its speed and some potential attacks that have been attempted. Then, we discuss possible improvements that can make RSA runs faster and more secure. On the …

Cross-Model Parameter Estimation In Epidemiology, Julia R. Fitzgibbons

Honors Theses and Capstones

No abstract provided.

Statistical And Machine Learning Approaches To Depressive Disorders Among Adults In The United States: From Factor Discovery To Prediction Evaluation, Minhwa Lee

Senior Independent Study Theses

According to the National Institutes of Mental Health (NIMH), depressive disorders (or major depression) are considered one of the most common and serious health risks in the United States. Our study focuses on extracting non-medical factors of depressive disorders diagnosis, such as overall health states, health risk behaviors, demography, and healthcare access, using the Behavioral Risk Factor Surveillance System (BRFSS) data set collected by the Centers for Disease Control and Prevention (CDC) in 2018.

We set the two objectives of our study about depressive disorders diagnosis in the United States as follows. First, we aim to utilize machine learning algorithms …

Computational Simulation And Analysis Of Neuroplasticity, Madison E. Yancey

Browse all Theses and Dissertations

Homeostatic synaptic plasticity is the process by which neurons alter their activity in response to changes in network activity. Neuroscientists attempting to understand homeostatic synaptic plasticity have developed three different mathematical methods to analyze collections of event recordings from neurons acting as a proxy for neuronal activity. These collections of events are from control data and treatment data, referring to the treatment of neuron cultures with pharmacological agents that augment or inhibit network activity. If the distribution of control events can be functionally mapped to the distribution of treatment events, a better understanding of the biological processes underlying homeostatic synaptic …

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.

The Knapsack Subproblem Of The Algorithm To Compute The Erdos-Selfridge Function, Brianna Sorenson

Undergraduate Honors Thesis Collection

This thesis summarizes the methodology of a new algorithm to compute the Erdos-Selfridge function which uses a wheel sieve, shows that a knapsack algorithm can be used to minimize the work needed to compute these values by selecting a subset of rings for use in the wheel, and compares the results of several different knapsack algorithms in this particular scenario.

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 …

Sports Analytics With Computer Vision, Colby T. Jeffries

Senior Independent Study Theses

Computer vision in sports analytics is a relatively new development. With multi-million dollar systems like STATS’s SportVu, professional basketball teams are able to collect extremely fine-detailed data better than ever before. This concept can be scaled down to provide similar statistics collection to college and high school basketball teams. Here we investigate the creation of such a system using open-source technologies and less expensive hardware. In addition, using a similar technology, we examine basketball free throws to see whether a shooter’s form has a specific relationship to a shot’s outcome. A system that learns this relationship could be used to …

The Rsa Cryptosystem, Rodrigo Iglesias

Williams Honors College, Honors Research Projects

This paper intends to present an overview of the RSA cryptosystem. Cryptosystems are mathematical algorithms that disguise information so that only the people for whom the information is intended can read it. The invention of the RSA cryptosystem in 1977 was a significant event in the history of cryptosystems. We will describe in detail how the RSA cryptosystem works and then illustrate the process with a realistic example using fictional characters. In addition, we will discuss how cryptosystems worked prior to the invention of RSA and the advantage of using RSA over any of the previous cryptosystems. This will help …

Logic -> Proof -> Rest, Maxwell Taylor

Senior Independent Study Theses

REST is a common architecture for networked applications. Applications that adhere to the REST constraints enjoy significant scaling advantages over other architectures. But REST is not a panacea for the task of building correct software. Algebraic models of computation, particularly CSP, prove useful to describe the composition of applications using REST. CSP enables us to describe and verify the behavior of RESTful systems. The descriptions of each component can be used independently to verify that a system behaves as expected. This thesis demonstrates and develops CSP methodology to verify the behavior of RESTful applications.

Developing A B -Tagging Algorithm Using Soft Muons At Level-3 For The Dø Detector At Fermilab, Mayukh Das

Doctoral Dissertations

The current data-taking phase of the DØ detector at Fermilab, called Run II, is designed to aid the search for the Higgs Boson. The neutral Higgs is postulated to have a mass of 117 GeV. One of the channels promising the presence of this hypothetical particle is through the decay of b-quark into a muon. The process of identifying a b-quark in a jet using muon as a reference is b-tagging with a muon tag.

At the current data taking and analysis rate, it will take long to reach the process of identifying valid events. The triggering mechanism of the …

Depth-First Search Embedded Wavelet Algorithm For Hardware Implementation, Li-Minn Ang

Theses: Doctorates and Masters

The emerging technology of image communication over wireless transmission channels requires several new challenges to be simultaneously met at the algorithm and architecture levels. At the algorithm level, desirable features include high coding performance, bit stream scalability, robustness to transmission errors and suitability for content-based coding schemes. At the architecture level, we require efficient architectures for construction of portable devices with small size and low power consumption. An important question is to ask if a single coding algorithm can be designed to meet the diverse requirements. Recently, researchers working on improving different features have converged on a set of coding …