Abstract ... Full abstract text here. Read More Read Less

Abstract The introduction of pervasive computing environments enforce new ways of human-machineinteraction. The welldefined interaction interfaces will make place for other, more intuitive ways of interaction. In a pervasive service environment, the system middleware should take care of capturing the user’s expression of an action intention, solving ambiguousness in this expression, and executing the final pervasive action This article introduces the Pervasive Service Action Query Language (PsaQL), a language to formalize the description of a user intention using composed pervasive services. It presents the next steps of intention treatment in a pervasive service environment: A mathematical model is given, which helps to express the algorithms performing translation of the user intention into an executable action. To implement such algorithms, a suitable object- oriented model representing actions is introduced. In the scope of PERSE, a pervasive service environment developed by our research group, general evaluation metrics for such algorithms are identified, a prototype has been developed and first benchmark results are presented in this article. Full abstract text here. Read More Read Less

Abstract In the area of information retrieval, the dimension of document vectors plays an important role. We may need to find a few words or concepts, which characterize the document based on its contents, to overcome the problem of the “curse of dimensionality”, which makes indexing of high-dimensional data problematic. To do so, we earlier proposed a Wordnet and Wordnet+LSI (Latent Semantic Indexing) based model for dimension reduction. While LSI works on the whole collection, another procedure of feature extraction (and thus dimension reduction) exists, using binary factorization. The procedure is based on the search of attractors in Hopfield-like associative memory. Being applied to textual data the procedure conducted well and even more it showed sensitivity to the context in which the words were used. In this paper, we suggest that the binary factorization may benefit from the Wordnet filtration. Full abstract text here. Read More Read Less

Abstract With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. Thereby, several path indexing, labelling and numbering scheme have been proposed. However, if XML data need to be updated frequently, most of these approaches will need to re-compute existing labels which is rather time consuming. The goal of the research reported in this paper is to design a persistent structural labelling scheme, namely a labelling scheme where labels encode ancestor-descendant relationships and sibling relationship between nodes but need not to be changed when the document is updated.

Abstract ... Full abstract text here. Read More Read Less

Abstract ... Full abstract text here. Read More Read Less

Abstract ... Full abstract text here. Read More Read Less

Abstract ... Full abstract text here. Read More Read Less

Abstract ... Full abstract text here. Read More Read Less

Abstract ... Full abstract text here. Read More Read Less