Merge trees are topological descriptors of scalar functions. They record how the subsets of the domain where the function value does not exceed a given threshold are connected. We define a distance between merge trees, called an interleaving distance, and prove the stability of these trees, with respect to this distance, to perturbations of the functions that define them. We show that the inter...

Selecting appropriate features has become a key task when dealing with high-dimensional data. We present a new algorithm designed to find an optimal solution for classification tasks. Our approach combines forward selection, backward elimination and exhaustive search. We demonstrate its capabilities and limits using artificial and real world data sets. Regarding artificial data sets interleavin...

The total order assumption (TOA) is the assumption that all execution sequences of observable actions or events are totally ordered by precedence. As long as in some cases TOA is to the point, total order and partial order semantics are both legitimate but lead to different theories. I argue that TOA is a simplifying assumption, and present an example of a total order theory without interleavin...

We deene algebraic systems called concurrent regular expressions which provide a modular description of languages of Petri nets. Concurrent regular expressions are extension of regular expressions with four operators-interleaving, interleaving closure, synchronous composition and renaming. This alternative characterization of Petri net languages gives us a exible way of specifying concurrent sy...

Language models that use interleaving, or shuffle, operators have applications in various areas of computer science, including system verification, plan recognition, and natural language processing. We study the complexity of the membership problem for such models, i.e., how difficult it is to determine if a string belongs to a language or not. In particular, we investigate how interleaving can...

Ordered dither is considered to be a simple and effective method among all halftoning techniques. In this paper, compaction of ordered dithered images using arithmetic coding is studied. A preprocessor referred to as pixel interleaving (i.e., grouping pixels with similar dithering thresholds) is employed in such a way that dithered images can be efficiently coded with the JBIG1 code and high co...

In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and uniform way across a wide range of different models for concurrency. In this paper, following a recent trend in theoretical computer science, we characterize their abstract definition game-theoretically and logically in a non-interleaving model. Our characterizations appear as surprisingly simple extens...

In this paper a discussion of the detailed operation of the interleavers used by the turbo codes defined on the telecommunications standards cdma2000 (3GPP2 C.S0024-B V2.0) and W-CDMA (3GPP TS 25.212 V7.4.0) is presented. Differences in the approach used by each turbo interleaver as well as dispersion analysis and frequency analysis are also discussed. Two examples are presented to illustrate t...