硅基两维光子晶体的制备和光子带隙特性

利用反应离子束刻蚀设备制备了硅基的两维空气柱光子晶体，并用红外显微镜测试了样品的 反射谱. 理论上用时域有限差分(FDTD)方法计算了样品的光子带隙，从测试结果看光子带隙 和理论计算的光子带隙符合得很好.  关键词： 光子晶体 光子带隙 反射谱 时域有限差方法     

与q形变玻色算符逆算符相关的相干态及其量子统计性质

讨论了ｑ形变玻色算符的广义逆算符作用于ｑ－相干态所得到的两类量子态的数学及量子统计性质。结果表明，ｑ－相干态的光子激发态不存在压缩但呈现反聚束效应，而ｑ－相干态的光子湮灭态却存在压缩但不呈现反聚束效应。     

计算机辅助电子线路实验的思考与探索

本文介绍了EltctronicWorkbench软件和计算机虚拟仪器系统，采用计算机模拟仿真技术对电子线路实验加以辅助设计和探索。     

一种可实时化的多光谱图像融合系统

在多光谱摄影和光电成像技术基础上，本文提出了一种可实时化的多光谱图像融合系统。与多光谱摄影相比，不仅可实现多光谱实时化摄像，而且光谱响应进一步向近红外延伸，并引入图像处理技术。实验表明：这种技术对于增加系统的识别能力具有明显的作用，可进一步构成不同用途的新型多光谱图像融合系统。     

碱土金属氟卤化物中的Eu3+的荧光光谱特征

本文系统研究了MFX体系中Eu³⁺荧光光谱特征,着重讨论了X^-,M²⁺及杂质缺陷(主要为O^2-)对Eu³⁺发光的影响.     

Dielectric effect on the rf characteristics of a helical groove travelling wave tube

A new type of partial-dielectric-loaded helical groove slow-wave structure (SWS) for millimetre wave travelling wave tube (TWT） is presented in this paper.The radio-frequency characteristics including the dispersion properties,the longitudinal electric field distribution and the beam-wave coupling impedance of this structure are analysed.The results show that the dispersion of the helical groove circuit is weakened,the phase velocity is reduced and the position of the maximum Ez is moved from the mouth to the inside of the groove after partially filling the dielectric materials in the helical groove SWS.Therefore,the dielectric-loaded helical groove SWS is suitable for a multi-beam TWT with broad band and high gain.     

类铜离子的电子碰撞参数及其规律

用准相对论扭曲波方法系统地计算了Ｂａ、Ｎｄ、Ｇｄ、Ｙｂ、Ａｕ、Ｐｂ类铜离子组态能级之间的电子碰撞激发强度Ω（ｎｌ－ｎｌ），３≤ｎ≤７，４≤ｎ≤７，同时给出了高能极限的碰撞强度和外推到阈值的碰撞强度，用最小二乘样条方法拟合了全能域碰撞强度及热平均速率系数。对于一个激发过程，用１０个参数可以得到碰撞电子在任意能量下的碰撞强度以及任意温度下的速率系数。     

Minimizing Maximum Weighted Error for Imprecise Computation Tasks

We consider the problem of preemptively scheduling a set of imprecise computation tasks on m ≥ 1 identical processors, with each task T_i having two weights, w_i and w′_i. Two performance metrics are considered: (1) the maximum w′-weighted error; (2) the total w-weighted error subject to the constraint that the maximum w′-weighted error is minimized. For the problem of minimizing the maximum w′-weighted error, we give an algorithm which runs in O(n³ log²n) time for multiprocessors and O(n²) time for a single processor. For the problem of minimizing the total w-weighted error subject to the constraint that the maximum w′-weighted error is minimized, we give an algorithm which also has the same time complexity.     

RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.