This paper presents an algorithm for discovering exceptional knowledge from *** knowledge, which is defined as an exception to a general fact, exhibits unexpectedness and is sometimes extremely useful in spite of its ...
详细信息
The paper proposes a new modeling method of interactions in the software development process, which focuses on the interactions among the elements of the process, and a new software development environment based on th...
详细信息
The paper proposes a new modeling method of interactions in the software development process, which focuses on the interactions among the elements of the process, and a new software development environment based on th...
详细信息
The paper proposes a new modeling method of interactions in the software development process, which focuses on the interactions among the elements of the process, and a new software development environment based on the model. In this method, interactions in the software process are modeled as a set of agents and communication channels. An agent interacts with other agents with channels. Channels are classified according to their content and type of interaction. A prototype of the supporting environment for software development which is based on the model is also developed. The environment consists of a proxy program for the agent and integrated communication server, which provides mechanisms for interaction, process execution, and user navigation.
Software testing generally proceeds as follows: generating test-cases, selecting test-data, executing a test target program, inspecting execution result and evaluating whether testing has already been sufficient or no...
详细信息
Software testing generally proceeds as follows: generating test-cases, selecting test-data, executing a test target program, inspecting execution result and evaluating whether testing has already been sufficient or not yet. As for methods for structural testing of programs, the way using a coverage, where the coverage means what extent given testing criteria are satisfied, is noted. At the evaluating step, whether or not we finish the testing is determined in view of the coverage. This paper proposes a method for structural testing of concurrent programs written in Ada programming language, especially, test-case generation and execution of the programs. The Event InterActions Graph (EIAG) is used as a model for concurrent programs. The EIAG consists of Event Graphs and Interactions. An Event Graph is a control flow graph of a program unit in a concurrent program. The Interactions represent interactions between the program units. program units are such as procedures, functions and task-types. After generating test-cases on the EIAG, a method for selecting test-data is described and measures to cope with infeasible test-cases with which are generated in this step is clarified. And a forced execution of a test target concurrent program in order to solve the nondeterministic execution is investigated. The nondeterministic execution is characteristic of concurrent programs.
This paper concerns the decentralized design for a MIMO system. The decentralized design means the design of the combination of a pre-compensator and decentralized controllers. An advantage of this idea is that we can...
详细信息
This paper concerns the decentralized design for a MIMO system. The decentralized design means the design of the combination of a pre-compensator and decentralized controllers. An advantage of this idea is that we can regard the decentralized controllers as SISO controllers, if the pre-compensator sufficiently decouples the plant. As a result, it is easy to comprehend the relationship between the controllers and specifications. However, it may occur that the structural restriction of the decentralized controllers results in a poorer performance than a centralized controller. This paper shows that the decentralized design proposed realizes a performance equal to the centralized one in the mixed sensitivity problem based on certain assumptions.
作者：
Okano, KHigashino, TTaniguchi, KMemberFaculty of Engineering Science
Osaka University Toyonaka Japan 560 Teruo Hipshino received his B.E.
M.E.and Ph.D. degrees in Information and Computer Sciences from Osaka University Osaka Japan in 1R9 1981 and 1984 respectively. He joined the Faculty of Osaka University in 1984. Since 1991 he has been an Associate Professor in the Department of Information and Computer Sciences at Osaka University. In 1990 he was a Visiting Researcher of Dept. I.R.O. at University of Montreal Canada. His current research interests include design and analysis of distributed systems specification and verification of communication protocols and formal approach of program design. He is a member of IEEE-CS ACMIEICE of Japanand IPS of Japan.
In this paper, new methods for providing the correctness of refinement among abstract sequential machine style programs are described. The programs are described in algebraic language ASL using some useful notions, i....
详细信息
In this paper, new methods for providing the correctness of refinement among abstract sequential machine style programs are described. The programs are described in algebraic language ASL using some useful notions, i.e., the extended projection and the valid reachability condition for each transition function. These notions allow a designer to refine a given text (program or specification) to a concrete text more freely than the text that does not use such notions. These notions can also enhance the expressive power of the text. On the other hand, these advantages would have lost half their values, if useful methods to prove the correctness of refinement among the texts using them are not found. Thus new methods for proving the correctness of the texts are proposed, and they do not require much proof loads. First, the correctness of refinement among the ASL texts with the extended projection is defined. Second, a method is proposed for proving the correctness of refinement among such texts. Also proposed is a definition of the correctness of refinement among the texts with the valid reachability conditions and a method to prove their correctness. These methods do not require more proof loads than the usual methods for the texts that do not use such notions in the abstract sequential machine style. Therefore, these methods are useful.
A temporal fractal is clearly shown in the feeding behavior of Drosophila as a self-similar pattern of locomotive velocity and inverse power law distributions of food dwelling time over the time scale range of 10(3). ...
A temporal fractal is clearly shown in the feeding behavior of Drosophila as a self-similar pattern of locomotive velocity and inverse power law distributions of food dwelling time over the time scale range of 10(3). The fractality was observed in the dwelling time distribution immediately after the fly was placed to feeding site or on inferior food in a two-choice situation. Fractality may be understood as adaptive, and an intrinsic property of animal behavior that reflects complex information processing in the CNS of Drosophila.
We have studied a mechanism of interaction support in software process by using an agent program prepared for every entity of the process. The agent defined accepts the requests and replies to them. We are now prototy...
详细信息
We have studied a mechanism of interaction support in software process by using an agent program prepared for every entity of the process. The agent defined accepts the requests and replies to them. We are now prototyping the communication support system based on this framework. More intelligent agent mechanisms such as automatic message routing could be investigated.
We have developed a knowledge-based but partially analytic simulation system. This system simulates regulatory action in lambda phage, a virus which infects E. coli. Specifically, we simulated the decision between its...
详细信息
We have developed a knowledge-based but partially analytic simulation system. This system simulates regulatory action in lambda phage, a virus which infects E. coli. Specifically, we simulated the decision between its two developmental pathways, lytic and lysogenic growth. Our model is composed of two levels: roughly abstracted level and precisely abstracted level. The former level is discrete-event and knowledge-based. It covers overall regulations inside lambda phage in qualitative representation. On the other hand, the latter is based on quantitative chemical equations describing the sensitive bifurcation within pathways. In this way, qualitatively clear overview of regulatory action is efficiently simulated using knowledge base, and only the unpredictable part is analytically simulated in detail. This system can output not only input knowledge but also precise prediction by computational analysis, data which help molecular biologists find new theories of regulatory actions.
We have developed a machine discovery system BONSAI which receives positive and negative examples as inputs and produces as a hypothesis a pair of a decision tree over regular patterns and an alphabet indexing. This s...
详细信息
暂无评论