This thesis investigated a method of barcode reconstruction to address the recovery of a blurred and convoluted one-dimensional barcode. There are a lot of types of barcodes used today, such as Code 39, Code 93, Code 128, etc. Our algorithm applies to the universal barcode, EAN 13. We extend the methodologies proposed by Iwen et al. (2013) in the journal article "A Symbol-Based Algorithm for Decoding barcodes." The algorithm proposed in the paper requires a signal measured by a laser scanner as an input. The observed signal is modeled as a true signal corrupted by a Gaussian convolution, additional noises, and an unknown multiplier. The known barcode dictionaries were incorporated into the forward map between the true barcode and the observed barcode. Unlike the one proposed by Iwen et al., we take dictionaries of different patterns into account, specifically for decoding book barcodes from images which are captured with smartphones. We also presented numerical experiments that examined the performance of the proposed algorithm and illustrated that the unique determination of barcode digits is possible even in the presence of noise.

To determine the function of a protein, we must know its 3-dimensional structure, which can be difficult to ascertain. Currently, predictive models are used to determine the structure of a protein from its sequence, but these models do not always predict the correct structure. To this end we use a nested graph model along with weighted invariants to minimize the errors and improve the accuracy of a predictive model to determine if we have the correct structure for a protein.

Recent advancements in sports information and technology systems have ushered in a new age of applications of both supervised and unsupervised analytical techniques in the sports domain. These automated systems capture large volumes of data points about competitors during live competition. As a result, multi-relational analyses are gaining popularity in the field of Sports Analytics. We review two case studies of dimensionality reduction with Principal Component Analysis and latent factor analysis with Non-Negative Matrix Factorization applied in sports. Also, we provide a review of a framework for extending these techniques for higher order data structures. The primary scope of this thesis is to further extend the concept of tensor decomposition through the use of function spaces. In doing so, we address the limitations of PCA to vector and matrix representations and the CP-Decomposition to tensor representations. Lastly, we provide an application in the context of professional stock car racing.

The interdisciplinary field of machine learning studies algorithms in which functionality is dependent on data sets. This data is often treated as a matrix, and a variety of mathematical methods have been developed to glean information from this data structure such as matrix decomposition. The Laplacian matrix, for example, is commonly used to reconstruct networks, and the eigenpairs of this matrix are used in matrix decomposition. Moreover, concepts such as SVD matrix factorization are closely connected to manifold learning, a subfield of machine learning that assumes the observed data lie on a low-dimensional manifold embedded in a higher-dimensional space. Since many data sets have natural higher dimensions, tensor methods are being developed to deal with big data more efficiently. This thesis builds on these ideas by exploring how matrix methods can be extended to data presented as tensors rather than simply as ordinary vectors.

In this thesis, we consider packings and coverings of various complete graphs with the 4-cycle with a pendant edge. We consider both restricted and unrestricted coverings. Necessary and sufficient conditions are given for such structures for (1) complete graphs Kv, (2) complete bipartite graphs Km,n, and (3) complete graphs with a hole K(v,w).

Sorting out data into partitions is increasing becoming complex as the constituents of data is growing outward everyday. Mixed data comprises continuous, categorical, directional functional and other types of variables. Clustering mixed data is based on special dissimilarities of the variables. Some data types may influence the clustering solution. Assigning appropriate weight to the functional data may improve the performance of the clustering algorithm. In this paper we use the extension of the Gower coefficient with judciously chosen weight for the L2 to cluster mixed data.The benefits of weighting are demonstrated both in in applications to the Buoy data set as well simulation studies. Our studies show that clustering algorithms with application of proper weight give superior recovery level when a set of data with mixed continuous, categorical directional and functional attributes is clustered. We discuss open problems for future research in clustering mixed data.

Biological systems are commonly represented using networks consisting of interactions between various elements in the system. Reverse engineering, a method of mathematical modeling, is used to recover how the elements in the biological network are connected. These connections are encoded using wiring diagrams, which are directed graphs that describe how elements in a network affect one another. A signed wiring diagram provides additional information about the interactions between elements relating to activation and inhibition. Due to cost concerns, it is optimal to gain insight into biological networks with as few experiments and data as possible. Minimal wiring diagrams identify the minimal sets of variables for which a model that fits the data exists. Previously established algorithms to compute possible minimal wiring diagrams rely on the primary decomposition of ideals in polynomial rings. Stanley-Reisner theory provides a one-to-one correspondence between squarefree monomial ideals and abstract simplicial complexes. In this work, we use this correspondence to determine conditions under which a given set of inputs is guaranteed to have a unique signed minimal wiring diagram, regardless of the output assignment.

Through methods in network theory and time-series analysis, we will analyze the spread of COVID-19 in the United States by determining trends in state-by-state daily cases through a network construction. Previous researchers have found frameworks for approximating the spread of the COVID-19 pandemic and identifying potential rises in cases by a network construction based on correlation of cases between regions [1]. Applying this network construction we determine how this network and its structure act as a predictor for overall COVID-19 cases in the United States by preforming a trend analysis on a variety of network statistics and US COVID-19 cases.

Time series analysis is a statistical technique used to analyze sequential data points collected or recorded over time. While traditional models such as autoregressive models and moving average models have performed sufficiently for time series analysis, the advent of artificial neural networks has provided models that have suggested improved performance. In this research, we provide a custom neural network; a shift encoder that can capture the intricate temporal patterns of time series data. We then compare the sparse matrix of the shift encoder to the parameters of the autoregressive model and observe the similarities. We further explore how we can replace the state matrix in a state-space model with the sparse matrix of the shift encoder.

The discrete Fourier transform has become an essential tool in the analysis of digital signals. Applications have become widespread since the discovery of the Fast Fourier Transform and the rise of personal computers. The field of digital signal processing is an exciting intersection of mathematics, statistics, and electrical engineering. In this study we aim to gain understanding of the mathematics behind algorithms that can extract chord information from recorded music. We investigate basic music theory, introduce and derive the discrete Fourier transform, and apply Fourier analysis to audio files to extract spectral data.