Abstra t. Numeri string is a sequen e of symbols from an alphabet U, where U is some numeri al universe losed under addition and subtra tion. Given two numeri strings A = a 1 a m and B = b 1 b n and a distan e fun tion d(A;B) that gives the s ore of the best (partial) mat hing of A and B, the transposition invariant distan e is min t2U fd(A + t; B)g, where A + t = (a 1 + t)(a 2 + t) : : : (a m ...

Abstra t. Lo al similarity omputation between two sequen es permits dete ting all the relevant alignments present between subsequen es thereof. A well-known dynami programming algorithm works in time O(mn), m and n being the lengths of the subsequen es. The algorithm is rather slow when applied over many sequen e pairs. In this paper we present the rst bit-parallel omputation of the s ore matri...

When a classification algorithm does not work on a data set, it is a non-trivial problem to figure out what went wrong on a technical level. It is even more challenging to communicate findings to domain experts who can interpret the data set but do not understand the algorithms. We propose a method for the interactive visual exploration of the feature-class matrix used to represent data sets fo...

In this contribution, a semi-automatic segmentation algorithm for (medical) image analysis is presented. More precise, the approach belongs to the category of interactive contouring algorithms, which provide real-time feedback of the segmentation result. However, even with interactive real-time contouring approaches there are always cases where the user cannot find a satisfying segmentation, e....

0

the present study investigated the use of interactive metadiscourse resources (imrs) in terms of appropriacy during a process- based writing course by applying qualitative and exploratory methods. moreover, learners' perception was investigated to find out how confident they felt as they were writing and rewriting the drafts. 30 intermediate efl learners were chosen to participate in this study...

This paper summarizes some aspects of data compression and describes how it can be used to increase the throughput of a computer communications link. The popular IZW algorithm is studied in detail, and special consideration is given to the problems that arise when using LZW to compress interactive traffic. An LZ’W implementation for the KA9Q Internet package for compression of interactive data ...

In this paper, specification and planning of UAV missions, in which interaction with the operators, adversaries, and the environment plays a crucial role, are studied. A novel specification method is introduced to model interactive tasks in UAV missions and process algebra framework is used to model complex interactive tasks from relatively simple ones. An anytime state-space search algorithm i...