Best L1 Piecewise Monotonic Data Modelling

Let us consider n data measurements of a univariate process that have been altered by random errors. We assume that an underlying model function has a substantially smaller number of turning points than the observed ones. We propose algorithms that make least the sum of the moduli of the errors by requiring k monotonic sections, alternately increasing and decreasing, in the sequence of the smoothed values. The main difficulty in this calculation is that the optimal positions of the joins of the monotonic sections have to be found automatically among so many combinations that it is impossible to test each one separately. Moreover, the calculation seems to be very intractable to general optimization techniques because O(n^k) local minima can occur. It is shown that dynamic programming can be used for separating the data into optimal disjoint sections of adjacent data, where each section requires a single L₁ monotonic calculation. This procedure is highly efficient, requiring at most O(kn²) computer operations and O(n) best L₁ monotonic calculations to subranges of data for a global minimum.     

Running programs backwards: The logical inversion of imperative computation

Imperative programs can be inverted directly from their forward-directed program code with the use of logical inference. The relational semantics of imperative computations treats programs as logical relations over the observable state of the environment, which is taken to be the state of the variables in memory. Program relations denote both forward and backward computations, and the direction of the computation depends upon the instantiation pattern of arguments in the relation. This view of inversion has practical applications when the relational semantics is treated as a logic program. Depending on the logic programming inference scheme used, execution of this relational program can compute the inverse of the imperative program. A number of nontrivial imperative computations can be inverted with minimal logic programming tools.     

大坝施工混凝土质量的评价体系

本文介绍了大坝施工混凝土质量的评价系统软件的设计思路和设计成果。它利用现代计算机技术和应用模糊数学理论评价混凝土重力坝和拱坝单块和整体的质量。在采用模糊综合评价工程质量中，对不同工艺环节，对坝体不同部位，鉴于其质量要求的差异应赋予不同的权重，在权重的取值上采用了专家调查排序，定量转化的方法是比较适宜的。在程序设计中，评价数学模型采用了BASIC程序，访膜块通过*TXT文件实现了与整个大坝混凝土质量微机管理系统的接口及数据传递。操作运行方便灵活。     

Practical method for generation expansion planning based on dynamic programming

This paper presents an efficient method which provides the optimal generation mix and the optimal generation construction process. The approximation method in which the dynamic programming technique and gradient method are combined is applied to determine the optimal generation mix with hydropower generation technologies. The successive approximations dynamic programming (SADP) technique, which is very suitable for high-dimensional multistage decision process problems, is used for obtaining the optimal generation construction process. The effectiveness and feasibility of the developed technique are demonstrated on a practical power system model which has five types of generation technologies including a hydropower generation technology.     

钢铁企业价格预测决策模型体系研究

通过对钢铁企业现行价格管理体系的分析 ,建立了钢铁企业价格预测决策模型体系。充分利用大量的定性、定量信息 ,并把趋势预测和因果预测技术相结合 ,采用组合预测模型对价格进行预测 ,最后对预测出来的多方案进行模糊综合评价 ,给出推荐方案顺序。实际应用表明 ,模型体系是有效的。     

二阶A型Cooper变换的增强型

对二阶Ａ型Ｃｏｏｐｅｒ变换进行增强，放宽可用性条件，并证明了其正确性，最后举例说明其应用。     

结构振动控制中压电阻尼技术研究：（三）机敏约束层阻尼技术

给出了机敏约束阻尼概念，阐述了机敏约束层阻尼系统特征，分析了结构设计和系统建模方法。以典型梁系统为例，比较了被动约束阻尼技术和机敏约束层阻尼技术减振效果。结果表明；机敏约束层阻尼控制技术是一种更为有效的振动控制方法。最后，提出了今后重点研究问题。     

Rule-based supervisory control of a two-link flexible manipulator

In this paper, we propose a two level hierarchical control strategy to achieve accurate end-point position of a planar two-link flexible manipulator. The upper level consists of a feedforward rule-based supervisory controller that incorporates fuzzy logic, whereas the lower level consists of conventional controllers that combine shaft position-endpoint acceleration feedback for disturbance rejection properties and shaping of the (joint) actuator inputs to minimize the energy transferred to the flexible modes during commanded movements. The effectiveness of this hierarchical control strategy is verified by experimental results for various movements of the links, in various configurations. In particular, we illustrate how the hierarchical intelligent control strategy performs better than conventional control techniques for endpoint position control in the presence of flexure effects.     

Object-extending class transformations

Reorganisation and evolution of class hierarchies is important for object-oriented system development and has received considerable attention in the literature. The contributions of this paper are: (1) a formal study of a set of extension relations and transformations on class hierarchies; (2) a presentation of a small set of primitive transformations which form a minimal and complete basis for the extension relations; and (3) an analysis of the impact of these transformations at the object level.The study leads to a better understanding of evolution and reuse of object-oriented software and class hierarchies. It also provides a terminology and a means of classification for design reuse. The theory presented in this paper is based on the Demeter data model, which gives a concise mathematical foundation for classes and their inheritance and part-of relationships. Parts of the theory have been implemented in the Demeter System ^TM C++, a CASE tool for object-oriented design and programming.     

Application of Differential Evolution for Irrigation Planning: An Indian Case Study

The present paper demonstrates the applicability of population based search optimization method, namely, Differential Evolution (DE) to a case study of Mahi Bajaj Sagar Project (MBSP), India. Ten different strategies of DE are employed to assess the ability of DE for solving higher dimensional problems as an alternative methodology for irrigation planning. The parameters considered in DE are population size, crossover constant and weighting factor. Linear Programming (LP) is utilized as a comparative approach to assess the ability of DE. Comparison of results of LP and the 10 DE strategies for the given parameters indicated that both the results are comparable even for high dimensional problems. Extensive sensitivity analysis studies, performed for 3,600 combinations of above parameters for the 10 DE strategies suggested that DE/rand-to-best/1/bin strategy is the best strategy giving maximum benefits taking minimum CPU time. It is concluded that DE can be utilized for efficient planning of any irrigation system with suitable modifications.