匹配合併 的英文怎麼說

中文拼音 [pèibìng]
匹配合併 英文
match-merge
  • : Ⅰ動詞(比得上; 相當; 相配) be equal to; be a match for Ⅱ形容詞(單獨) lone Ⅲ量詞1. (用於馬、騾等) 2. (用於整卷的綢或布)
  • : Ⅰ動詞1 (兩性結合) join in marriage 2 (使動物交配) mate (animals) 3 (按適當的標準或比例加以...
  • : 合量詞(容量單位) ge, a unit of dry measure for grain (=1 decilitre)
  • 匹配 : 1. [書面語] (婚姻配合) mate; marry 2. [電學] matching
  1. ( 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 )提出了程序碎片演算法,判斷通過參數化演算法找到的重復代碼段之間的可性,從而能從程序中識別出非連續的近似重復代碼。
  2. Is the most common type of code group ; the policy statement of all matching child code groups and by extension their child code groups are combined with the permission set of the matching parent code group

    是最常見的代碼組類型;所有子代碼組的策略聲明(以及在擴展后它們的子代碼組的策略聲明)與的父代碼組的權限集在一起。
  3. After research surface reconstruction with triangular facets, contours of first layer and the last layer are triangulated with layer separation algorithm firstly. and then the least polar - angle criterion is presented for linking two convex contours, and the method is also given in which non - convex contour is transformed to a set of convex contour. with the splitting and integrating algorithm, the single - to - multi - contour reconstruction with triangular facet has been simplified to one - to - one contour

    首先採用層析式演算法對起始層和結束層中的輪廓進行三角剖分;然後採用最小極角法實現兩凸輪廓間的三角片重構,並討論了非凸輪廓變換為凸輪廓的方法;最後,使用分裂與技術將單輪廓多輪廓的三角片重構簡化為單輪廓之間的三角片重構,最終完成整個骨骼表面的三角片重構。
  4. 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的語義層次。
  5. By virtue of associating and improving the graph coloring algorithm and maximal matching algorithm, a coloring - matching algorithm is proposed to solve the exam - arrangement problem

    摘要將安排考試課程與分班級考場分別化為圖的染色與最大問題,進而將兩種演算法融改進,使之適於實際應用。
  6. Thus, resources may be mixed and matched as required by the business

    這樣,資源可以被混業務的需求。
  7. The merge join transformation requires that both inputs be sorted and that the joined columns have matching metadata

    聯接轉換要求兩個輸入都是已排序的,並且要求被聯接的列具有的元數據。
  8. The improved parameterized matching algorithm has linear time and space complexity, fragment combining algorithm has 0 ( n2 ) time and space complexities ( n is the number of statements of the function which the fragment belongs to )

    分析表明:改進的參數化演算法的復雜性同程序文件的行數成線性關系;碎片演算法的復雜性是o ( n ~ 2 )的,其中n是碎片所在依賴單位的語句個數。
  9. Transactional and merge replication allow you to validate that data at the subscriber matches data at the publisher

    通過事務復制和復制,您可以驗證訂閱服務器中的數據與發布服務器中的數據是否
  10. Searches for a matching rule with which the new rule can be merged

    搜索可以將新規則與之規則。
分享友人