HIRFL–CSR加速器中束流与真空中剩余气体的碰撞损失

研究了重离子加速器中束流与真空中剩余气体的碰撞损失过程和碰撞截面,在依据大量实验数据的基础上,提出了一组计算离子一原子的电荷交换截面的经验公式.以兰州重离子加速器HDRFL及冷却储存环CSR为例,给出了依据碰撞截面的公式计算束流在加速器真空中的传输效率的方法,并计算了在不同真空度下HIRFL的ECR源轴向注入束运线、注入器SFC、前束运线、主加速器SSC和后束运线等不同加速阶段及CSR的传输效率,并提出合理的真空度要求.HIRFL的真空分布测量和束流的损失测量证明了该计算方法的可靠性.     

超尺寸物品装箱问题及其算法

本文探讨一类新装箱问题-超尺寸物品装箱问题。针对实际解决该问题的两涉法，我们提出了一个评价效率更高的目标函数，证明了在此目标函数下两步法的渐近最坏比不小于2，并给出了渐近量坏比与拆分次数的关系。最后本文提出了一种不同于两步法的新在线算法MA，证明了在新目标函数下其渐近最坏比不超过7/4。     

Effect of the Parameters of Three-Mirror Resonators on the Spectral Characteristics of Single-Pulse Laser Generation with Self-Injection of Priming Radiation

Based on a semiclassical theory, investigations were made of the dynamics and spectral composition of pulsed generation with self-injection of priming radiation from the active part of a three-mirror linear resonator, the passive part of which contains an active loss modulator and serves as the output reflector of the laser. It is shown that there exists a range of resonator parameters at which pulsed lasing has virtually a single frequency irrespective of the detuning of the frequencies of the priming radiation and of the nearest eigenmode of the composite resonator. Considering graphically the phase conditions of generation, it is established that among pulsed lasers with self-injection of priming radiation which are constructed on the basis of three-mirror linear and branched resonators, the most efficient for creating single-frequency generation are those in which the length of the main resonator, where generation of the pulse occurs, is larger than the length of the additional one intended for forming the priming radiation. With an inverse ratio of the lengths of the resonators, the conditions of single-frequency pulsed generation becomes dependent on the priming radiation frequency.     

A Novel Biomass Supported Na2CO3 System for Flue Gas Desulfurization

The breakthrough and stoichiometric SO2 adsorption efficiencies of a biomass supported Na2CO3 system (80 wt %Na2CO3/straw) have reached 48.9% and 80.6% respectively at a desulfurization temperature of 80℃.     

一种新的WDM光网中的共享链路保护策略

研究了WDM光网中的链路保护问题.提出了一种新的共享链路保护策略--基于SRLG的共享链路保护策略(SRLG-SLP).SRLG(共享风险链路组)定义了对一条工作光通道分配保护资源时的资源可用性的约束.它规定任意两条有着同样故障风险或者说处于同一个SRLG的工作光通道不能利用同样的保护资源.另外,还提出了一种更加符合实际的单链路故障模型,其中链路故障间隔时间和链路故障保持时间被考虑作为两个独立的变量.基于该链路故障模型,通过大量的仿真试验,比较了专用链路保护(DLP)、共享链路保护(SLP)和提出的SRLG-SLP保护策略的资源利用率、保护效率以及业务中断率.结果显示,我们提出的SRLG-SLP在保护效率和业务中断率方面的保护性能远好于DLP和SLP,但会牺牲一些资源利用率.     

Large scale petroleum reservoir simulation and parallel preconditioning algorithms research

Solving large scale linear systems efficiently plays an important role in a petroleum reservoir simulator, and the key part is how to choose an effective parallel preconditioner. Properly choosing a good preconditioner has been beyond the pure algebraic field. An integrated preconditioner should include such components as physical background, characteristics of PDE mathematical model, nonlinear solving method, linear     

PACKING PAIRS BY QUINTUPLES:THE CASE OF ZERO CONGRUENCE MOD 4

ＰＡＣＫＩＮＧＰＡＩＲＳＢＹＱＵＩＮＴＵＰＬＥＳ：ＴＨＥＣＡＳＥＯＦＺＥＲＯＣＯＮＧＲＵＥＮＣＥＭＯＤ４ＹＩＮＪＩＡＮＸＩＮＧＡｂｓｔｒａｃｔ：ＬｅｔＤ（ｖ）ｄｅｎｏｔｅｔｈｅｍａｘｉｍｕｍｎｕｍｂｅｒｏｆｑｕｉｎｔｕｐｌｅｓｏｆａｖ－ｓｅｔｏｆｐｏ...     

Stationary Distribution Function Estimation for Ergodic Diffusion Process

The problem of nonparametric stationary distribution function estimation by the observations of an ergodic diffusion process is considered. The local asymptotic minimax lower bound on the risk of all the estimators is found and it is proved that the empirical distribution function is asymptotically efficient in the sense of this bound.     

一种新型的二元光学器件——多位相光束分束器的制作

本文报道了用于多光束分束器的反射式16位相值二元光学器件的制作。该二元光学器件把一束光束分成5×5光束阵列。测量的衍射效率为76.16%,接近理论设计值79.68%。该二元光学器件的有效孔径为10mm×10mm。     

A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms

This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems (MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented. An erratum to this article is available at .