遍歷法 的英文怎麼說

中文拼音 [biànlìfǎ]
遍歷法 英文
traversal method
  • 遍 : Ⅰ副詞（全面;普遍） all around; all over; everywhere Ⅱ量詞（動作的全過程） time in repetition
  • 歷 : Ⅰ名詞1 （經歷） experience 2 [天文學] （歷法） calendar 3 （歷書; 年鑒; 歷本） almanac Ⅱ動詞（經...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  1. Improving anil jain ' s algorithm, we propose a minutiae match algorithm. our improvement is focused on the following two aspects : first, we use a minutiae alignment algorithm based on the iteration of the neighbor minutia centered at the minutia gravity. secondly, we use a modifiable bounding - box to carry out minutiae matching, which makes our algorithm more robust to the non - linear transform of the fingerprint images

    我們的改進主要體現在二個方面:首先我們利用了一種「基於重心附近遍歷的特徵點對齊演算法」 ，該方法不需要記錄特徵點的多餘信息來進行特徵點的對齊;其次，我們利用一個可變大小的「界限盒」來進行特徵點的匹配，使得我們的匹配演算法對指紋圖像的非線性形變具有更好的魯棒性。
  2. With the plant bionomy the tree ' s growth mechanism is analysed. tree ' s growth model and data structure are builded, and the way of traversaling is advanced

    本文從植物生態學角度出發，根據樹的生長原理，建立生長模型及相應的數據結構，並提出該結構的遍歷演算法。
  3. As you iterate over the query expressions, your algorithm may need to correct for double negatives

    在遍歷查詢表達式時，演算法可能需要糾正雙重否定。
  4. Firstly, we find the resources in the breadth first search way, at the mean time, hop field is generated, and then, we schedule the resources according to the hop field

    本文提出一種新型的網格資源調度演算法最小跳數演算法，首先通過廣度搜索遍歷找到資源，並同時生成跳數場，再根據跳數調度資源。
  5. Three steps of the method are, first, genetic algorithm is adopted in the whole planning area to hunt the possible traverse sequence of the substations ; second, the least weight match algorithm in graph theory is adopted to optimize the tie lines between each substation and its neighbors according to the traverse sequence determined in the first step ; finally, the scheme which has the least cost of investment in tie lines will be taken as the ultimate scheme

    第一層優化是在整個規劃區域內，應用遺傳演算法搜索可能的變電站的遍歷順序；第二層優化是按照第一層優化確定的遍歷順序，應用綱絡圖論中的最小權匹配演算法分別對每一個變電站與其相鄰站之間的聯絡線進行優化。
  6. Using the logarithm graph, multi - varieties production batch problem is resolved. the production scheduling is realized with heuristic traverse algorithm. at last, the strategies, which include disassembling task, shorting interval of the working procedure, overlapping working procedure, deferring the back working procedure etc., are brought forward to deal with the order ' s inserting, postponement, freezing and doing again on carrying out the production plan

    3 ）分析了企業職能信息系統的集成性和各部門間的協調性，研究車間生產計劃的制訂過程，以模糊多屬性折衷式模型實現了工藝路線的決策，採用對數坐標圖表法，解決了多品種生產批量問題，用基於啟發式的遍歷演算法實現了生產工單的排產，最後提出了任務分解、縮短工序間隔，相鄰工序時間疊加，延遲后續工序等控制策略處理計劃執行過程中工單的插單、延期、掛停與返工等特殊問題。
  7. In this dissertation, we firstly prove that any dirichlet problem is indeed equal to a voltages problem of networks. we give five solutions to dirichlet problem in two dimensions ; among these five solutions, we prove that the iteration solution and the solution of relaxations are exponential convergence, then we estimate their respective convergence rates ; secondly, we discuss random walks on general networks, prove that there is an one to one correspondence between networks and reversible ergodic markov chains ; thirdly, we give probabilistic interpretation of voltages for general networks : when a unit voltage is applied between a and b, making va = 1 and vb = 0, the voltage vx at any point x represents the probability that a walker starting from x will return to a before reaching b ; furthermore, we study the relationship between effective resistance and escape probability : starting at a, the probability that the walk reaches b before returning to a is the ratio of the effective conductance and the total conductance

    本文證明了任何邊值的dirichlet問題都可轉化為求解電路電壓的問題：給出了計算平面格點上dirichlet問題的5種方法：證明了迭代法和松馳法都是指數收斂的，並分別給出收斂速度的估計；討論了一般電路上的隨機徘徊，驗證了電路與可逆的遍歷markov鏈是一一對應的；給出了電路電壓的概率解釋：當把1伏電壓加於a ， b兩端，使得v _ a = 1 ， v _ b = 0時，則x點的電壓v _ x表示對應的markov鏈中，從x出發，到達b之前到達a的概率；進一步地，給出了逃離概率與有效電阻之間的關系：從a出發，在到達b之前到達a的概率為有效傳導率與通過a的總傳導率之比。
  8. In this paper, a lot of researches and exploration are applied to studying the universality and expansibility of hardware and the arithmetic design and code optimization of software. especially, all of the following arithmetics or conceptions are worked out in the research of software design : self - adaptable compression arithmetic based on dictionary model for data collection system, similarity full binary sort tree, a optimized quick search arithmetic and an improved arithmetic of multiplication in the floating - point operation. and all of the arithmetic are designed with mcs - 51 assembly language. the quick search arithmetic, in which merits of both binary search and sequence search are used fully, are based on the specialty of preorder traversal in similarity full binary sort tree

    特別在軟體設計研究中，提出了適用於數據採集系統的數據壓縮演算法? ?基於字典模型的自適應壓縮演算法；提出了類滿二叉排序樹的定義；提出了基於類滿二叉排序樹的先序遍歷特性的最優化快速查找演算法，它充分利用了折半查找和順序查找各自的優點；提出了浮點運算乘法的改進演算法；並在mcs - 51匯編語言層次上對所有的演算法加以實現。
  9. It is not uncommon to form a mental representation of this traversal path by running through the execution sequence of the code in your mind

    通過在您的思維中完整地運行一遍代碼的執行序列，從而形成這種遍歷路徑的一種精神表示形式，這種方法是經常使用的。
  10. After knowing fully the present situation of business operation of the golden cereal company and development characteristics in logistic - system field, the mathematics model of logistics system has been established in the article with the application of linear program method in operational research, as well as the strategy of minimum route in graph theory and the thought of transiting all over ; meanwhile, on the foundation of internet network technology and structure of b / s, the online optimization design and production of web page have been carried out for the logistic - system of the golden grain farming capital company with adoption of jsp ( java server page ) technology and sql server database technology

    本文在充分了解金色谷農資公司的業務運行現狀和物流配送行業發展特點的基礎上，應用運籌學的線形規劃方法，以及圖論中最短路徑的策略和圖的遍歷的思想，建立了配送系統數學模型；並基於internet網路技術b s結構基礎上，採用jsp （ javaserverpage ）技術和sqlserver數據庫技術，對金色谷農資公司物流配送系統進行了網上優化設計及網頁製作，研製開發了金色谷農資智能配送網。
  11. We define a type of hyperbolicity on the full measure invariant set which is given by the oseledec ' s multiplicative ergodic theorem and prove that the system has the lipschitz shadowing property on it

    對于由oseledec乘法遍歷定理得到的滿測度（ fullmeasure ）不變集定義了雙曲性，並證明了系統在這個不變集上具有lipschitz跟蹤性。
  12. In this paper, we brought out the concept of “ ergodic matrix ”, and gave out the recursion formula ( ii ) which can construct the ergodic matrix q with n n dimensions using a vector with n dimension. that is, we can delegate n2 bits ergodic matrix q using n bits integer vector, at the same time save the complexity of space and time

    在此基礎上，本文對利用遍歷矩陣生成信息摘要以及利用它們實現一般數字簽名和具有仲裁方式的數字簽名的演算法及應用進行了相關的一些研究，對演算法的強度進行了分析，並用程序對演算法進行了驗證。
  13. In hindu culture, newborns are traditionally named based on their jyotish charts, and jyotish concepts are pervasive in the organization of the calendar and holidays as well as in many areas of life and science

    在印度文化里，新生嬰兒通常是依照佔星圖而給他們命名，占星術的概念普遍深入地在歷法和假日的組織上，同時也在生活和科學的很多領域上。
  14. Traverses the abstract syntax tree one or more times, collecting information and checking that the input program

    遍歷抽象語法樹（ abstract syntax tree ， ast ）一次或多次，收集信息並檢查輸入程序
  15. An abstract syntax tree is built after syntax analysis and traversed three times to do semantic analysis to generate the intermediate code

    在語法分析、語義分析及中間代碼生成方面，先經過語法分析建立抽象語法樹，然後對抽象語法樹進行三次遍歷完成語義分析並生成中間代碼。
  16. That makes the tree walking more explicit

    的改寫，它使得樹的遍歷演算法更明顯。
  17. As an application of the ergodic theory, we discuss the method of calculating a type of limits

    摘要作為遍歷理論的應用，討論一類極限的求法。
  18. A kind of list - traverse algorithm is put forward in this paper, which uses the space of list elements to record traverse information and limits the space spending of traverse process to constant amount

    摘要提出了一種遍歷列表數據結構的演算法，通過利用列表節點元素自身空間來記錄遍歷信息，把遍歷過程中需要的空間開銷限制在常量范圍之內。
  19. According to binary tree level traversal principle, this article embarks from fully binary tree ' s definition and the nature, and proposes a method to judge fully binary tree on the basis of traversing binary tree

    摘要從完全二叉樹的定義及性質出發，根據二叉樹的層次遍歷原則，提出了一種遍歷法判斷完全二叉樹的方法。
  20. We found that the ergodic method used to calculate the symmetries of a multidimensional system would give rise to the computing complexity problem, hi order to avoid the computing complexity problem, we present a novel approach using genetic algorithms for calculating the permutation symmetries of a patterns set and the weight matrix of the network. we design the corresponding computer program with visual c + + 6. 0 language. and numerical simulat

    並用wsualc語言分別設計了求解網路連接矩陣和給定樣本集的置換對稱性相應的遍歷法和遺傳演算法的程序，在pc機上進行數值模擬計算，比較遍歷法和遺傳演算法的計算結果。
分享友人
分享到 Line

分享到臉書