遍歷圖 的英文怎麼說

中文拼音 [biànlìtú]
遍歷圖 英文
traversing graph
  • 遍 : Ⅰ副詞（全面;普遍） all around; all over; everywhere Ⅱ量詞（動作的全過程） time in repetition
  • 歷 : Ⅰ名詞1 （經歷） experience 2 [天文學] （歷法） calendar 3 （歷書; 年鑒; 歷本） almanac Ⅱ動詞（經...
  • 圖 : Ⅰ名詞1 （繪畫表現出的形象; 圖畫） picture; chart; drawing; map 2 （計劃） plan; scheme; attempt 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. 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

    第一層優化是在整個規劃區域內，應用遺傳演算法搜索可能的變電站的遍歷順序；第二層優化是按照第一層優化確定的遍歷順序，應用綱絡圖論中的最小權匹配演算法分別對每一個變電站與其相鄰站之間的聯絡線進行優化。
  3. 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 ）分析了企業職能信息系統的集成性和各部門間的協調性，研究車間生產計劃的制訂過程，以模糊多屬性折衷式模型實現了工藝路線的決策，採用對數坐標圖表法，解決了多品種生產批量問題，用基於啟發式的遍歷演算法實現了生產工單的排產，最後提出了任務分解、縮短工序間隔，相鄰工序時間疊加，延遲后續工序等控制策略處理計劃執行過程中工單的插單、延期、掛停與返工等特殊問題。
  4. A dynamic program slice is obtained by recursively traversing the data and control dependence edges in the dynamic dependence graph of the program for the given test case [ 0, 3 ]

    對于給定的測試用例{ [ 0 . 3 ] ，動態程序片是通過以下方式獲得的:遞歸遍歷程序動態依賴圖中的數據和控制依賴邊
  5. 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數據庫技術，對金色谷農資公司物流配送系統進行了網上優化設計及網頁製作，研製開發了金色谷農資智能配送網。
  6. Generally, the disassembly strategy can be divided into the liner - scanning strategy and recursion - scanning strategy based on control flow. through researching on the recursion - scanning strategy based on control flow and instruction sets of many processors, this essay proposes a kind of disassembly strategy based on the static program flow traversal graph, and makes use of six strategies to pick up the hidden program sections from the data sections, thereby raising the precision of the disassembly result

    反匯編策略大體可以分為線性掃描策略和基於控制流的遞歸掃描策略，該文通過對基於控制流的遞歸掃描策略以及多款處理器指令系統的研究，提出了一種基於程序靜態流程遍歷圖的反匯編策略，使用6種策略將隱匿於數據段中的程序段提取出來，提高了反匯編結果的精確度。
  7. 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協議，該演算法具有通用性。
  8. The capsule endoscope travels through the gi tract, shooting and sending out images of the gi tract, and evacuates finally

    膠囊內窺鏡的基本特徵是無外接引線，可以遍歷消化道的整個檢查區域，同時用微攝像頭無線傳輸消化道圖像。
  9. Subsequently we analyze the isomorphism relationship between ergodic matrices and the corresponding permutation group. by defining the permutation symbol operation system of ergodic matrices, we constructed a union form to express all existed permutation algorithms

    通過在理論上分析遍歷矩陣和置換群的同構關系，定義了遍歷矩陣對應的置換運算和符號體系，再統一的框架下表達各種圖像置亂變換。
  10. Concerning the two - dimensional drafting, tools are developed to realize the products " overall searching, non - dimensional information ' s extraction from solid model, the statistics of part number and the filling of list table

    採用catiav5com組件及介面技術，由二維圖文檔對象信息出發，通過對三維文檔對象的遍歷，完成三維實體模型非幾何信息的提取、零件數量的統計等。
  11. Bulk operations on a ttreeview are often painfully slow, because every time a node is referenced using an index, the ttreeview has to walk through its linked list of nodes to get to the specified index

    對一個樹開視圖控制項進行大量操作經常速度很慢，因為每一次節點都需要通過一個索引進行引用，樹形視圖控制項必須遍歷它的節點鏈表以獲到特定的索引，這個例子演示了一種解決這一問題的方法。
  12. How to rapidly stream ttreeview contents - bulk operations on a ttreeview are often painfully slow, because every time a node is referenced using an index, the ttreeview has to walk through its linked list of nodes to get to the specified index

    對一個樹開視圖控制項進行大量操作經常速度很慢，因為每一次節點都需要通過一個索引進行引用，樹形視圖控制項必須遍歷它的節點鏈表以獲到特定的索引，這個例子演示了一種解決這一問題的方法。
  13. The syntax transformer will go through each rule and try to find a matching pattern

    這種語法轉換器會遍歷每條規則，並試圖查找一個匹配的模式。
  14. It presents the arithmetic that is achieved by postorder traversing binary tree, which is built from aov diagraph, based on investigating the arithmetic of interchanging between the ladder diagram and instruction list, and the interpretation and execution of plc programming language. the whole software is developed in visual c + + ide with mfc and multi - threads mechanism. the software is well constructed and conforms to a standard of iec61131

    在重點研究了編程軟體中梯形圖與指令表程序的轉換演算法以及指令解釋執行的原理和方法的基礎上，提出了由aov有向圖建立二叉樹、並對其進行後序遍歷來實現梯形圖程序與指令表程序轉換的演算法，並給出了演算法在編程軟體中的具體實現。
  15. But the standard mc has some shortcomings : firstly, the standard mc picks up isosurfaces by threshold, however, threshold segmentation is invalid for picking up tissues or organs from some medical images ; secondly, the standard mc pocesses cubes one by one, that is to say, all the cubes will be checked, and the algorithm spents 30 % - 70 % of time to check the null units, so we need a reasonable data structure to travel the space data and accelerate the checking or filting of null units ; thirdly, the standard mc has a large scale of triangles, normally, the tissue or organ reconstructed includes hundreds of thousands so much as millions of triangles, this means it hardly to execute real - time rendering or interaction ; lastly, the standard mc can not get the very smoothly surface mesh, and there will be some unexpected accidented cases, especially in the case of big errors in oringinal data

    但是標準mc演算法存在較大的問題:標準mc演算法實質上是通過閾值分割來提取等值面，閾值分割對某些醫學圖像的組織或器官的提取難以得到較好的效果;標準mc演算法是逐個移動立方體來進行處理，就是說對所有的立方體都要進行一次檢測，演算法執行中30 % ~ 70 %的時間用在對空單元的檢測上，因此需要有一種合理的數據結構對空間數據進行有效的遍歷，以加速對空單元的檢測和過濾;標準mc演算法產生了大量的三角面片，一般重建的組織或器官包含數十萬甚至上百萬的三角面片，難以實現實時的繪制和交互操作;標準mc演算法得到的表面網格並不光滑，會有一些不期望的凹凸，特別是在原始數據有較大誤差的情況下尤其突出。
  16. This result have unified the traditional explicit graph searching and implicit graph search, partial searching for one solution and complete searching for all solutions into a same model and some algorithms

    這一結果將傳統的顯式圖搜索與隱式圖搜索，求一個解的局部搜索與求全體解的遍歷搜索，全部統一到同一個模型和若干演算法中去。
  17. From the top level data object contained in the graph, all children data objects are reachable by traversing the references from the root data object

    對于包含在數據圖中的頂層數據對象，可以從根數據對象開始遍歷引用來到達所有子數據對象。
  18. In static analysis, we generate the control flow graph of the sequential program and convert the graph to an extended finite state machine ( efsm ). by analyzing the paths of the efsm, we can find whether there is data dependence in the program or not

    數據相關性的靜態測試中，我們首先生成程序的流程圖，在遍歷流程圖的同時生成這個程序的擴展有限狀態機（ efsm ） ，然後調用路徑分析工具對efsm的路徑進行分析。
  19. The historical development of bom technique is reviewed from theory and practice, and the analysis, design and optimization strategy of relational database based bom are presented. in the flowing section, the paper analyzes traditional bom search algorithms and proposes some optimization algorithms, and then, through applying dag to bom technique, the bom cyclic nesting error check algorithms and low - lever code algorithms are improved as well

    本文重點研究了bom技術的研究現狀，提出了基於關系型數據庫的bom的分析、設計和優化策略；並且對bom的常用遍歷演算法進行分析后對其進行改進；將dag圖運用到bom技術上對bom的循環嵌套錯誤檢查的演算法和低層碼的演算法進行改進。
  20. Is thrown when the stack walk reaches the code that tried to call

    ，則當堆棧遍歷到達曾試圖調用
分享友人
分享到 Line

分享到臉書