Practical algorithms for transposition-invariant string-matching

We consider the problems of (1) longest common subsequence (LCS) of two given strings in the case where the first may be shifted by some constant (that is, transposed) to match the second, and (2) transposition-invariant text searching using indel distance. These problems have applications in music comparison and retrieval. We introduce two novel techniques to solve these problems efficiently. The first is based on the branch and bound method, the second on bit-parallelism. Our branch and bound algorithm computes the longest common transposition-invariant subsequence (LCTS) in time O((m²+loglogσ)logσ) in the best case and O((m²+logσ)σ) in the worst case, where m and σ, respectively, are the length of the strings and the size of the alphabet. On the other hand, we show that the same problem can be solved by using bit-parallelism and thus obtain a speedup of O(w/logm) over the classical algorithms, where the computer word has w bits. The advantage of this latter algorithm over the present bit-parallel ones is that it allows the use of more complex distances, including general integer weights. Since our branch and bound method is very flexible, it can be further improved by combining it with other efficient algorithms such as our novel bit-parallel algorithm. We experiment on several combination possibilities and discuss which are the best settings for each of those combinations. Our algorithms are easily extended to other musically relevant cases, such as δ-matching and polyphony (where there are several parallel texts to be considered). We also show how our bit-parallel algorithm is adapted to text searching and illustrate its effectiveness in complex cases where the only known competing method is the use of brute force.     

Capacity Constrained Transit Assignment with Common Lines

This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking common lines into account. The approach handles congested transit networks, where some passengers will not be able to board because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example. This revised version was published online in July 2006 with corrections to the Cover Date.     

On α-I-continuous and α-I-open functions

Montgomery and Vaughan improved a theorem of Erd?s and Fuchs for an arbitrary sequence. Sárközy extended this theorem of Erd?s and Fuchs for two arbitrary sequences which are "near" in a certain sense. Using the idea of Jurkat (differentiation of the generating function), we will extend similarly the result of Montgomery and Vaughan for "sufficiently near" sequences.     

Discovery of a new long-lived isomeric state in 125Ce

A new long-lived isomeric state in the near proton dripline nucleus ¹²⁵Ce has been identified with Schottky mass spectrometry at GSI. The excitation energy E ^* = 103(12)keV and the decay time of 193(1)s have been obtained from a single stored fully ionized ^125m Ce⁵⁸⁺ ion. The data implies an E3 transition and a 1/2⁺ assignment for the spin of the isomer.     

Gravity in non-commutative geometry

We study general relativity in the framework of non-commutative differential geometry. As a prerequisite we develop the basic notions of non-commutative Riemannian geometry, including analogues of Riemannian metric, curvature and scalar curvature. This enables us to introduce a generalized Einstein-Hilbert action for non-commutative Riemannian spaces. As an example we study a space-time which is the product of a four dimensional manifold by a two-point space, using the tools of non-commutative Riemannian geometry, and derive its generalized Einstein-Hilbert action. In the simplest situation, where the Riemannian metric is taken to be the same on the two copies of the manifold, one obtains a model of a scalar field coupled to Einstein gravity. This field is geometrically interpreted as describing the distance between the two points in the internal space.Dedicated to H. ArakiSupported in part by the Swiss National Foundation (SNF)     

Algebraic composition operators

The focus of this paper is on the following problem. Given a linear space F of complex-valued functions on a set X and a polynomial p(z), is there an algebraic composition operator on F whose characteristic polynomial equals p(z)? We show that the supply of all the polynomials p(z) for which the answer to this question is affirmative depends heavily on the structure of the space F.