Physical Sciences and Mathematics Commons^™

Spatiotemporal Subspace Feature Tracking By Mining Discriminatory Characteristics, Richard D. Appiah

Doctoral Dissertations

Recent advancements in data collection technologies have made it possible to collect heterogeneous data at complex levels of abstraction, and at an alarming pace and volume. Data mining, and most recently data science seek to discover hidden patterns and insights from these data by employing a variety of knowledge discovery techniques. At the core of these techniques is the selection and use of features, variables or properties upon which the data were acquired to facilitate effective data modeling. Selecting relevant features in data modeling is critical to ensure an overall model accuracy and optimal predictive performance of future effects. The …

3-Manifold Perspective On Surface Homeomorphisms For Surfaces With Very Negative Euler Characteristic, Michael Harris

Graduate Theses and Dissertations

The goal of this paper is to show for a compact triangulated 3-manifold M with boundary which fibers over the circle that whenever F is a fiber with sufficiently negative Euler characteristic the monodromymaps an essential simple closed curve or an essential simple arc in F to be disjoint from its image (possibly after isotopy). This is shown by applying the theorem of Ichihara, Kobayashi, and Rieck in [10] to the double of M to get a pair of pants. We then find an equivariant pair of pants and use it to find an essential simple closed curve or an …

Interaction Graphs Derived From Activation Functions And Their Application To Gene Regulation, Simon Joyce

Graduate Dissertations and Theses

Interaction graphs are graphic representations of complex networks of mutually interacting components. Their main application is in the field of gene regulatory networks, where they are used to visualize how the expression levels of genes activate or inhibit the expression levels of other genes.

First we develop a natural transformation of activation functions and their derived interaction graphs, called conjugation, that is related to a natural transformation of signed digraphs called switching isomorphism. This is a useful tool for the analysis of interaction graphs used throughout the rest of the dissertation.

We then discuss the question of what restrictions, if …