This paper develops a fuzzy chance constrained mixed-integer nonlinear programming (FCC-MINLP) model and the solution methods for refinery short-term crude oil scheduling problem under demands uncertainty. To reduce t...
详细信息
This paper develops a fuzzy chance constrained mixed-integer nonlinear programming (FCC-MINLP) model and the solution methods for refinery short-term crude oil scheduling problem under demands uncertainty. To reduce the calculation complexity of the model, it is transformed into its equivalent fuzzy chance constrained mixed-integer linear programming (FCC-MILP) model by using the method of Quesada & Grossmann (1995). After that the FCC-MILP model is solved through its crisp equivalent algorithm and fuzzy simulation algorithm rely on the theory presented by Liu & Iwamura (B. Liu, K. Iwamura, 1998) for the first time in this area. Finally, a case study which has 265 continuous variables, 68 binary variables and 318 constraints is effectively solved in LINGO 8.0 (J. X. Xie and Y. Xue, 2005) with the proposed approaches
The authors have developed a module extractor called VAMP, that cooperates with a standard formatter. They describe the VAMP approach to literate programming. Literate programming identifies a method of documentation ...
详细信息
The authors have developed a module extractor called VAMP, that cooperates with a standard formatter. They describe the VAMP approach to literate programming. Literate programming identifies a method of documentation which explains to people what a computer is supposed to do. Generally, this means that refinement steps are documented in such a way that modules can be extracted from the documentation files. The tool has been in use since 1982. The experiences are predominantly positive, in spite of the overhead implicit in the methodology. The fact that VAMP is independent of both programming language and formatter distinguishes it from WEB and its derivatives.< >
This paper describes a signalprocessor that is specialized on the realization of single- and multi-rate digital filters. It is designed around a TRW multiplier /accumulator and contains a coefficient- and data-address...
详细信息
This paper describes a signalprocessor that is specialized on the realization of single- and multi-rate digital filters. It is designed around a TRW multiplier /accumulator and contains a coefficient- and data-address -computer especially suited to the filter-algorithms. It is programmed in a high level filter-description language with a syntax resembling PASCAL. A crosscompiler translates these programs directly into the machines microcode. Since the language is limited to constructs, that the machines architecture supports efficiently, the automatically generated microcode is only marginaly less efficient than optimal handwritten code.
A novel hybrid algorithm EPLSE is proposed to design fuzzy rule bases automatically, which is based on the combination of EP (evolutionary programming) and LSE (least squares estimate). By utilizing the consequent par...
详细信息
ISBN:
(纸本)0780383532
A novel hybrid algorithm EPLSE is proposed to design fuzzy rule bases automatically, which is based on the combination of EP (evolutionary programming) and LSE (least squares estimate). By utilizing the consequent parameters of the super 1/sup st/-order Sugeno model, the training error is decreased greatly. Compared with the original work, the proposed algorithm has remarkably improved the fuzzy model's precision and simplified its structure. In the simulation, EPLSE is employed to predict a chaotic time series. Comparisons with some typical fuzzy modeling methods and artificial neural networks are presented and discussed. Other promising applications of the proposed EPLSE are also suggested.
A new evolutionary programming algorithm for multi-objective optimization is proposed. It employs two elitism mechanisms and does not include fitness assignment. The proposed algorithm was applied to the mobile robot ...
详细信息
A new evolutionary programming algorithm for multi-objective optimization is proposed. It employs two elitism mechanisms and does not include fitness assignment. The proposed algorithm was applied to the mobile robot path planning with three objectives. The random approach combined with a heuristic method based on domain knowledge were used in the initialization process to motivate convergence, and three evolutionary operators named deletion, repair and smooth were designed to improve the searching efficiency of the algorithm. Simulation results indicate that the proposed algorithm can find a set of Pareto optimal solutions efficiently in a single run, from which the decision maker can make a choice
A suite of programs that performs the automatic grading of Java programming assignments is described. This suite has been used in the Introduction to Computer Science course at Rutgers University since the Spring 2000...
详细信息
A suite of programs that performs the automatic grading of Java programming assignments is described. This suite has been used in the Introduction to Computer Science course at Rutgers University since the Spring 2000 semester where it grades some 400-600 weekly assignments. The time to grade the submissions is a matter of minutes on a 500 MHZ PC. The development process for a typical assignment that includes the development of the required assignment-specific evaluation software is in the order of 8 hours. The programming system derives its ability to grade in the presence of errors from the use of the Java reflection classes, the Java inheritance mechanism, and Perl regular expressions. The reflection classes allow a student program's methods to be individually found and executed independently of how they are actually named by the student. The Java inheritance mechanism allows a flawed student method to be overridden with a known good method so the evaluation may proceed. The regular expressions allow the student's program output to be gleaned for information even if the output does not adhere to specified format. The regular expressions are also used to scan the student's source code for desirable or undesirable coding patterns. In addition, the systems programming aspects of Perl are used to extract the student programs from the environment where they are submitted and to construct the environment in which they are compiled, executed, and evaluated. To date about 32000 student programs have been graded by this system.
The paper presents a research on control and programming fault-tolerant robot fine-motions for constraint tasks encountered, for instance, in robot automation of assembly processes. It concerns mainly the problem of t...
详细信息
The paper presents a research on control and programming fault-tolerant robot fine-motions for constraint tasks encountered, for instance, in robot automation of assembly processes. It concerns mainly the problem of the autonomous adjustment of fine-motion misplacement which can be resulted from a number of factors but especially from the constrained accuracy of robots. It has been proposed to apply a task-level programming concept which assumes that user programs specify only goals of robot motions without any need to develop means ensuring the goals to be achieved. The control programs including such means can be synthesized by an automatic programming system developed for complementing user programs with the sensor-based fine-motion control strategies. The system presented was applied in a supervisory level of the three-layered control system of Zebra ZERO research robot, for experimental verification of the proposed approach.
Genetic programming (GP) has been applied as an automatic programming tool to solve various kinds of problems by genetically breeding a population of computer programs using biologically inspired operations. However, ...
详细信息
Genetic programming (GP) has been applied as an automatic programming tool to solve various kinds of problems by genetically breeding a population of computer programs using biologically inspired operations. However, it is well known as a computationally demanding approach with a significant potential of parallelization. In this paper, we emphasize parallelizing the evaluation of genetic programs on Graphics Processing Unit (GPU). We used a compact representation for genotypes. This representation is a memory-efficient method that allows efficient evaluation of programs. Our implementation clearly distinguishes between an individual's genotype and phenotype. Thus, the individuals are represented as linear entities (arrays of 32 bits integers) that are decoded and expressed just like nonlinear entities (trees).
Domain specific programming languages tend to be rigid in capability, and dependent on either a graphical interface or a scripting language. We present a question-oriented approach that requires no prior knowledge of ...
详细信息
Domain specific programming languages tend to be rigid in capability, and dependent on either a graphical interface or a scripting language. We present a question-oriented approach that requires no prior knowledge of programming and can be easily adapted to a wide range of domains. Interrogative programming works by "parsing" the user's intent using the responses to a series of closed-ended questions. Questions are guided by a context free grammar specified in an external file. We discuss the benefits, capabilities and limitations of interrogative programming along with the results of recent usability studies with our prototype.
The design of pseudorandom number generators by means of evolutionary computation is a classical problem. Today, it has been mostly and better accomplished by means of cellular automata and not many proposals, inside ...
详细信息
The design of pseudorandom number generators by means of evolutionary computation is a classical problem. Today, it has been mostly and better accomplished by means of cellular automata and not many proposals, inside or outside this paradigm could claim to be both robust (passing all the statistical tests, including the most demanding ones) and fast, as is the case of the proposal we present here. Furthermore, for obtaining these generators, we use a radical approach, where our fitness function is not at all based in any measure of randomness, as is frequently the case in the literature, but of nonlinearity. Efficiency is assured by using only very efficient operators (both in hardware and software) and by limiting the number of terminals in the genetic programming implementation.
暂无评论