脱镁叶绿素a和脱镁叶绿素b的联合同步荧光分析法

建立了脱镁叶绿素a和脱镁叶绿素b的联合同步荧光分析法。方法简便快速。脱镁叶绿素a和脱镁叶绿素b的线性范围分别为0～400ng/ml和0～200ng/ml,检出限分别为1ng/ml和0.5ng/ml。     

Constrained control for uncertain linear systems

The linear state feedback synthesis problem for uncertain linear systems with state and control constraints is considered. We assume that the uncertainties are present in both the state and input matrices and they are bounded. The main goal is to find a linear control law assuring that both state and input constraints are fulfilled at each time. The problem is solved by confining the state within a compact and convex positively invariant set contained in the allowable state region.It is shown that, if the controls, the state, and the uncertainties are subject to linear inequality constraints and if a candidate compact and convex polyhedral set is assigned, a feedback matrix assuring that this region is positively invariant for the closed-loop system is found as a solution of a set of linear inequalities for both continuous and discrete time design problems.These results are extended to the case in which additive disturbances are present. The relationship between positive invariance and system stability is investigated and conditions for the existence of positively invariant regions of the polyhedral type are given.The author is grateful to Drs. Vito Cerone and Roberto Tempo for their comments.     

Special representations of the group SP(4,q) with minimal degrees

Let G be a finite group. Let p(G) denote the minimal degree of a faithful permutation representation ofG and let q(G) and c(G) denote the minimal degree of a faithful representation of G by quasi-permutation matrices over the rational and the complex numbers, respectively. Finally r(G) denotes the minimal degree of a faithful rational valued complex character of G. The purpose of this paper is to calculate p(G), q(G), c(G) and r(G) for the group SP(4,q). This revised version was published online in June 2006 with corrections to the Cover Date.     

纯量反馈系统同时强镇定的充分条件

一个稳定的补偿器可同时镇定n个对象(同时强镇定)等价于一个补偿器(不一定稳定)同时镇定n 1个对象(同时镇定)．两个以上对象的同时强镇定和三个以上对象的伺时镇定是线性系统中一个急待解决的公开问题．文中所作的基本假定是所有的对象具有相同的简单不稳定零点，在此条件下给出了n个对象同时强镇定的一个充分条件．当仅有一个不稳定零点时．容易检验是否同时强镇定，否则仅需确定n个对象的不稳定零点并且判定由不稳定零点导出一个相应矩阵是正定的，就能判定n个对象同时强镇定．因此是一个易于检验的充分条件．文章同时给出了n个对象同时强镇定的算法，丰富了同时强镇定的充分条件．     

The lay-out of the photon collider at the international linear collider

One of the interaction regions at the linear colliders should be compatible both with e ⁺ e ⁻ and γγ, γe modes of operation. In this paper, the differences in requirements and possible design solutions are discussed.      

On the approximation of convex functions by Bernstein-type operators

As a consequence of Jensen's inequality, centered operators of probabilistic type (also called Bernstein-type operators) approximate convex functions from above. Starting from this fact, we consider several pairs of classical operators and determine, in each case, which one is better to approximate convex functions. In almost all the discussed examples, the conclusion follows from a simple argument concerning composition of operators. However, when comparing Szász-Mirakyan operators with Bernstein operators over the positive semi-axis, the result is derived from the convex ordering of the involved probability distributions. Analogous results for non-centered operators are also considered.     

����Լ���������������MinimaxԤ��

本文研究了独立随机变量之和的绝对矩的几个性质, 其中包括$\ep|X+Y|-\ep|X-Y|$的表达式, 这里$X$和$Y$是相互独立的随机变量.     

一类多元Gauss-Weierstrass 算子线性组合的加权Lp-逼近

本文研究一类多元Gauss-Weierstrass算子的线性组合加Jacobi型权逼近的性质,利用加权矩量不等式及加权K-泛函、光滑模等工具,建立了这类算子在Lp(1≤p≤∞)空间的正、逆定理和逼近阶的特征刻划.     

相关系数与相关性度量

研究了度量相关性的两个主要工具:线性相关系数和尾部相关系数.线性相关系数反映了变量间的线性相关性,这对于一般的椭圆型分布是合适的.但如果随机变量具有不对称的尾部变化特征时,要用尾部相关系数描述它们之间的相关性.通过相关函数C opu la,对沪深股市的尾部相关系数进行了定量分析.结果表明:沪深股市具有较强的相关性.     

Linear least squares problems with data over incomplete grids

The paper addresses bivariate surface fitting problems, where data points lie on the vertices of a rectangular grid. Efficient and stable algorithms can be found in the literature to solve such problems. If data values are missing at some grid points, there exists a computational method for finding a least squares spline by fixing appropriate values for the missing data. We extended this technique to arbitrary least squares problems as well as to linear least squares problems with linear equality constraints. Numerical examples are given to show the effectiveness of the technique presented. AMS subject classification (2000)  65D05, 65D07, 65D10, 65F05, 65F20