遍歷的 的英文怎麼說

中文拼音 [biànlìde]
遍歷的 英文
ergodic
  • 遍 : Ⅰ副詞（全面;普遍） all around; all over; everywhere Ⅱ量詞（動作的全過程） time in repetition
  • 歷 : Ⅰ名詞1 （經歷） experience 2 [天文學] （歷法） calendar 3 （歷書; 年鑒; 歷本） almanac Ⅱ動詞（經...
  • 的 : 4次方是 The fourth power of 2 is direction
  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. Indicates that you want all the end - points of this traversal

    表示您想要該遍歷的所有端點。
  3. The number of ancestor node levels to traverse when retrieving the requested ancestor node

    在檢索請求的祖先節點時要遍歷的祖先節點的層次數。
  4. 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數據庫技術，對金色谷農資公司物流配送系統進行了網上優化設計及網頁製作，研製開發了金色谷農資智能配送網。
  5. Our results show that the rate of correlation among the random variables of those output sequences are low although they are not independent ; in addition, the output sequences of those combined generators are homogeneous markov chains which are strictly stationary processes with ergodicity ; the output sequences of those combined generators are also proved to summit to the strong law of large numbers and the central limit theorem ; finally the computation formula of the rate of the accordance between the output sequences and input sequences of those combined generators is given

    我們的研究結論表明：雖然這些序列中隨機變量之間不具有相互獨立性，但它們的相關程度卻比較低；證明了「停走」生成器， km _ 1m _ 2型組合生成器和加法型組合生成器的概率模型輸出序列都是強平穩的和遍歷的齊次馬氏鏈；討論了這些序列的概率極限性質，證明了它們均服從強大數定律和中心極限定理；還分別給出了各類生成器的輸出序列與輸入序列之間的符合率的計算公式。
  6. List comprehensions give a concise syntax for a rather general class of iterations over lists

    列表推導為創建在列表上進行迭代遍歷的通用類提供了一種簡明的語法。
  7. A discussion on the recursive program

    二叉樹後序遍歷的非遞歸化演算法討論
  8. An example of an implementation that does not perform a stack walk is

    不執行堆棧遍歷的實現的示例為
  9. Versa provides this operation in the form of a backward traversal

    Versa以向後遍歷的形式提供這一操作。
  10. Backward traversals are in the form

    向後遍歷的形式是：
  11. Average number of row versions in the version chains that are traversed

    被遍歷的版本鏈中的行版本平均數。
  12. The recursive and non - recursive algorithm of post - traversing binary tree

    二叉樹後序遍歷的遞歸和非遞歸演算法
  13. It stores all the cells found along the way that make up the word

    它存儲在生成那個單詞時所遍歷的所有細胞。
  14. In general, the set of

    一般來說，這樣遍歷的一組
  15. You might need to change the elements of the collection in the middle of a traversal

    可能需要在遍歷的中途更改集合的元素。
  16. Chapter 5 is contributed to studying convergence rate of standard transition function and relation of all kinds of convergence rates. by revealing the close link among strong ergodicity, stochastically monotone, and the feller transition functions we are able to prove that a monotone ergodic transition function is strongly ergodic if and only if it is not a feller transition function

    第五章討論標準轉移函數的收斂速度以及各種收斂速度之間的關系，通過找出強遍歷、隨機單調性和feller轉移函數之間的緊密關系，我們證明了隨機單調標準轉移函數是強遍歷的充要條件是它不是feller轉移函數。
  17. By using the topology among triangles to find a node of equivalent depth in adjacent triangles, this algorithm overcomes the drawback of traditional algorithm which needs to scan all the triangles

    文章提出一種基於三角形拓撲關系的等深點快速追蹤演算法，該演算法利用三角形之間的拓撲關系，在相鄰三角形中查找等深點，克服了傳統演算法需要進行遍歷的缺點。
  18. An easy checking criterion for a minimal monotone transition function to be strongly ergodic is then obtained. we further prove that a non - minimal ergodic monotone transition function is always strongly ergodic

    對于最小隨機單調轉移函數的強遍歷，給出了非常容易檢驗的準則，此外，我們還證明了非最小隨機單調轉移函數強遍歷當且僅當它是遍歷的。
  19. Chapter 6 is devoted to studying convergence rate of the birth and death processes. for a conservative birth and death q - matrix, we prove that the minimal q - function is strongly ergodic if and only if r - and s <. suppose a birth and death q - matrix satisfies r < and s

    第六章對生滅過程中的收斂速度進行了研究，得到了對保守生滅q -矩陣，最小q -函數是強遍歷的充要條件是r =和s ；且當r和s時，存在唯一可配稱誠實q -函數是強遍歷的。
  20. The idea behind it is to approximate the object with a simpler bounding volume that is a little bigger than the object. in building hierarchies on object, one can obtain increasingly more accurate approximations of the objects. so during traversing bounding volume hierarchy, it speeds up collision detection by prune away primitive pairs, which will not intersect clearly though rapid intersection test between bounding volumes and just deal with those whose bounding volume is intersected

    層次包圍盒方法是解決碰撞檢測問題固有時間復雜性的一種有效的方法，它是用體積略大而幾何特性簡單的包圍盒來近似地描述復雜的幾何對象，並通過構造樹狀層次結構來逼近對象的幾何模型，從而在對包圍盒樹進行遍歷的過程中，通過包圍盒間的快速相交測試來及早地排除明顯不可能相交的基本幾何元素對，而只對包圍盒重疊的部分元素進行進一步的相交測試，以提高碰撞檢測的速度。
分享友人
分享到 Line

分享到臉書