No abstract

PERVASIVE computing 75 80 PERVASIVE computing Presentation Input sensor Coordinator Model Figure 4. Application framework infrastructure. The coordinator oversees the composition of the model, presentation, and controller components.82 PERVASIVE computing PERVASIVE computing 83 the AUTHORS Manuel Román is a PhD candidate at the University of Illinois at Urbana-Champaign. His research interests include ubiquitous computing, middleware, operating systems, and interactive and programmable active spaces. He received his BS and MS in computer science from the La Salle School of Engineering (Ramon Llull Univ.).

Abstract. Ubiquitous Computing advocates the construction of massively distributed systems that help transform physical spaces into computationally active and intelligent environments. The design of systems and applications in these environments needs to take account of heterogeneous devices, mobile users and rapidly changing contexts. Most importantly, agents in ubiquitous and mobile environments need to be context-aware so that they can adapt themselves to different situations. In this paper, we argue that ubiquitous computing environments must provide middleware support for context-awareness. We also propose a middleware that facilitates the development of context-aware agents. The middleware allows agents to acquire contextual information easily, reason about it using different logics and then adapt themselves to changing contexts. Another key issue in these environments is allowing autonomous, heterogeneous agents to have a common semantic understanding of contextual information. Our middleware tackles this problem by using ontologies to define different types of contextual information. This middleware is part of Gaia, our infrastructure for enabling Smart Spaces.

No abstract

No abstract

No abstract

Relatively simple considerations govern the construction of functional hybrid PKSs. Fusion sites should be chosen either in the surface-accessible linker regions between enzymatic domains, as previously revealed, or just inside the conserved margins of domains. The interaction of an ACP domain with the adjacent KS domain, whether on the same polyketide or not, is of particular importance, both through conservation of appropriate protein-protein interactions, and through optimising molecular recognition of the altered polyketide chain in the key transfer of the acyl chain from the ACP of one module to the KS of the downstream module.

We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared across multiple queries. Efficient support for overlapping queries is a critical issue in the emerging data stream systems, and this is particularly the case when filters are expensive in terms of their computational complexity and processing time. This problem generalizes other well-known problems such as pipelined filter ordering and set cover, and is not only NP-Hard but also hard to approximate within a factor of o(log n) from the optimum, where n is the number of queries. In this paper, we present two near-optimal approximation algorithms with provably-good performance guarantees for the evaluation of overlapping queries. We present an edge-coverage based Greedy algorithm which achieves an approximation ratio of (1 + log(n) + log(α)), where n is the number of queries and α is the average number of filters in a query. We also present a randomized, fast and easily parallelizable Harmonic algorithm which achieves an approximation ratio of 2β, where β is the maximum number of filters in a query. We have implemented these algorithms in a prototype system, and evaluated their performance using extensive experiments in the context of multimedia stream analysis. The results show that our Greedy algorithm consistently outperforms other known algorithms under various settings and scales well as the numbers of queries and filters increase.