The classical Poincaré weak recurrence theorem states that for any probability space (Ω,S, P ), any P -measure preserving transformation T , and any A ∈ S, almost all points of A return to A. In the present paper the Poincaré theorem is proved when the σ-algebra S is replaced by any σ-complete MV-algebra. Keywords— Measure preserving transformation, Poincaré recurrence theorem, σ-complete MV-al...

This paper presents some transformation techniques from bounded SPN systems to corresponding SPA models, preserving concurrency. Initially, a simple algorithm is introduced, showing that the obtained SPA models simulate the net systems. Then the algorithm is improved in order to keep more of the net structure, when possible. For the case of non ordinary net systems the SPA language is extended ...

In restructuring legacy code it may be useful to introduce a design pattern in order to add clarity to the system and thus facilitate further program evolution. We show that aspects of this transformation can be automated and present a nascent high-level language for describing transformations that introduce design patterns. The role of preconditions in preserving program behaviour during this ...

We present a pipelined architecture for a text simplification system and describe our implementation of the three stages— analysis, transformation and regeneration. Our architecture allows each component to be developed and evaluated independently. We lay particular emphasis on the discourse level aspects of syntactic simplification as these are crucial to the process and have not been dealt wi...

We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (given for example by the restriction to formulas of a certain quantifier rank) and – depending on the fragment – reduces the model under consideration to a simpler one. In the second approach, one applies a global tran...

Let R be an n-dimensional Euclidean space and D be an n-dimensional hyperbolic space with the Poincaré metric for n > 1. In this paper, we shall prove the following results. (i) A bijection f : D → D n is an isometry (Möbius transformation) if and only if f is triangle preserving. (ii) A bijection f : R → R is an affine transformation if and only if f is triangle preserving.

This paper presents a general approach to automatically validate code-improving transformations on low-level program representations. The approach ensures the correctness of compiler and hand-specified optimizations at the machine instruction level. The method verifies the semantic equivalence of the program representation before and after a transformation to determine the validity of the trans...

This paper studies the creation of schematic maps from traditional vector-based, carto-graphic information. An algorithm is proposed to modify positions of lines in the original input map with the goal of producing as output a schematic map that meets certain geometric and aesthetic criteria. Special emphasis is placed here on preserving topological structure of features during this transformat...

Cryptographic solutions to privacy-preserving multiparty linear programming are slow. This makes them unsuitable for many economically important applications, such as supply chain optimization, whose size exceeds their practically feasible input range. In this paper we present a privacy-preserving transformation that allows secure outsourcing of the linear program computation in an efficient ma...

In this paper, a conflict problem caused by applying traditional operational transformation algorithms on Replace operation is firstly described. Then a new conception of operation group is introduced into the collaborative editing area. T-Group is an important type of operation group, when a Replace operation can be considered as a T-Group. To preserve T-Groups in operational transformation ne...