Information about interactions between human actors, and the attributes about the actors in the networks, has become increasingly abundant in computer systems over the last decade. Multidimensional social networks are an ...
The PageRank of a vector is a measure of centrality for nodes in a network. Three ways to calculate the PageRank are using power iteration, Monte Carlo methods, and iterative graph methods using Spark. The graph methods ...
Population genetics focuses on understanding the evolutionary history of specific populations to gain insight into evolutionary events leading to the variation observed in nature. Increasing our understanding of evolution ...
In this paper, we consider two problems related to counting problems in complexity theory. First, we use the reachability method to prove that nondeterministic logarithm space is closed under complement. Then, we consider ...
Machine learning algorithms called classifiers make discrete predictions about new data by training on old data. These predictions may be hiring or not hiring, good or bad credit, and so on. The training data may contain ...
Past research has shown that children are able to implicitly learn the underlying melodic structure of their native culture's musical system, even without formal musical training. Although implicit musical learning has ...
This thesis discusses the relationship between computer vision and self-driving cars. It discusses the status of fields of computer vision and self-driving cars, at the time of the thesis' writing, and it also proposes a ...
Every ten years, when states are forced to redraw their congressional districts, the process is intensely partisan, and the outcome is rarely fair and democratic. In the last few decades, the growing capabilities of computers ...
It is possible to extend a microprocessor from a single core to a multiple cores by replicating the single core processor, and interfacing them to main memory bus via a bus arbitrator. With a multi-core processor, the ...
Optimization of route planning is essential to everyday tasks such as planning trips and traffic simulation. In order to optimize routes in large graphs such as transportation networks, an algorithm must be able to quickly ...
We present an exploration of data mining and machine learning techniques applied to a materials science dataset, with the goal of improving a lab's efficiency when running experiments. The primary product of our work is ...
The parallel computing community has produced various cluster computing frameworks to process the immense amounts of data we generate in the modern age. Two in particular, Hadoop MapReduce and Spark, rose above the rest ...
One of the most fundamental concepts in graph theory is connectivity, or the property that a path exists between two vertices in a given graph. The property of connectivity may be extended into biconnectivity and ...
As the population genetic database such as 1000 Genomes Dataset (Consortium et al. 2015) grows in size every day, it becomes more and more challenging to understand the large flow of the genetic information. Recent works ...
In this work we present a basic overview of digital rights management technologies, focusing heavily on a technical understanding of digital watermarking and its applications in copyright protection. We discuss the basic ...
Gestures serve an important role in human-computer interfaces, and advancing technology such as virtual and augmented reality makes 3-D gestures an increasingly important and powerful means of interaction. Robust gesture ...
In an age of ever expanding data sets, there is an increasing demand for high performance computing (HPC) in the scientific community. In order to maximize the performance of existing hardware, researchers have been looking ...
Axiomatization in finite model theory is the process of finding a set of axiom formulas from which all other formulas in a theory can be derived. Applied to the theory of a structure like "binary strings" or "natural number ...
In this paper, I discuss what array dependence analysis is, and how we can phrase questions about dependencies as questions about integer feasibility. I present the straight forward approaches to dealing with equalities, ...
This paper is an empirical study mainly of graph properties for various graphs including both deterministic graphs, those with a set structure, and random graphs. The main properties that are analyzed are graph diameter, ...