Kinetics of phenol hydrogenation over supported palladium catalyst

Kinetics of vapor phase hydrogenation of phenol to cyclohexanone over Pd/MgO system has been studied in a flow microreactor under normal atmospheric pressure. The reaction rate is found to be negative order with respect to the partial pressure of phenol and has increased from −0.5 to 0.5 with increasing temperature (473 to 563 K). The apparent activation energy (E_a) of the process is found to be close to 65 kJ per mol. On the basis of kinetic results a surface mechanism is proposed.     

可靠性试验样本量和截尾时间的计算

可靠性寿命试验中，一般都因受到费用和时间的限制，因此要用截尾试验获得信息，再据此对其可靠性进行统计推断，用非参数估计的方法探讨了进行可靠性试验的样本量或截尾时间的估计方法。     

可变抽样区间的非参数控制图

最近几年一些学者研究了可变抽样区间的质量控制图。Amin等提出了可变抽样区间(VSI)的非参数控制图———符号 (Sign)统计量图〔1〕。本文在此基础上研究位置VSI符号控制图的制定方法 ,并设计离散VSI符号控制图。符号控制图的优点是对非正态总体亦可应用 ,并且不需要过程方差的信息。本文将所设计的VSI符号控制图同固定抽样区间 (FSI)的常规图作比较 ,并举实例说明符号控制图的应用     

Ⅴ型三能级原子与双模奇偶纠缠相干光场相互作用系统的光子统计性质

本文采用求解Schroedinger方程和数值计算方法，研究了Ⅴ-型三能级原子与双模奇偶纠缠相干光场相互作用系统的光子统计性质，结果表明：此性质与双模奇偶纠缠相干光场的纠缠程度、失谐量、原子的初态以及双模光的平均光子数相关联．     

Weak convergence of the U-statistic and weak invariance of the one-sample rank order statistic for Markov processes and ARMA models

Harel and Puri (1989, J. Multivariate Anal. 29) studied the asymptotic behavior of the U-statistic and the one-sample rank order statistic for nonstationary absolutely regular processes. In this note, we present some applications of these results for Markov processes as well as ARMA processes.     

基于聚类算法实现信号盲分类

本文解决了信号处理、工业控制等领域存在的非平稳信号盲分类问题。在聚类中广泛应用的K-Means算法及其它基于中心的聚类算法有两个共同的缺陷-需要预先确定类数目且随机初始化中心引起性能不稳定。本文提出的算法较好地解决了这两个问题，提高了算法稳定性，实现了非平稳信号盲分类。提取非平稳信号的小波系数作为聚类的样本空间，分析聚类结果的统计偏差以估计类的数目，采用调和均值准则进行分类。最后给出的仿真结果表明本文提出的方法较传统的K-Means算法明显降低分类错误率。     

两个回归函数相等的Bootstrap检验

两个回归参数相等性检验一直是统计界感兴趣的问题之一．在这篇文章中，四个检验统计量被用于度量两曲线的差异，在原假设下统计量的分布采用向量数据的重复抽样来逼近，并给出了—些模拟结果．     

Compact Matrix Expressions for Generalized Wald Tests of Equality of Moment Vectors

Asymptotic chi-squared test statistics for testing the equality of moment vectors are developed. The test statistics proposed are generalized Wald test statistics that specialize for different settings by inserting an appropriate asymptotic variance matrix of sample moments. Scaled test statistics are also considered for dealing with nonstandard conditions. The specialization will be carried out for testing the equality of multinomial populations, and the equality of variance and correlation matrices for both normal and nonnormal data. When testing the equality of correlation matrices, a scaled version of the normal theory chi-squared statistic is proven to be an asymptotically exact chi-squared statistic in the case of elliptical data.     

Scheduling orders for multiple product types to minimize total weighted completion time

We consider the problem of scheduling orders for multiple different product types in an environment with m dedicated machines in parallel. The objective is to minimize the total weighted completion time. Each product type is produced by one and only one of the m dedicated machines; that is, each machine is dedicated to a specific product type. Each order has a weight and may also have a release date. Each order asks for certain amounts of various different product types. The different products for an order can be produced concurrently. Preemptions are not allowed. Even when all orders are available at time 0, the problem has been shown to be strongly NP-hard for any fixed number (?2) of machines. This paper focuses on the design and analysis of efficient heuristics for the case without release dates. Occasionally, however, we extend our results to the case with release dates. The heuristics considered include some that have already been proposed in the literature as well as several new ones. They include various static and dynamic priority rules as well as two more sophisticated LP-based algorithms. We analyze the performance bounds of the priority rules and of the algorithms and present also an in-depth comparative analysis of the various rules and algorithms. The conclusions from this empirical analysis provide insights into the trade-offs with regard to solution quality, speed, and memory space.     

Convergence rates for Markov chain order estimates using EDC criterion

The Efficient Determination Criterion (EDC) generalizes the AIC and BIC criteria and provides a class of consistent estimators for the order of a Markov chain with finite state space. In this note, we derive rates of convergence for the EDC estimates. *Partially supported by CNPq, CAPES/PROCAD, FAPDF/PRONEX, FINATEC and FUNPE/UnB. **Partially supported by CAPES.