一种用于自动标引系统的主题词自动切分方法

该文着重介绍一种知识指导下的主题词自动切分方法，该方法能灵活处理自然主题词、大幅度跳跃及关联词的切分问题，其字面切分精度达９９．３３％，综合切分精度达９８．９１％。     

邻羟基苯基二乙基膦酸酯粉末晶体射线衍射数据的指标化研究

本文提出了简单、直接的改进尝试法,它适用于六方、四方、正交、单斜和三斜晶体的粉末衍射数据的指标化,该方法在偶然或系统消光失去衍射的情况下,也能有效地指标化粉末衍射数据,作者在改进尝试法的基础上采用FORTRAN77计算机语言编写了程序,并用具体实例进行了验证。作者用改进尝试法成功地指标化了未知晶系邻羟基苯基二乙基膦酸酯粉末晶体的X射线衍射数据,由指标化程序得到的点阵参数最后用最小二乘法作了精化,其结果如下:α=12.8705(01)A,b=8.6118(37)(?),c=11.4123(40)(?),β=92.942(77)°,s=4,M_(20=)6.11,D_(obs)=1.218,D_(oal)=1.210,空间群为C_(2h)~1-P2/m,C_2~1-P2或C_3~1-Pm。     

HoGe1.56的结构研究

用Ｘ射线衍射分析法对晶体ＨｏＧｅ１．５６的结构进行了研究，根据实验衍射数据，我们用Ｌｉｐｓｏｎ方法按四方晶系成功地指化了所有谱线，表明ＨｏＧｅ１．５６属四方晶系，其点阵参数为ａ＝４．０５１Ａ和ｃ＝１３．６５１Ａ。     

提高学术论文关键词标引质量探析

从明确在期刊网络化时代，关键词正确标引的重要意义出发，探讨了提高学术论文关键词标引质量的途径。提出在学习掌握关键词的标引原则和方法的前提下，要在实践中不断加强学习、交流和积累，并将关键词标引质量纳入期刊评比和质量管理中，才能提高关键词的标引质量，使学术论文主题突出，一目了然，起到“画龙点睛”的作用．从而最有效地发挥每篇文献应有的作用，     

Converting suffix trees into factor/suffix oracles

Several methods to compress suffix trees were defined, most of them with the aim of obtaining compact (that is, space economical) index structures. Besides this practical aspect, a compression method can reveal structural properties of the resulting data structure, allowing a better understanding of it and a better estimation of its performances.

In this paper, we propose a simple method to compress suffix trees by merging couples of nodes. This idea was already used in the literature in a context different from ours. The originality of our approach is that the nodes we merge are not chosen with respect to their subtrees (which is difficult to test algorithmically), nor with respect to the words spelled along branches (which usually requires testing several branches before finding the good one) but with respect to their position in the tree (which is easy to compute). Another particularity of our method is it needs to read no edge label: it is exclusively based on the topology of the suffix tree. The compact structure resulting after compression is the factor/suffix oracle introduced by Allauzen, Crochemore and Raffinot whose accepted language includes the accepted language of the corresponding suffix tree.

The interest of our paper is therefore threefold:

1. A topology-based compression method is defined for (compact) suffix trees.

2. A new property of a factor/suffix oracle is established, that is, like a DAG, it results from the corresponding suffix tree after a linear number of appropriate node mergings; unlike a DAG, the merged nodes do not necessarily have isomorphical subtrees.

3. A new algorithm to transform a suffix tree into a factor/suffix oracle is given, which has linear running time and thus improves the quadratic complexity previously known for the same task.

基于有序NPsim矩阵的颜色近邻搜索

基于光谱表示法颜色近邻搜索的核心是高维向量近邻搜索,相似性度量和索引树构建是影响其性能的关键,前者存在等距性问题,后者存在构建困难、查询效率低、不易动态调整等问题,从而严重影响颜色近邻搜索算法的性能。使用NPsim函数计算颜色相似性,结合有序矩阵组织颜色空间数据,提出一种基于有序NPsim矩阵的颜色近邻搜索算法。首先,计算颜色空间中所有颜色之间的NPsim值,构建反映所有颜色相似性关系的NPsim矩阵;然后,按照每种颜色与其他颜色的相似性,对NPsim矩阵的每行元素降序排列,从而得到反映每种颜色与其他颜色相似性大小关系的有序NPsim矩阵;最后,对于颜色空间中任意给定的颜色,根据它在有序NPsim矩阵中的行号,就能够直接找到该颜色的所有近邻。采用蒙赛尔全光泽色系光谱构建有序NPsim矩阵,同时建立KD树和SR树,分别进行K近邻搜索,并从精度和速度两方面比较。在精度方面,本算法得到的颜色近邻与查询颜色距离最近、相似性最好,存在逆序现象的近邻个数最少;在速度方面,构建有序NPsim矩阵的时间比构建KD树和SR树的时间要长,但近邻搜索速度是KD树/SR树的1万倍左右,而且与K值无关;此外,构建有序NPsim矩阵易于并行化,而构建KD树和SR树不易并行化,并行化后构建有序NPsim矩阵的速度会超过构建KD树和SR树的速度。实验结果表明该方法适用于颜色近邻搜索。     

On a new naturally indexed quick clustering method with a global objective function

A new clustering method is presented which proposes a class of objective functions and an algorithm which sub-optimizes the objective functions over the whole space of partitions. The objective functions have a global nature, encompassing both the cluster contents and the cluster number. However, the accompanying suboptimization algorithm works according to a simple progressive merger scheme. The algorithmic scheme produces in a quite natural way an indexed hierarchy. The hierarchy index is not just tacked on to the method—see Diday and Moreau¹—on the contrary, the algorithm refers directly to its values which measure, depending upon the particular formulation, either the relative affinity or the relative difference of the two clusters merged at a given level of hierarchy. In this way, the scale of hierarchy and hierarchy-wise validity of clusters can easily be established, which is of great importance in analysing unstructured data sets whose generating process is unknown and can only be hypothesized after an initial structure had been established, e.g. owing to clustering, as is the case in pattern recognition—see Kaminuma².     

高氯酸二水·双(N-氧化吡啶-2-甲醛)缩-1,3-丙二胺合镍粉末衍射数据的指标化研究

本文报导了高氯酸二水·双(N-氧化吡啶-2-甲醛)缩-1,3-丙二胺合镍的合成,粉末衍射数据及精化的单胞参数.主要的结晶学数据为:[Ni(C_(15)H_(16)N_4O_2)(H_2O)_2)(ClO_4)_2.正交晶系,空间群Pnam 或Pna2_1,a=7.490(4)×10~(-10)m,b=15.510(11)×10~(-10)m,c=18.457(13)×10~(-10)m,Z=4,Dcal=1.790,Dobs=1.765,品质因子为15.7.     

2—硝基—4—甲基苯胂酸粉晶X射线衍射数据的指标化研究

2-硝基-4-甲基苯胂酸分子中的胂酸基能与稀土元素络合显色,是合成重要显色剂的反应中间体。了解它的结构,对设计合成路线、研究反应机理以及探索稀土元素的分析方法有着十分重要的意义。本文报道2-硝基-4-甲基-苯胂酸多晶样品X射线衍射数据,利用改进的尝试法将所有衍射数据指标化。该方法亦适用于六方、四方、正交、单斜和三斜物质粉末衍射数据的指标化。