Coordinating production and distribution of jobs with bundling operations

We consider an integrated scheduling and distribution model in which jobs completed by two different machines must be bundled together for delivery. The objective is to minimize the sum of the delivery cost and customers' waiting costs. Such a model not only attempts to coordinate the job schedules on both machines, but also aims to coordinate the machine schedules with the delivery plan. Polynomial-time heuristics and approximation schemes are developed for the model with only direct shipments as well as the general model with milk-run deliveries.     

激光平网雕刻机设计

研制了用于制作平面网版的激光雕刻机，设计了雕刻机用CO2激光器、光路系统及单片机控制系统，探讨了将图像文件转化为控制命令文件的方法。     

WKB近似下的Fourier衍射成象方法

对于介质目标微波衍射成象，本文引入了ＷＫＢ近似来模拟目标内部总场。基于这种近似，我们导出了Ｆｏｕｒｉｅｒ衍射公式，并采用了广义滤波逆传播方法由目标空间谱实现目标特性的重建。计算机模拟结果表明采用ＷＫＢ近似重建目标特性较Ｂｏｒｎ近似有明显改善。     

The Continuous Interpolating Self-organizing Map

The self-organizing map (SOM) [5] provides a general data approximation method which is suitable for several application domains. The topology preservation is an important feature in data-analysis and may also be advantageous for the evaluation of the data in a function approximation or regression task. For this reason the interpolated self-organizing map (I-SOM) adds an output layer to the SOM architecture which computes a real valued output vector. This paper presents an extension of I-SOM towards a continuous interpolation. It is compared to RBF and to the parametrized self-organizing map.     

快速二阶BP网络及其在城市用水量预测中的应用

针对BP网络收敛速度慢，易导致局部极小值的缺点，提出一种快速二阶BP网络，并以城市年用水量预测为例，与BP网络对比，结果表明，该方法加快了收敛速度，提出了结果的准确度。     

m,m′-二氨基二苯酮与均苯四酸二酐的微波辐射聚合

研究 m,m′-二氨基二苯酮 (m,m′- DABP)与均苯四酸二酐 (PMDA)的缩聚及亚酰化 ,并运用微波辐射和常规加热两种方式对反应进行了比较。考察了微波辐射时间 (功率 )、单体浓度、单体配比和温度等因素对缩聚物的特性粘数、转化率的影响。用红外光谱对亚酰化度进行了表征 ,并用简并四波混频技术首次测量了该缩聚物的三阶光学非线性极化率系数及其响应时间。实验结果表明 ,微波辐射对提高聚合物的特性粘数和转化率都有显著作用 ;合成的缩聚物具有较大的三阶光学非线性极化率系数 (聚酰亚胺的 χ(3) =1.642× 10 -13 esu)和较快的时间响应 (19ps     

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.     

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.     

Software for dynamic reconfigurable order picking systems

This paper describes an approach, conceptual framework, and software architecture for dynamic reconfiguration of the order picking system. The research and development project was sponsored by the Material Handling Research Center (MHRC), a National Science Foundation sponsored Cooperative Industry/University Research Center. The storage configuration is assumed to be an in-the-aisle order picking system in which stockkeeping units (SKUs) can occupy variable capacity storage locations and stock-splitting is allowed among zones (clusters). The product mix may include multiple product families with different life cycles, correlated demand within families and commonality of demand across families.