This paper presents a fuzzy controller to reject sinusoidal disturbances in a dynamical system. First, the fuzzy rules used in the fuzzy control are automatically tuned by evolutionary programming. These fuzzy rules a...
详细信息
This paper presents a fuzzy controller to reject sinusoidal disturbances in a dynamical system. First, the fuzzy rules used in the fuzzy control are automatically tuned by evolutionary programming. These fuzzy rules are then used to reject the disturbances in a dynamical system. The robust control technique is applied to compensate for the uncertainties arising from the unknown optimal weight matrix and reconstruction error by using a fuzzy logic system. Simulation results are presented to illustrate the performance of the proposed control.
A visual environment for designing sequence control program with AI planning is described. In order to increase productivity and improve the quality and reliability of the control specifications, the authors have been...
详细信息
A visual environment for designing sequence control program with AI planning is described. In order to increase productivity and improve the quality and reliability of the control specifications, the authors have been developing a planning-based Visual programming System for Sequence Control Program Specification Design (VIPS/S-SFCD). VIPS/S-SFCD features an example-based programming technique in which designers specify the initial states and goal states of machines using visual representations, and generates control specification by AI planning. To overcome the difficulty of dealing with complex data/knowledge of the planner, VIPS/S-SFCD analyzes and confirms user intention using context-dependent valence theory and case grammar. They used VIPS/S-SFCD to experimentally generate control program specifications for actually existing steel plants. The experimental results showed that visual representation with dynamic, intuitional icons, the coverage of the grammar rule, and generating time of control specification are practical.
Parts of the CICS transaction processing system were modelled formally in the 1980s in a collaborative project between IBM Hursley Park and Oxford University Computing Laboratory. Z was used to capture a precise descr...
详细信息
Parts of the CICS transaction processing system were modelled formally in the 1980s in a collaborative project between IBM Hursley Park and Oxford University Computing Laboratory. Z was used to capture a precise description of the behaviour of various modules as a means of communicating requirements and design intentions. These descriptions were not mechanically verified in any way: proof tools for Z were not considered mature, and no business case was made for effort in this area. We report a recent experiment on using the Z/Eves mechanical theorem prover to construct a machine-checked analysis of one of the CICS modules: the File Control API. This work was carried out as part of the international Grand Challenge in Verified Software, and our results are recorded in the Verified Software Repository. We give a brief description of the other modules, and propose them as challenge problems for the verification community.
This paper explores the feasibility of applying a grammatical evolution (GE) system and combines it with the genetic algorithm (GA) to establish the inflow predicting model of De-Chi Reservoir in central Taiwan. First...
详细信息
This paper explores the feasibility of applying a grammatical evolution (GE) system and combines it with the genetic algorithm (GA) to establish the inflow predicting model of De-Chi Reservoir in central Taiwan. First, a GE is an evolutionary automatic programming type system, which can discover relationships among observed data and express them mathematically. Further, a GA was used with this GE to optimize the appropriate function type automatically. We apply this GE model to fit to the inflow data series on dry year. Experimental results are presented to demonstrate the applicability of GE for forecasting long-term time series, and the results are found to be better compared with the traditional multiregressive (MR) method.
Java has been used widely, from servers to cellular phones. In order to test those Java runtime systems, many test tools have been provided. However these tools are not enough for Java JIT compilers. They should be te...
详细信息
Java has been used widely, from servers to cellular phones. In order to test those Java runtime systems, many test tools have been provided. However these tools are not enough for Java JIT compilers. They should be tested by various executable bytecode sequences. Most test tools don't cover such kinds of a combination test. Therefore we developed a random test program generator and a Java JIT compiler test system. This test system automatically: 1) generates Java class files which are random, executable and finite; 2) inserts codes that output execution-process-dependent results; 3) runs these on the target JIT compiler and other tested Java runtimes; 4) compares results. In this paper, we describe how to generate random test programs, and how to test a Java JIT compiler, and then we evaluate quality (coverage) of generated random test programs.
A framework for the development of distributed object-oriented systems in heterogeneous environments is presented. This model attempts to incorporate concepts of distributed computing technology together with software...
详细信息
A framework for the development of distributed object-oriented systems in heterogeneous environments is presented. This model attempts to incorporate concepts of distributed computing technology together with software engineering methods. A tool has been developed to enforce the model by means of a high-level specification language and an automatic code generator. However, it is emphasized that the model may be exploited as a methodologic foundation even outside an automatic generation approach.< >
This paper outlines an analysis method for automatically identifying the required capabilities for the system calls defined by the Linux Kernel. Integrated in the LLVM compiler infrastructure, the static and path sens...
详细信息
ISBN:
(数字)9798331539979
ISBN:
(纸本)9798331539986
This paper outlines an analysis method for automatically identifying the required capabilities for the system calls defined by the Linux Kernel. Integrated in the LLVM compiler infrastructure, the static and path sensitive approach used aims to generate a complete set of logical equations, expressed in terms of the syscalls' argument configurations, that describe the relation between system calls and capabilities. In order to achieve the desired syscall to capability mapping a four stage analysis pipeline is proposed, each stage complimenting one of the abstraction layers used by the LLVM compiler. First, all possible execution paths, in terms of functions, are identified by the first stage, which is followed by the identification of the control flow blocks leading to calls to ensuing functions in the chain. Once all such paths are known, the third stage is tasked with solving the path explosion problem and to eliminate all control flow blocks that do not influence overall analysis goals. The final stages are responsible with instruction level analysis which binds each path to a constant equation verifying the arguments passed to the system call. By means of a scalable synthetic test program generator four sets of test-benches are constructed. Each test-bench is responsible to validate its corresponding stage of the analysis pipeline. They consists of programs that are scaled on the dimensions identified through mathematical analysis of the tested algorithm and problem.
The assembly plan from observation (APO) system observes a human operator perform an assembly task, analyzes the observations, models the task and generates the programs for the robot to perform the same task. A major...
详细信息
The assembly plan from observation (APO) system observes a human operator perform an assembly task, analyzes the observations, models the task and generates the programs for the robot to perform the same task. A major component of the APO system is the task recognition module, which models the observed task. The task model in the APO context is defined as a sequence of assembly states of the part being assembled and the actions which cause the transition between the states. The state of the assembled part is based on its freedom, which can be computed from the geometry of the contacts between the part and its environment. This freedom can be represented as a polyhedral convex cone (PCC) in screw space. We show that any contact configuration can be classed into a finite number of contact states. These contact states correspond to typologically distinct intersections of the PCC with a linear subspace T in screw space. The models of any observed task can be represented as a path in a transition graph obtained from these contact states. We illustrate the theory by implementing the APO system for polygonal objects assembled in a plane using rotation and translation.
The authors propose a novel method to program a robot, the assembly-plan-from-observation (APO) method. The APO method aims to build a system that has the capability of observing a human performing an assembly task, u...
详细信息
The authors propose a novel method to program a robot, the assembly-plan-from-observation (APO) method. The APO method aims to build a system that has the capability of observing a human performing an assembly task, understanding the task based on the observation, and generating the robot program to achieve the same task. Assembly relations which serve as the basic representation of each assembly task are defined. It was verified that such assembly relations can be recovered from the observation of human assembly tasks, and that from such assembly relations, it is possible to generate robot motion commands to repeat the same assembly task. An APO system based on the assembly relations was demonstrated.< >
暂无评论