Other Applied Mathematics Commons^™

Multi-Valued Solutions For The Equation Of Motion, Darcy-Jordan Model, As A Cauchy Problem: A Shocking Event, Chandler Shimp

Master's Theses

Shocks are physical phenomenon that occur quite often around us. In this thesis we examine the occurrence of shocks in finite amplitude acoustic waves from a numerical perspective. These waves, or jump discontinuities, yield ill-behaved solutions when solved numerically. This study takes on the challenge of finding both single- and multi-valued solutions.

The previously unsolved problem in this study is the representation of the Equation of Motion (EoM) in the form of the Darcy-Jordan model (DJM) and expressed as a dimensionless IVP Cauchy problem. Prior attempts to solve have resulted only in implicit solutions or explicit solutions with certain initial …

The “Knapsack Problem” Workbook: An Exploration Of Topics In Computer Science, Steven Cosares

Open Educational Resources

This workbook provides discussions, programming assignments, projects, and class exercises revolving around the “Knapsack Problem” (KP), which is widely a recognized model that is taught within a typical Computer Science curriculum. Throughout these discussions, we use KP to introduce or review topics found in courses covering topics in Discrete Mathematics, Mathematical Programming, Data Structures, Algorithms, Computational Complexity, etc. Because of the broad range of subjects discussed, this workbook and the accompanying spreadsheet files might be used as part of some CS capstone experience. Otherwise, we recommend that individual sections be used, as needed, for exercises relevant to a course in …

Machine Learning With Topological Data Analysis, Ephraim Robert Love

Doctoral Dissertations

Topological Data Analysis (TDA) is a relatively new focus in the fields of statistics and machine learning. Methods of exploiting the geometry of data, such as clustering, have proven theoretically and empirically invaluable. TDA provides a general framework within which to study topological invariants (shapes) of data, which are more robust to noise and can recover information on higher dimensional features than immediately apparent in the data. A common tool for conducting TDA is persistence homology, which measures the significance of these invariants. Persistence homology has prominent realizations in methods of data visualization, statistics and machine learning. Extending ML with …

Scaling Up Exact Neural Network Compression By Relu Stability, Thiago Serra, Xin Yu, Abhinav Kumar, Srikumar Ramalingam

Faculty Conference Papers and Presentations

We can compress a rectifier network while exactly preserving its underlying functionality with respect to a given input domain if some of its neurons are stable. However, current approaches to determine the stability of neurons with Rectified Linear Unit (ReLU) activations require solving or finding a good approximation to multiple discrete optimization problems. In this work, we introduce an algorithm based on solving a single optimization problem to identify all stable neurons. Our approach is on median 183 times faster than the state-of-art method on CIFAR-10, which allows us to explore exact compression on deeper (5 x 100) and wider …

Optimal Construction Of A Layer-Ordered Heap And Its Applications, Jake Pennington

Graduate Student Theses, Dissertations, & Professional Papers

The layer-ordered heap (LOH) is a simple data structure used in algorithms that perform optimal top-$k$ on $X+Y$, algorithms with the best known runtime for top-$k$ on $X_1+X_2+\cdots+X_m$, and the fastest method in practice for computing the most abundant isotopologue peaks in a chemical compound. In the analysis of these algorithms, the rank, $\alpha$, has been treated as a constant and $n$, the size of the array, has been treated as the sole parameter. Here, we explore the algorithmic complexity of LOH construction with $\alpha$ as a parameter, introduce a few algorithms for constructing LOHs, analyze their complexity in both …