Makespan estimation and order acceptance in batch process industries when processing times are uncertain

Batch process industries are characterized by complex precedence relationships between operations, which renders the estimation of an acceptable workload very difficult. A detailed schedule based model can be used for this purpose, but for large problems this may require a prohibitive large amount of computation time. We propose a regression based model to estimate the makespan of a set of jobs. We extend earlier work based on deterministic processing times by considering Erlang-distributed processing times in our model. This regression-based model is used to support customer order acceptance. Three order acceptance policies are compared by means of simulation experiments: a scheduling policy, a workload policy and a regression policy. The results indicate that the performance of the regression policy can compete with the performance of the scheduling policy in situations with high variety in the job mix and high uncertainty in the processing times. Correspondence to: C.V. Ivanescu     

矩形介质波导阵列的一种新型分析方法

本文将等效介电常数近似分析方法在应用范围和处理方法上进行了一些改进．发展为双等效介电常数近似分析法，然后用它来分析矩形介质波导阵列．推得两个一维周期的耦合特征方程。如果将Macatili方法应用范围扩展用来研究该波导阵列也会得到同样的结果，它们都能在二维平面上较准确地反应出通带和阻带等主要周期特性。     

High Accuracy Analysis of the Adini's Nonconforming Element

Received September 14, 2000; revised September 25, 2001     

A Refinement Calculus for Shared-Variable Parallel and Distributed Programming

Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists. Porting an implementation from one machine to another may require substantial changes. This paper addresses some of these problems by developing a formal basis for the design of parallel programs in the form of a refinement calculus. The calculus allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated. Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. The calculus rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality. The calculus straddles both concurrency paradigms, that is, a shared-variable program can be refined into a distributed, message-passing program and vice versa. Received July 2001 / Accepted in revised form May 2002     

标准化钻速法检测地层压力技术的改进与应用

利用钻井资料检测地层压力的方法，基本上都是以泥岩的压实规律为基础，以钻速的变化为根据的。但是在钻井过程中影响钻速的因素很多，可以衡量一种检测方法优劣，主要是看其能否合理、全面地考虑诸多影响因素，能否适用于现场。本文介绍标准化钻速法检测地层压力的基本原理和工作步骤，提出了适用于现场的改进的数学模型和应用方法，并与实测值很接近。     

ATM网VBR编码会议电视业务模型的研究

文章研究了ATM网中VBR编码的会议电视业务的模型，提出一阶自回归、瑞利分布残差而不是高斯分布的AR序列模型──RAR（1），实验表明，该模型能产生足够多的大信元帧数，这对于研究信元丢失率特性具有至关重要的影响，而且简单实用。此外，RAR（1）模型在较少（16个）和较多（128个）VBR信源统计复用时，能很好地拟合实际的会议电视业务的统计数据。     

用奇异模型描述的受限机器人的学习控制

本文了一类受限机器人的迭代学习控制方案，控制器的设计是基于机器人模型的降阶形式。在存在有界未知干扰的情况下，对末端操纵器受线性、无摩擦约束面的受限机器人。本文给出的控制方案保证了机器人系统的完全运动跟踪，同时保证了力跟踪误差有界的，且界的大小是可调节的。     

变井储系数的确定方法及其在反褶积分析中的应用

中针对变井储试井分析问题，给出了确定变井储系数及计算续流量的方法，并用反褶积分析积分析方法解释了未出现径向流的早期测压数据，给出了解决早期试井资料分析问题的有效方法。