ICP－AES法测定金属矿产品中的磷

本文研究了铁矿石、铬矿石、锰矿石中的微量磷的电感耦合等离子体发射光谱法的测定。方法简便，具有很好的精密度和准确度。标准样品的分析结果基本与标称值相吻合，回收率在９５％－１０５％之间。     

On Some Integral Equations in Hilbert Space with an Application to the Theory of Elasticity

A Volterra type integral equation in a Hilbert space with an additional linear operator L and a spectral parameter depending on time is considered. If the parameter does not belong to the spectrum of L unconditional solvability of the considered problem is proved. In the case where the initial value of the parameter coincides with some isolated point of the spectrum of the operator L sufficient conditions for solvability are established. The obtained results are applied to the partial integral equations associated with a contact problem of the theory of elasticity.     

Commutant Lifting Theorem for the Bergman Space

The central question of this paper is the one of finding the right analogue of the Commutant Lifting Theorem for the Bergman space L_a². We also analyze the analogous problem for weighted Bergman spaces L_a,α², − 1 < α < ∞.     

对位酚类衍生物作为化学发光分析的增强剂研究

在化学发光分析中，常常要用到碱性条件下鲁米诺与过氧化氢的反应系统，通过催化剂辣根过氧化物酶使反应顺利进行。如果再加入适当的增强剂，则灵敏度提高且发光时间延长，可改善测定的重现性。实验证明，对位酚类衍生物，如：对叔丁基苯酚，对甲苯酚的发光增强作用明显，其发光效率可上升几十倍，发光时间也获得有效延长。     

Syntactic characterization of closure under connected limits

Summary We give a syntactic characterization of (finitary) theories whose categories of models are closed under the formation of connected limits (respectively the formation of pullbacks and substructures) in the category of all structures. They are also those theories whose consistent extensions by new atomic facts admit in each component an initial structure (respectively an initial term structure), and also thoseT for whichM(T) is locally finitely multi-presentable in a canonical way. We also show that these two properties of theories are nonuniform.     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.     

Fibrations of bigroupoids

Using Brown's construction (J. Algebra 15 (1970) 103) of an exact 6-term sequence for a fibration of groupoids we show how an exact 9-term sequence can be associated to a fibration of bigroupoids. Applications to topology and algebra are given.     

On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance

The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the rooted subtree prune and regraft distance between two rooted binary phylogenetic trees on the same label set is NP-hard. This resolves a longstanding open problem. Furthermore, we show that this distance is fixed parameter tractable when parameterised by the distance between the two trees.Received March 16, 2004     

Cochran's statistical theorem for outer inverses of matrices and matrix quadratic forms

We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures.