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

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

基于几何布朗运动的投资组合模型

在证券的价格过程是几何布朗运动的前提下,建立了最优投资组合的多目标规划模型,使得投资收益最大和投资风险最小,并利用线性加权和法求得有效解.最后用实例进行分析.     

Structural property and function of D-erythro asymmetric chain sphingomyelins as studied by microcalorimetry and electron microscopy

D-erythro sphingomyelines (SM) having a defined acyl chain were synthesized with sphingosylphosphorylcholine as a starting material, and both a structural property and its relating phase transition phenomenon were compared between a symmetric chain length SM (palmitoyl-SM: C16-SM) and asymmetric chain length SMs (behenoyl-SM: C22-SM, lignoceryl-SM: C24-SM). Furthermore, effect of increasing a content of asymmetric chain SMs in the mixture systems of C22-SM/C16-SM, and C24-SM/C16-SM was investigated. The present calorimetric and electron microscopic studies revealed that (1) The main transition enthalpy is smaller for the asymmetric chain SMs than for the symmetric chain SM by about 3 kJ mol⁻¹, although the acyl chain length is longer for the former than for latter; (2) Relatively small size vesicles (100∼200 nm diameters) surrounded by one or more lamellae are observed for the asymmetric chain SMs, in contrast to large multilamellar vesicles (1500∼2500 nm diameters) having at least fifteen stained lamellae for the symmetric chain SM and (3) The coexisting asymmetric chain SMs cause the decrease in size and multiplicity for the MLV of the symmetric chain SM, simultaneously with a decrease in the main transition enthalpy.     

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.     

Transcendental geometric programs

This paper treats a class of posynomial-like functions whose variables may appear also as exponents or in logarithms. It is shown that the resulting programs, called transcendental geometric programs, retain many useful properties of ordinary geometric programs, although the new class of problems need not have unique minima and cannot, in general, be transformed into convex programs. A duality theory, analogous to geometric programming duality, is formulated under somewhat more restrictive conditions. The dual constraints are not all linear, but the notion ofdegrees of difficulty is maintained in its geometric programming sense. One formulation of the dual program is shown to be a generalization of the chemical equilibrium problem where correction factors are added to account for nonideality. Some of the computational difficulties in solving transcendental programs are discussed briefly.This research was partially supported by the National Institute of Health Grant No. GM-14789; Office of Naval Research under Contract No. N00014-75-C-0276; National Science Foundation Grant No. MPS-71-03341 A03; and the US Atomic Energy Commission Contract No. AT(04-3)-326 PA #18.