遍歷方法 的英文怎麼說

中文拼音 [biànlìfāngfǎ]
遍歷方法 英文
traversal method
  • 遍 : Ⅰ副詞（全面;普遍） all around; all over; everywhere Ⅱ量詞（動作的全過程） time in repetition
  • 歷 : Ⅰ名詞1 （經歷） experience 2 [天文學] （歷法） calendar 3 （歷書; 年鑒; 歷本） almanac Ⅱ動詞（經...
  • 方 : Ⅰ名詞1 （方形; 方體） square 2 [數學] （乘方） involution; power 3 （方向） direction 4 （方面） ...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 方法 : method; means; way; technique; process; procedure; plan; device; recipe; fashion; tool; maneuver
  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. 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的總傳導率之比。
  3. 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

    通過在您的思維中完整地運行一遍代碼的執行序列，從而形成這種遍歷路徑的一種精神表示形式，這種方法是經常使用的。
  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. 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

    在此基礎上，本文對利用遍歷矩陣生成信息摘要以及利用它們實現一般數字簽名和具有仲裁方式的數字簽名的演算法及應用進行了相關的一些研究，對演算法的強度進行了分析，並用程序對演算法進行了驗證。
  6. Certification is the common issue usually raised by the both parties in international trade. however, due to the distinction of standards of economy and culture, levels of the science and technology development and abilities and methods of machining, certification sometimes turn into technology trade barriers in a specific time

    國際貿易中，貿易雙方普遍會提出認證的要求，但是由於各國經濟文化水準、科學技術水平和加工能力和方法的不同，認證往往會在一定的歷史時期內成為對外貿易中的技術型貿易壁壘。
  7. An abstract syntax tree is built after syntax analysis and traversed three times to do semantic analysis to generate the intermediate code

    在語法分析、語義分析及中間代碼生成方面，先經過語法分析建立抽象語法樹，然後對抽象語法樹進行三次遍歷完成語義分析並生成中間代碼。
  8. We studied the relation of knowledge - points and give a personal control - tactical algriothms for learning knowledge - points. and this will help construct the personal courseware structure. as for selecting suitable knowledge - point, we also use the the history records metioned above, and attempt to find the regularation between the attributes of knowledge - point the characters of the learners

    知識點的遍歷過程即是課件的學習過程，本文從知識點之間關系的角度，建立知識點網路，給出了遍歷課件知識點網路的個性化控制策略演算法；至於選擇適合的知識點，本文利用上面已建好的數據倉庫，運用決策樹方法，找出學生特點與知識點屬性的關系，為製作課件時組織知識點提供參考。
  9. Chapter 2 of this paper, by using a new method of proof, we obtain the weak ergodic convergence theorem for general semigroups of asymptotically nonexpansive type semigroups in reflexive banach space. by theorem 2. 1 of chapter 1 we get the weak ergodic convergence theorem of almost orbit for general semigroups of asymptotically nonexpansive type semigroups in reflexive banach space. by this method of proof, we give the weak ergodic convergence theorems for right reversible semigroups. by theorem 2. 1 of chapter l, we generalize the result to almost orbit case. so we can remove a key supposition that almost orbit is almost asymptotically isometric. it includes all commutative semigroups cases. baillon [ 8 ], hirano and takahashi [ 9 ] gave nonlinear retraction theorems for nonexpansive semigroups. recently mizoguchi and takahashi [ 10 ] proved a nonlinear ergodic retraction theorem for lipschitzian semigroups. hirano and kido and takahashi [ 11 ], hirano [ 12 ] gave nonlinear retraction theorems for nonexpansive mappings in uniformly convex banach spaces with frechet differentiable norm. in 1997, li and ma [ 16 ] proved the ergodic retraction theorem for general semitopological semigroups in hilbert space without the conditions that the domain is closed and convex, which greatly extended the fields of applications of ergodic theory. chapter 2 of this paper, we obtain the ergodic retraction theorem for general semigroups and almost orbits of asymptotically nonexpansive type semigroups in reflexive banach spaces. and we give the ergodic retraction theorem for almost orbits of right reversible semitopological semigroups

    近年來， bruck [ 5 ] ， reich [ 6 ] ， oka [ 7 ]等在具frechet可微范數的一致凸banach空間中給出了非擴張及漸近非擴張映射及半群的遍歷收斂定理。 li和ma [ 13 ]在具frechet可微范數的自反banach空間中給出了一般交換漸近非擴張型拓撲半群的遍歷收斂定理，這是一個重大突破。本文第二章用一種新的證明方法在自反banach空間中，研究了揚州大學碩士學位論文2一般半群上的（ r ）類漸近非擴張型半群的弱遍歷收斂定理，即:定理3 . 1設x是具性質（ f ）的實自反banach空間， c是x的非空有界閉凸子集， g為含單位元的一般半群， s =仕工， 。
  10. In historical context, this is due to the accepting strategy the scholars generally abided by, that is, the accepting tendency of political indoctrination, comprehensive mode of " mei ", " ci " and the meaning explanation of " bi ", " xing "

    這種文學接受的「異化」現象所以出現，從具體的歷史語境來看，是由於漢儒普遍遵循一種先在的接受策略這就是政治教化的接受取向， 「美」 、 「刺」的理解模式和「比」 、 「興」的釋義方法。
  11. Chaotic optimization method searches optima by means of regularity, ergodicity and intrinsic stochastic properties of chaotic motion and can find out global optimum in great probability

    摘要混沌優化方法利用混沌運動的隨機性、規律性、遍歷性尋優，能以較大的概率搜索到全局最優點。
  12. In order to avoid blind searching ergodicity in the overall situation before reducing the searching space of the variable optimized in chaos optimization algorithm, an optimization algorithm based on the chaos searching direction

    摘要為了克服混沌優化方法在縮小優化變量的搜索空間前所進行的全局性、遍歷性的盲目搜索，提出了一種基於混沌搜索方向的全局最優方法。
  13. This method consists of two nested loops : the first loop iterate through all the registered types. the second loop iterates through all attributes for the current type

    這個方法由兩個嵌套的循環組成：第一個循環遍歷所有注冊的類型。第二個循環遍歷當前類型的所有特性。
  14. 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

    摘要從完全二叉樹的定義及性質出發，根據二叉樹的層次遍歷原則，提出了一種遍歷法判斷完全二叉樹的方法。
  15. This is certainly more convenient than the traversal methods i discussed

    這無疑比我所討論的遍歷方法更方便。
  16. New ways of walking

    新的遍歷方法
  17. Method for comparing names and namespace uris ; instead, an application can choose to write its own traversal methods that can use java

    方法比較名稱和名稱空間uri ，以查找節點。相反，應用程序可以選擇編寫它自己的遍歷方法，在這個遍歷方法中使用java
  18. The creativity of the work in the paper can be shown as the following four aspects : ( 1 ) for single subnet, the condition of simple link judgement is added into the ptda, so the algorithm is improved well ; ( 2 ) for multiple subnets, the ptda becomes more effective, benefited from use of breadth - first - search algorithm of graph, port - deletion method etc ; ( 3 ) due to suitable adoption of the three protocols stp, snmp and arp, the ptda based on spanning tree protocol can get very effective and correct ; ( 4 ) owing to the employment of ieee802. 1 q, the ptda of vlan is all - purpose to some extent

    本文的創新之處主要體現在以下四個方面:在單子網物理拓撲發現演算法中，增加了判斷簡單連接的條件，使演算法更加完善;在多子網物理拓撲發現演算法中採用圖的廣度優先遍歷方法、埠刪除方法等，該演算法更加有效;在生成樹協議物理拓撲發現演算法中，正確使用stp 、 snmp和arp三種協議，物理拓撲發現非常準確;在vlan物理拓撲發現演算法中，正確運用了ieee802 . 1q協議，該演算法具有通用性。
  19. The application of ergodic sequence to quantitative theory of averaging methods in dynamical system

    遍歷序列在動力系統平均方法定量研究中的應用
  20. Through chaos optimization method embedded into the genetic algorithm. the algorithm with the combination the advantages of the genetic algorithm and chaos optimization method which need not the optimal problem function ' s differential and promote the ability of the genetic algorithm ' s locally meticulous search can be obtained with the faster convergence and the greater probability for the global solution. a chaotic sequence is inserted into the search procedure of genetic algorithm, which can overcome premature of the search by genetic algorithm and the speed of convergence is faster than standard genetic algorithm

    對遺傳演算法進行了理論分析，並且研究了遺傳演算法的設計與實現；利用混沌優化方法不依賴于梯度信息的性質，將其與遺傳演算法相結合，提出了一種求解連續不可微函數優化問題的混合遺傳演算法；基於對于符號動力系統的研究，利用混沌序列的遍歷性，將混沌序列引入遺傳演算法中，提出一種嵌入哈爾濱工程大學博土學位論文一混飩序列的遺傳演算法，該演算法有效地克服了標準遺傳演算法中的早熟現象，並且具有更快的收斂速度。 」
分享友人
分享到 Line

分享到臉書