For example, the pentagon is strongly regular with parameters (v, k, λ, μ) = (5, 2, 0, 1). One easily verifies that a graph G is strongly regular with parameters (v, k, λ, μ) if and only if its complement G is strongly regular with parameters (v, v−k− 1, v− 2k+μ− 2, v−2k+λ). The line graph of the complete graph of order m, known as the triangular graph T (m), is strongly regular with parameters...

In this paper, we aim to design and implement a system that allows a user to quickly and accurately read values of points of interest in graphs. This system focuses on two types of graphs: simple line graphs and 2D grayscale images. These images are obtained through photographs of printed graphs taken with an Android phone. Our final product is a portable graph reader that compensates for the n...

Rapid progress has been made towards question answering (QA) systems that can extract answers from text. Existing neural approaches make use of expensive bidirectional attention mechanisms or score all possible answer spans, limiting scalability. We propose instead to cast extractive QA as an iterative search problem: select the answer’s sentence, start word, and end word. This representation r...

Computers excel at performing quantitative and repetitive tasks quickly, but they struggle with qualitative tasks, such as handwriting recognition. This is because it is effectively impossible to program recognition of millions of different handwriting styles into one algorithm. However, with the advent of machine learning, computers can be trained to recognize unknown objects and characters by...

In studying the correlations between genetic mutations and cancer development, the relationship between mutations and patient survival is one of the most significant from both academic and clinical perspectives. Survival analysis being an established field, assessing the correlation between any given mutation or collection of mutations and survival is a straightforward process. This paper seeks...

The goal of this project was to design an image processing algorithm that scans in sheet music and plays the music described on the page. Our algorithm takes a digital image of sheet music and segments it by line. For each line, it detects the note types and locations, and computes the frequency and duration. These frequency and duration pairs are stored in a matrix and fed into the audio synth...