Phase measurement accuracy of feedback interferometers

Feedback interferometers are described with specific reference to potential applications in micro-machines. A theoretical analysis is developed to determine the linearity, stability, and noise performance of this type of interferometer. The theoretical analysis was tested using a prototype high-precision feedback interferometer which showed that, at a feedback loop gain which enabled the system to track 6 fringes, the linearity of the interferometer was better than λ/100 and single phase measurements could be made with an accuracy of λ/80.     

Approximating dominant singular triplets of large sparse matrices via modified moments

A procedure for determining a few of the largest singular values and corresponding singular vectors of large sparse matrices is presented. Equivalent eigensystems are solved using a technique originally proposed by Golub and Kent based on the computation of modified moments. The asynchronicity in the computations of moments and eigenvalues makes this method attractive for parallel implementations on a network of workstations. Although no obvious relationship between modified moments and the corresponding eigenvectors is known to exist, a scheme to approximate both eigenvalues and eigenvectors (and subsequently singular values and singular vectors) has been produced. This scheme exploits both modified moments in conjunction with the Chebyshev semi-iterative method and deflation techniques to produce approximate eigenpairs of the equivalent sparse eigensystems. The performance of an ANSI-C implementation of this scheme on a network of UNIX workstations and a 256-processor Cray T3D is presented.This research was supported in part by the National Science Foundation under grant numbers NSF-ASC-92-03004 and NSF-ASC-94-11394.     

An asymptotic minimax risk bound for estimation of a linear functional relationship

We consider estimation of the parameter B in a multivariate linear functional relationship X_i=ξ_i+ξ_1i, Y_i=Bξ_i+ξ_2i, i=1,…,n, where the errors (ζ_1i^′, ζ_2i^′) are independent standard normal and (ξ_i, i ) is a sequence of unknown nonrandom vectors (incidental parameters). If there are no substantial a priori restrictions on the infinite sequence of incidental parameters then asymptotically the model is nonparametric but does not fit into common settings presupposing a parameter from a metric function space. A special result of the local asymptotic minimax type for the m.1.e. of B is proved. The accuracy of the normal approximation for the m.l.e. of order n^−1/2 is also established.     

On a modification of the Clenshaw-Curtis quadrature formula

In this paper we discuss a modification of the Clenshaw-Curtis quadrature formula. It is shown that for integrals, where the integrand may be expanded in a sufficiently rapid convergent Chebyshev series, we may split the sequence of calculated approximations into two sequences, one which approximates the integral from above and one which approximates it from below. Thus, at any step during the calculation we obtain both upper and lower bounds for the true value of the integral.Work performed while the author was working as a visiting scientist at CERN/Geneve.     

B-Splines with Arbitrary Connection Matrices

We consider a space of Chebyshev splines whose left and right derivatives satisfy linear constraints that are given by arbitrary nonsingular connection matrices. We show that for almost all knot sequences such spline spaces have basis functions whose support is equal to the support of the ordinary B-splines with the same knots. Consequently, there are knot insertion and evaluation algorithms analogous to de Boors algorithm for ordinary splines.     

Accurate mass measurement and tandem mass spectrometry of intact globin chains identify the low proportion variant hemoglobin Lepore-Boston-Washington from the blood of a heterozygote

Within a mixture of proteins, minor polymorphic components are difficult to identify using a conventional proteomic approach. Their identification generally requires multi-dimensional separation steps, before or after proteolytic cleavage, followed by sequence analysis of the proteolytic products. In this study, we investigated the potential of tandem mass spectrometry for protein characterization by identifying the delta-beta hybrid human hemoglobin variant Lepore-Boston-Washington using electrospray ionization tandem mass spectrometry. Hemoglobin Lepore-Boston-Washington occurs mainly in heterozygotes, where it comprises approximately 10% of the total non-alpha-chains, the dominant non-alpha-chain being the normal beta (approximately 90%). Furthermore, Hemoglobin Lepore-Boston-Washington has an average molecular mass (15,865.23 Da) that is only 2 Da lower than that of the normal beta-chain (15,867.24 Da). Consequently, it cannot be resolved from the normal beta-chain by mass spectrometry. Here we show how Hemoglobin Lepore-Boston-Washington was identified directly from the diluted blood of a heterozygote by analyzing the product ions from the Lepore-Boston-Washington and normal beta-chain ions without prior separation of the individual chains. This study shows the potential of the tandem mass spectrometry for identifying a minor component in an unseparated mixture of proteins.     

On copositive approximation in some classical spaces of sequences

In this paper the author writes a simple characterization for the best copositive approximation in c; the space of convergent sequences, by elements of finite dimensional Chebyshev subspaces, and shows that it is unique.     

随机Bonhoeffer-Van der Pol系统的随机混沌控制

讨论了具有有界随机参数的随机Bonhoeffer-Van der Pol系统的随机混沌现象，并利用噪声对其进行控制.首先运用Chebyshev多项式逼近的方法，将随机Bonhoeffer-Van der Pol系统转化为等价的确定性系统，使原系统的随机混沌控制问题转换为等价的确定性系统的确定性混沌控制问题，继而可用Lyapunov指数指标来研究等价确定性系统的确定性混沌现象和控制问题.数值结果表明，随机Bonhoeffer-Van der Pol系统的随机混沌现象与相应的确定性Bonhoeffer-Van der Pol系统极为相似.利用噪声控制法可将混沌控制到周期轨道，但是在随机参数及其强度的影响下也呈现出一些特点.     

基于灰度相关的图像匹配算法的改进

针对目前图像匹配算法中存在的匹配精度不高和匹配速度慢的缺点，对基于灰度相关的2类匹配算法——最小误差法和相关系数法进行了改进。最小误差法采用新的ML距离法，提出动态调整阈值的方法，既保证了匹配精度，又避免了局部噪声的影响；相关系数法对相关系数的计算公式进行了简化，并采用三步搜索策略进行匹配，以达到减少计算量和搜索位置的目的。实验证明：改进后的算法，在保证一定匹配精度的条件下，匹配速度大大提高，能够满足实际应用中的实时性要求。