The tools for visualization of relativistic string dynamics in various topological classes are developed. New theoretical results, obtained with the aid of these tools, are described. (C) 2000 Elsevier Science Ltd. Al...
详细信息
The tools for visualization of relativistic string dynamics in various topological classes are developed. New theoretical results, obtained with the aid of these tools, are described. (C) 2000 Elsevier Science Ltd. All rights reserved.
Studies the relationship of the second law of thermodynamcis and the limiting capabilities of heat engines. Self-organization and the production of entropy in a system; Proposed design for a heat engine.
Studies the relationship of the second law of thermodynamcis and the limiting capabilities of heat engines. Self-organization and the production of entropy in a system; Proposed design for a heat engine.
The paper presents a heterogeneous distribution of computations while solving dense linear algebra problems on heterogeneous networks of computers. The distribution is based on heterogeneous block cyclic distribution ...
详细信息
ISBN:
(纸本)3540658211
The paper presents a heterogeneous distribution of computations while solving dense linear algebra problems on heterogeneous networks of computers. The distribution is based on heterogeneous block cyclic distribution which is extension of the traditional homogeneous block cyclic distribution taking into account differences in the processor performances. The mpC language, specially designed for parallel programming heterogeneous networks is briefly introduced. An mpC aplication earring out Cholesky factorization on a heterogeneous network of workstations is used to demonstrate that the heterogeneous distribution have an essential advantage over the traditional homogeneous distribution.
Strengthening the result of Rodl and Frankl (Europ. J. Combin 6 (1985) 317-326), Pippenger proved the theorem stating the existence of a nearly perfect matching in almost regular uniform hypergraph satisfying some con...
详细信息
Strengthening the result of Rodl and Frankl (Europ. J. Combin 6 (1985) 317-326), Pippenger proved the theorem stating the existence of a nearly perfect matching in almost regular uniform hypergraph satisfying some conditions (see J. Combin. Theory A 51 (1989) 24-42). Grable announced in J. Combin. Designs 4 (4) (1996) 255-273 that such hypergraphs have exponentially many nearly perfect matchings. This generalizes the result and the proof in Combinatorica 11 (3) (1991) 207-218 which is based on the Rodl nibble algorithm (European J. Combin. 5 (1985) 69-78). In this paper, we present a simple proof of Grable's extension of Pippenger's theorem. Our proof is based on a comparison of upper and lower bounds of the probability for a random subgraph to have a nearly perfect matching. We use the Lovasz Local Lemma to obtain the desired lower bound of this probability. (C) 1949 Elsevier Science B.V. All rights reserved.
KVEST - Kernel VErification and Specification Technology - is based on automated test generation from formal specifications in the RAISE specification language. The technology was developed under contract with Nortel ...
详细信息
ISBN:
(纸本)3540665870
KVEST - Kernel VErification and Specification Technology - is based on automated test generation from formal specifications in the RAISE specification language. The technology was developed under contract with Nortel Networks. As of 1999, the methodology and toolset have been applied in three industrial project dealing with verification of large-scale telecommunication software. The first project, the Kernel Verification project, gives its name to the methodology and the toolset as a whole. Results of this project are available from the Formal Methods Europe Application database [13]. It is one of the biggest formal method application presented in the database. This paper provides a brief description of the approach, comparison to related works, and statistics on completed projects.
This paper presents the first approximation method of the finite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs with ongoing behaviors (perpetual p...
详细信息
ISBN:
(纸本)3540656995
This paper presents the first approximation method of the finite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs with ongoing behaviors (perpetual processes). Our technical contributions are (1) the semantical characterization of finite failure of logic programs over infinite trees and (2) the design and soundness proof of the first set-based analysis of logic programs with the greatest-model semantics. Finally, we exhibit the connection between finite failure and the inevitability of the 'inconsistent-store' error in fair executions of concurrent constraint programs where no process suspends forever. This indicates a potential application to error diagnosis for concurrent constraint programs.
The mpC language and its supportive portable programming environment ave aimed at efficiently-portable modular parallel programming heterogeneous networks of computers (HNCs). Unlike traditional tools used for portabl...
详细信息
ISBN:
(纸本)0818686464
The mpC language and its supportive portable programming environment ave aimed at efficiently-portable modular parallel programming heterogeneous networks of computers (HNCs). Unlike traditional tools used for portable programming HNCs, mpC provides more advanced facilities for process management to support efficient portability. The paper presents the abstraction of network object introduced in the mpC language to manage processes constituting a message-passing program in order to ensure efficient execution of mpC applications on any particular HNC. The main attention is paid to the translation of this high-level mechanism into low-level notions of target message-passing programs.
The mpC language and its supportive portable programming environment are aimed at efficiently-portable modular parallel programming heterogeneous networks of computers (HNCs). Unlike traditional tools used for portabl...
详细信息
The mpC language and its supportive portable programming environment are aimed at efficiently-portable modular parallel programming heterogeneous networks of computers (HNCs). Unlike traditional tools used for portable programming HNCs, mpC provides more advanced facilities for process management to support efficient portability. The paper presents the abstraction of network object introduced in the mpC language to manage processes constituting a message-passing program in order to ensure efficient execution of mpC applications on any particular HNC. The main attention is paid to the translation of this high-level mechanism into low-level notions of target message-passing programs.
General aspects of the application of object technology to the programming of problems and methods of computational mathematics are considered. Principles of the object-oriented approach (OOA) and their systematizing ...
General aspects of the application of object technology to the programming of problems and methods of computational mathematics are considered. Principles of the object-oriented approach (OOA) and their systematizing role in a given subject domain are discussed. On the basis of object analysis, a formal model of computational mathematics is constructed. The model incorporates basic kinds of mathematical objects and messages that mechanize interactions of mathematical objects in the framework of computational applications. Analysis of the model reveals a number of object paradigms of programming that express fundamental principles of computational mathematics and determine a constructive approach to the implementation of mathematical software of different subject and problem orientation.
暂无评论