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.     

背包问题最优解的结构

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

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

汽车振动和噪声是影响舒适性的主要因素，如何采用有效的技术手段测量分析汽车的振动、噪声，日益受到人们重视。本文应用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.     

新生代农民工转户意愿及影响因素分析--基于江西省的调查数据

通过对江西省新生代农民工进行随机抽样问卷调查,本文运用多元有序Logistic模型对新生代农民工转户意愿及影响因素进行回归分析。结果显示,年龄、文化程度、是否具有职业资格等级证书、家中耕地亩数、家庭生活水平、家距离工作地点远近程度、家庭居住区域类型、务工居住住所类型对新生代农民工转户意愿有显著影响。基于分析得出的新生代农民工转户意愿影响因素,提出相应的政策建议。     

分数阶区间系统的鲁棒稳定性分析

由于实际的物理系统常会存在各种不确定结构,这些不确定结构给系统的稳定性分析带来了困难和一定的影响,因此对这类带有不确定结构的分数阶系统控制问题的研究,具有广泛的实际应用意义。本文主要针对带有区间不确定性的分数阶控制系统,分析了该系统的鲁棒稳定性问题,首先将区间矩阵用分式线性变换(LFT)表示,然后基于分析得出了此类系统鲁棒稳定的充分必要条件。并给出两个数值算例阐释该方法,仿真结果表明了该方法的有效性。     

A Numerical Study of Diagonally Split Runge–Kutta Methods for PDEs with Discontinuities

Diagonally split Runge–Kutta (DSRK) time discretization methods are a class of implicit time-stepping schemes which offer both high-order convergence and a form of nonlinear stability known as unconditional contractivity. This combination is not possible within the classes of Runge–Kutta or linear multistep methods and therefore appears promising for the strong stability preserving (SSP) time-stepping community which is generally concerned with computing oscillation-free numerical solutions of PDEs. Using a variety of numerical test problems, we show that although second- and third-order unconditionally contractive DSRK methods do preserve the strong stability property for all time step-sizes, they suffer from order reduction at large step-sizes. Indeed, for time-steps larger than those typically chosen for explicit methods, these DSRK methods behave like first-order implicit methods. This is unfortunate, because it is precisely to allow a large time-step that we choose to use implicit methods. These results suggest that unconditionally contractive DSRK methods are limited in usefulness as they are unable to compete with either the first-order backward Euler method for large step-sizes or with Crank–Nicolson or high-order explicit SSP Runge–Kutta methods for smaller step-sizes. We also present stage order conditions for DSRK methods and show that the observed order reduction is associated with the necessarily low stage order of the unconditionally contractive DSRK methods. The work of C.B. Macdonald was partially supported by an NSERC Canada PGS-D scholarship, a grant from NSERC Canada, and a scholarship from the Pacific Institute for the Mathematical Sciences (PIMS). The work of S. Gottlieb was supported by AFOSR grant number FA9550-06-1-0255. The work of S.J. Ruuth was partially supported by a grant from NSERC Canada.     

Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment

This paper studies a generalization of the order acceptance and scheduling problem in a single-machine environment where a pool consisting of firm planned orders as well as potential orders is available from which an over-demanded company can select. The capacity available for processing the accepted orders is limited and each order is characterized by a known processing time, delivery date, revenue and a weight representing a penalty per unit-time delay beyond the delivery date. We prove that the existence of a constant-factor approximation algorithm for this problem is unlikely. We propose two linear formulations that are solved using an IP solver and we devise two exact branch-and-bound procedures able to solve instances with up to 50 jobs within reasonable CPU times. We compare the efficiency and quality of the results obtained using the different solution approaches.