Discrete-time control schemes are often used for realization of positional control strategies for continuous time control problems (Krasovskii and Subbotin, 1974; Osipov, 1971) . However for general systems.with delay...
详细信息
Discrete-time control schemes are often used for realization of positional control strategies for continuous time control problems (Krasovskii and Subbotin, 1974; Osipov, 1971) . However for general systems.with delays (whicb are often called functional differential equations (FDE)) exact solutions in both continuous and discrete schemes can be found in exceptional cases. So, as rule, it is necessary to solve corresponding control problems using suitable numerical algorithms . In surveys (Cryer and Tavernini, 1972; Hall and watt, 1976; Bellen, 1985) different numerical methods for FDE are discussed. In this paper positional implicit Runge-Kutta-like numerical methods of solving general FDE are presented. The elaborated methods are direct analogs of the corresponding numerical methods of ODE case. Also we present new theorem (which generalizes the results of (Kim and Pimenov, 1997; Kim and Pimenov, 1998)) on convergence order. The obtained results are based on distinguishing of finite dimensional and infinite dimensional components in the structure of FDE, on interpolation and extrapolation of the discrete prehistory of the model, on application of constructions of i- smooth analysis (Kim, 1996) . The notion of an approximation order for an optimal strategy in the discrete scheme of realization is introduced. The conditions, which guarantee required approximation order of the optimal strategy, are presented.
The problem researched is that there presently does not exist a set of success factors which are common across organizations and have some predictability relationship to software reuse. For completeness, this research...
详细信息
A clustering-based approach to the separation of text from mixed text/graphics documents is presented. The approach starts from the grouping of connected components. Clustering is employed at three critical stages to ...
详细信息
The CAPSE environment for computer Aided Parallel Software engineering is intended to assist the developer in the crucial task of parallel programming. The methodology of CAPSE is based on direct manipulative graphica...
详细信息
Tackles some critical issues in diagnostic problem solving by addressing the conceptual design of automatic diagnostic systems.able to cope with complex dynamic processes. The dynamic switching fuzzy system model intr...
详细信息
Tackles some critical issues in diagnostic problem solving by addressing the conceptual design of automatic diagnostic systems.able to cope with complex dynamic processes. The dynamic switching fuzzy system model introduced by M.H. Smith (1994) is used as a generalized framework which dynamically changes the reasoning method by tuning the operators and/or defuzzification methods. This technique is applied to tune different fuzzy diagnostic models introduced by M. Ulieru (1995). The dynamic switching fuzzy diagnostic model (DFSDM) proposed in this paper can adapt online to drastic changes in the behavior of the diagnosed process. Tutorial investigations on an inverted pendulum clarify the ability of this method to cope with unexpected, unknown disturbances while simulation results on an electromechanical process prove the ability of this technique to manage critical faults in continuous dynamic systems.
In this paper, a design of a test processor ASIC employing a probabilistic approach is presented. The test processor chip is computer programmable. It consists of linear feedback shift register (LFSR) which can select...
详细信息
In this paper, a design of a test processor ASIC employing a probabilistic approach is presented. The test processor chip is computer programmable. It consists of linear feedback shift register (LFSR) which can select one of 16 polynomials and set user programmable need for every test set, signature analyzer and 3 built-in RAMs and other control circuitry. It is capable of generating random numbers and applying them to the circuit under test (CUT) and then retrieve the responses from the CUT. It can generate a signature by compressing the response data and detect circuit faults by comparing this signature with that of a good CUT. This ASIC can be used to design a low cost IC tester of reliable performance.
作者:
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.
In this paper the NeuDB system is presented, which accomplishes the physical and conceptual integration of neural networks with an object-oriented database system. In the context of the database system neural networks...
详细信息
暂无评论