3,353 research outputs found

    On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching

    Get PDF
    We present parallel algorithms for exact and approximate pattern matching with suffix arrays, using a CREW-PRAM with pp processors. Given a static text of length nn, we first show how to compute the suffix array interval of a given pattern of length mm in O(mp+lg⁥p+lg⁥lg⁥p⋅lg⁥lg⁥n)O(\frac{m}{p}+ \lg p + \lg\lg p\cdot\lg\lg n) time for p≀mp \le m. For approximate pattern matching with kk differences or mismatches, we show how to compute all occurrences of a given pattern in O(mkσkpmax⁥(k,lg⁥lg⁥n) ⁣+ ⁣(1+mp)lg⁥p⋅lg⁥lg⁥n+occ)O(\frac{m^k\sigma^k}{p}\max\left(k,\lg\lg n\right)\!+\!(1+\frac{m}{p}) \lg p\cdot \lg\lg n + \text{occ}) time, where σ\sigma is the size of the alphabet and p≀σkmkp \le \sigma^k m^k. The workhorse of our algorithms is a data structure for merging suffix array intervals quickly: Given the suffix array intervals for two patterns PP and Pâ€ČP', we present a data structure for computing the interval of PPâ€ČPP' in O(lg⁥lg⁥n)O(\lg\lg n) sequential time, or in O(1+lg⁥plg⁥n)O(1+\lg_p\lg n) parallel time. All our data structures are of size O(n)O(n) bits (in addition to the suffix array)

    Quark spectral properties above Tc from Dyson-Schwinger equations

    Full text link
    We report on an analysis of the quark spectral representation at finite temperatures based on the quark propagator determined from its Dyson-Schwinger equation in Landau gauge. In Euclidean space we achieve nice agreement with recent results from quenched lattice QCD. We find different analytical properties of the quark propagator below and above the deconfinement transition. Using a variety of ansaetze for the spectral function we then analyze the possible quasiparticle spectrum, in particular its quark mass and momentum dependence in the high temperature phase. This analysis is completed by an application of the Maximum Entropy Method, in principle allowing for any positive semi-definite spectral function. Our results motivate a more direct determination of the spectral function in the framework of Dyson-Schwinger equations

    a simulation approach for a young german cohort

    Get PDF
    We quantify the private and fiscal lifetime returns to higher education in Germany accounting for the redistribution through the tax-and-transfer system, cohort effects, and the effect of income pooling within households. For this purpose we build a dynamic microsimulation model that simulates individual life cycles of a young German cohort in terms of several key variables, such as employment, earnings, and household formation. To estimate the returns to higher education, we link our dynamic microsimulation model to a tax-benefit simulator that allows converting gross wages into disposable incomes. On average, we find private and fiscal returns that are substantially higher than current market interest rates. However, analyzing the distribution of returns we also find that there is a considerable share of young adults for whom we forecast vocational training, the alternative to higher education, to be financially more rewarding. We demonstrate how the taxtransfer system and income pooling within couple households affect private returns and decompose the fiscal returns into its major components

    On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching

    Get PDF
    We present parallel algorithms for exact and approximate pattern matching with suffix arrays, using a CREW-PRAM with p processors. Given a static text of length n, we first show how to compute the suffix array interval of a given pattern of length m in O(m/p + lg p + lg lg p * lg lg n) time for p <= m. For approximate pattern matching with k differences or mismatches, we show how to compute all occurrences of a given pattern in O((m^k sigma^k)/p max (k, lg lg n) + (1+m/p) lg p * lg lg n + occ} time, where sigma is the size of the alphabet and p <= sigma^k m^k. The workhorse of our algorithms is a data structure for merging suffix array intervals quickly: Given the suffix array intervals for two patterns P and P\u27, we present a data structure for computing the interval of PP\u27 in O(lg lg n) sequential time, or in O(1 + lg_p lg n) parallel time. All our data structures are of size O(n) bits (in addition to the suffix array)

    On Gribov's supercriticality picture of quark confinement

    Full text link
    Some years ago Gribov developed the so-called supercritical light quark confinement scenario. Based on physical arguments he conjectured a drastic change in the analytical properties of the quark propagator when the back-reaction of Goldstone bosons (pions) is considered. We investigate this scenario and provide numerical solutions for the quark propagator in the complex plane with and without the pion back-reaction. We find no evidence for the scenario Gribov advocated. As an aside we present a novel method to solve the quark Dyson-Schwinger equation in the complex plane and discuss new characteristics of dynamical chiral symmetry breaking in our truncation scheme.Comment: 21 pages, 12 figures. Version to appear in EPJ
    • 

    corecore