Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to nonfederal websites. Their policies may differ from this site.

Abstract Cantor sets are constructed from iteratively removing sections of intervals. This process yields a cumulative distribution function (CDF), constructed from the invariant Borel probability measure associated with their iterated function systems. Under appropriate assumptions, we identify sampling schemes of such CDFs, meaning that the underlying Cantor set can be reconstructed from sufficiently many samples of its CDF. To this end, we prove that two Cantor sets have almostnowhere intersection with respect to their corresponding invariant measures.

We introduce a novel methodology for anomaly detection in timeseries data. The method uses persistence diagrams and bottleneck distances to identify anomalies. Specifically, we generate multiple predictors by randomly bagging the data (reference bags), then for each data point replacing the data point for a randomly chosen point in each bag (modified bags). The predictors then are the set of bottleneck distances for the reference/modified bag pairs. We prove the stability of the predictors as the number of bags increases. We apply our methodology to traffic data and measure the performance for identifying known incidents.

The Kaczmarz algorithm is an iterative method for solving a system of linear equations. It can be extended so as to reconstruct a vector $x$ in a (separable) Hilbert space from the innerproducts $\{ \langle x, \phi_{n} \rangle \}$. The Kaczmarz algorithm defines a sequence of approximations from the sequence $\{ \langle x, \phi_{n} \rangle \}$; these approximations only converge to $x$ when $\{ \phi_{n} \}$ is \emph{effective}. We dualize the Kaczmarz algorithm so that $x$ can be obtained from $\{\langle x, \phi_{n} \rangle\}$ by using a second sequence $\{\psi_{n}\}$ in the reconstruction. This allows for the recovery of $x$ even when the sequence $\{\phi_{n}\}$ is not effective; in particular, our dualization yields a reconstruction when the sequence $\{\phi_{n}\}$ is \emph{almost effective}. We also obtain some partial results characterizing when the sequence of approximations from $\{\langle \vec{x}, \phi_{n} \rangle\}$ converges to $x$, in which case $\{ (\phi_{n}, \psi_{n}) \}$ is called an effective pair.

Abstract In this paper we study in detail a variation of the orthonormal bases (ONB) of L2[0, 1] introduced in [Dutkay D. E., Picioroaga G., Song M. S., Orthonormal bases generated by Cuntz algebras, J. Math. Anal. Appl., 2014, 409(2), 11281139] by means of representations of the Cuntz algebra ON on L2[0, 1]. For N = 2 one obtains the classic Walsh system which serves as a discrete analog of the Fourier system. We prove that the generalized Walsh system does not always display periodicity, or invertibility, with respect to function multiplication. After characterizing these two properties we also show that the transform implementing the generalized Walsh system is continuous with respect to filter variation. We consider such transforms in the case when the orthogonality conditions in Cuntz relations are removed. We show that these transforms which still recover information (due to remaining parts of the Cuntz relations) are suitable to use for signal compression, similar to the discrete wavelet transform.