Air U Debugger

Thesis Project

Poor air quality impacts public health due to increased incidence of cancers, heart diseases, and various respiratory disorders. Many Utah cities have hazardous air quality episodes as a result of inversions and forest fires; however, despite its impact on our community, the data obtained about PM 2.5 levels is often course- often being measured for an entire zip code. Such granularity is unacceptable as research suggests that microclimates of pollution exist that are not captured by these measurements.

As such, a model was built to provide finer resolution PM 2.5 estimates throughout SLC. However, there didn't exist a way to understand how the model responds to episodes of poor air quality. As such the Air U Debugger (AUDB) was constructed.

I conducted the user interviews to determine the software requirements for AUDB; furthermore, I developed this AUDB through prototyping sessions. The current version of this tool pulls air quality sensor data, model data, and geographic data to display to the user.

This tool was selected to be demoed at the 2018 Utah Data Science Day.

Dijikstra's Airport Search

Class Project

Our algorithm is used to find the cheapest flight path from a depature city to a destination city. It accomplishes this through reading csv data into a Network Graph Class, and creates an API for fast querying of the data.

Dijikstra's Algorithm was used to quickly traverse all of the created nodes. This algorithm uses a priority queue to return the cheapest path possible while attempting to find the destination node.

The flight data is stored in a few levels. First, a network graph class has a hashmap that contains each airport in the data set. Each airport contains another hashmap for all of the flight destinations leaving from that airport.

Using these nested hash maps, we were able to acheive O([V+E]*log(V)) run performance, where V is the number of airports and E is the number of flights. We decided to prioritze time over space in our design decisions. This decision was necessary as we wanted this API to be used on a large scale- we wanted a larger upfront memory cost in exchange for faster querying.

gRIDE Bus Finder

Personal Project

This web app allows users to determine what Genentech bus picks up closest to their entered address. I created this app after I got tired of putting addresses into google maps and seeing the walking time between potential apartments and the bus stop.

This application quickly spread among the intern community, and within my first week at Genentech, I had a meeting with the director of the Bus Fleet. I demoed the application, and we developed a plan to scale the application and add it to the Genentech website.

R was used for this application due to the variety of factors. Primarily, there existed quite a few tools for analyzing geographic data, which made it easy to compute which pickup stops were the closest to the entered address. Additionally, R Shiny is a framework for making quick prototypes. As this application was origionally not intended to be used by 1000's of people, scalability was not a huge consideration.

ECG Signal Averaging

Course Project

This application was developed to provide diagnostic information for patient's heart health. Through classifying beats as normal or irregular, physicians could take a statistical view of patient's health data. On this project, I worked as the project lead; I established software requirements, orchestrated the development of our classification algorithm, and coordinated meetings with our research advisor.