反应精馏过程的操作优化与集成优化分析

为优化反应精馏工业装置操作,分析了反应精馏过程优化问题的内容和特点,提出了一套行之有效的优化策略,并建立了典型过程的以经济效益为目标、符合过程约束和质量及转化率约束的优化数学模型。对MTBE装置进行了操作优化分析,可提高年经济效益1.62%。提出了反应精馏过程的集成优化思想,通过对乳酸提纯反应精馏装置进行集成优化分析,可有效确定过程的最优设计参数,并提高年经济效益8.23%。计算结果表明:该模型及其算法可有效用于反应精馏过程的优化分析。通过优化计算可取得明显的经济效益。     

配送量不定的供应链协调

本文研究供应链管理中配送量不确定时，制造商和分销商之间的协调问题。通过建立惩罚和奖励机制模型来协调供应链各部分的运作，使得分散系统就如一个整体。同时分析供应链的利润分配问题，分别得出各个机制下分销商的最优决策。     

Maximizing a Linear Fractional Function on a Pareto Efficient Frontier

We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included.     

A search technique for global optimization in a chaotic environment

We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters.     

Simulated annealing with noisy or imprecise energy measurements

The annealing algorithm (Ref. 1) is modified to allow for noisy or imprecise measurements of the energy cost function. This is important when the energy cannot be measured exactly or when it is computationally expensive to do so. Under suitable conditions on the noise/imprecision, it is shown that the modified algorithm exhibits the same convergence in probability to the globally minimum energy states as the annealing algorithm (Ref. 2). Since the annealing algorithm will typically enter and exit the minimum energy states infinitely often with probability one, the minimum energy state visited by the annealing algorithm is usually tracked. The effect of using noisy or imprecise energy measurements on tracking the minimum energy state visited by the modified algorithms is examined.The research reported here has been supported under Contracts AFOSR-85-0227, DAAG-29-84-K-0005, and DAAL-03-86-K-0171 and a Purdue Research Initiation Grant.     

加入WTO后庆加快信息资源的建设

文章就我国加入WTO后信息资源建设方面的必要性、紧迫性、实用性、目标等方面做了阐述。     

Adaptive Algorithm for Constrained Least-Squares Problems

This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method.     

具有模糊数的模糊多目标群体决策优选模型与方法

多目标群体决策问题是运筹学的一个重要研究领域，目前已经提出了一些有效的决策方法。但对目标值和权重均为模糊数的模糊多目标群体决策问题却研究不多，本对此类模糊多目标群体决策问题进行了探讨，利用相对正理想方案与相对负理想方案概念定义了相对差异距离，进而建立了模糊多目标群体决策优选模型与方法，并通过战役决心方案的评价说明了该方法是可行、有效的，可作为军事决策与决策支持系统的备选方法。     

Patterns and Symmetries in the Visual Cortex and in Natural Images

As borders between different entities, lines are an important element of natural images. Indeed, the neurons of the mammalian visual cortex are tuned to respond best to lines of a given orientation. This preferred orientation varies continuously across most of the cortex, but also has vortex-like singularities known as pinwheels. In attempting to describe such patterns of orientation preference, we are led to consider underlying rotation symmetries: Oriented segments in natural images tend to be collinear; neurons are more likely to be connected if their preferred orientations are aligned to their topographic separation. These are indications of a reduced symmetry requiring joint rotations of both orientation preference and the underlying topography. This is verified by direct statistical tests in both natural images and in cortical maps. Using the statistics of natural scenes we construct filters that are best suited to extracting information from such images, and find qualitative similarities to mammalian vision. PACS84.35+i 89.70.+c 87.57.Nk