traversal 中文意思是什麼

traversal 解釋
n. 名詞 1. 橫過，橫越，橫斷物，（橫向）往返移動。
2. （城墻，壕溝的）護墻，障礙物；【登山】Z字形攀登。

  1. Motivated by this observation, this paper studies the problem of efficiently processing k nn k - ge 1 search on r - tree - like structures storing historical information about moving object trajectories. two algorithms are developed based on best - first traversal paradigm, called bfp k nn and bft k nn, which handle the k nn retrieval with respect to the static query point and the moving query trajectory, respectively. both algorithms minimize the number of node access, that is, they perform a single access only to those qualifying nodes that may contain the final result

    例如，若已知動物的軌跡，則動物學家可能提出如下兩種查詢： i在時間區間ti ， tj內找到離一個給定的靜態點譬如食物源實驗室等最近的k條動物軌跡ii在時間區間ti ， tj內找到離一條預先指定的動物軌跡最近的k條動物軌跡。
  2. Listing 1 shows the full clockwise traversal listing

    清單1顯示了完整的順時針遍歷清單：
  3. According to the mean message traversal, the performance of leo / meo mobile satellite communication networks with intersatellite links ( isls ) is analyzed in this paper. three different traffic patterns are used in the analysis. if the isl number per satellite increases, the advantage of packet switch is more significant than that of circuit switch

    本文提出了一種基於信息平均傳輸距離的中/低軌衛星移動通信系統星際鏈路網路性能的分析方法.根據三種不同的業務分佈模型對繁/簡兩種網路的信息過網時延和呼叫丟失率進行了分析.通過增加網路中每個節點星際鏈路的數目可以改善網路的性能，而且這種改善對採用分組交換的系統比採用電路交換的系統大
  4. In general, the format of a traversal expression is

    通常，遍歷表達式的格式如下：
  5. Therefore, we can implement the depth - first traversal in the

    因此，我們可以在抽象
  6. The following is an example of a traversal expression

    下面是遍歷表達式的一個示例。
  7. Defines recursive traversal properties of a role

    定義角色的遞歸遍歷屬性。
  8. Controlling link traversal behavior with url rewriting

    使用url重寫來控制鏈接遍歷行為
  9. This is a forward traversal, which follows the predicate

    這是向前的遍歷，它按照謂詞（
  10. Indicates that you want all the end - points of this traversal

    表示您想要該遍歷的所有端點。
  11. And do not require any additional locking during traversal

    ，遍歷期間也不要求額外的鎖定。
  12. 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匯編語言層次上對所有的演算法加以實現。
  13. 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

    通過在您的思維中完整地運行一遍代碼的執行序列，從而形成這種遍歷路徑的一種精神表示形式，這種方法是經常使用的。
  14. To control the focus traversal policy

    來控制焦點遍歷策略。
  15. 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種策略將隱匿於數據段中的程序段提取出來，提高了反匯編結果的精確度。
  16. 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

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

    這無疑比我所討論的遍歷方法更方便。
  18. Method for comparing names and namespace uris ; instead, an application can choose to write its own traversal methods that can use java

    方法比較名稱和名稱空間uri ，以查找節點。相反，應用程序可以選擇編寫它自己的遍歷方法，在這個遍歷方法中使用java
  19. Versa provides this operation in the form of a backward traversal

    Versa以向後遍歷的形式提供這一操作。
  20. You might need to change the elements of the collection in the middle of a traversal

    可能需要在遍歷的中途更改集合的元素。
分享友人
分享到 Line

分享到臉書