Proposes a computation model for cooperative agents. In this model, we introduce a field as an abstraction of a group of agents. Each agent can communicate to other agents in the same group through a field. the field ...
详细信息
Proposes a computation model for cooperative agents. In this model, we introduce a field as an abstraction of a group of agents. Each agent can communicate to other agents in the same group through a field. the field also enables one to specify the action of the group, i.e. it is used for a knowledge base to keep the rules and data shared by the agents in the group. Based on this model, a programming language which is based on Prolog was designed, and a prototype processing system was built on a network-connected distributed multi-workstation system. We also present example programs written in this language to demonstrate the effectiveness of the model.< >
Presents a framework for analyzing and determining robot motion plans for situations in which the robot is affected by an environment that probabilistically changes over time. In general, motion planning under uncerta...
详细信息
Presents a framework for analyzing and determining robot motion plans for situations in which the robot is affected by an environment that probabilistically changes over time. In general, motion planning under uncertainty has received substantial interest, and in particular a changing-environment has been recognized as an important aspect of motion planing under uncertainty. the authors model the environment as a finite-state Markov process, and the robot executes a motion strategy that is conditioned on its current position and the state of the environment. Optimality of a robot strategy is evaluated in terms of a performance functionalthat depends on the environment, robot actions, and a precise encoding of relevant preferences. By using a simple, yet powerful computation technique that is based on dynamic programming, the authors can numerically compute optimal robot strategies for a wide class of problems, surpassing previous results in this context that were obtained analytically. Several computed motion planning examples are presented.< >
this paper describes a rapid software prototyping environment which executes formal specifications in which executable specifications and conventional implementations can be used interchangeably. therefore, a prototyp...
详细信息
this paper describes a rapid software prototyping environment which executes formal specifications in which executable specifications and conventional implementations can be used interchangeably. therefore, a prototype system can be transformed into a production quality system by incrementally replacing specifications with implementations so that the complete software system exists at each step, thus enabling both evolutionary software development and assistance in the discovery of errors. Also, the external behaviour of software systems can be described directly from the user's point of view by means of scenarios generated based on executable specifications.< >
Software maintenance requires the understanding of existing code, determining whether to make changes, assessing the impact of modifications, rebuilding code after alterations, and regression testing to validate chang...
详细信息
Software maintenance requires the understanding of existing code, determining whether to make changes, assessing the impact of modifications, rebuilding code after alterations, and regression testing to validate changes. Program understanding is a bottleneck phase when the code to be maintained is invisible which means difficult to get needed information. this paper suggests a method for supporting program understanding by bottom-up driven and code-oriented view. the toolset includes abstraction mechanism, restructuring capability, ripple effect analysis, chunking guidance, and reuse. It lets the maintenance programmer understand the program effectively, refer to other people's understanding, analyze the effect of changes, and reusable program segments.< >
We study the energy and compatibility function formulations for pattern recognition by homomorphic mapping of attributed relational graphs using the Hopfield network. A deterministic hypothesis initialization strategy...
详细信息
We study the energy and compatibility function formulations for pattern recognition by homomorphic mapping of attributed relational graphs using the Hopfield network. A deterministic hypothesis initialization strategy is introduced and proven to be superior to the commonly used random initialization in many aspects. Further, a method to verify the validity of the hypotheses generated by the Hopfield network is also presented based on a compatible cluster formation procedure using binary compatibility measures. the compatible cluster formation method allows multiple hypotheses to be evaluated simultaneously and the best to be chosen. the performance of the homomorphic algorithm is evaluated using silhouette images.< >
the placement or insertion of surface mounted components is an essential stage in printed circuit board assembly (PCBA). A reduction in production time of placement through efficient process planning will significantl...
详细信息
the placement or insertion of surface mounted components is an essential stage in printed circuit board assembly (PCBA). A reduction in production time of placement through efficient process planning will significantly increase total yield of the whole line. CPS, a knowledge-based decision support system for component placement which incorporates optimisation algorithms, capable of the task, is presented. A case study is also presented.< >
Presents a fuzzy-based approach for capacitor placement in a distribution circuit. Two membership functions were defined for the voltage sensitivity and the real power loss. these membership functions greatly reduce t...
详细信息
ISBN:
(纸本)0780318625
Presents a fuzzy-based approach for capacitor placement in a distribution circuit. Two membership functions were defined for the voltage sensitivity and the real power loss. these membership functions greatly reduce the effort needed for finding the optimal locations via an exhaustive search. the whole problem is formulated as a fuzzy-set optimization problem to minimize the real power loss and the capacitor cost with voltage-limiting constraints. A distribution feeder was used to show the effectiveness of the proposed method.< >
Object-oriented technology, including object-oriented analysis (OOA), object-oriented design (OOD), and object-oriented programming (OOP), is a new promising approach to developing software systems to reduce software ...
详细信息
ISBN:
(纸本)0780318625
Object-oriented technology, including object-oriented analysis (OOA), object-oriented design (OOD), and object-oriented programming (OOP), is a new promising approach to developing software systems to reduce software costs and to increase software extensibility, flexibility, and reusability. Software metrics are widely used to measure software complexity and assure software correctness. this paper proposes a metric to measure object-oriented software. Also, an important factor called URIs, is conducted to build the metric. this approach describes a graph-theoretical method for measuring the complexity of the class hierarchy. the proposed metric shows that inheritance has a close relation with object-oriented software complexity and reveals that misuse of repeated (multiple) inheritance will increase software complexity and be prone to implicit software errors.< >
Presents a set of asynchronous backtrackable communication primitives and their integration into the SLOOP parallel object-oriented logic language. After a brief survey of inter-process communication models in paralle...
详细信息
Presents a set of asynchronous backtrackable communication primitives and their integration into the SLOOP parallel object-oriented logic language. After a brief survey of inter-process communication models in parallel logic languages, we define the set of communication primitives and give a uniform semantics of the extension of Prolog thus obtained. then we detail an implementation of these primitives based on the study of a dependency graph recording the connections between communication points. In order to integrate the primitives into the SLOOP language, we have defined a set of system classes used as an interface between the Prolog layer and the object layer. Lastly, an example illustrates most of the concepts supported by our language.< >
Reachability analysis (RA) is the most popular protocol verification technique as it can verify a number of protocol properties, like deadlock freeness, livelock freeness and boundedness; and it can be easily automate...
详细信息
Reachability analysis (RA) is the most popular protocol verification technique as it can verify a number of protocol properties, like deadlock freeness, livelock freeness and boundedness; and it can be easily automated. However, it is also very well-known that the state space explosion problem of RA limits its use in complex situations. the usefulness of existing verification tools in verifying complex protocols are very much pushed back by this problem. Various approaches have been proposed to tackle the problem; one of them is the partitioning method. So far, there has been very rare or possibly no report on how these methods can be implemented. this paper describes the implementation of the partitioning method into a proven computer-aided verification tool, PROTEAN, in order to address the state space explosion problem.< >
暂无评论