A lack of adequate and flexible topology support in the popular message passing systems such as Parallel Virtual Machine was a major factor in the development of our Virtual Process Topology Environment. This parallel...
详细信息
We study the performance of various run placement policies on disks for the merge phase of concurrent mergesorts using parallel prefetching. The initial sorted runs (input) of a merge and its final sorted run (output)...
详细信息
As a computational model to be simulated in a DNA computing context, Boolean circuits are especially interesting because of their parallelism. Simulations in concrete biochemical computing settings have been given by ...
详细信息
As a computational model to be simulated in a DNA computing context, Boolean circuits are especially interesting because of their parallelism. Simulations in concrete biochemical computing settings have been given by Ogihara and Ray (1996) and Amos and Dunne (1997). In this paper, we show how to simulate Boolean circuits by finite splicing systems, an abstract model of enzymatic recombination. We argue that using an abstract model of DNA computation as a basis leads to simulations of greater clarity and generality. In our construction, the running time of the simulating system is proportional to the depth, and the use of material is proportional to the size of the Boolean circuit simulated. However, the rules of the simulating splicing system depend on the size of the Boolean circuit, but not on the connectives used.
We offer a standpoint that emotions are a necessary mechanism for autonomous control systems. By an autonomous controlled object we understand an object, that is controlled by a control system which is its on-board su...
详细信息
We offer a standpoint that emotions are a necessary mechanism for autonomous control systems. By an autonomous controlled object we understand an object, that is controlled by a control system which is its on-board subsystem. The control system performs learning and control in one process. We develop a methodology of autonomous adaptive control (AAC), that allows us to construct a control system for a given controlled object. As the control goals we take the controlled object survival and the knowledge accumulation. As a whole these goals bring maximization of the controlled object lifetime. We suggest an emotions modeling mechanism (EM). We give the description of its functions and their implementation in AAC methodology. These functions are: (1) a compulsion of the control system for activity; (2) an appreciation of the CO current state at its quality; (3) an appreciation of the formed patterns and their usefulness for control goals; (4) an influence on tempo and depth of reasoning of decision making in current state; (5) providing the decision making subsystem with emotional appraisals of the recognized patterns; (6) providing transfer of information on patterns of emotional appraisals simultaneously with information on the patterns while the organism interacts with another organism.
A lack of adequate and flexible topology support in the popular message passing systems such as Parallel Virtual Machine was a major factor in the development of our Virtual Process Topology Environment. This parallel...
详细信息
A lack of adequate and flexible topology support in the popular message passing systems such as Parallel Virtual Machine was a major factor in the development of our Virtual Process Topology Environment. This parallel programming environment provides high level abstractions for interprocess communication, relieving the application developer of the cumbersome task of mapping logical neighbours to their task identifiers within message passing systems. The novel approach of separating topological specification from the APIs provided extreme flexibility to the developers of the applications using regular topologies. We believed that the task of supporting process topologies could be made even easier and, in this paper present our new method which uses recurrence relations to define topologies. Within the new environment, the recurrence relationships can be passed to the topology server which then is used in the generation of the topological specification.
In modern circuit design, the Shannon decomposition of switching functions is widely used. On the other hand, in information theory of telecommunication, the Shannon entropy used as a measure to represent the informat...
详细信息
In modern circuit design, the Shannon decomposition of switching functions is widely used. On the other hand, in information theory of telecommunication, the Shannon entropy used as a measure to represent the informat...
详细信息
In modern circuit design, the Shannon decomposition of switching functions is widely used. On the other hand, in information theory of telecommunication, the Shannon entropy used as a measure to represent the information in numerical values, is a key notion. In this paper, we relate these two concepts, belonging to different areas, into an approach to the minimisation of exclusive-or sum-of-products (AND/EXOR) expressions for switching functions. The Shannon decomposition, and the closely related Davio decomposition for AND/EXOR expressions are interpreted in terms of basic concepts in the information theory. Thanks to that, we have proposed an entropy based strategy for minimization of AND/EXOR expressions. We have provided a comparison and an experimental verification of this strategy with some known heuristic minimization strategies using benchmarks. In some cases, our program Info-EXOR produces extremely better results. Moreover, the information theory interpretation of classical decomposition of switching functions offers a new point of view to the existing design styles.
作者：
Frank MoranFrank Moran is BCS Vice-President
Branches. He began programming in the Department of Social Security. He moved to the National Insurance Recording System in 1984. From 1992 his final three years as Assistant Director were spent in charge of small network systems
The branch organisation is the local face of the BCS – and a vital contact point between the society, its members and the wider IT community
The branch organisation is the local face of the BCS – and a vital contact point between the society, its members and the wider IT community
In this paper, we supplement the set of basic and back-forth behavioural equivalences for Petri nets considered in [11] by place bisimulation ones. The relationships of all the equivalence notions are examined, and th...
详细信息
We introduce a first-order language for semantic underspecification that we call Constraint Language for Lambda-Structures (CLLS). A λ-structure can be considered as a λ-term up to consistent renaming of bound varia...
详细信息
暂无评论