The development of large, complex systems consisting of both hardware and software normally involves several companies and/or development teams for the development of the different subsystems forming the entire system...
详细信息
ISBN:
(纸本)0897916107
The development of large, complex systems consisting of both hardware and software normally involves several companies and/or development teams for the development of the different subsystems forming the entire system. Depending on the kind of subsystem to be developed, these different development teams normally use different systemengineering methodologies and/or tool sets to produce their subsystems. However, the usage of different methodologies and tools makes technical management and quality assurance for the entire development effort a difficult task. Therefore the development as well as the maintenance of future systems with their increasing size and complexity requires a common frame for the entire system development and maintenance effort covering different kinds of subsystems, like graphical user interfaces, database systems, expert systems, real-time systems, and so on. This common frame should support the separate and independent development of the different subsystems by different subcontractors using different systemengineering methods, the integration of these subsystems to the entire system as well as the maintenance of the entire system. A hierarchical object-oriented model for the encapsulation and integration of different systemengineering methods can serve as this common frame, providing traceability from the system requirements model to the implemented system while giving each subsystem development team full scope in choosing the systemengineering method most suitable for a specific subsystem. The approach underlying this object-oriented model is the encapsulation of the different subsystems in "high-level objects," which can be either further decomposed into "high-level object" or described in more detail using any appropriate systemengineering method. The integration of these "high-level objects" to the entire system is supported by a "definition object" on each layer of each systemengineering model. The "definition objects" provide trace
This paper discusses the support for two different implementations of resilient Logical Machines. LM checkpoint/rollback and replicated LM execution, corresponding to backward and forward error recovery respectively. ...
详细信息
This paper discusses the support for two different implementations of resilient Logical Machines. LM checkpoint/rollback and replicated LM execution, corresponding to backward and forward error recovery respectively. By LM approaches, one can effectively achieve fault-tolerance for node crash but eliminate some critical problems such as domino effect, live lock, and local dependencies.< >
The authors discuss active tactile sensing for detecting a contact point between a multifingered robot hand and an unknown object. They define the concept of actively sensible meaning that an active sensing motion can...
详细信息
The authors discuss active tactile sensing for detecting a contact point between a multifingered robot hand and an unknown object. They define the concept of actively sensible meaning that an active sensing motion can be planned for a sensing event. Assuming more than two sensing events, conditional-minimum-external-sensor-realization is defined, where it is shown that it is possible to reduce the number of external sensors with a well-planned sensing algorithm. Based on these definitions, an active sensing algorithm for detecting the contact point with minimum-external-sensor-realization is proposed. This approach remedies several disadvantages found in conventional approaches. The approach was tested through experiments using a single-finger model with a fingertip tactile sensor.< >
The authors discuss the self-posture changeability (SPC) for a general 3-D link system. The series of motions brought about by SPC is called self-posture changing motions (SPCM). SPC and SPCM are considered assuming t...
详细信息
The authors discuss the self-posture changeability (SPC) for a general 3-D link system. The series of motions brought about by SPC is called self-posture changing motions (SPCM). SPC and SPCM are considered assuming that the link system moves slowly enough to suppress any dynamic effects. It is shown that, according to a particular combination of link posture, joint assignment, and object shape, there exist a deadlock state, where no further angular displacement can be imparted to the position-controlled joint. It is also shown that there are two different types of deadlock states which never result in any SPCM. The authors introduce (w, omega )-posture changeability, the characteristic with which a link can change posture for every possible force within a cone of a prime axis w and a solid angle, omega . The necessary and sufficient conditions leading to (w, omega )-posture changeability are shown, for a given contact point and frictional conditions. a sufficient condition is included required to realize SPCM under the assumption that the contact point moves continuously over the object and the link-object system never results in a deadlock state.< >
<正>The unification problem is one of the most important and fundamental problems in many fields,such as artificial intelligence,knowledge engineering,intelligent robotics,deductive database,and new-type programming...
<正>The unification problem is one of the most important and fundamental problems in many fields,such as artificial intelligence,knowledge engineering,intelligent robotics,deductive database,and new-type programming *** paper presents an AND-OR terms graph for representing a power set of terms,and establishes a homomorphic mapping from the terms graph to a Harmony network for solving the first order unification problem under some equational ***,in order to construct the homomorphic Harmony network an improved competitive activation mechanism is presented,which allows more than one nodes within an inhibitory cluster of nodes to be activated simultaneously and avoids running the time-consuming Harmony network learning algorithm based on complicated stochastic *** algorithm,given by this paper,used for getting the maximum Harmony state of the homomorphic Harmony network,which is associated with the solution of unification problems,can update network states in such a way that several nodes corresponding to the same variable in a given set of terms always result in the same value through a stochastic dynamic *** approach and the algorithms in this paper are superior to the traditional symbolic logic methods in the high parallelism, the ability of solving the unification problem between uncertain and incomplete terms,the ease of treating combination of several equational theories,and the adaptability for many various types of the unification problems,especially,for solving many terms’ unification simultaneously and parallelly.
Simulating a large artificial neural network to solve real-world application problems often requires large amounts of computational *** of the algorithm on conventional hardware are rather slow and direct VLSI or spec...
详细信息
Simulating a large artificial neural network to solve real-world application problems often requires large amounts of computational *** of the algorithm on conventional hardware are rather slow and direct VLSI or special purpose hardware implementations are rather *** this paper,it is investigated to simulate a fully connected multilayered feedforword neural network using the backpropagation learning algorithm on a distributed memory multiprocessor *** partitioning and data partitioning schemes and their algorithms are described and the network partitioning method was realized in a ring network topology of transputer *** almost linear acceleration result has been achieved.
A novel approach to obstacle detection using optical flow without recovering range information has been developed. This method can be used for ground vehicles to navigate through man-made roadways or natural outdoor t...
详细信息
The authors have parallelized the AMBER molecular dynamics program for the AP1000 highly parallel computer. To obtain a high degree of parallelism and an even load balance between processors for model problems of prot...
详细信息
The authors have parallelized the AMBER molecular dynamics program for the AP1000 highly parallel computer. To obtain a high degree of parallelism and an even load balance between processors for model problems of protein and water molecules, protein amino acid residues and water molecules are distributed to processors randomly. Global interprocessor communication required by this data mapping is efficiently done using the AP1000 broadcast network, to broadcast atom coordinate data for other processors' reference and its torus network; also for point-to-point communication to accumulate forces for atoms assigned to other processors. Experiments showed that a problem with 41095 atoms is processed 226 times faster with a 512 processor AP1000 than by a single processor.< >
In constructing highly reliable LAN systems, a mechanism that enables every active node to maintain timely and consistent knowledge about the health status of all cooperating nodes can be used as a cornerstone. The au...
详细信息
In constructing highly reliable LAN systems, a mechanism that enables every active node to maintain timely and consistent knowledge about the health status of all cooperating nodes can be used as a cornerstone. The authors consider the case where maintenance of such knowledge is achieved in a decentralized manner and timely and consistent recognition of newly joining nodes is also facilitated. The authors develop an optimal version of H. Kopetz et al.'s (1985) periodic reception history broadcast (PRHB) method. The authors' version enables detection of failures with minimum latency and is called the PRHB with earliest detection (PRHB/ED). This scheme has much shorter latency than the previous PRHB scheme and is yet equally practical in the sense that it does not increase the communication traffic at all, and the complexity of the algorithm for analyzing the observations exchanged among the active nodes is still bounded by a linear function of the number of nodes in the system.< >
暂无评论