匹配優先演算法 的英文怎麼說

中文拼音 [pīpèiyōuxiānyǎnsuànfǎ]
匹配優先演算法 英文
matching precedence algorithm
  • 匹 : Ⅰ動詞（比得上; 相當; 相配） be equal to; be a match for Ⅱ形容詞（單獨） lone Ⅲ量詞1. （用於馬、騾等） 2. （用於整卷的綢或布）
  • 配 : Ⅰ動詞1 （兩性結合） join in marriage 2 （使動物交配） mate （animals） 3 （按適當的標準或比例加以...
  • 先 : 名詞1 （時間或次序在前的） earlier; before; first; in advance 2 （祖先; 上代） elder generation; ...
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 匹配 : 1. [書面語] （婚姻配合） mate; marry 2. [電學] matching
  1. Firstly, the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type. secondly, the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm, and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention. finally, the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward, this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically

    首先，採用廣度優先搜索演算法查找電氣原理圖中的連通導線端點集，並根據不同類型的繼電元件對應的cad圖塊結構的不同，得到電氣原理圖中元件接線端子之間的連接關系;其次，根據二分圖匹配演算法為電氣原理圖中繼電元件選擇合適的型號和規格，並採用人工干預和自動布置相結合的方法完成屏面布置圖的自動生成;最後，提出了完全無向圖中經過每個頂點一次且僅一次的優化路徑演算法，利用該演算法和經過預處理的prim最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  2. Fractal coding has been proved useful for image compression. it is also proved effective for content - based image retrieval. in the paper, we present a block - constrained fractal coding scheme and a matching strategy for content - based image retrieval. in this coding scheme, an image is partitioned into non - overlap blocks of a size close to that of a query iconic image. fractal codes are generated for each block independently. in the similarity measure of fractal codes, an improved nona - tree decomposition scheme is adopted to avoid matching the fractal codes globally in order to reduce computational complexity. our experimental results show that our coding scheme and the matching strategy we adopted is useful for image retrieval, and is compared favorably with other two methods tested in terms of storage usage and computing time

    分形編碼在圖像壓縮方面取得了很好的效果，同時，分形編碼也能夠用於基於內容的圖像檢索.本文提出了一種基於塊限制的分形編碼演算法和匹配策略，並將它們用於圖像檢索.在我們編碼演算法中，圖像會被預先分成互相不重疊的子圖像塊，然後對這些子圖像進行獨立地分形編碼，從而獲得整幅圖像的分形碼.該編碼演算法能夠在很大程度上減少編碼時間.在進行圖像間相似性的匹配時，我們採用改進的基於九叉樹的分配策略，從而避免全局地進行分形碼的匹配，減少了計算量.實驗結果說明，我們的編碼演算法和匹配策略能夠比較有效地應用於基於內容的圖像檢索，在計算時間和存儲時間上都優于實驗中其它兩種方法
  3. In the proposed join algorithms, although some algorithms such as mpmgin algorithm [ 23 ], outperform standard rdbms join algorithms, they perform a lot of unnecessary computation and i / o for matching basic structural relationships, especially in the case of parent - child relationships ; other algorithms such as the stack - tree - desc algorithm [ 24 ], represent the state - of - the - art in structural joins, however, they do not utilize indexed structures but sequentially scan the input lists. thus, i / o ' s can be wasted for scanning element that do not participate in the join, and join speed can be influenced

    另外，在所提出的演算法中，盡管有的演算法，如mpmgjn演算法[ 23 ]優于標準的rdbms連接演算法，但是該演算法為匹配基本的結構關系，特別是在父子關系情況下，執行了大量不必要的計算和佔用了大量的i / o資源；有的演算法雖然代表了結構連接演算法的先進水平，如stack - tree - desc [ 24 ]連接演算法，但是它沒有利用索引結構而是順序瀏覽輸入列表。
  4. This matching algorithm can reduce differences during translation, rotation, and zooming under the noisy or distorted condition. to do this, firstly, select optimum matching - origin - pair in the polar coordinates, then the number of matching pairs can be acquired

    本演算法能夠減小指紋平移、旋轉誤差，在有噪聲和形變情況下，先優選出極坐標原點對，進而求出匹配對的數目。
  5. According to the particularity of chinese information, the author improves the mm word segmentation algorithm, and gained a preferable word segmentation algorithm

    本文根據中文信息處理的特殊性，在原有的最大匹配分詞演算法的基礎上進行改進，通過引進預處理過程，利用長詞優先規則得到一個較好的分詞演算法。
  6. A novel method of content - based image segmentation using deformable template matching is proposed. a two - dimensional ( 2 - d ) deformable template based on orthogonal curves is built by pre - computing extensions of the deformable template along orthogonal curves and sampling the curves uniformly. then the definitions of internal and external energy functions are given according to the image segmentation problem, and genetic algorithm is used to obtain globally optimal solutions. the proposed method uses a lower - dimensional search space than conventional methods and reduces the sensitivity of the algorithm to initial placement of the template. experiments on real - world images and in simulations at low signal - to - noise ratio show the robustness and good performance of the method

    本文提出一種採用可變形模板匹配技術進行基於內容的圖像分割演算法.通過預先計算出可變形模板沿著變形的正交曲線，並對模板曲線及正交曲線進行離散抽樣，建立一基於正交曲線的二維（ 2 - d ）可變形模板，針對圖像分割問題定義控制可變形模板進行變形的內、外部能量函數，本文採用遺傳演算法搜索能量函數最小的全局最優解.該新演算法比傳統的可變形模板匹配方法降低了搜索空間的維數，減少了演算法對模板初始位置的敏感.對實際圖像及模擬低信噪比圖像處理的結果表明，新演算法具有良好的分割精度及穩定性
  7. We propose a new two level matching algorithm for seed points in propagation. firstly, our algorithm compares edge similarity around the target pixel based on edge extraction. this level of feature matching is both simple and reliable

    提出了一種新的用於種子點可靠匹配的兩層演算法，該演算法在圖像邊緣提取的基礎上，首先比較目標點匹配的邊緣相似性，這種特徵匹配具有簡單可靠的優點。
  8. The key to the settlement of question lies in rapid determining the position relations, which satisfies the restraints on layout between these contours. in order to do so, a series of characteristic points on a contour should be obtained by cutting the contour through horizontal equidistant lines, then the position relations mentioned above can be determined, and some layout parameters are solved. finally, a optimum result of layout is obtained

    其原理是先用等距水平線分割零件輪廓，得到一系列輪廓的特徵點，然後利用其特性可快速確定零件輪廓在滿足排樣約束時的相互位置關系，通過與之匹配的高效演算法可求得排樣參數，獲得最優排樣方案。
  9. At first the problem of the matching search of domain and range in the jacquin algorithm of fractal image coding has been analyzed and the result of it belonging to the np _ hard has been found

    首先經過分析發現簡庫恩演算法中的定義域、值域匹配搜索問題屬于組合優化問題中的np ? hard ，並把組合優化方法應用於分形圖像壓縮編碼的搜索過程。
  10. How to use the patter matching theory based on bunch most matching arithmetic to achieve furthest address data first to split in the system flow

    如何利用模式匹配理論，根據串的最大匹配演算法思想實現系統流程中最長地址數據優先拆分。
  11. In the process of this algorithm, curriculum time allotment is firstly packet optimized, and then the arrangement process is completed by superposition and matching matrices

    該演算法首先對課時段進行分組優化，然後引入矩陣的迭加匹配運算，最終實現自動排課。
分享友人
分享到 Line

分享到臉書