充分发挥计算机辅助教学作用

本文就计算机在物理实验方面的辅助教学进行了较为深刻的研究和探索，并提出可行性的方案。     

氙灯泵浦新型晶体Nd∶S－VAP调Q激光器腔内倍频研究

采用氙灯泵浦晶体Ｎｄ∶Ｓ－ＶＡＰ，ＫＴＰ晶体腔内倍频，实现了Ｎｄ∶Ｓ－ＶＡＰ晶体０．５３２５μｍ绿光激光ＢＤＮ染料片调Ｑ运转。测量了输出绿光激光的特性及不同腔长和染料片小信号透过率情况下的输出能量及脉冲宽度，给出了染料片调Ｑ腔内倍频的耦合波方程组，数值求解方程组，所得的理论数据与实验结果很好地相符     

陡前沿脉冲产生的受激布里渊散射稳定性研究

受激布里渊散射转换效率及相位共轭保真度的稳定性与泵浦脉冲的前沿上升时间有关，对前沿上升时间与介质声学声子寿命接近的泵浦脉冲，在泵浦能量超过受激布里渊散射阈值较多时，会造成严重的相位共轭保真度不稳定。本文针对上升前沿时间为２ｎｓ的泵浦脉冲及声学声子寿命的１ｎｓ和ＣＣｌ４介质，在泵浦脉冲前沿根部引入缓慢上升的小信号后，采用振放双池受激布里渊散射相位共轭镜，在泵浦激光能量达到５００倍受激布里渊散射阈值时     

A GENERAL FORM OF THE INCREMENTS OF A TWO-PARAMETER WIENER PROCESS

In this paper,we consider a general form of the increments for a two-parameter Wiener process.Both the Csorgo-Revesz‘s increments and a class of the lag increments are the special cases of this general form of increments.Our results imply the theorem that have been given by Csorgo and Revesz(1978),and some of their conditions are removed.     

Sr1-xLaxTiO3的高温高压合成及XPS研究

 利用高温高压方法合成了有稀土元素La掺杂的钙钛矿氧化物Sr_1-xLa_xTiO₃。XRD测试表明，在x≤0.5时，样品基本为单相，呈立方相；晶胞体积随x的增加而增加，在x=0.4时开始减小。XPS测量发现，样品中存在Ti离子的变价。讨论了Ti离子价态的变化对晶格参数的影响。     

球上加权Bergman空间上的Schatten类Hankel算子

本文给出了超球上加权Ｂｅｒｇｍａｎ空间上Ｈａｎｋｅｌ算子属于Ｓｃｈａｔｔｅｎｐ－类（２≤ｐ＜＋∞）的一个充要条件，推广了文［１０］中的主要结果。     

Scheduling Parts in a Combined Production-transportation Work Cell

This paper is concerned with a combined production-transportation scheduling problem. The problem comprises a simple, two-machine, automated manufacturing cell, which either stands alone or is a subunit of a complete flexible manufacturing system. The cell consists of two machines in series with a dedicated part-handling device such as a crane or robotic arm for transferring parts from the first machine to the second. The loading of a new piece on the first machine and the ejection of a finished piece from the second machine are performed by dedicated automated mechanisms. The introduction of parts into the system is done n at a time, whereby the parts are reshuffled into a sequence that minimizes completion time. All processing and transfer times are considered deterministic—a reasonable assumption for a cell comprising a robotic transfer device and two CNC machining units. What complicates the problem is the assumption of a non-negligible time for the transfer device to return (empty) from the second machine to the first. The operation is a generalization of a two-machine flowshop problem, and is formulated as a specially structured, asymmetric travelling salesman problem. An approximate polynomial time 0(n log n) algorithm is proffered. The procedure incorporates a lower bound using the Gilmore–Gomory algorithm for the no-wait, two-machine flowshop problem.