SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS （PART I：EQUAL TIMES AND COSTS）

Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O（n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented.     

Affine scaling algorithm fails for semidefinite programming

In this paper, we introduce an affine scaling algorithm for semidefinite programming (SDP), and give an example of a semidefinite program such that the affine scaling algorithm converges to a non-optimal point. Both our program and its dual have interior feasible solutions and unique optimal solutions which satisfy strict complementarity, and they are non-degenerate everywhere.     

真分数表成单位分数和的一类特解

用初等的方法研究了m/n表法，并给出了真分数表成单位分数和的一类特解。     

分数Hamilton圈与分数树形图

定义有向图的分数有向Hamilton圈和分数支撑树形图，讨论分数Hamilton圈、分数旅行售货员问题和分数支撑树形图基于线性规划的等价定义及多项式时间算法。     

关系模式关键字的一个求解算法

本文给出了关系数据库模式中求解关键字的一个算法。算法很简洁并且对于[1]定义的一大类问题,执行时间是多项式级的。     

NURBS曲线半正交小波分解的Gauss算法

在多分辨率曲线和曲面造型中,B样条小波已经得到广泛应用 为了进行小波分解,通常要解一个线性方程组或者求矩阵的逆 如果曲线比较复杂,控制点较多 (例如:数千个以上 ),则矩阵的阶数就会很大,所需的内存将难以容忍,小波分解的速度也会受到很大影响 本文根据B样条小波的综合滤波器的特点,给出了GaussB样条半正交小波的快速分解算法     

Finding global minima with a new dynamical evolutionary algorithm

A new dynamical evolutionary algorithm (DEA) based on the theory of statistical mechanics is presented. This algorithm is very different from the traditional evolutionary algorithm and the two novel features are the unique of selecting strategy and the determination of individuals that are selected to crossover and mutate. We use DEA to solve a lot of global optimization problems that are nonlinear, multimodal and multidimensional and obtain satisfactory results. Foundation item: Supported by the National Natural Science Foundation of China (No. 60133010, NO. 60073043 and No. 700/1042) Biography: Zou Xiu-fen(1996-), female, Ph. D candidate, Associate professor, research direction: evolutionary computing, parallel computing.     

基于层面信息的路径优化

根据分层物体快速成型（LOM）中零件逐层累积的特点，从缩短加工时间、提高制件效率方面着手阐述了路径优化的必要性，针对LOM机的运动机理和软件数据结构，给出了扫描路径优化的原理，将图论中的便宜算法用于LOM机的扫描路径优化。     

A decomposition heuristics for the container ship stowage problem

In this paper we face the problem of stowing a containership, referred to as the Master Bay Plan Problem (MBPP); this problem is difficult to solve due to its combinatorial nature and the constraints related to both the ship and the containers. We present a decomposition approach that allows us to assign a priori the bays of a containership to the set of containers to be loaded according to their final destination, such that different portions of the ship are independently considered for the stowage. Then, we find the optimal solution of each subset of bays by using a 0/1 Linear Programming model. Finally, we check the global ship stability of the overall stowage plan and look for its feasibility by using an exchange algorithm which is based on local search techniques. The validation of the proposed approach is performed with some real life test cases. This work has been developed within the research area: “The harbour as a logistic node” of the Italian Centre of Excellence on Integrated Logistics (CIELI) of the University of Genoa, Italy     

线性二次型最优控制的并行算法和软件

构造了线性二次型最优控制的并行算法，介绍了这个并行算法在武汉大学“ＷＵＤＰ９１”并行分布式处理系统上试算的数值应用软件的框图．本软件适用于既定动态系统的平衡问题．对于经济系统，可通过政策控制变量来调节和改善其状态和响应．对于自治系统可找出最优控制使得消耗函数达到最小值．通过对一系列例子进行试算，结果证实，所构造的并行算法和相应的数值软件是有效的，其加速比约为７．