smoothing document language model with local word graph

ACM SIGIR; ACM SIGWEB

Beam matching between SFC and SSC

The beam matching status between the two isochronous cyclotrons in the Heavy Ion Research Facility at the Lanzhou-Cooling Storage Ring (HIRFL-CSR) is described. Several methods which can be used to accomplish 100% matching are proposed. By comparing of them, the best method is determined. The advantage due to this method is discussed.

Refinement of edge-to-edge matching model and its application in the Mg17Al12/alpha-Mg and alpha-Y/alpha-Mg systems

A refined version of the edge-to-edge matching model is described here. In the original model, the matching directions were obtained from the planes with all the atomic centers that were exactly in the plane, or the distance from the atomic center to the plane which was less than the atomic radius. The direction-matching pairs were the match of straight rows-straight rows and zigzag rows-zigzag rows. In the refined model, the matching directions were obtained from the planes with all the atomic centers that were exactly in the plane.

Extended application of edge-to-edge matching model to HCP/HCP (alpha-Mg/MgZn2) system in magnesium alloys

In the present work, the edge-to-edge matching model has been introduced to predict the orientation relationships (OR) between the MgZn2 phase which has hexagonal close packed (HCP) structure and the HCP a-Mg matrix. Based on the crystal structures and lattice parameters only, the model has predicted the two most preferred ORs and they are: (1) [1 1 2 3](alpha-Mg) vertical bar vertical bar]1 1 2 3](alpha-Mg), (0 0 0 1)(alpha-Mg) 0.27 degrees from (0 0 0 1)(MgZn2), (1 0 1 1)(alpha-Mg) 26.18 degrees from (1 1 2 2)(MgZn2), (2) [1 0 1 0](alpha-Mg),vertical bar vertical bar[1 1 2 0](MgZn2), (0 0 0 1)(alpha-Mg) vertical bar vertical bar(0 0 0 1)(MgZn2), (1 0 1 1)(alpha-Mg) 3.28 degrees from ( 1 1 2 2)(MgZn2). Four experimental ORs have been reported in the alpha-Mg/MgZn2 system, and the most frequently reported one is ideally the OR (2). The other three experimental ORs are near versions of the OR (2). The habit plane of the OR (2) has been predicted and it agrees well with the experimental results.

The study on automorphism group of ESESOC

It is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. In this paper, an algorithm was developed by the all-paths topological symmetry algorithm to build the automorphism group of a chemical graph. A comparison of several topological symmetry algorithms reveals that the all-paths algorithm (APA) could yield the correct class of a chemical graph. It lays a foundation for the ESESOC system in computer-aided structure elucidation.

The statistic inversion algorithms of water constituents for the Huanghai Sea and the East China Sea

A group of statistical algorithms are proposed for the inversion of the three major components of Case-H waters in the coastal area of the Huanghai Sea and the East China Sea. The algorithms are based on the in situ data collected in the spring of 2003 with strict quality assurance according to NASA ocean bio-optic protocols. These algorithms are the first ones with quantitative confidence that can be applied for the area. The average relative error of the inversed and in situ measured components' concentrations are: Chl-a about 37%, total suspended matter (TSM) about 25%, respectively. This preliminary result is quite satisfactory for Case-H waters, although some aspects in the model need further study. The sensitivity of the input error of 5% to remote sensing reflectance (Rrs) is also analyzed and it shows the algorithms are quite stable. The algorithms show a large difference with Tassan's local SeaWiFS algorithms for different waters, except for the Chl-a algorithm.

立体视觉中误匹配滤波方法的研究

从二维空间和三维空间2种角度研究误匹配滤波算法,提出在匹配前用于降低误匹配的灰度预处理算法和一种基于真实控制点的视差滤波算法。前者只针对2幅图像的重叠区域进行灰度均衡,可以减少计算量,后者在传统视差均值滤波的基础上可进一步提高误匹配的滤波效率。基于真实图像的实验结果表明,新算法可以有效滤除误匹配,提高三维重建精度,保证重建效果。

基于初等运动的多机器人避碰及死锁预防

该文以一实际应用为背景提出了多移动机器人避碰及死锁预防算法 ,该算法将机器人的运行环境形式化地描述为初等运动集、冲突图、总任务集及机器人作业集 ,利用集合论、图论的有关方法及技术实现了多机器人间的避碰与死锁预防 .当机器人的运行环境改变时 ,只需要对相应的集合描述文件进行修改 ,而不用对程序做任何改动 .算法的另一个特点是利用避碰算法巧妙地完成了死锁预防 .仿真和实际运行证明了该算法高效可靠 .