微球动态涂敷状态实时监测光学系统的设计

 介绍了一种可用于实时监测直径0.2～1.0 mm激光核聚变靶球涂敷状态的光学系统的设计，系统采用环形LED照明系统以适合特殊的照明要求，用Petzval型物镜使500 mm处的微球清晰成像于CCD像面上，CCD输出的图像电信号经图像采集卡转换成数字信号，最后该数字信号由计算机进行处理，实现了系统对靶球膜层涂敷作业的自动监控，大大提高了涂敷效率。所设计的系统轴上点最大弥散斑直径为12.6 mm,轴外最大弥散斑直径为15.8 mm，整个视场的像质比较均匀,分辨率较高，对于波长522 nm的光线，场曲和畸变分别小于15 mm和0.012%，像质优良。     

半导体激光器光束准直系统的功率耦合效率

在长距离无线光通信中，接收点光功率密度与光束发散角平方呈反比关系，为了获得小的发散角和大的功率耦合效率，要求准直系统有较大的数值孔径(NA)，但数值孔径过大会增加像差，因此合理设计功率耦合效率与准直系统的数值孔径就非常重要。该文对半导体激光器光束准直系统中功率耦合效率进行了研究，给出了半导体激光器光束功率耦合效率与k(孔径半径与孔径处等效光束半径之比)的关系表达式，并结合激光器光束准直系统，给出了半导体激光器光束功率耦合效率与准直系统数值孔径的关系表达式。该研究结论对于半导体激光器光束准直系统设计具有参考作用。     

大学物理课程网络辅助教学系统的构建与应用

本文介绍了上海交通大学大学物理课程网络辅助教学系统的设计思想、整体结构和主要的功能模块，概述了运用网络辅助教学系统实施“课堂教学＋网络辅助教学”：这种教学模式的应用情况．     

工科物理实验课程改革与实践

针对21世纪实验教学的要求,介绍了开展工科物理实验教学体系与教学内容改革的经验。     

一类含参广义集值拟变分包含组的解的灵敏性分析

本文引入了一类新的含参广义集值拟变分包含组,应用隐预解算子技巧,建立了该类变分包含组与一类不动点问题的等价性,在适当的条件下,分析了含参广义集值拟变分包含组的解的灵敏性,所得结果推广改进了最新文献中的许多结果．     

Surface structures formed by individual adsorption and coadsorption of Mn and Bi on Cu(0 0 1), studied by LEED

We have studied the individual adsorption of Mn and Bi, and their coadsorption on Cu(0 0 1) by low-energy electron diffraction (LEED). For Mn, we have determined the c(2 × 2) structure formed at 300 K, whose structure had been determined by several methods. We reconfirmed by a tensor LEED analysis that it is a substitutional structure and that a previously reported large corrugation (0.30 Å) between substitutional Mn and remaining surface Cu atoms coincides perfectly with the present value. In the individual adsorption of Bi, we have found a c(4 × 2) structure, which is formed by cooling below ∼250 K a surface prepared by Bi deposition of ∼0.25 ML coverage at 300 K where streaky half-order LEED spots appear. The c(4 × 2) structure has been determined by the tensor LEED analysis at 130 K and it is a substitutional structure. In the coadsorption, we found a c(6 × 4) structure, which has been determined by the tensor LEED analysis. It is very similar to the previously determined structure of the c(6 × 4) formed by coadsorption of Mg and Bi, and embedded MnBi₄ clusters are arranged in the top Cu layer instead of MgBi₄. Large lateral displacements of Bi atoms in the c(6 × 4)-(Mn + Bi) suggest that the Mn atoms undergo the size-enhancement caused by their large magnetic moment.     

主成分分析在地区科技竞争力评测中的应用

近年来对于科技竞争力的研究在国内方兴未艾,其中对于科技竞争力的评测是众多学者研究的重点和热点,也是各级决策者最为关心、最为重要的课题之一。本文根据科技竞争力概念和内涵来确定评测指标体系的构成要素,建立了评测指标体系,并利用主成分分析方法对采集来的数据进行分析,得到最终的评测结果。     

On the realization of Riemannian symmetric spaces in Lie groups

In this paper we give a realization of some symmetric space G/K as a closed submanifold P of G. We also give several equivalent representations of the submanifold P. Some properties of the set gK∩P are also discussed, where gK is a coset space in G.     

The number of limit cycles of cubic Hamiltonian system with perturbation

In this paper, by using qualitative analysis, we investigate the number of limit cycles of perturbed cubic Hamiltonian system with perturbation in the form of (2n+2m) or (2n+2m+1)th degree polynomials . We show that the perturbed systems has at most (n+m) limit cycles, and has at most n limit cycles if m=1. If m=1, n=1 and m=1, n=2, the general conditions for the number of existing limit cycles and the stability of the limit cycles will be established, respectively. Such conditions depend on the coefficients of the perturbed terms. In order to illustrate our results, two numerical examples on the location and stability of the limit cycles are given.     

Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities

In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven.