Resource management in distributed sensor networks is a challenging problem. this can be attributed to the fundamental trade-off between the value of information contained in a distributed set of measurements versus t...
详细信息
We address the task of systematically designing efficient programs for parallel machines. Our approach starts with a sequential algorithm and proceeds by expressing it in terms of standard, pre-implemented parallel co...
详细信息
We address the task of systematically designing efficient programs for parallel machines. Our approach starts with a sequential algorithm and proceeds by expressing it in terms of standard, pre-implemented parallel components called skeletons. We demonstrate the skeleton-based design process using a tridiagonal system solver as our example application. We develop a cost-optimal parallel version of our application and implement it in message passing interface (MPI). the performance of our solution is demonstrated experimentally on a Cray T3E machine. (c) 2004 Elsevier B.V. All rights reserved.
Transaction management has some known drawbacks, which have been researched in the past, and many solutions in the form of advanced transaction models have been proposed. However, these models are too difficult to be ...
详细信息
ISBN:
(纸本)9728865198
Transaction management has some known drawbacks, which have been researched in the past, and many solutions in the form of advanced transaction models have been proposed. However, these models are too difficult to be used by the application programmer because of their complexity and their lack of separation of concerns. In this paper we address this by letting the application programmer specify advanced transactions at a much higher abstraction level. To achieve this, we use the software engineering techniques of Aspect Oriented programming and Domain-Specific Languages. this allows the programmer to declare advanced transactions separately in a concise specification which is much more straightforward.
In this paper, we present a current cooperative work involving different institutes around the world. Our aim is to provide an online Inductive Logic programming tool. this is the first step in a more complete structu...
详细信息
ISBN:
(纸本)9728865198
In this paper, we present a current cooperative work involving different institutes around the world. Our aim is to provide an online Inductive Logic programming tool. this is the first step in a more complete structure for enabling e-technology for machine learning and bio-informatics. We describe the main architecture of the project and how the data will be formatted for being sent to the ILP machinery. We focus on a biological application (yeast fermentation process) due to its importance for high added value end products.
Mobile Agent system creates a new way for sharing distributed resources and providing multi-located services. Withthe idea of moving calculations towards resources, it occupies less network traffics than the traditio...
详细信息
ISBN:
(纸本)9728865198
Mobile Agent system creates a new way for sharing distributed resources and providing multi-located services. Withthe idea of moving calculations towards resources, it occupies less network traffics than the traditional Client/Server model and achieves more flexibilities than the Remote Procedure Call (RPC) architecture. In order to endow agents withthe ability of accessing remote data resources, in this paper we present the design strategies of the Database Interface between a logic programming language based Mobile Agent system and a remote DBMS.
this paper presents a formal verification withthe Coq proof assistant of a memory model for C-like imperative languages. this model defines the memory layout and the operations that manage the memory. the model has b...
详细信息
ISBN:
(纸本)3540297979
this paper presents a formal verification withthe Coq proof assistant of a memory model for C-like imperative languages. this model defines the memory layout and the operations that manage the memory. the model has been specified at two levels of abstraction and implemented as part of an ongoing certification in Coq of a moderately-optimising C compiler. Many properties of the memory have been verified in the specification. they facilitate the definition of precise formal semantics of C pointers. A certified OCaml code implementing the memory model has been automatically extracted from the specifications.
We present a theory of proof denotations in classical propositional logic. the abstract definition is in terms of a semiring of weights, and two concrete instances are explored. Withthe Boolean semiring we get a theo...
详细信息
ISBN:
(数字)9783540320142
ISBN:
(纸本)3540255931
We present a theory of proof denotations in classical propositional logic. the abstract definition is in terms of a semiring of weights, and two concrete instances are explored. Withthe Boolean semiring we get a theory of classical proof nets, with a geometric correctness criterion, a sequentialization theorem, and a strongly normalizing cut-elimination procedure. this gives us a "Boolean" category, which is not a poset. Withthe semiring of natural numbers, we obtain a sound semantics for classical logic, in which fewer proofs are identified. though a "real" sequentialization theorem is missing, these proof nets have a grip on complexity issues. In both cases the cut elimination procedure is closely related to its equivalent in the calculus of structures.
We describe an abstract machine, called GCPAN, for the distributed execution of Safe Ambients (SA), a variant of the Ambient Calculus (AC). Our machine improves over previous proposals for executing AC, or variants of...
详细信息
We explore the notion of the workflow for specifying interactions among collections of devices (which we term device ecologies). We discuss three levels of abstraction in programming device ecologies: high-level workf...
详细信息
ISBN:
(纸本)9728865198
We explore the notion of the workflow for specifying interactions among collections of devices (which we term device ecologies). We discuss three levels of abstraction in programming device ecologies: high-level workflow, low-level workflow and device conversations, and how control (in the sense of operations issued by an end-user on such workflows or exceptions) is passed between levels. Such levels of abstraction are important since the system should be as user friendly as possible while permitting programmability not only at high-levels of abstraction but also at low levels of detail. We also present a conceptual architecture for the device ecology workflow engine for executing and managing such workflows.
暂无评论