Context plays a key role, as recongnized by a wide body of research, in application and entity adaptation in the ubiquitous computing world characterized by extensive platform heterogenity and environment dynamicity and unpredictability. Implicit in the notion of context, as used by context-aware applications, is the actual effects, including constraints, context has on target entities. We beli...

In this paper, we present a novel approach to enhance hierarchical phrase-based machine translation systems with linguistically motivated syntactic features. Rather than directly using treebank categories as in previous studies, we learn a set of linguistically-guided latent syntactic categories automatically from a source-side parsed, word-aligned parallel corpus, based on the hierarchical str...

We consider parallel communicating grammar systems which consist of several grammars and perform derivation steps, where each of the grammars works in a parallel and synchronized manner on its own sentential form, and communication steps, where a transfer of sentential forms is done. We discuss accepting and analyzing versions of such grammar systems with context-free productions and present ch...

Finding high-level structure in scores is one of the main challenges in music information retrieval. Searching for a formalization enabling variety through fixed musical concepts, we use parametric grammars, an extension of context-free grammars with predicates that take parameters. Parameters are here small patterns of music that will be used with different roles in the piece. We investigate t...

The knowledge representation tradition in computational lexicon design represents words as static encapsulations of purely lexical knowledge. We suggest that this view poses certain limitations on the ability of the lexicon to generate nuance-laden and context-sensitive meanings, because word boundaries are obstructive, and the impact of non-lexical knowledge on meaning is unaccounted for. Hopi...

The parsing schemata formalism allows us to describe parsing algorithms in a simple way by capturing their fundamental semantics while abstracting low-level detail. In this work, we present a compilation technique allowing the automatic transformation of parsing schemata to executable implementations of their corresponding algorithms. Taking a simple description of a schema as input, our techni...

The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamental semantics while abstracting low-level detail. In this work, we present a compilation technique allowing the automatic transformation of parsing schemata to efficient executable implementations of their corresponding algorithms. Our technique is general enough to be...

In this article the authors provide an overview of the Ecospace reference architecture which constitutes a reusable high-level representation for building Collaborative Work Environments that are interoperable, context-aware and highly personalised. Based on this architecture they have already developed a number of prototypes that at the same time use and validate the proposed design. Here they...

In [TSP], level curves of a function , called “the edge strength function,” defined for 2–dimensional shapes, are interpreted as successively smoother versions of the initial shape boundary. The local minima of the absolute gradient along the level curves of are shown to be a robust criterion for determining the shape skeleton. More generally, at an extremal point of along a level curve, the le...

To cover three-dimensional information spaces stationary or spatial Augmented Reality (sAR) systems involve installed projection systems, Head-Upand other displays. Therefore, information presentation techniques for sAR contain three basic problems assigned to the questions which form, which screen position and which physical location the information should have in 3D space. This paper introduc...