双轴晶体Nd^3＋：KGd（WO4）2的非偏振吸收光谱研究

报道了用三个方向相互垂直的非偏振吸收光谱测量计算Ｊｕｄｄ－Ｏｆｅｌｔ参数从而算出双轴晶体Ｎｄ３＋ＫＧｄ（ＷＯ４）２的荧光寿命、荧光分支比和发射截面的方法。得到的荧光寿命为１１９μｓ，平均发射截面为２．３×１０－１９ｃｍ２。     

单模光纤的传输衰减随温度变化的研究

本文从实验上测量了单模石英光纤在－50～120℃范围内的损耗。随着温度升高，光纤的损耗随之降低，在常温附近达到最小。其后损耗随着温度的继续升高而增加。损耗的变化主要是由于杂质的吸收和微弯损耗。本文对杂质的吸收以及微弯损耗进行了数值模拟，并且从理论上定性地解释了损耗对温度的依赖关系。     

基于变芯径光纤的光学系统在光造型中的应用

光学系统采用变芯径光纤，可大幅度提高光的传输效率，增加光学子系统柔性。描述了光造型工作原理及其理论依据，在介绍所研制的光的成型系统光学子系统的基础上，阐述了紫外光源的选择与设计，及变芯径光纤的设计、传输、耦合与聚焦等技术。该套基于变芯径光纤的光学子系统成本低、体积小、效率高，巳成功应用于所研制的台式低成本快速成型系统中，为该系统的进一步推广奠定了技术基础。     

矩孔金属光栅矢量模式理论的数值计算

根据矩孔金属光栅的矢量模式理论，计算了不同入射方向，波长及偏振态情况下衍射场的分布，研究了不同光栅结构对衍射效率，偏振态变化的影响；同时，根据实际需要，加工制作了一批不同深度的矩孔光栅样品，进行了实验测量，并将计算值与实验值进行了比较，两者基本相符。     

线列阵甚宽频带恒定束宽的数字实现方法

线性嵌套阵可以很好地在很宽的频率（N个倍频程，N=7）上实现恒定束宽。这种方法设计简单，又节省线阵阵元。本文给出了线性嵌套阵具体的数字化实现方法，解决了FIR滤波器设计，滤波器时间延迟等问题。由于数字化实现过程中使用了很多组FIR滤波器，计算量很大，文章采用了DSP信号处理板实现数字化算法，利用DSP处理板可以多任务同时处理优势，解决了计算量大的问题。经过实验验证，在DSP上实现的数字化的线性嵌套阵宽带恒定束宽方法满足了工程上实时处理的需要。     

Isoparametric, Finite Element Methods for Nonlinear Dirichlet Problem

In this paper, the author solves the nonlinear Dirichlet problem with nonhomo- genous boundary condition by use of the isoparametric finite element method, and obtains the optimal error estimate.     

Corrections of proofs for Hansen and Mélot's two theorems

The Randi? index R(G) of a (chemical) graph G is also called connectivity index. Hansen and Mélot [Variable neighborhood search for extremal graphs 6: analyzing bounds for the connectivity index, J. Chem. Inf. Comput. Sci. 43 (2003) 1-14] in their paper, characterized the chemical trees of given order and number of pendent vertices which have the minimum and maximum Randi? index, respectively. In this note, we point out the mistakes in the proofs of their results Theorems 8 and 10, while we still believe that the two theorems are true, and then we give their corrected proofs.     

UNIQUENESS PROBLEM WITH TRUNCATED MULTIPLICITIES OF MEROMORPHIC MAPPINGS FOR MOVING TARGETS

In this article,two uniqueness theorems of meromorphic mappings on moving targets with truncated multiplicities are proved.     

Towards Strong Duality in Integer Programming

We consider in this paper the Lagrangian dual method for solving general integer programming. New properties of Lagrangian duality are derived by a means of perturbation analysis. In particular, a necessary and sufficient condition for a primal optimal solution to be generated by the Lagrangian relaxation is obtained. The solution properties of Lagrangian relaxation problem are studied systematically. To overcome the difficulties caused by duality gap between the primal problem and the dual problem, we introduce an equivalent reformulation for the primal problem via applying a pth power to the constraints. We prove that this reformulation possesses an asymptotic strong duality property. Primal feasibility and primal optimality of the Lagrangian relaxation problems can be achieved in this reformulation when the parameter p is larger than a threshold value, thus ensuring the existence of an optimal primal-dual pair. We further show that duality gap for this partial pth power reformulation is a strictly decreasing function of p in the case of a single constraint. Dedicated to Professor Alex Rubinov on the occasion of his 65th birthday. Research supported by the Research Grants Council of Hong Kong under Grant CUHK 4214/01E, and the National Natural Science Foundation of China under Grants 79970107 and 10571116.