A ROBUST DECOMPOSITION OF LINEAR PROGRAMMING USING A GOAL-PARTITIONING METHOD

The Dantzig/Wolfe linear programming decomposition algorithm has had important economicinterpretations as well as a widespread impact on solving large scale linear programming problem.Inthis paper we consider a similar underlying structure,where however there is only one couplinginequality or equation.With this simplification,we demonstrate how to achieve an equitable partitionof the overall coupling resource to individual subproblem constraints through a simple iterationprocedure which appears to be very efficient.     

FROM MANUFACTURING SCHEDULING TO SUPPLY CHAIN COORDINATION：THE CONTROL OF COMPLEXITY AND UNCERTAINTY

With time-based competition and rapid technology advancements, effective manufacturingscheduling and supply chain coordination are critical to quickly respond to changing marketconditions. These problems, however, are difficult in view of inherent complexity and variousuncertainties involved. Based on a series of results by the authors, decomposition and coordination byusing Lagrangian relaxation is identified in this paper as an effective way to control complexity anduncertainty.A manufacturing scheduling problem is first formulated within the job shop context withuncertain order arrivals, processing times, due dates, and part priorities as a separable optimizationproblem. A solution methodology that combines Lagrangian relaxation, stochastic dynamicprogramming, and heuristics is developed. Method improvements to effectively solve large problemsare also highlighted. To extend manufacturing scheduling within a factory to coordinate autonomicmembers across chains of suppliers, a decentralized supply chai     

海量信息系统与复杂性研究

对海量信息系统在未来信息技术领域中的地位和作用做了简明的阐述。海量信息系统是目前国际互联网基础上将要更快更广泛发展起来的信息技术。对海量信息系统的研究具有一定的前瞻性，是一项很有前途的技术。对海量信息研究中可能存在的复杂性问题做了简要的探索。     

复杂性问题研究实践与认识论、方法论反思

概述笔者从事两项复杂性问题研究的认识与实践 :一是辩证唯物论认识论的指导作用与系统科学的中介作用 ,不容忽视 ;二是在预测和控制某些复杂系统行为的研究中 ,还原论与整体论结合的一个切入点和一种有效形式 ,是典型信息法。     

T＝∞跟踪问题的一种解法

跟踪问题是线性系统二次型性能指标最优控制讨论的一个重要应用问题。当终端时间T为有限时 ,很多文献都给出了适当的解法 ,但T =∞时的求解还有很多问题值得探讨。本文给出了终端T =∞时预期输出满足一定条件的跟踪问题的一种解法。此种情况可转化为输出调节器问题 ,并给出了具体的求解方法和例子。     

用于分布式识别的语音参数的提取和性能分析

主要研究用于分布式语音识别(DSR)的语音参数的提取方法以及参数性能分析。以前所用到的语音参数大部分是LPC倒谱参数,但其抗噪声性能较差。文中主要讨论了MEL倒谱参数,并在移动通信环境下,比较了两者的性能。     

武汉机场飞行区土方调配大系统优化方案研究

武汉机场是国家重点建设项目。本文提出了机场飞行区土方工程的最优调配问题。它是一个规模庞大的大系统最优规划, 变量多达一千四百九十六个, 一般计算机容量已不够。为此, 在工民建施工领域首次提出了大系统土方调配优化数学模型进行优化, 得出的优化方案可节约经费1073441.29元。所建立的大系统土方调配优化数学模型对工民建等大型土方调配优化有普遍的应用价值。     

奥运会临时超市网点设计模型

给出了2008年北京奥运会临时超市网点的设计模型。根据题目提供的三次问卷调查表,给出了问题一观众的出行、用餐和购物的规律。利用问题一的结论,以最短路径作为观众出行路径原则,得出了问题二的人流量分布。对于问题三,以分布基本均衡作为目标函数,以满足购物需求作为约束条件,给出了临时超市网点设计模型。     

基于信号重构的一种系统仿真方法

本文根据信号重构的思想，提出了一种系统仿真方法。该方法是对时域矩阵仿真方法的扩展，即保留了时域矩阵方法快速性的特点，又提高了仿真精度。文中还对该方法的截断误差做出了估计，并证明了该方法的收敛性。最后，通过仿真例子说明了该方法的有效性。     

Error rates in quadratic discrimination with constraints on the covariance matrices

In multivariate discrimination of several normal populations, the optimal classification procedure is based on quadratic discriminant functions. We compare expected error rates of the quadratic classification procedure if the covariance matrices are estimated under the following four models: (i) arbitrary covariance matrices, (ii) common principal components, (iii) proportional covariance matrices, and (iv) identical covariance matrices. Using Monte Carlo simulation to estimate expected error rates, we study the performance of the four discrimination procedures for five different parameter setups corresponding to standard situations that have been used in the literature. The procedures are examined for sample sizes ranging from 10 to 60, and for two to four groups. Our results quantify the extent to which a parsimonious method reduces error rates, and demonstrate that choosing a simple method of discrimination is often beneficial even if the underlying model assumptions are wrong.The authors wish to thank the editor and three referees for their helpful comments on the first draft of this article. M. J. Schmid supported by grants no. 2.724-0.85 and 2.038-0.86 of the Swiss National Science Foundation.