Simultaneous measurement of glucose and glutamine in aqueous solutions by near infrared spectroscopy

A method is described for measuring the concentrations of both glucose and glutamine in binary mixtures from near infrared (NIR) absorption spectra. Spectra are collected over the range from 5000–4000/cm (2.0–2.5μm) with a 1-mm optical path length. Glucose absorbance features at 4710, 4400, and 4300/cm and glutamine features at 4700, 4580, and 4390/cm provide the analytical information required for the measurement. Multivariate calibration models are generated by using partial least squares (PLS) regression alone and PLS regression combined with a preprocessing digital Fourier filtering step. The ideal number of PLS factors and spectral range are identified separately for each analyte. In addition, the optimum Fourier filter parameters are established for both compounds. The best overall analytical performance is obtained by combining Fourier filtering and PLS regression. Glucose measurements are established over the concentration range from 1.66–59.91 mM, with a standard error of prediction (SEP) of 0.32 mM and a mean percent error of 1.84%. Glutamine can be measured over the concentration range from 1.10–30.65 mM with a SEP of 0.75 mM and a mean percent error of 6.67%. These results demonstrate the analytical utility of NIR spectroscopy for monitoring glucose and glutamine levels in mammalian and insect cell cultures.     

排序集抽样下Inverse Rayleigh分布的Fisher信息量及其在参数估计中的应用

文章分别在简单随机抽样和排序集抽样下研究了Inverse Rayleigh分布中对应样本所含刻度参数θ的Fisher信息量.数值结果表示,同等样本容量的排序集样本比简单随机样本提供更多关于θ的信息.接着分别基于简单随机样本和排序集样本构造了θ的一些优良估计,并对估计结果进行了数值比较.     

On the population monotonicity of independent set games

An independent set game is a cooperative game dealing with profit sharing in the maximum independent set problem. A population monotonic allocation scheme is a rule specifying how to share the profit of each coalition among its participants such that every participant is better off when the coalition expands. In this paper, we provide a necessary and sufficient characterization for independent set games admitting population monotonic allocation schemes. Moreover, our characterization can be verified efficiently.     

6元素集合上T0拓扑总数的计算

文中证明了有限预序集与有限偏序集的一些性质,并基于有限集上的拓扑和其上预序的一一对应关系,利用这些性质通过对极小元和极大元个数进行分类讨论,以一种有别于计算机算法而又容易理解的计算方法得出6元素集合上的T₀拓扑总数为130023.     

回流充气法处理中,高量含铁地下水的研究

本文介绍一种深井回流充气工艺,它兼具充氧和除铁综合性能的新型工艺形式,能改善含铁地下水的过滤性能.在此基础上提出了深井回流充气稳定期的概念,建立了深井回流充气系统中氧量的平衡关系.通过正交试验,提出了处理中、高量含铁地下水的推荐工艺流程和工艺参数.采用χ—射线衍射方法测试了井内铁泥和成熟滤料表面滤膜的成分和形态,分析了"充气"和"过滤》两过程中的除铁机理.     

〔23，12，7〕Golay码的改进译码算法

ＭａｒｉｏＢｌａｕｍ和ＪｅｈｏｓｈｕａＢｒｕｃｋ提出了一种基于［２３,１２,７］Ｇｏｌａｙ码校验矩阵＂设计＂特性的译码算法,和其它的Ｇｏｌａｙ码译码算法相比,这种译码算法的复杂度最小,但它不便于用集成器件实现和不便于完全集成化,作者对该算法进行了改进,使其易于集成实现;同时使［２３,１２,７］Ｇｏｌａｙ码译码算法进一步简化．对其复杂度分析证明,当误码率≤１０％时,作者所设计的译码算法优于其它译码算法。     

Finding normal solutions in piecewise linear programming

Letf: ⁿ (–, ] be a convex polyhedral function. We show that if any standard active set method for quadratic programming (QP) findsx(t)= arg min _x ¦x¦²/2+t f(x) for somet> 0, then its final working set defines a simple equality QP subproblem, whose Lagrange multiplier can be used both for testing ift is large enough forx(t) to coincide with the normal minimizer off, and for increasingt otherwise. The QP subproblem may easily be solved via the matrix factorizations used for findingx(t). This opens up the way for efficient implementations. We also give finite methods for computing the whole trajectory {x(t)} _t 0, minimizingf over an ellipsoid, and choosing penalty parameters inL ₁QP methods for strictly convex QP.This research was supported by the State Committee for Scientific Research under Grant 8S50502206.     

Near-perfect matrices

A 0, 1 matrixA isnear-perfect if the integer hull of the polyhedron {x0: Ax } can be obtained by adding one extra (rank) constraint. We show that in general, such matrices arise as the cliquenode incidence matrices of graphs. We give a colouring-like characterization of the corresponding class of near-perfect graphs which shows that one need only check integrality of a certain linear program for each 0, 1, 2-valued objective function. This in contrast with perfect matrices where it is sufficient to check 0, 1-valued objective functions. We also make the following conjecture: a graph is near-perfect if and only if sequentially lifting any rank inequality associated with a minimally imperfect graph results in the rank inequality for the whole graph. We show that the conjecture is implied by the Strong Perfect Graph Conjecture. (It is also shown to hold for graphs with no stable set of size eleven.) Our results are used to strengthen (and give a new proof of) a theorem of Padberg. This results in a new characterization of minimally imperfect graphs: a graph is minimally imperfect if and only if both the graph and its complement are near-perfect.The research has partially been done when the author visited Mathematic Centrum, CWI, Amsterdam, The Netherlands.     

Initial data truncation for multivariate output of discrete-event simulations using the Kalman filter

Data truncation is a commonly accepted method of dealing with initialization bias in discrete-event simulation. An algorithm for determining the appropriate initial-data truncation point for multivariate output is proposed. The technique entails averaging across independent replications and estimating a steady-state output model in a state-space framework. A Bayesian technique called Multiple Model Adaptive Estimation (MMAE) is applied to compute a time varying estimate of the output's steady-state mean vector. This MMAE implementation features the use, in paralle, of a bank of Kalman filters. Each filter is constructed under a different assumption concerning the output's steady-state mean vector. One of the filters assumes that the steady-state mean vector is accurately reflected by an estimate, called the assumed steady-state mean vector, taken from the last half of the simulation data. As the filters process the output through the effective transient, this particular filter becomes more likely (in a Bayesian sense) to be the best filter to represent the data and the MMAE mean estimator is influenced increasingly towards the assumed steady-state mean vector. The estimated truncation point is selected when a norm of the MMAE mean vector estimate is within a small tolerance of the assumed steady-state mean vector. A Monte Carlo analysis using data from simulations of open and closed queueing models is used to evaluate the technique. The evaluation criteria include the ability to construct accurate and reliable confidence regions for the mean response vector based on the truncated sequences.