As concurrent software systems become larger, the interaction of their components is becoming more complex. This interaction may limit reuse, making it difficult to validate design and correctness and perhaps forcing ...
详细信息
ISBN:
(纸本)0769510809
As concurrent software systems become larger, the interaction of their components is becoming more complex. This interaction may limit reuse, making it difficult to validate design and correctness and perhaps forcing reengineering of these systems in order to meet future requirements. In order to reduce this complexity and to build stable and adaptable concurrent software systems, we present an approach that emphasizes the separation of interaction components from the functional components.
Dominance constraints are logical tree descriptions originating from automata theory that have multiple applications in computational linguistics. The satisfiability problem of dominance constraints is NP-complete. In...
详细信息
'Almost-certain eventualities' are liveness properties that hold with probability 1. 'Abstract probabilities' are probabilities in transition systems about which we know only that they are neither 0 no...
详细信息
We give a necessary and sufficient condition for when a set-theoretic function can be written using the recursion operator fold, and a dual condition for the recursion operator unfold. The conditions are simple, pract...
详细信息
‘Almost-certain eventualities’ are liveness properties that hold with probability 1. ‘Abstract probabilities’ are probabilities in transition systems about which we know only that they are neither 0 nor 1. Vardi [...
‘Almost-certain eventualities’ are liveness properties that hold with probability 1. ‘Abstract probabilities’ are probabilities in transition systems about which we know only that they are neither 0 nor 1. Vardi [17] showed that almost-certain properties in linear temporal logic depend only on abstract probabilities, rather than on the probabilities' precise values; we discuss the extent to which a similar result holds in quantitative temporal logic [9,10], and we show how to specialise the logic to those cases. The aim is to provide a simpler calculus than the full logic, one that is in a certain sense complete for proving almost-certain eventualities from abstract-probabilistic assumptions. We consider briefly the complexity of the specialised logic.
This paper presents linguistic primitives for publish/subscribe programming using events and objects. We integrate our primitives into a strongly typed object-oriented language through four mechnisms: (1) serializatio...
详细信息
ISBN:
(纸本)1581133359
This paper presents linguistic primitives for publish/subscribe programming using events and objects. We integrate our primitives into a strongly typed object-oriented language through four mechnisms: (1) serialization, (2) multiple subtyping, (3)closures, and (4) deferred code evaluation. We illustrate our primitives through Java, showing how we have overcome its respective lacks. A precompiler transforms statements based on our publish/subscribe primitives into calls to specifically generated typed adapters, which resemble the typed stubs and skeletons by the rmic precompiler for remote method invocations in Java
We give a necessary and sufficient condition for when a set-theoretic function can be written using the recursion operator fold, and a dual condition for the recursion operator unfold. The conditions are simple, pract...
We give a necessary and sufficient condition for when a set-theoretic function can be written using the recursion operator fold, and a dual condition for the recursion operator unfold. The conditions are simple, practically useful, and generic in the underlying datatype.
Dominance constraints are logical tree descriptions originating from automata theory that have multiple applications in computational linguistics. The satisfiability problem of dominance constraints is NP-complete. In...
ISBN:
(纸本)9780898714906
Dominance constraints are logical tree descriptions originating from automata theory that have multiple applications in computational linguistics. The satisfiability problem of dominance constraints is NP-complete. In most applications, however, only normal dominance constraints are used. The satisfiability problem of normal dominance constraints can be reduced in linear time to the configuration problem of dominance graphs, as shown recently. In this paper, we give a polynomial time algorithm testing configurability of dominance graphs (and thus satisfiability of normal dominance constraints). Previous to our work no polynomial time algorithms were known.
OPTIPRISM is an agent-based network management system (NMS) providing configuration and fault management services for all-optical networks. OPTIPRISM has been developed and tested on the Multi-wavelength Optical Netwo...
详细信息
OPTIPRISM is an agent-based network management system (NMS) providing configuration and fault management services for all-optical networks. OPTIPRISM has been developed and tested on the Multi-wavelength Optical Network (MONET) switches of the Advanced Technology Demonstration Network (ATDnet). OPTIPRISM features a scalable architecture consisting of a distributed hierarchy of intelligent, mobile manager agents. These managers have uniform interfaces, which makes it is easy to add managers from the hierarchy in order to extend OPTIPRISM as the network grows. Using agent mobility, OPTIPRISM is able to reorganize its physical deployment so as to improve overall responsiveness. Finally, OPTIPRISM includes an innovative browser agent which incorporates a scalable solution to the problem of end-user interaction with a large distributed NMS.
The purpose of my HCI research is to use the Design Patterns approach to establish a framework to support designing WIMP User Interfaces. In this paper I will introduce the WIMP+ User Interfaces and the idea to use th...
详细信息
ISBN:
(纸本)1581132484
The purpose of my HCI research is to use the Design Patterns approach to establish a framework to support designing WIMP User Interfaces. In this paper I will introduce the WIMP+ User Interfaces and the idea to use the Acquisition-Computation-Expression-Execution [6] (ACEE) Design Pattern to build the framework.
暂无评论