合并算法 meaning in English
merging algorithm
union algorithm
Examples
- With respect to the applications of pki in pervasive computing networks , we provide an elegant simplized model for trust to solve trust management problem efficiently . the idea to build up such a model originates from that of " web of trust " model of pgp mixed up with that of the delegation model of spki , more details as follows : 1 . the simplized trust model and the corresponding trust metrics evaluation algorithms
我们把信任分为信任和相信两种，通过研究传递闭包的原理，提出一个理论上被证明的具有循环不变性的信任度合并算法，并且给出了在一个实际的仿真环境中该模型的应用效果对比，同时该模型结合了pgp和spki各自的优势，弥补了pgp 、 spki各自的不足，表达的信任关系能够真实反映普适计算的分布式特点和彼此相当的社会关系形式，其优势非常突出适合推广到多种普适应用环境。 - It then briefly introduces the key techniques , such as xml ( s ) , rdf ( s ) , ontology , owl etc . we specially analyze the role of ontology in semantic web , and discuss the comparison algorithms between different version of ontology , and also , the merging algorithms of ontology from different sources . we have made some essential improvement to the algorithms , and also put forward a notation method to the integration of wsdl and ontology . we have applied our research to the uddi workflow and satisfactorily solved the many problems of traditional keyword - based searching method of uddi
其中对本体和语义web的关系做了重点分析；接下来，我们讨论了不同版本间本体的比较算法，以及不同来源本体的合并算法，并尝试着做了一定的改进；然后，由于wsdl语言的缺乏语义，我们给出了一种注释的方法，从而将wsdl与具有语义的本体结合起来；针对uddi仅能基于关键字来搜索的弱点，本文最后还讨论了如何将前面所分析的本体匹配算法和web服务描述的语义化方法应用于uddi的工作流程，并给出了一个dumf框架，在一定程度上提高了uddi的语义层次。 - Based on tree data structure , the cartesian grids about 2 - d and 3 - d configurations are generated using the surface - cutting procedure . in the course of grid generation , a two - step ray - casting algorithm to excluded cells inside the body and a cell - merging technique to avoid numerical instability are fully developed . after creating these surrounding grids , the cell - cutting algorithm is designed to perform geometry - based refinement of grids , and greatly improve the applicability and quality of grid generation
采用物面切割，基于叉树数据结构，发展了一种普遍适用于二维和三维外形的直角切割网格生成方法；构造两步射线求交算法，删除外形内的固体网格，以及小网格合并算法，确保网格质量和流场计算的稳定性；运用对任意网格的切割细分算法，实现了针对几何外形的自适应网格加密，使得网格生成更具普适性和灵活性。 - In this paper , the search engine principles and its current development status were firstly discussed , and the disadvantages of existing traditional search engines were also analyzed . based on the preceding analysis , we have proposed the future research directions and analyzed the necessity of introducing metasearch engine . secondly , the metasearch engine principles and its current development status were summarized , and the difficulties of research about the current metasearch engines were pointed out
本文首先概述了搜索引擎的工作原理和现状，分析了现有传统搜索引擎的不足，提出未来搜索引擎的研究方向和引入元搜索引擎的必要性；其次概述了元搜索引擎的原理和现状，分析了当前研究元搜索引擎的难点所在，并提出改进方案；接着分析了有关元搜索引擎技术的相关算法，即成员搜索引擎选择算法、文本选择算法、结果合并算法。 - ( 2 ) a fragment combining algorithm is designed to judge the combined ability of the parameterized duplication code fragment which are found by the former method , so the discontiguous parameterized duplication code is detected . the analysis indicates that the new algorithm has an acceptable complexity
经过改进，算法的空间复杂性得到降低，使之更适于大型程序文本的匹配； ( 2 )提出了程序碎片合并算法，判断通过参数化匹配算法找到的重复代码段之间的可合并性，从而能从程序中识别出非连续的近似重复代码。