Physical Sciences and Mathematics Commons^™

School District Boundaries Map, Nick Huffman

Honors Theses

The purpose of this project is to provide a school district boundary mapping feature to a product sold by Level Data called SDVS, which is a plugin used by districts inside of PowerSchool. Using primarily the features offered by Mapbox, We have implemented a React component that is capable of plotting useful data points related to a student and their school district on a map. The tool is designed to be used primarily by school administrators to determine whether or not a student lives within their district boundaries. The application uses a dataset that is provided by the NCES to …

Stem Teacher Database, Veronica Buss

Honors Theses

The College of Engineering and Applied Sciences (CEAS) Recruitment web application provides access to recruitment information for the Manager of Recruitment and Outreach and those who also use the spreadsheet file with their current data. This database is a functional database for the WMU college of engineering and applied sciences’ recruiters to organize their data on STEM teachers from the feeder high schools of WMU. The app provides an interface for its users to filter and search the data they have compiled to create recruitment mailing reports. The main purpose of this app was to facilitate the retrieval and upkeep …

Applying Deep Learning For Cell Detection In Time-Lapse Microscopic Images, Jay Patel

Honors Theses

The budding yeast Saccharomyces cerevisiae is an effective model for studying cellular aging. We can measure the lifespan of yeast cells in two ways: replicative and chronological lifespans. Chronological focuses on the time that a cell can survive. The replicative lifespan (RLS) is the number of cell divisions that a single mother cell can go through before ceases to be dividing. RLS is a measurement of individual cells and is more informative on the aging process than in chronological lifespan. Many genes that influence yeast RLS have been shown to be highly conserved and have a similar effect on aging …

Human Facial Emotion Recognition System In A Real-Time, Mobile Setting, Claire Williamson

Honors Theses

The purpose of this project was to implement a human facial emotion recognition system in a real-time, mobile setting. There are many aspects of daily life that can be improved with a system like this, like security, technology and safety.

There were three main design requirements for this project. The first was to get an accuracy rate of 70%, which must remain consistent for people with various distinguishing facial features. The second goal was to have one execution of the system take no longer than half of a second to keep it as close to real time as possible. Lastly, …

Meta-Analysis Of Biological Research Literature, Evan Suggs

Honors Theses

Comparative studies have been powerful tools in generating a broad understanding about the evolution of animal social systems but they currently rely on the slow, manual process of reading thousands of abstracts and papers from research databases. A web application was created for researchers conducting a comparative survey, in order to speed up their research. This web application automates the retrieval of research papers and their selection process. Using previously obtained data sets on the orders Artiodacytla and Lagomorph, a machine learning application was created to classify the papers. These techniques and tools should greatly increase the speed at which …

A Machine Learning Method For Predicting Liver Transplant Survival Outcomes, Brandon C. Revels

Honors Theses

For years, doctors have utilized the Model for End-stage Liver Disease (MELD) score to aid in the allocation of organs for liver transplants (LT). A major issue with using the MELD score to allocate organs for transplantation is that the MELD score does not accurately predict post-transplant survival. This research project aims to investigate the use of machine learning (ML) methods to predict LT survival using the newer Scientific Registry of Transplant Recipients (SRTR) dataset. For this project, death and nonfatal graft failure were treated equally as both cases result in a loss of a donated organ. The ML algorithms …

Engagement And Computational Thinking Through Creative Coding, Dana Hoppe

Honors Theses

Rising enrollments in Computer Science pose an opportunity to engage students from diverse backgrounds and interests; and a challenge to deliver on positive learning outcomes. While student engagement is the driving factor for increased learning performance and retention, it has been declining to new lows for Computer Science students in recent years. In order to further explore the potential of contextualized computing as a tool for increasing engagement in computing and developing Computational Thinking aptitude in students, we have developed an introductory computing course contextualized with Art and Design with modules centered around guiding pedagogical principles and aimed at middle …

Applications And Implementation Of A Satellite-Based Quantum Internet, Renèe Desporte

Honors Theses

No abstract provided.

Communicating Computing Limitations Through Kinesthetic Pedagogy, Michael Mason

Honors Theses

Abstract concepts, such as those in advanced Computer Science and Mathematics, can be extremely difficult to understand fundamentally without an existing background in a similar subject. Recent research has shown that raw visualizations without learner interaction are not particularly effective at communicating complex information because they allow the learner to ignore the example (Lauer 2006, Naps 2002). Forcing somebody to interact with an example ensures that they can grasp the visualization. This paper describes a six step technique to demonstrate the limitations of computing through kinesthetic pedagogy, then offers an example exercise utilizing the method. The six proposed steps are: …

Ethics, Privacy And Data Collection: A Complex Intersection, Matthew S. Brown

Honors Theses

The technology around us enables incredible abilities such as high-resolution video calls and the ability to stay connected with everyone we care about through social media. This technology also comes with a hidden cost in the form of data collection.

This work explores what privacy means and how users understand what data social media companies collect and monetize. This thesis also proposes a more ethical business model that addresses privacy concerns from an individual perspective.

Measuring Differential Forest Growth In The Sheepscot River Headwaters With Bitemporal Lidar, Soren Denlinger

Honors Theses

In recent years, lidar has proven itself as a forestry tool capable of accurate, large- scale inventories. Lidar has even shown utility in multitemporal analysis and growth assessment, given high-resolution or small-scale point clouds. However, lidar’s efficacy as a multitemporal tool with relatively low-resolution, large-scale datasets is comparatively unknown. In this study, I compared forest in Midcoast Maine bitemporally, with publicly available datasets from the years 2007 and 2012. Specifically, I compared differences in growth characteristics of riparian, wetland, and upland forests. Although the 2007 dataset (created for geomorphological research) and the 2012 dataset (statewide, general-purpose) possess varying point densities …

Fast Medial Axis Sampling For Use In Motion Planning, Hanglin Zhou

Honors Theses

Motion planning is a difficult but important problem in robotics. Research has tended toward approximations and randomized algorithms, like sampling-based planning. Probabilistic RoadMaps (PRMs) are one common sampling-based planning approach, but they lack safety guarantees. One main approach, Medial Axis PRM (MAPRM) addressed this deficiency by generating robot configurations as far away from the obstacles as possible, but it introduced an extensive computational burden. We present two techniques, Medial Axis Bridge and Medial Axis Spherical Step, to reduce the computational cost of sampling in MAPRM and additionally propose recycling previously computed clearance information to reduce the cost of connection in …

Computer-Assisted Coloring-Graph Generation And Structural Analysis, Wesley Su

Honors Theses

Graphs are a well studied construction in discrete math, with one of the most common areas of study being graph coloring. The graph coloring problem asks for a color to be assigned to each vertex in a graph such that no two adjacent vertices share a color. An assignment of k colors that meets these criteria is called a k-coloring. The coloring graph Ck(G) is defined as the graph where every vertex represents a valid k-coloring of graph G and edges exist between colorings that di↵er by one vertex. We call graph G the base graph of the k-coloring graph …

Biasing Medial Axis Rapidly-Exploring Random Trees With Safe Hyperspheres, David Qin

Honors Theses

Motion planning is a challenging and widely researched problem in robotics. Motion planning algorithms aim to not only nd unobstructed paths, but also to construct paths with certain qualities, such as maximally avoiding obstacles to improve path safety. One such solution is a Rapidly-Exploring Random Tree (RRT) variant called Medial Axis RRT that generates the safest possible paths, but does so slowly. This paper introduces a RRT variant called Medial Axis Ball RRT (MABallRRT) that uses the concept of clearance -- a robot's distance from its nearest obstacle -- to efficiently construct a roadmap with safe paths. The safety of …

Connectiveity And Structures Of Coloring Graphs, Xin Yutong

Honors Theses

Reconfiguration problems have been studied and applied to solve problems in various areas, including Math, Computer Science, and Chemistry. Due to the close relatedness between coloring graphs and reconfiguration problems, the connectivity and structure of coloring graphs give valuable information to a solution set of the corresponding reconfiguration problem. In this paper we will discuss 2--connectedness and cut-vertices of coloring graphs, and forbidden structures on a coloring graph wit cut-vertices.