同步N—策略多重休假M／M／c排队

研究了具有同步N-策略多重休假的M／M／c排队系统．在休假时间服从相型（PH）分布的假设下，给出了系统的稳态指标．证明在已知服务台全忙并且系统中顾客数大于或等于N的条件下，条件随机变量可分解成独立随机变量之和，其中一个是无休假经典M／M／c系统中的对应条件变量，另一个是休假引起的附加随机变量     

不同模板剂合成SAPO-34分子筛的表征与热分解过程研究

采用XRD、SEM、FT IR、TG DTA等表征手段 ,对分别以正磷酸、拟薄水铝石和硅溶胶为磷源、铝源和硅源 ,用五种模板剂合成的SAPO 34分子筛进行了表征 .不同模板剂合成的SAPO 34分子筛在晶粒粒度分布上有相当大的差异 .通过TEAOH Et3 N或者TEAOH Morpholine复合模板剂法可以有效地调节晶粒粒度 .不同模板剂合成的SAPO 34分子筛的红外骨架振动相似 ;而模板剂分子与分子筛骨架的作用方式有区别 .模板剂种类对SAPO 34分子筛骨架热稳定性没有影响 ,但对其热分解的行为有影响     

Finitely Additive Supermartingales

The concept of finitely additive supermartingales, originally due to Bochner, is revived and developed. We exploit it to study measure decompositions over filtered probability spaces and the properties of the associated Doléans-Dade measure. We obtain versions of the Doob–Meyer decomposition and, as an application, we establish a version of the Bichteler and Dellacherie theorem with no exogenous probability measure. I am indebted to an anonymous referee for several helping suggestions.     

矩阵奇异值分解理论在中文文本分类中的应用

用改进的截断与转换的矩阵奇异值分解算法,设计实现了基于字频特征的中文文本分类器.理论分析与实验结果表明,采用的方法提高了数值计算精度,降低了文本集特征空间的维数,简化了文本分类算法的时间复杂度,提高了文本分类准确率.     

Kinetics of decomposition pathways of an energetic GZT molecule

This investigation uses the Gaussian 98 program, density functional theory (DFT) B3LYP/6‐31G(d,p), and ab initio MP2/6‐31G(d,p) and HF/6‐31G(d) methods to model energetic diguanidinium 5,5′‐azotetrazolate (GZT) ionic species in order to determine their decomposition mechanisms. GZT was initially cracked into two guanidinium cations (G⁺) and a 5,5′‐azotetrazolate anion (ZT^2?). Three routes—the elimination of a hydronium ion (H⁺), the elimination of a hydrogen radical (H·), and the elimination of an amine radical (·NH₂)—are suggested for the decomposition of the G⁺ cation, and three routes—single ring opening, double ring opening and N? N bond cleavage outside the ring—are proposed for the further decomposition of the ZT^2? anion. Fourteen decomposition species were obtained on splitting both the cation and anion. This result reveals the reliability of the aforementioned decomposition mechanisms. The transition state species were also obtained using a two‐structure or three‐structure synchronous transit‐guided quasi‐Newton (STQN) between the Cartesian coordinates of related particles at specific decomposition stages in this research. The corresponding activation energies in all decomposition stages were considered to infer the most feasible pathways of GZT decomposition. © 2007 Wiley Periodicals, Inc. Int J Quantum Chem, 2008     

On the convergence of stochastic dual dynamic programming and related methods

We discuss the almost-sure convergence of a broad class of sampling algorithms for multistage stochastic linear programs. We provide a convergence proof based on the finiteness of the set of distinct cut coefficients. This differs from existing published proofs in that it does not require a restrictive assumption.     

Numerical solutions of the space‐time fractional advection‐dispersion equation

Fractional advection‐dispersion equations are used in groundwater hydrologhy to model the transport of passive tracers carried by fluid flow in a porous medium. In this paper we present two reliable algorithms, the Adomian decomposition method and variational iteration method, to construct numerical solutions of the space‐time fractional advection‐dispersion equation in the form of a rabidly convergent series with easily computable components. The fractional derivatives are described in the Caputo sense. Some examples are given. Numerical results show that the two approaches are easy to implement and accurate when applied to space‐time fractional advection‐dispersion equations. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008     

Stochastic programming for nurse assignment

We present a brief overview of four phases of nurse planning. For the last phase, which assigns nurses to patients, a stochastic integer programming model is developed. A Benders’ decomposition approach is proposed to solve this problem, and a greedy algorithm is employed to solve the recourse subproblem. To improve the efficiency of the algorithm, we introduce sets of valid inequalities to strengthen a relaxed master problem. Computational results are provided based upon data from Baylor Regional Medical Center in Grapevine, Texas. Finally, areas of future research are discussed.     

g-循环矩阵的谱分解和Jordan块结构

首先证明了n级非奇异g-循环矩阵必定可以对角化，并且给出了它的谱分解。其次，当（n,g）=1时，给出了n级奇异g-循环矩阵相似于某些对角阵和某些幂零Jordan块的直和，进一步给出了其中幂零Jordan块的幂零指数的计算法。     

Impact of flexible machines on automated manufacturing systems

Although the problem of scheduling dynamic job shops is well studied, setup and changeover times are often assumed to be negligibly small and therefore ignored. In cases where the product mix changes occur frequently, setup and changeover times are of critical importance. This paper applies some known results from the study of multi-class single-server queues with setup and changeover times to develop an approximation for evaluating the performance of job shops. It is found that the product mix, setup and changeover times, and scheduling rules affect the performance significantly, in particular at high levels of machine utilisation. This approach could be used to determine the required level of flexibility of machines and to choose an appropriate scheduling policy such that production rates remain within acceptable limits for foreseeable changes in the product mix.