Ubiquitous computing places humans in the center of environments saturated with computing and wireless communications capabilities, yet gracefully integrated, so that technology recedes in the background of everyday a...
详细信息
ISBN:
(纸本)9781581139648
Ubiquitous computing places humans in the center of environments saturated with computing and wireless communications capabilities, yet gracefully integrated, so that technology recedes in the background of everyday activities. The ubiquitous computing world then, is a world largely defined by applications. But such applications present an altogether new set of requirements. The special track on ubiquitous computing applications, first introduced in acm SAC 2004 and running for the second time in acm SAC 2005, provides a forum for the discussion of all types of ubiquitous computing applications and related specialized infrastructures built for the deployment of targeted applications. Individual papers place applications within their use context and introduce novel and appropriate interaction paradigms while at the same time addressing related technical and business aspects and consequently identify novel opportunities or constraints.
As opposed to finite domain CSPs, arc consistency cannot be enforced, in general, on CSPs over the reals, including very simple instances. In contrast, a stronger property, the so-called box-set consistency, that requ...
详细信息
ISBN:
(纸本)9781581139648
As opposed to finite domain CSPs, arc consistency cannot be enforced, in general, on CSPs over the reals, including very simple instances. In contrast, a stronger property, the so-called box-set consistency, that requires a no-split condition in addition to arc consistency, can be obtained on a much larger number of problems. To obtain this property, we devise a lazy algorithm that combines hull consistency filtering, interval union projection, and intelligent domain splitting. It can be applied to any numerical CSP, and achieves box-set consistency if constraints are redundancy-free in terms of variables. This holds even if the problem is not interval-convex. The main contribution of our approach lies in the way we bypass the non-convexity issue, which so far was a synonym for either a loss of accuracy or an unbounded growth of label size. We prove the correctness of our algorithm and through experimental results, we show that, as compared to a strategy based on a standard bisection, it may lead to gains while never producing an overhead. Copyright 2005 acm.
We present the architecture of a scalable and dynamic intermediary infrastructure for developing and deploying advanced Edge computing services, by using a cluster of heterogeneous machines. Our main goal is to addres...
详细信息
ISBN:
(纸本)9781581139648
We present the architecture of a scalable and dynamic intermediary infrastructure for developing and deploying advanced Edge computing services, by using a cluster of heterogeneous machines. Our main goal is to address the challenges of the next-generation Internet services: scalability, high availability, fault-tolerance and robustness. Moreover, SEcS offers an easy, "on-the-fly" and per-user configuration of services. The architecture is based on IBM's Web Based Intermediaries (WBI) [8, 9]. Copyright 2005 acm.
This paper shows the efficiency of prefix and non-prefix codes for searching over compressed handheld databases. Byte Pair Encoding (BPE), Tagged Suboptimal Code (TSC), and Huffman encoding are the compression techniq...
详细信息
ISBN:
(纸本)9781581139648
This paper shows the efficiency of prefix and non-prefix codes for searching over compressed handheld databases. Byte Pair Encoding (BPE), Tagged Suboptimal Code (TSC), and Huffman encoding are the compression techniques used in the evaluation. By compressing handheld databases and searching over compressed text without needing to expand the databases, more data will be stored and more applications can be used. Experimental results show that about 33% more space has been achieved in the compressed handhelds' databases when using Searching over Compressed Text using BPE (SCTB) or Searching over Compressed Text using TSC (SCTT) solutions. Moreover, both solutions are 6.6 times faster than decompressing the databases followed by a linear search in all different sizes of databases. Efficiency performance shows that SCTB is the recommended solution for databases consisting of large-sized records and rarely updated, and SCTT is the recommended method for frequently updated databases or consisting of small-sized records. TSC and BPE compression schemes could also be used to accelerate wireless connectivity, web clipping, or databases transfer between handheld devices and computers, since these databases are usually small in size. Copyright 2005 acm.
This paper is an overview of Software Engineering 2004, the Software Engineering volume of the computing Curricula 2001 project. We briefly describe the contents of the volume, the process used in developing the volum...
详细信息
This paper is an overview of Software Engineering 2004, the Software Engineering volume of the computing Curricula 2001 project. We briefly describe the contents of the volume, the process used in developing the volume's guidelines, and how we expect the volume to be used in practice.
By immersing computational systems into the physical world, pervasive computing brings us from traditional desktop computing interactions into a form closer to human interactions, which are characterized by their depe...
详细信息
ISBN:
(纸本)9781581139648
By immersing computational systems into the physical world, pervasive computing brings us from traditional desktop computing interactions into a form closer to human interactions, which are characterized by their dependance on the environment. Furthermore, acting within the environment can contribute in many cases to a form of implicit interaction in which no explicit communication message is exchanged. However, this way of interacting cannot be achieved without a shared common knowledge with a well defined semantic. This appeals to explore a new approach of interaction mediated by the environment, closer to human interactions, and therefore, more suitable to achieve the intended silent computation of pervasive computing. To address this issue, we present in this paper XCM;a generic coordination model for pervasive computing. XCM is organized around few abstract concepts (entity, environment, social law and port) and is expressed as an ontology. While the abstract concepts of XCM deal with the environmental representation and context-dependency, the ontological representation allows to achieve knowledge sharing and context reasoning. Copyright 2005 acm.
In many practical applications, we are interested in computing the product of given matrices and/or a power of a given matrix. In some cases, the initial matrices are only known with interval uncertainty. It turns out...
详细信息
ISBN:
(纸本)9781581139648
In many practical applications, we are interested in computing the product of given matrices and/or a power of a given matrix. In some cases, the initial matrices are only known with interval uncertainty. It turns out that under this uncertainty, there is a principal difference between the product of two matrices and the product of three (or more) matrices: on the one hand, it is more or less known that the problems of computing the exact range for the product of two matrices - and for the square of a matrix - are computationally feasible;on the other hand, we prove that the problems of computing the exact ranges for the product of three matrices - and for the third power of a matrix - are NP-hard. Copyright 2005 acm.
The paradigm of Ubiquitous computing seeks to build a computing environment that responds to user context. An ideal file system for the Ubiquitous environment is one that can successfully recognize the present context...
详细信息
ISBN:
(纸本)9781581139648
The paradigm of Ubiquitous computing seeks to build a computing environment that responds to user context. An ideal file system for the Ubiquitous environment is one that can successfully recognize the present context and automate file management. The intelligence in the Ubiquitous file management is achieved by applying a heuristics based clustering approach to the system. The applied heuristics are those that are used on file attributes by users to manually manage files in a traditional file system. File attributes can be used to relate files to the most appropriate work-context and also draw inter-file relationships. We discuss methods to harness the given file information from the file-system to form a context-relation wrapper over disparate files. This enables management of files as context related working sets rather than as individual files. A survey was conducted among regular computer users and the compiled results supported our context based file clustering approach. The experiments also showed promising results that confirm our model on the file heuristics, thus finding semantic relations between those files. Copyright 2005 acm.
暂无评论