Divergent word order between languages causes delay in simultaneous machine translation. We present a sentence rewriting method that generates more monotonic translations to improve the speedaccuracy tradeoff. We design grammaticality and meaning-preserving syntactic transformation rules that operate on constituent parse trees. We apply the rules to reference translations to make their word ord...

in Computer Science. There have been many recent developments in this field. One fascinating problem considered lately is the order-preserving matching (OPM) problem. The task is to find all the substrings in the text which have the same length and relative order as the pattern, where the relative order is the numerical order of the numbers in a string. The problem finds its applications in the...

We present a novel factor analysis method that can be applied to discovery of common factors shared among trajectories in multivariate time series data. These factors satisfy a precedence-ordering property: certain factors are recruited only after some other factors are activated. Precedence ordering arise in applications where variables are activated in a specific order, which is unknown. The ...

We show that a dissipative, ergodic measure preserving transformation of a σ-finite, non-atomic measure space always has many non-proportional, absolutely continuous, invariant measures and is ergodic with respect to each one of these. §0 Introduction Let (X,B,m, T ) be an invertible, ergodic measure preserving transformation of a σ-finite measure space, then there are no other σ-finite, m-abso...

The full transformation semigroup TnTn is defined to consist of all functions from Xn={1,…,n}Xn={1,…,n} itself, under the operation composition. In \cite{JMH1}, for any αα in TnTn, Howie and denoted collapse by c(α)=⋃t∈\im(α){tα−1:|tα−1|≥2}c(α)=⋃t∈\im(α){tα−1:|tα−1|≥2}. Let OnOn be order-preserving transformations CnCn decreasing on XnXn=under its natural order, respectively. E(On)E(On) set ide...

The order-preserving multiple pattern matching problem is to find all substrings of T whose relative orders are the same for any in a set patterns. Various sequential algorithms have been studied problems. In this paper, we propose two parallel algorithms, each which uses Aho–Corasick automata and fingerprint tables, respectively. We also present experimental results comparing execution times a...

The main aim of this contribution is to give an overview concerning applications of graph transformation techniques to the area of Petri nets achieved by the team of TU Berlin within the APPLIGRAPH Working Group and the DFG Researcher Group on Petri Net Technology. Since about 10 years the strong relationships between the areas of Petri nets and graph transformation systems have been studied es...