一种改进的计算探测器校正因子的相关抽样方法

对于小尺寸探测器处于大块介质的情形, 在探测器的校正因子的Monte Carlo模拟中, 存在两个难题: 一是由于探测器尺寸很小粒子难以到达探测器并发生碰撞; 二是两个随机变量比值难以达到要求精度. 本文使用经过改进的粒子碰撞自动重要抽样方法, 再结合相关抽样方法, 解决了这两个难题, 并在MCNP-4C程序平台上加以实现. 除了粒子碰撞自动重要抽样以外, 还选用了其他3种方法: 直接模拟、区域分裂、强迫碰撞+Dxtran球分别与相关抽样方法结合, 对一个简化的探测器校正因子计算模型进行了计算. 实际计算结果表明, 相关抽样方法无论与哪种方法结合, 都起到了提高相关量计算效率的作用; 而它与粒子碰撞自动重要抽样结合, 比其他方法具有明显的优越性.     

Countably compact topological group topologies on free Abelian groups from selective ultrafilters

Tkachenko showed in 1990 the existence of a countably compact group topology on the free Abelian group of size c using CH. Koszmider, Tomita and Watson showed in 2000 the existence of a countably compact group topology on the free Abelian group of size c² using a forcing model in which CH holds.Wallace's question from 1955, asks whether every both-sided cancellative countably compact semigroup is a topological group. A counterexample to Wallace's question has been called a Wallace semigroup. In 1996, Robbie and Svetlichny constructed a Wallace semigroup under CH. In the same year, Tomita constructed a Wallace semigroup from MAcountable.In this note, we show that the examples of Tkachenko, Robbie and Svetlichny, and Koszmider, Tomita and Watson can be obtained using a family of selective ultrafilters. As a corollary, the constructions presented here are compatible with the total failure of Martin's Axiom.     

Predicting automobile claims bodily injury severity with sequential ordered logit models

Despite the large cost of bodily injury (BI) claims in motor insurance, relatively little research has been done in this area. Many companies estimate (and therefore reserve) bodily injury compensation directly from initial medical reports. This practice may underestimate the final cost, because the severity is often assessed during the recovery period. Since the evaluation of this severity is often only qualitative, in this paper we apply an ordered multiple choice model at different moments in the life of a claim reported to an insurance company. We assume that the information available to the insurer does not flow continuously, because it is obtained at different stages. Using a real data set, we show that the application of sequential ordered logit models leads to a significant improvement in the prediction of the BI severity level, compared to the subjective classification that is used in practice. We also show that these results could improve the insurer’s reserves notably.     

p+209Bi核反应微观数据的理论计算

利用光学模型、激光模型、蒸发模型及扭曲波玻恩近似理论,对入射能量从阈能到300MeV,p+²⁰⁹Bi的中子反应截面、剩余核截面、出射粒子的多重数进行了理论计算及分析,并将计算结果与实验数据进行了比较.同时得到一组能量到50?0MeV与实验数据符合很好的光学势参数.     

空位在金刚石近(001)表面扩散的分子动力学模拟

用分子动力学方法模拟了空位在金刚石近(001)表面的扩散过程,研究了温度对空位扩散的影响.结果表明,当温度为1000K左右时,位于近表面第二层上的空位开始向表面运动;当温度在1400—2000K时,空位完全扩散到表面.这与实验结果和其他计算结果符合得很好.同时发现,温度为1400—1800K时,空位的扩散经历了两次迁移运动,其分别对应了均方位移图中的两个极大值.在不施加任何约束的条件下得到了空位的动态扩散路径,空位在金刚石近(001)表面的扩散势垒约为042eV.并探讨了一定温度下空位数目增多及其不同排列 关键词： 金刚石 空位 扩散 分子动力学     

On the construction of samples for testing approximate optimization methods for estimate calculation algorithms

To validate approximate optimization schemes for estimate calculation algorithms (ECAs), it is necessary to compute the optimal height, which cannot be done in a reasonable amount of time. A variety of samples are built for which the optimal height of the ECAs is known by construction.     

Structure and magnetism of bcc(1 1 0)-like Fe films grown on Cu(0 0 1) via ion beam triangulation and spin-polarized electron capture

The structure and magnetism of thin epitaxial Fe layers grown on Cu(0 0 1) is investigated by grazing scattering of fast H and He atoms. Information on the atomic structure of the film and substrate surfaces is obtained by making use of ion beam triangulation with protons. The magnetic behavior is studied via the polarization of light emitted after capture of spin-polarized electrons into excited atomic terms during scattering of He atoms. For the formation of bcc(1 1 0)-like Fe films at higher coverages, we detect differences in structural and magnetic properties for room and low temperature growth. We suggest that the crystalline structure depends on the film morphology and that Cu impurities affect the magnetic properties.     

Packing Non-Zero A-Paths In Group-Labelled Graphs

Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊂V. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem. These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow.