This study investigated changes in the complexity (magnitude and structure of variability) of the collective behaviours of association football teams during competitive performance. Raw positional data from an entire competitive match between two professional teams were obtained with the ProZone tracking system. Five compound positional variables were used to investigate the collective patterns...

PROMS, a computer-music service under development at the University of Bonn, Germany, aims at designing and implementing PROcedures for Music Search. This paper discusses an eÆcient algorithm for searching a music pattern, e.g., a melody or a sequence of chords, in a large database of polyphonic music, given in a score-like format. Our algorithm is a variant of the now classic inverted le index...

We present a new indexing method for the approximate string matching problem. The method is based on a suux tree combined with a partitioning of the pattern. We analyze the resulting algorithm and show that the retrieval time is O(n), for 0 < < 1, whenever < 1 ? e= p , where is the error level tolerated and is the alphabet size. We experimentally show that this index outperforms by far all othe...

We offer a new definition of $varepsilon$-orthogonality in normed spaces, and we try to explain some properties of which. Also we introduce some types of $varepsilon$-orthogonality in an arbitrary  $C^ast$-algebra $mathcal{A}$, as a Hilbert $C^ast$-module over itself, and investigate some of its properties in such spaces. We state some results relating range-kernel orthogonality in $C^*$-algebras.

Energy efficiency is a key concern in the design of modern computer systems. One promising approach to energyefficient computation, approximate computing, trades off output precision for energy efficiency. However, this tradeoff can have unexpected effects on computation quality. This paper presents dynamic-analysis tools to debug and monitor the quality of approximate computations. We propose ...

We present a method to speed up approximate string matching by mapping the factual alphabet to a smaller alphabet. We apply the alphabet reduction scheme to a tuned version of the approximate Boyer– Moore algorithm utilizing the Four-Russians technique. Our experiments show that the alphabet reduction makes the algorithm faster. Especially in the k-mismatch case, the new variation is faster tha...

In this paper we address the problem of fuzzy search over encrypted data that supports misspelled search terms. We advance prior work by using a bit vector for bigrams directly instead of hashing bigrams into a Bloom filter. We show that we improve both index building performance as well as retrieval ratio of matching documents while providing the same security guarantees. We also compare fuzzy...

Comparison to traditionally accurate computing, approximate computing focuses on the rapidity of the satisfactory solution, but not the unnecessary accuracy of the solution. Approximate bisimularity is the approximate one corresponding to traditionally accurate bisimilarity. Based on the work of distances between basic processes, we propose an algebraic approach for distances between processes ...

This study investigated the complexity of the electromyography (EMG) of lower limb muscles when performing obstacle crossing tasks at different heights in poststroke subjects versus healthy controls. Five poststroke subjects and eight healthy controls were recruited to perform different obstacle crossing tasks at various heights (randomly set at 10, 20, and 30% of the leg's length). EMG signals...

The paper presents a novel approach to exploring similarities in music performances. Based on simple measurements of timing and intensity in 12 recordings of a Schubert piano piece, short ‘performance archetypes’ are calculated using a SOM algorithm and labelled with letters. Approximate string matching done by an evolutionary algorithm is applied to find similarities in the performances repres...