Simulation of automatically-generated test programs is the primary means for verifying complex hardware designs and random test program generators therefore play a major role in the verification process of micro-proce...
详细信息
Simulation of automatically-generated test programs is the primary means for verifying complex hardware designs and random test program generators therefore play a major role in the verification process of micro-processors. The input for a test program generator is typically an abstract specification-a template-of the tests to be generated. Due to randomness, generators often encounter situations that were not anticipated when the test specification was written. We introduce the concept of adaptive test program generation, which is designed to handle these unforeseen situations. We propose a technique that defines unexpected events together with their alternative program specifications. When an event is detected, its corresponding alternative specification is injected into the test program.
Traditional approaches to programming robots are generally inaccessible to non-robotics-experts. A promising exception is the learning from demonstration paradigm. Here a policy mapping world observations to action se...
详细信息
Traditional approaches to programming robots are generally inaccessible to non-robotics-experts. A promising exception is the learning from demonstration paradigm. Here a policy mapping world observations to action selection is learned, by generalizing from task demonstrations by a teacher. Most learning from demonstration work to date considers data from a single teacher. In this paper, we consider the incorporation of demonstrations from multiple teachers. In particular, we contribute an algorithm that handles multiple data sources, and additionally reasons about reliability differences between them. For example, multiple teachers could be inequally proficient at performing the demonstrated task. We introduce Demonstration Weight Learning (DWL) as a learning from demonstration algorithm that explicitly represents multiple data sources and learns to select between them, based on their observed reliability and according to an adaptive expert learning inspired approach. We present a first implementation of DWL within a simulated robot domain. Data sources are shown to differ in reliability, and weighting is found impact task execution success. Furthermore, DWL is shown to produce appropriate data source weights that improve policy performance.
RBF neural network based surrogate model is constructed from process simulator and particle swarm optimization (PSO) strategy is discussed to solve this nonlinear programming problem with some output variables are unm...
详细信息
RBF neural network based surrogate model is constructed from process simulator and particle swarm optimization (PSO) strategy is discussed to solve this nonlinear programming problem with some output variables are unmeasured. Performance of maximum yield rate for a hydrolysis of the propylene oxide reaction is developed and the constrained PSO can give the best value of the steady state with different inflow rate and temperature. Comparison results with the evolutionary strategy (ES) show the efficiency of this new intelligent optimization method, it provides a practically method for industry process optimization
More than ten years ago the first major workshop on "Reusability in programming" was held. Since that time some technologies have advanced and come into successful commercial use while others have gone unuse...
详细信息
More than ten years ago the first major workshop on "Reusability in programming" was held. Since that time some technologies have advanced and come into successful commercial use while others have gone unused. New management and abstraction techniques have aided reuse. Interfacing to huge abstractions, now in common use, has made reuse more difficult. This paper is not a formal survey of reuse technology but instead discusses the evolution of early concepts and the issues they raise. Much of the research of the original workshop participants is just now becoming relevant. In some cases the research of the past points to problems and solutions for the present. As part of this examination the activities in reuse for the next ten years are forecast and a guide of hard questions to ask purveyors of reuse technology is provided.< >
A user-friendly window-driven interactive environment called Op/sup ti/A for the effective solution of mathematical programming problems is described. It enables solution of various frequently encountered classes of p...
详细信息
A user-friendly window-driven interactive environment called Op/sup ti/A for the effective solution of mathematical programming problems is described. It enables solution of various frequently encountered classes of parameter optimization problems including nonsmooth, minimax and multicriterial. Reciting the fact that most of the optimal control problems, either continuous-time or discrete-time, can be alternatively expressed in a mathematical programming framework, one can use the current system for their solution, at least for some classes of problems. Especially for continuous-time optimal control problems the appropriate parametrization results in reasonably manageable nonlinear mathematical programming problems.< >
Development environments are entering a period of dramatic change. A major component of this change is a reorientation toward domain driven environments including an integration of domain-oriented support tools. This ...
详细信息
Development environments are entering a period of dramatic change. A major component of this change is a reorientation toward domain driven environments including an integration of domain-oriented support tools. This reorientation will bring about a decline in the role of conventional programming languages and at the same time force an evolution toward more abstract programming representations more abstract in the sense that most of the implementation details (as they are currently known) will be abstracted away. Thus, development is moving farther away from conventional software engineering models and closer to the problem.< >
An approach for deriving an English-language description of a computer program directly from the source code is presented. Two levels of translation are presented: statement rendering, to derive the English-language e...
详细信息
An approach for deriving an English-language description of a computer program directly from the source code is presented. Two levels of translation are presented: statement rendering, to derive the English-language equivalent of the program statements, and concept abstraction, to deduce the purpose of the program. The translation method presented is shown to be equivalent to language translation, with some restrictions. One restriction is that the translation grammar is not bidirectional when abstractions are considered. Another is that the source (program) language is much more regularized than is normally the case with spoken (natural) languages.< >
Everyday experience tells us that some errors are transient, but also that some can be handled simply by "retrying" the failed operation. For instance, a glitch on the network might turn a resource unreachab...
详细信息
Everyday experience tells us that some errors are transient, but also that some can be handled simply by "retrying" the failed operation. For instance, a glitch on the network might turn a resource unreachable for a short period of time; or a sudden peak of work on a server can cause a momentary denial of service. In many occasions, without other kind of specialized recovery code, it is possible to keep a program running only by retrying a failed operation. Unfortunately, retry is not explicitly available on many platforms or programming languages and, even if it were, it could not be blindly used for dealing with every abnormal situation. On languages like C# or Java, or even on languages that offer the retry construct such as Smalltalk and Eiffel, where errors are represented and communicated through exceptions, there is no simple way to clear the effects of a failed operation and, thus, re-attempt its execution. Programmers have to explicitly write sometimes complex and error-prone code to repair the state of a program and the execution context. In this paper, we propose an AOP technique for implementing "retry" on systems lacking such a feature without using any language extensions for AOP or imposing modifications to the development language. Our approach eliminates the need for programmers to write "state-cleaning" code for normal objects by means of a transparent transactional mechanism and provides the means to identify non-idempotent operations on the code. In our evaluation we show that a relevant number of application failures can be masked using this approach.
Artificial intelligence - one of the most interesting theoretical and applied areas of computer science. There is a wide range of techniques and approaches for creation of artificial intelligence in the applications a...
详细信息
Artificial intelligence - one of the most interesting theoretical and applied areas of computer science. There is a wide range of techniques and approaches for creation of artificial intelligence in the applications and real-time control systems. In this paper, we propose a realization of neuro-automata controlling based on neural networks and automaton paradigm and considering an example of how this paradigm could be used in real application.
This paper introduces an automated grader for Java programs called GUIGrader that allows students a degree of flexibility in graphical user interface (GUI) design. GUIGrader allows students to build multi-window Java ...
详细信息
This paper introduces an automated grader for Java programs called GUIGrader that allows students a degree of flexibility in graphical user interface (GUI) design. GUIGrader allows students to build multi-window Java applications, choose among alternative GUI components, and decide how to order, position and label components. This enables students to practice some aspects of designing their own GUI applications while still providing automated grading based on a single test plan. The data-driven approach helps to maintain consistency between test plans and program specifications. Testing GUIGrader on Java assignments from both a first-year and an upper-year course confirms the feasibility of the approach
暂无评论