The challenges of the unit commitment problem for real-life small-scale power systems

Small-scale power systems mainly present two particular problems when it comes to their modeling and solution. Due to their size, it is important to consider and meet various types of reserve requirements in order to have a reliable operation of the power system. It is also important to consider variable start-up costs in order to obtain a more accurate unit commitment. In this paper six different types of reserve requirements are considered for the unit commitment problem: spinning reserve, regulation reserve (AGC per unit), ten-minute reserve, ten-minute non-synchronized reserve, ten-minute operational reserve, and ten-minute distributed reserve. Additionally, a Mixed Integer Programming formulation is introduced to represent variable start-up costs. The model introduced here is currently in use by the Baja California (México) power system operator.     

Neural network approach for allocation with capacity

In this paper we discuss neural network approach for allocation with capacity constraints problem. This problem can be formulated as zero-one integer programming problem. We transform this zero-one integer programming problem into an equivalent nonlinear programming problem by replacing zero-one constraints with quadratic concave equality constraints. We propose two kinds of neural network structures based on penalty function method and augmented Lagrangian multiplier method, and compare them by theoretical analysis and numerical simulation. We show that penalty function based neural network approach is not good to combinatorial optimization problem because it falls in the dilemma whether terminating at an infeasible solution or sticking at any feasible solution, and augmented Lagrangian multiplier method based neural network can alleviate this suffering in some degree.     

The programming language standards scene, ten years on Paper 2: Pascal

This paper, one of a simultaneously published set on ten years of activity in programming language standards, describes the developments in standardization of the programming language Pascal which have taken place in the period 1983–1993.     

Grammar-related transformations of logic programs

We investigate a simple transformation of logic programs capable of inverting the order of computation. Several examples are given which illustrate how this transformation may serve such purposes as left-recursion elimination, loop-elimination, simulation of forward reasoning, isotopic modification of programs and simulation of abductive reasoning.     

An architectural approach to improved program maintainability

A programming standard is described, with the emphasis on the visual aspects of the final product rather than on how the programs are engineered.     

The structure of the MARY/2 compiler

The MARY12 language implemented at Penobscot Research Center contains language differences from previous MARY implementations. These differences significantly increase the difficulty of implementing a compiler. Similar constructs have appeared in recent language proposals such as those for ADA. The methods of the MARY/2 compiler should be useful in compilers for these and other future languages. This paper discusses the language constructs which are the source of the difficulty; the implementation methods actually used; possible trade used; and the character of the programs which these constructs facilitate.     

NUMLS中的多态类型检测

本文从ＮＵＭＬ函数式部分实现中遇到的类型检测问题着手，讨论类型检测问题到半合一问题的转化，给出半合一的转换式求解机制和该转换规则集的可靠性和完备性定理。     

Propagation Pattern模型及改进

面向对象对软件工程有着极大的意义，但同时也带来了编程上的新问题。由于复杂类结构和冗余代码所带来的源码重读困难，使软件进化和维护都未达到理想的目的。我们研究美国Ｎｏｒｔｈｅａｓｔｅｒｎ大学的自动面向对象程序生成工具Ｐｒｏｐａｇａｔｉｏｎ Ｐａｔｔｅｒｎ模型，并将其发展为一种新的程序索引描述。这里我们结合类图和Ｐｒｏｐａｇａｔｉｏｎ Ｐａｔｔｅｒｎ抽象描述，希望能以简洁的图文形式描述面向对象程序，以利     

知识工程中使用演绎逻辑的局限性

本文简要归纳了演绎逻辑在知识工程中的作用,着重分析了演绎逻辑在知识表达、推理、问题求解、逻辑程序设计等方面以及作为专家系统说明语言与分析工具的局限性。     

人工智能语言LISP的新发展——面向对象的CLOS系统

本文是深入浅出的综述,介绍CLOS的发展历史、主要特点和展望。