A Primal-dual Steepest-edge Method for Even-flow Harvest Scheduling Problems

The even-flow harvest scheduling problem arises when the forestry agency has evolved into a rigid non-declining even-flow policy. In this paper, we investigate model formulation and solution strategies for the even-flow harvest scheduling problem. A multiple-objective linear programming problem is formulated for even-flow harvest scheduling problems with multiple-site classes and multiple periods. The aim of this problem is to simultaneously maximize a desired harvest-volume per hectare for each period of planning horizon and the total economic return. A block diagonal constraint structure, with many sets of network sub-problems and a set of coupling constraints, is identified in this linear programming problem. A longest path method for each of network sub-problems and a primal-dual steepest-edge algorithm for the entire problem are developed. The developed algorithm has been coded in Borland C++ and implemented on a personal computer. An illustrative example is used to display the detailed procedure for the developed algorithm and a real-world case study is used to show the trade-off between desired even-flow harvest volume policy and total economic return. Results show the potential benefits of this approach.     

硫化胶交联结构及其性能

综合讨论了聚合物／聚合物之间的交联结构及聚合物／填料之间的偶联结构对硫化胶抗硫化返牟性，抗氧老化性及动态疲劳性能的影响。     

Modeling video sources for real-time scheduling

What is the impact of the autocorrelation of variable-bit-rate (VBR) sources on real-time scheduling algorithms? Our results show that the impact of long term, or interframe, autocorrelation is negligible, while the impact of short term, or intraframe, autocorrelation can be significant. Such results are essentially independent of the video coding scheme employed. To derive these results, video sequences are modeled as a collection of stationary subsequences called scenes. Within a scene, a statistical model is derived for both the sequence of frames and of slices. The model captures the distribution and the autocorrelation function of real-time video data. In previous work, the pseudoperiodicity of the slice level auto-correlation function made it difficult to develop a simple yet accurate model. We present a generalization of previous methods that can easily capture this pseudoperiodicity and is suited for modeling a greater variety of autocorrelation functions. By simply tuning a few parameters, the model reproduces the statistic behavior of sources with different types and levels of correlation on both the frame and the slice level.     

非线性系统鲁棒吸引的动态补偿方法

考虑非线性不确定系统的鲁棒吸引问题,借助于动态输出反馈,构造了两类控制律。这两类控制律分别可使相应的闭环系统被一任意小的区域鲁棒吸引,或被一预先设置的区域有限吸引。     

连续重整装置仿真系统的设计开发

为提高操作人员对连续重整装置开停工及事故处理的熟练程度，并对生产进行指导，采用半机理模型结合设计和现场数据介发的连续重整装置仿真系统已在现场成功投用。介绍了该仿真系统的软硬件结构、动态模型及仿真功能。     

一种新的机器人手臂控制方法

从机器人手臂的关节电机力学出发，本文提出了一种独立于现行机器人关节控制器的离线补偿方法，通过对－２自由度机器人的数值研究，证明该法不仅能有效地克服由于惯性负载，关节间耦合与重力效应给控制系统带来的动态精度问题，而且还可以消除由于控制系统本身的固有特性所决定的系统的跟踪误差。     

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.     

Effects of a Nd—Fe—B magnetic filler on the crystallization of poly(phenylene sulfide)

The crystallization of poly(phenylene sulfide) (PPS) in a polymer–magnetic Nd—Fe—B powder suspension was studied. Isothermal crystallization behavior was analyzed by way of differential scanning calorimetry, and the kinetics were described via the Avrami equation. The Avrami parameters and the crystallization times were strongly affected by both the particle size and the presence of a coupling agent coated on the filler particles. The small Nd—Fe—B particles exhibited long induction and half‐times, whereas the large particles tended to have short crystallization times. Particles ranging from 38 to 150 μ appeared to have similar crystallization times and to have no significant change in the value of Avrami index with melt crystallization temperature. As a result of these analyses, the dynamic mechanical properties were determined to correlate the fundamental polymer crystallization characteristics and the physical properties of the PPS binder. The enhancement of the wetting of the filler to the binder was promoted through the coupling agent, as confirmed by dynamic mechanical testing performed on the samples. The storage modulus typically decreased because of the presence of the uncoated small particles. Conversely, the loss modulus was enhanced because of the presence of the coated small particles in the PPS binder. © 2002 Wiley Periodicals, Inc. J Appl Polym Sci 83: 1091–1102, 2002     

聚醚酰亚胺热焓松弛的分子量依赖关系

采用ＤＳＣ对不同分子量的聚醚酰亚胺的等温及动态热焓松弛行为进行了研究，并以ＫＷＷ方程对实验数据进行了非线性拟合。结果表明，分子量对热焓松弛的影响是由高分子端基引起自由体积的差异所致。不同分子量的聚醚酰亚胺分子具有不同数量的端基，淬冷时端基数目的差异将产生不同数量的过剩自由体积，从而影响松弛热焓及松弛速率、低分子量的聚醚酰亚胺松弛相对较快，且起始热焓高，松弛的表观活化能亦较小。     

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.