Controlling quantum coherence of atom laser by light with strong strength

A new method for controlling the quantum coherence of atom laser by applying input light with strong strength is presented within the framework of quantum dynamical theory. Unlike the case of rotating wave approximation(RWA), we show that the non-classical properties, such as sub-Poisson distribution and quadrature squeezed effect, can appear in the output atom laser beam with time. By choosing suitable initial RF phase, a steady and brighter output of squeezed coherent atom laser is also available.     

可重构制造系统重组过程中设备选择模型的研究

根据生产任务选择加工设备进行制造资源重组是实现可重构制造系统的关键问题之一，由于设备的选择涉及到多种因素，既有定量指标，又有定性指标，传统的依靠人工经验的方法显得力不从心。本文首先结合实际情况，提出了一套设备选择评价体系，通过对模糊判断矩阵采用最小对数二乘法确定各评价因素的权重系数，针对定性指标和定量指标采用不同的方法确定其性能指标值，通过模糊积分对评判指标进行综合评判，最后进行了实例研究。所提出的方法有效地简化了决策过程，为可重构制造系统设备选择提供了一套行之有效的方法。     

一类机器人系统的最优控制

本文通过把结构阻尼系数当作控制变量来讨论一类弹性机器人系统的最优控制问题 ,并利用Banach空间几何性质证明了最优控制元的存在唯一性     

A Language for Teaching Discrete-event Simulation

Courses which teach discrete-event simulation are based on many different simulation languages. The requirements for a language to support teaching simulation are discussed. In particular, it is recommended that such languages separate into distinct modules those aspects of simulation which are taught as separate topics. Implementation of the separation is discussed. The SEESIM language, developed as a teaching aid, is described, and examples of its use are given. Straightforward use of SEESIM can be learned quickly, yet the language provides facilities for a staged introduction to advanced concepts of simulation.     

铝互连线的电迁移问题及超深亚微米技术下的挑战

铝互连线的电迁移问题历来是微电子产业的研究热点，其面临的电迁移可靠性挑战也是芯片制造业最持久和最重要的挑战之一.从20世纪90年代开始，超深亚微米(特征尺寸≤0.18 μm)铝互连技术面临了更加复杂的电迁移可靠性问题.从电迁移理论出发，分析概括了铝互连电迁移问题的研究方法，总结了上世纪至今关于铝互连电迁移问题的主要经验；最后结合已知的结论和目前芯片制造业现状，分析了当前超深亚微米铝互连线电迁移可靠性挑战的原因和表现形式，提出了解决这些问题的总方向. 关键词： 电迁移 铝互连 微结构     

The operational performance of the Yale ESTU

The ESTU began operation in 1988 and achieved the design voltage of 20 MV in 1990. Since that time, improvements to the gas handling system, negative ion injector, accelerator terminal and control system have greatly increased its capability and reliability. Today, the ESTU can efficiently produce an extensive assortment of stable ions at wide-ranging energies in support of low-energy nuclear physics.     

Application of pressure sensitive paint measurement to a low-solidity cascade diffuser of a transonic centrifugal compressor

A pressure sensitive paint (PSP) measurement has been known as a pressure field measurement technique based on the oxygen quenching phenomenon of luminescence of specific luminophores. A PSP measurement was applied for pressure field measurement in a low-solidity circular cascade diffuser of a single-stage transonic centrifugal compressor with 5 in pressure ratio for HFC134a gas. The oxygen concentration was about 500 ppm. Ru (bath-phen) was adsorbed on a silica-gel thinlayer chromatography sheet, and the sheet was pasted onto the side-wall between the cascade vanes. A drastic change in luminescent intensity was recognized during a surge condition. Also the pressure variations based on luminescent intensity agreed well with the pressure fluctuations measured using a semiconductor pressure sensor with high-frequency-response. It was shown that a PSP measurement worked well to investigate the unsteady pressure fields in a circular cascade diffuser of a transonic centrifugal compressor. Moreover, the time response of PSP becomes clear as a problem to be overcome for the present.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.