Streaming Algorithms Via Reductions

In the streaming algorithms model of computation we must process data in order and without enough memory to remember the entire input. We study reductions between problems in the streaming model with an eye to using reductions as an algorithm design technique. Our contributions include: * Linear Transformation reductions, which compose with existing linear sketch techniques. We use these for small-space algorithms for numeric measurements of distance-from-periodicity, finding the period of a numeric stream, and detecting cyclic shifts. * The first streaming graph algorithms in the sliding window\u27 model, where we must consider only the most recent L elements for some fixed threshold L. We develop basic algorithms for connectivity and unweighted maximum matching, then develop a variety of other algorithms via reductions to these problems. * A new reduction from maximum weighted matching to maximum unweighted matching. This reduction immediately yields improved approximation guarantees for maximum weighted matching in the semistreaming, sliding window, and MapReduce models, and extends to the more general problem of finding maximum independent sets in p-systems. * Algorithms in a stream-of-samples model which exhibit clear sample vs. space tradeoffs. These algorithms are also inspired by examining reductions. We provide algorithms for calculating F_k frequency moments and graph connectivity

Streaming Periodicity with Mismatches

We study the problem of finding all k-periods of a length-n string S, presented as a data stream. S is said to have k-period p if its prefix of length n-p differs from its suffix of length n-p in at most k locations. We give a one-pass streaming algorithm that computes the k-periods of a string S using poly(k, log n) bits of space, for k-periods of length at most n/2. We also present a two-pass streaming algorithm that computes k-periods of S using poly(k, log n) bits of space, regardless of period length. We complement these results with comparable lower bounds

Improved Circular k-Mismatch Sketches

The shift distance $\mathsf{sh}(S_1,S_2)$ between two strings $S_1$ and $S_2$ of the same length is defined as the minimum Hamming distance between $S_1$ and any rotation (cyclic shift) of $S_2$. We study the problem of sketching the shift distance, which is the following communication complexity problem: Strings $S_1$ and $S_2$ of length $n$ are given to two identical players (encoders), who independently compute sketches (summaries) $\mathtt{sk}(S_1)$ and $\mathtt{sk}(S_2)$, respectively, so that upon receiving the two sketches, a third player (decoder) is able to compute (or approximate) $\mathsf{sh}(S_1,S_2)$ with high probability. This paper primarily focuses on the more general $k$-mismatch version of the problem, where the decoder is allowed to declare a failure if $\mathsf{sh}(S_1,S_2)>k$, where $k$ is a parameter known to all parties. Andoni et al. (STOC'13) introduced exact circular $k$-mismatch sketches of size $\widetilde{O}(k+D(n))$, where $D(n)$ is the number of divisors of $n$. Andoni et al. also showed that their sketch size is optimal in the class of linear homomorphic sketches. We circumvent this lower bound by designing a (non-linear) exact circular $k$-mismatch sketch of size $\widetilde{O}(k)$; this size matches communication-complexity lower bounds. We also design $(1\pm \varepsilon)$-approximate circular $k$-mismatch sketch of size $\widetilde{O}(\min(\varepsilon^{-2}\sqrt{k}, \varepsilon^{-1.5}\sqrt{n}))$, which improves upon an $\widetilde{O}(\varepsilon^{-2}\sqrt{n})$-size sketch of Crouch and McGregor (APPROX'11)

Dictionary matching in a stream

We consider the problem of dictionary matching in a stream. Given a set of strings, known as a dictionary, and a stream of characters arriving one at a time, the task is to report each time some string in our dictionary occurs in the stream. We present a randomised algorithm which takes O(log log(k + m)) time per arriving character and uses O(k log m) words of space, where k is the number of strings in the dictionary and m is the length of the longest string in the dictionary

An analysis of the periodicity of the cell cycle and apoptotic regulatory proteins in prostate xenografts using anova and cosinor methods

Circadian rhythms have been found in both plants and animals, in normal tissues as well as in most tumors and human cancers. By following these rhythms in healthy and cancerous tissue, it has been possible to find optimal times to deliver a dose of drug, such that efficacy is maximized and toxicity to normal tissues is minimized. In this study, the periodicity of several cell cycle and apoptotic regulatory proteins were studied in two prostate cancer models against a dietary therapeutic agent, Selenium. The ALVA-3 1 (androgen-independent) and PC-3 (androgen-independent) prostate cancer cell lines were grown in vivo, as a subcutaneous xenograft in mice and measured at seven different Hours After Light Onset (HALO). Measurements were taken at 3, 7, 10, 13, 17, 20 and 23 HALO, which is equivalent to 10 AM, 1 PM, 4 PM, 7 PM, 11 PM, 2 AM and 5 AM. The tumors were used to assess total expression of the protein of interest using an immunoblotting method, and the results were assessed by densitometry. Statistical analysis of the mice with the ANOVA and the COSiNOR methods showed that selenium treatment was most effective at HALO 13 at decreasing cell cycle and apoptosis-related proteins for ALVA-3 1. For PC-3 tumor lines, HALO 7 proved to be of highest expression while HALO 13 showed the lowest expression. The selenium treated tumors showed inhibitory effects via lower expression levels throughout both tumor trials

Approximating Properties of Data Streams

In this dissertation, we present algorithms that approximate properties in the data stream model, where elements of an underlying data set arrive sequentially, but algorithms must use space sublinear in the size of the underlying data set. We first study the problem of finding all k-periods of a length-n string S, presented as a data stream. S is said to have k-period p if its prefix of length n − p differs from its suffix of length n − p in at most k locations. We give algorithms to compute the k-periods of a string S using poly(k, log n) bits of space and we complement these results with comparable lower bounds. We then study the problem of identifying a longest substring of strings S and T of length n that forms a d-near-alignment under the edit distance, in the simultaneous streaming model. In this model, symbols of strings S and T are streamed at the same time and form a d-near-alignment if the distance between them in some given metric is at most d. We give several algorithms, including an exact one-pass algorithm that uses O(d2 + d log n) bits of space. We then consider the distinct elements and `p-heavy hitters problems in the sliding window model, where only the most recent n elements in the data stream form the underlying set. We first introduce the composable histogram, a simple twist on the exponential (Datar et al., SODA 2002) and smooth histograms (Braverman and Ostrovsky, FOCS 2007) that may be of independent interest. We then show that the composable histogram along with a careful combination of existing techniques to track either the identity or frequency of a few specific items suffices to obtain algorithms for both distinct elements and `p-heavy hitters that is nearly optimal in both n and c. Finally, we consider the problem of estimating the maximum weighted matching of a graph whose edges are revealed in a streaming fashion. We develop a reduction from the maximum weighted matching problem to the maximum cardinality matching problem that only doubles the approximation factor of a streaming algorithm developed for the maximum cardinality matching problem. As an application, we obtain an estimator for the weight of a maximum weighted matching in bounded-arboricity graphs and in particular, a (48 + )-approximation estimator for the weight of a maximum weighted matching in planar graphs

Geometric Phases and Topological Effects

Lecture Notes of the 45th IFF Spring School "Computing Solids - Models, ab initio methods and supercomputing" (Forschungszentrum Juelich, 2014).Comment: 40 pages. January 201

High resolution study of local stress inside alumina ; micro mechanical analysis using laser scanning confocal microscope

The aim of this work is to measure the stress inside a hard micro object under extreme compression. To measure the internal stress, we compressed ruby spheres (a-Al2O3: Cr3+, 150 µm diameter) between two sapphire plates. Ruby fluorescence spectrum shifts to longer wavelengths under compression and can be related to the internal stress by a conversion coefficient. A confocal laser scanning microscope was used to excite and collect fluorescence at desired local spots inside the ruby sphere with spatial resolution of about 1 µm3. Under static external loads, the stress distribution within the center plane of the ruby sphere was measured directly for the first time. The result agreed to Hertz’s law. The stress across the contact area showed a hemispherical profile. The measured contact radius was in accord with the calculation by Hertz’s equation. Stress-load curves showed spike-like decrease after entering non-elastic phase, indicating the formation and coalescence of microcracks, which led to relaxing of stress. In the vicinity of the contact area luminescence spectra with multiple peaks were observed. This indicated the presence of domains of different stress, which were mechanically decoupled. Repeated loading cycles were applied to study the fatigue of ruby at the contact region. Progressive fatigue was observed when the load exceeded 1 N. As long as the load did not exceed 2 N stress-load curves were still continuous and could be described by Hertz’s law with a reduced Young’s modulus. Once the load exceeded 2 N, periodical spike-like decreases of the stress could be observed, implying a “memory effect” under repeated loading cycles. Vibration loading with higher frequencies was applied by a piezo. Redistributions of intensity on the fluorescence spectra were observed and it was attributed to the repopulation of the micro domains of different elasticity. Two stages of under vibration loading were suggested. In the first stage continuous damage carried on until certain limit, by which the second stage, e.g. breakage, followed in a discontinuous manner.The aim of this work is to measure the stress inside a hard micro object under extreme compression. To measure the internal stress, we compressed ruby spheres (a-Al2O3: Cr3+, 150 µm diameter) between two sapphire plates. Ruby fluorescence spectrum shifts to longer wavelengths under compression and can be related to the internal stress by a conversion coefficient. A confocal laser scanning microscope was used to excite and collect fluorescence at desired local spots inside the ruby sphere with spatial resolution of about 1 µm3. Under static external loads, the stress distribution within the center plane of the ruby sphere was measured directly for the first time. The result agreed to Hertz’s law. The stress across the contact area showed a hemispherical profile. The measured contact radius was in accord with the calculation by Hertz’s equation. Stress-load curves showed spike-like decrease after entering non-elastic phase, indicating the formation and coalescence of microcracks, which led to relaxing of stress. In the vicinity of the contact area luminescence spectra with multiple peaks were observed. This indicated the presence of domains of different stress, which were mechanically decoupled. Repeated loading cycles were applied to study the fatigue of ruby at the contact region. Progressive fatigue was observed when the load exceeded 1 N. As long as the load did not exceed 2 N stress-load curves were still continuous and could be described by Hertz’s law with a reduced Young’s modulus. Once the load exceeded 2 N, periodical spike-like decreases of the stress could be observed, implying a “memory effect” under repeated loading cycles. Vibration loading with higher frequencies was applied by a piezo. Redistributions of intensity on the fluorescence spectra were observed and it was attributed to the repopulation of the micro domains of different elasticity. Two stages of under vibration loading were suggested. In the first stage continuous damage carried on until certain limit, by which the second stage, e.g. breakage, followed in a discontinuous manner