Using semantic transformers to enable interoperability between media devices in a ubiquitous computing environment

One of the aims of ubiquitous computing is to enable \serendipitous interoperability"; i.e., to make devices that were not necessarily designed to work together interoperate with one another. It also promises to make technologies disappear, by weaving themselves into the fabric of everyday life until they are indistinguishable from it. In order to reach this goal, self-con??guration of the various devices and technologies in ubicomp environments is essential. Whether automated and initiated by context-aware entities, or initiated by users by creating semantic connections between devices, the actual con??guration of the various components (based on their capabilities) should be performed automatically by the system. In this paper we introduce semantic transformers that can be employed to enable interoperability through self-con??guration mechanisms

Using Semantic Transformers to Enable Interoperability between Media Devices in a Ubiquitous Computing Environment

One of the aims of ubiquitous computing is to enable "serendipitous interoperability"; i.e., to make devices that were not necessarily designed to work together interoperate with one another. It also promises to make technologies disappear, by weaving themselves into the fabric of everyday life until they are indistinguishable from it. In order to reach this goal, self-configuration of the various devices and technologies in ubicomp environments is essential. Whether automated and initiated by context-aware entities, or initiated by users by creating semantic connections between devices, the actual configuration of the various components (based on their capabilities) should be performed automatically by the system. In this paper we introduce semantic transformers that can be employed to enable interoperability through self-configuration mechanisms

Correction to "massive MIMO with Optimal Power and Training Duration Allocation"

© 2012 IEEE. We correct the proofs of Propositions 1 and 2 in [1]

Sublinear-Time Algorithms for Tournament Graphs

We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O (√n ∙ log n ∙ √log*n), that is, sublinear both in the size of the description of the graph as well as in the number of vertices. This result is motivated by the search of a generic algorithm for solving a large class of search problems called Local Search, LS. LS is defined by us as a generalisation of the well-known class PLS

Using semantic transformers to enable interoperability between media devices in a ubiquitous computing Environment

One of the aims of ubiquitous computing is to enable "serendipitous interoperability"; i.e., to make devices that were not necessarily designed to work together interoperate with one another. It also promises to make technologies disappear, by weaving themselves into the fabric of everyday life until they are indistinguishable from it. In order to reach this goal, self-configuration of the various devices and technologies in ubicomp environments is essential. Whether automated and initiated by context-aware entities, or initiated by users by creating semantic connections between devices, the actual configuration of the various components (based on their capabilities) should be performed automatically by the system. In this paper we introduce semantic transformers that can be employed to enable interoperability through self-configuration mechanisms

Overlaps Help: Improved Bounds for Group Testing with Interval Queries

Cicalese F, Damaschke P, Tansini L, Werth S. Overlaps Help: Improved Bounds for Group Testing with Interval Queries. In: Proc. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005). Lecture Notes in Computer Science, 3595. 2005: 935-944.Given a finite ordered set of items and an unknown distinguished subset P of up to p positive elements, identify the items in P by asking the least number of queries of the type "does the subset Q intersect P?", where Q is a subset of consecutive elements of {1, 2,..., n}. This problem arises e.g. in computational biology, in a particular method for determining splice sites. We consider time-efficient algorithms where queries are arranged in a fixed number s of stages: in each stage, queries are performed in parallel. In a recent paper we devised query-optimal strategies in the special cases p = 1 or s = 2, subject to lower-order terms. Exploiting new ideas we are now able to provide a much neater argument that allows doubling the general lower bound for any p ! 2 and s >= 3. Moreover, we provide new strategies that match this new bound up to the constant of the main term. The new query scheme shows an effective use of overlapping queries within a stage. Remarkably, this contrasts with the known results for s <= 2 where optimal strategies were implemented by disjoint queries