萃取色谱法富集原子吸收法测定环境水中超痕量金属元素──两种萃取剂的比较

本文研究并比较了分别以８－羟基喹啉和巯基苯骈噻唑为萃取剂，以活性硅胶为载体的柱式萃取色谱法对环境水中Ｚｎ、Ｃｕ、Ｐｂ、Ｃｄ、Ｆｅ、Ｃｏ、Ｎｉ和Ｍｎ的最佳富集和洗脱条件。实验证明，后者明显优于前者。以巯基苯骈噻唑为萃取剂的色谱柱对金属元素的吸附具有快速、完全、寿命长和重现性好等特点。在ｐＨ＝７～８之间回收率可达９８％以上，富集倍数为２００倍。     

Echo planar imaging of perfluorocarbons

Emulsions of perfluorotributylamine (FTBA) and perflubron were evaluated for their utility in ¹⁹F echo planar imaging. Fluorine images of the emulsions were obtained in a phantom and two mice that had been predosed. Both agents, but particularly perflubron, show potential for fluorine echo planar studies because of the long spin-spin relaxation times of the CF₃ resonances. High resolution thin slice images obtained in as little as 26.6 ms are presented.     

Riccati-based preconditioner for computing invariant subspaces of large matrices

Summary. This paper introduces and analyzes the convergence properties of a method that computes an approximation to the invariant subspace associated with a group of eigenvalues of a large not necessarily diagonalizable matrix. The method belongs to the family of projection type methods. At each step, it refines the approximate invariant subspace using a linearized Riccati's equation which turns out to be the block analogue of the correction used in the Jacobi-Davidson method. The analysis conducted in this paper shows that the method converges at a rate quasi-quadratic provided that the approximate invariant subspace is close to the exact one. The implementation of the method based on multigrid techniques is also discussed and numerical experiments are reported. Received June 15, 2000 / Revised version received January 22, 2001 / Published online October 17, 2001     

Minimizing the number of transitions with respect to observation equivalence

Labeled transition systems (lts) provide an operational semantics for many specification languages. In order to abstract unrelevant details of lts's, manybehavioural equivalences have been defined; here observation equivalence is considered. We are interested in the following problem:Given a finite lts, which is the minimal observation equivalent lts corresponding to it? It is well known that the number of states of an lts can be minimized by applying arelational coarsest partition algorithm. However, the obtained lts is not unique (up to the renaming of the states): for an lts there may exist several observation equivalent lts's which have the minimal number of states but varying number of transitions. In this paper we show how the number of transitions can be minimized, obtaining a unique lts.     

U-statistics in danach spaces

U-statistics in Banach spaces are considered and thoroughly investigated. The martingale structure, estimates of moments, the law of large numbers, the central limit theorem, the invariance principle, estimates of the rate of convergence, and large deviations are established     

钯作基体改进剂FIA－HG－GFAAS法测定锗及其机理研究

采用钯，钯－镁作基体改进剂，ＦＩＡ－ＨＧ－ＧＦＡＡＳ法成功地测定了锗。灵敏度、精密度和分析速度都得到很大的提高。峰值吸收的特征质量８．０ｐｇ，检出限１０．９ｐｇ，相对标准偏差０．３４％，同时探讨了基体改进剂钯的稳定作用机理及锗在石墨管中的原子化机理。     

REML estimation for binary data in GLMMs

The restricted maximum likelihood (REML) procedure is useful for inferences about variance components in mixed linear models. However, its extension to hierarchical generalized linear models (HGLMs) is often hampered by analytically intractable integrals. Numerical integration such as Gauss-Hermite quadrature (GHQ) is generally not recommended when the dimensionality of the integral is high. With binary data various extensions of the REML method have been suggested, but they have had unsatisfactory biases in estimation. In this paper we propose a statistically and computationally efficient REML procedure for the analysis of binary data, which is applicable over a wide class of models and design structures. We propose a bias-correction method for models such as binary matched pairs and discuss how the REML estimating equations for mixed linear models can be modified to implement more general models.     

On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms

In this paper we design a fast new algorithm for reducing an N × N quasiseparable matrix to upper Hessenberg form via a sequence of N − 2 unitary transformations. The new reduction is especially useful when it is followed by the QR algorithm to obtain a complete set of eigenvalues of the original matrix. In particular, it is shown that in a number of cases some recently devised fast adaptations of the QR method for quasiseparable matrices can benefit from using the proposed reduction as a preprocessing step, yielding lower cost and a simplification of implementation.