基于Powell图的模式识别法建立化学反应速度方程

本文基于Ｐｏｗｅｌｌ图，提出了用模式识别技术中的相似系数法来确定化学反应级数的方法，并给出了计算实例。     

Robustness of classification rules that incorporate additional information

The discrimination problem for two normal populations with the same covariance matrix when additional information on the population is available is considered. A study of the robustness properties against training sample contamination of classification rules that incorporate this additional information is performed. These rules have received recently attention where their total misclassification probability (TMP) is proved to be lower than Fisher's linear discriminant rule. The results of a simulation study on the TMP which compares the behaviour of the new rules against Fisher's rule and some of its robustified versions under different types of contamination are presented. These results show that the rules that incorporate the additional information not only have lower TMP, but they also prevent against some types of contamination. In order to achieve prevention from all types of contamination a robustifed version of these rules is recommended.     

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     

Experiments of Fast Learning with High Order Boltzmann Machines

This work reports the results obtained with the application of High Order Boltzmann Machines without hidden units to construct classifiers for some problems that represent different learning paradigms. The Boltzmann Machine weight updating algorithm remains the same even when some of the units can take values in a discrete set or in a continuous interval. The absence of hidden units and the restriction to classification problems allows for the estimation of the connection statistics, without the computational cost involved in the application of simulated annealing. In this setting, the learning process can be sped up several orders of magnitude with no appreciable loss of quality of the results obtained.     

Order acceptance with weighted tardiness

Over the past decade the strategic importance of order acceptance has been widely recognized in practice as well as academic research. This paper examines order acceptance decisions when capacity is limited, customers receive a discount for late delivery, but early delivery is neither penalized nor rewarded. We model a manufacturing facility that considers a pool of orders, and chooses for processing the subset that results in the highest profit. We present several solution methods, beginning with a straightforward application of an approach which separates sequencing and job acceptance. We then develop an optimal branch-and-bound procedure that uses a linear (integer) relaxation for bounding and performs the sequencing and job acceptance decisions jointly. We develop a variety of fast and high-quality heuristics based on this approach. For small problems, beam search runs almost 20 times faster than the benchmark, with a high degree of accuracy, and a branch-and-bound heuristic using Vogel's method for bounding is over 100 times faster with very high accuracy. For larger problems, a myopic heuristic based on the relaxation runs 2000 times faster than the beam-search benchmark, with comparable accuracy.     

基于复合顺序形态变换的车牌边缘检测

边缘检测是图像分割的重要环节,边缘提取的好坏直接影响了整个图像处理的效果。数学形态学用具有一定形态结构的“结构元素”去度量图像的形态,以解决图像处理和分析问题。文章通过对多种边缘检测方法的分析比较,结合高速公路路口汽车图像噪声大的特点,提出了基于复合顺序形态变换的车牌边缘检测。该方法不但能有效地改善有噪图像边缘检测的效果,鲁棒性好,而且并行快速,便于硬件实现。     

Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines

We consider the scheduling of orders in an environment with m uniform machines in parallel. Each order requests certain amounts of k different product types. Each product type can be produced by any one of the m machines. No setup is required if a machine switches over from one product type to another. Different product types intended for the same order can be produced at the same time (concurrently) on different machines. Each order is released at time zero and has a positive weight. Preemptions are allowed. The completion time of an order is the finish time of the product type that is completed last for that order. The objective is to minimize the total weighted completion time. We propose heuristics for the non-preemptive as well as the preemptive case and obtain worst case bounds that are a function of the number of machines as well as the differences in the speeds of the machines. Even though the worst-case bounds we showed for the two heuristics are not very tight, our experimental results show that they yield solutions that are very close to optimal.     

背包问题最优解的结构

讨论背包问题的最优解,引入背包问题的阶的概念,并对背包问题的阶作出深入的讨论,在此基础上得到背包问题的最优解的一般形式。     

汽车振动噪声测试的阶次跟踪方法

汽车振动和噪声是影响舒适性的主要因素，如何采用有效的技术手段测量分析汽车的振动、噪声，日益受到人们重视。本文应用PULSE多分析系统中的阶次跟踪分析方法，测试分析了车内司机座位处振动、噪声随发动机转速变化的关系，结果发现，对于试验车在测试工况下1．5倍发动机转速时，车内振动和噪声都有一个峰值。文中通过阶次分析，对发动机运转稳定性进行了测试。为降低车内噪声和振动响应提供了分析依据和参考。     

Modeling adsorption and order formation by colloidal particles on a solid surface: A Brownian dynamics study

A three-dimensional simulation model for colloidal dispersion system with an adsorptive surface under a specified bulk concentration was developed basing on the Brownian dynamics technique, and the adsorption process of electrostatically stabilized colloidal particles with radius of 50 nm onto a planar surface with counter charge was simulated. The particle-particle and particle-surface interactions were modeled on the DLVO theory. The adsorbed particles are found to form hexagonally ordered array, only if the surface coverage is above a certain threshold, which varies depending on the ionic strength or the interaction potentials. Through the analysis of the ordered structure, we found that the determinant factor for the order formation is “one-directional average force” acting between adsorbed particles, which exhibits a common value regardless of the ionic strength. Also, looking at the last process for establishing the order, we developed a model that can predict the potential barrier for the order formation. Further, the order formation was proven to be a stochastic phenomenon, and a model to describe the probability against time was developed and its quantitative validity was demonstrated.