面阵探测器的像点亚像素定位研究

面阵探测器可直接探测点目标图像的位置，但其定位精度受到探测器分辨率的限制。因此，亚像元精度技术得到了发展。它是利用目标像点的灰度分布特性，通过内插细分算法，确定出像点位置。可将定位精度提高1—2个数量级。本文介绍了几种实现目标像点亚像素定位的内插细分算法。对它们的计算公式、特点进行了分析，并进行了实验验证。     

Analysis of a Multiserver Queue with Setup Times

This paper deals with the analysis of an M/M/c queueing system with setup times. This queueing model captures the major characteristics of phenomena occurring in production when the system consists in a set of machines monitored by a single operator. We carry out an extensive analysis of the system including limiting distribution of the system state, waiting time analysis, busy period and maximum queue length. AMS subject classification: 90B22, 60K25     

布尔矩阵维数的缺断区间(英)

本文证明了n维布尔矩阵维数的一个新的缺断区间为这一结果扩充了一些已知的结论．     

矩阵在几何光学中的应用

本文中介绍了适用于几何光学中近轴光线的矩阵方法     

The completely positive and doubly nonnegative completion problems

We prove the following. Let G be an undirected graph. Every partially specified symmetric matrix, the graph of whose specified entries is G and each of whose fully specified submatrices is completely positive (equal to BB^T for some entrywise nonnegative matrix B), may be completed to a completely positive matrix if and only if G is a block-clique graph (a chordal graph in which distinct maximal cliques overlap in at most one vertex). The same result holds for matrices that are doubly nonnegative (entrywise nonnegative and positive semidefinite).     

Approximation by a class of modified Szász-Durrmeyer operators

We modify Szász-Durrmeyer operators by means of three-diagonal generalized matrix which overcomes a difficulty in extending a Berens-Lorentz result to the Szász-Durrmeyer operators for second order of smoothness. The direct and converse theorems for these operators inL _p are also presented by Ditzian-Totik modulus of smoothness.This project is supported by Zhejiang Provincial Foundation of China.     

正方分布的4×4单模光纤熔锥耦合器耦合特性分析

本文以线性耦合波方程为基础,采用散射矩阵的方法讨论了具有正方分布的4×4单模光纤熔锥形耦合器的耦合特性,并与实验作了比较,得到了比较一致的结果。     

A DIRECT METHOD FOR THE UNIT CIRCLE PROBLEM

The unit circle problem is the problem of finding the number of eigenvalues of a non-Hermitian matrix inside and outside the unit circle . To reduce the cost of computing eigenvalues for the problem, a direct method, which is analogous to that given in [5], is proposed in this paper.