Cross-Document Pattern Matching

We study a new variant of the string matching problem called cross-document string matching, which is the problem of indexing a collection of documents to support an efficient search for a pattern in a selected document, where the pattern itself is a substring of another document. Several variants of this problem are considered, and efficient linear-space solutions are proposed with query time bounds that either do not depend at all on the pattern size or depend on it in a very limited way (doubly logarithmic). As a side result, we propose an improved solution to the weighted level ancestor problem

Compressed Subsequence Matching and Packed Tree Coloring

We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size $n$ compressing a string of size $N$ and a pattern string of size $m$ over an alphabet of size $\sigma$, our algorithm uses $O(n+\frac{n\sigma}{w})$ space and $O(n+\frac{n\sigma}{w}+m\log N\log w\cdot occ)$ or $O(n+\frac{n\sigma}{w}\log w+m\log N\cdot occ)$ time. Here $w$ is the word size and $occ$ is the number of occurrences of the pattern. Our algorithm uses less space than previous algorithms and is also faster for $occ=o(\frac{n}{\log N})$ occurrences. The algorithm uses a new data structure that allows us to efficiently find the next occurrence of a given character after a given position in a compressed string. This data structure in turn is based on a new data structure for the tree color problem, where the node colors are packed in bit strings.Comment: To appear at CPM '1

Short distance behaviour of the effective string

We study the Polyakov loop correlator in the (2+1) dimensional Z_2 gauge model. An algorithm that we have presented recently, allows us to reach high precision results for a large range of distances and temperatures, giving us the opportunity to test predictions of the effective Nambu-Goto string model. Here we focus on the regime of low temperatures and small distances. In contrast to the high temperature, large distance regime, we find that our numerical results are not well described by the two loop-prediction of the Nambu-Goto model. In addition we compare our data with those for the SU(2) and SU(3) gauge models in (2+1) dimensions obtained by other authors. We generalize the result of L\"uscher and Weisz for a boundary term in the interquark potential to the finite temperature case.Comment: 38 pages, 7 figures, version accepted for publication in JHE

Deliberating stratospheric aerosols for climate geoengineering and the SPICE project

Increasing concerns about the narrowing window for averting dangerous climate change have prompted calls for research into geoengineering, alongside dialogue with the public regarding this as a possible response. We report results of the first public engagement study to explore the ethics and acceptability of stratospheric aerosol technology and a proposed field trial (the Stratospheric Particle Injection for Climate Engineering (SPICE) ‘pipe and balloon’ test bed) of components for an aerosol deployment mechanism. Although almost all of our participants were willing to allow the field trial to proceed, very few were comfortable with using stratospheric aerosols. This Perspective also discusses how these findings were used in a responsible innovation process for the SPICE project initiated by the UK’s research councils

Validation of Memory Accesses Through Symbolic Analyses

International audienceThe C programming language does not prevent out-of- bounds memory accesses. There exist several techniques to secure C programs; however, these methods tend to slow down these programs substantially, because they populate the binary code with runtime checks. To deal with this prob- lem, we have designed and tested two static analyses - sym- bolic region and range analysis - which we combine to re- move the majority of these guards. In addition to the analy- ses themselves, we bring two other contributions. First, we describe live range splitting strategies that improve the effi- ciency and the precision of our analyses. Secondly, we show how to deal with integer overflows, a phenomenon that can compromise the correctness of static algorithms that validate memory accesses. We validate our claims by incorporating our findings into AddressSanitizer. We generate SPEC CINT 2006 code that is 17% faster and 9% more energy efficient than the code produced originally by this tool. Furthermore, our approach is 50% more effective than Pentagons, a state- of-the-art analysis to sanitize memory accesses

On the existence of the second Dirac operator in Riemannian space

We describe a Riemannian space class where the second Dirac operator arises and prove that the operator is always equivalent to a standard Dirac one. The particle state in this gravitational field is degenerate to some extent and we introduce an additional value in order to describe a particle state completely. Some supersymmetry constructions are also discussed. As an example we study all Riemannian spaces with a five-dimentional motion group and find all metrics for which the second Dirac operator exists. On the basis of our discussed examples we hypothesize about the number of second Dirac operators in Riemannian space.Comment: LaTex, 10 pages, no figure

Surface scattering and band gaps in rough waveguides and nanowires

The boundaries of waveguides and nanowires have drastic influence on their coherent scattering properties. Designing the boundary profile is thus a promising approach for transmission and band-gap engineering with many applications. By performing an experimental study of microwave transmission through rough waveguides we demonstrate that a recently proposed surface scattering theory can be employed to predict the measured transmission properties from the boundary profiles and vice versa. A new key ingredient of this theory is a scattering mechanism which depends on the squared gradient of the surface profiles. We demonstrate the non-trivial effects of this scattering mechanism by detailed mode-resolved microwave measurements and numerical simulations.Comment: 5 pages 4 figure

Virus Replication as a Phenotypic Version of Polynucleotide Evolution

In this paper we revisit and adapt to viral evolution an approach based on the theory of branching process advanced by Demetrius, Schuster and Sigmund ("Polynucleotide evolution and branching processes", Bull. Math. Biol. 46 (1985) 239-262), in their study of polynucleotide evolution. By taking into account beneficial effects we obtain a non-trivial multivariate generalization of their single-type branching process model. Perturbative techniques allows us to obtain analytical asymptotic expressions for the main global parameters of the model which lead to the following rigorous results: (i) a new criterion for "no sure extinction", (ii) a generalization and proof, for this particular class of models, of the lethal mutagenesis criterion proposed by Bull, Sanju\'an and Wilke ("Theory of lethal mutagenesis for viruses", J. Virology 18 (2007) 2930-2939), (iii) a new proposal for the notion of relaxation time with a quantitative prescription for its evaluation, (iv) the quantitative description of the evolution of the expected values in in four distinct "stages": extinction threshold, lethal mutagenesis, stationary "equilibrium" and transient. Finally, based on these quantitative results we are able to draw some qualitative conclusions.Comment: 23 pages, 1 figure, 2 tables. arXiv admin note: substantial text overlap with arXiv:1110.336