Very recently a new algorithm to the nonnegative single-source shortest path problem on road networks has been discovered. It is very cacheefficient, but only on static road networks. We show how to augment it to the time-dependent scenario. The advantage if the new approach is that it settles nodes, even for a profile query, by scanning all downward edges. We improve the scanning of the downwa...

A dynamic network is a network whose components may interact on channels established dynamically by the communication of their associated ports This paper generalises a speci cation technique based on input output relations on streams to capture the special kind of privacy preservation found in such networks A privacy preserving component never accesses depends on or sends a port whose name it ...

We consider the problem of integrating supplemental information strings in the grapheme-to-phoneme (G2P) conversion task. In particular, we investigate whether we can improve the performance of a G2P system by making it aware of corresponding transductions of an external knowledge source, such as transcriptions in other dialects or languages, transcriptions provided by other datasets, or transc...

We generalize Uno and Yagiura’s algorithm for finding all common intervals of two permutations to the setting of two sequences with many-to-many alignment links across the two sides. Common intervals in such a setting can be interpreted as translationally equivalent phrases between two sentences. We show how to decompose an alignment into hierarchical phrase pairs in linear time.

A paired many-to-many -disjoint path cover (-DPC for short) of a graph is a set of  disjoint paths joining  distinct source-sink pairs in which each vertex of the graph is covered by a path. A two-dimensional × torus is a graph defined as the product of two cycles  and  of length  and , respectively. In this paper, we deal with an × bipartite torus, even ≥ , with a single faul...

In many-to-many matching models, substitutable preferences constitute the largest domain for which a pairwise stable matching is guaranteed to exist. In this note, we extend the recently proposed algorithm of Hatfield et al. [3] to test substitutability of weak preferences. Interestingly, the algorithm is faster than the algorithm of Hatfield et al. by a linear factor on the domain of strict pr...