遍歷表 的英文怎麼說

中文拼音 [biànbiǎo]
遍歷表 英文
traversal list
  • : Ⅰ副詞(全面;普遍) all around; all over; everywhere Ⅱ量詞(動作的全過程) time in repetition
  • : Ⅰ名詞1 (經歷) experience 2 [天文學] (歷法) calendar 3 (歷書; 年鑒; 歷本) almanac Ⅱ動詞(經...
  • : Ⅰ名詞1 (外面;外表) outside; surface; external 2 (中表親戚) the relationship between the child...
  1. As you iterate over the query expressions, your algorithm may need to correct for double negatives

    查詢達式時,演算法可能需要糾正雙重否定。
  2. In general, the format of a traversal expression is

    通常,遍歷表達式的格式如下:
  3. The following is an example of a traversal expression

    下面是遍歷表達式的一個示例。
  4. Indicates that you want all the end - points of this traversal

    示您想要該的所有端點。
  5. 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 )分析了企業職能信息系統的集成性和各部門間的協調性,研究車間生產計劃的制訂過程,以模糊多屬性折衷式模型實現了工藝路線的決策,採用對數坐標圖法,解決了多品種生產批量問題,用基於啟發式的演算法實現了生產工單的排產,最後提出了任務分解、縮短工序間隔,相鄰工序時間疊加,延遲后續工序等控制策略處理計劃執行過程中工單的插單、延期、掛停與返工等特殊問題。
  6. 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的總傳導率之比。
  7. The drawing thread can simply iterate through the list of objects without worry because you know that even if game objects are added during the drawing period, they will not affect the nodes that are currently being drawn

    可移動線程可以無所顧慮地,因為您知道即使在移動期間添加了游戲對象,它們也不會影響正在移動的節點。
  8. 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

    通過在您的思維中完整地運行一代碼的執行序列,從而形成這種路徑的一種精神示形式,這種方法是經常使用的。
  9. Microsoft sql server 2005 analysis services ssas supplies lots of intrinsic functions for use with the multidimensional expressions and data mining extensions languages, designed to accomplish everything from standard statistical calculations to traversing members in a hierarchy

    Microsoft sql server 2005 analysis services ( ssas )提供了很多用於多維達式( mdx )和數據挖掘擴展插件( dmx )語言的內部函數,用於完成從標準統計計算到層次結構中成員的所有任務。
  10. It simply connects to the current sql server instance by using windows authentication, and then iterates through all the user databases and performs the identity checks on each table found in each database

    它只是使用windows身份驗證與當前sql server實例連接,然後所有用戶數據庫並對每個數據庫中的每個執行標識檢查。
  11. Function used by the key class does not spread values evenly over the hash range or has a large number of hash collisions, certain bucket chains may be much longer than others, and traversing a long hash chain and calling

    函數不能將value均勻地分佈在整個hash范圍內,或者存在大量的hash沖突,那麼某些bucket鏈就會比其他的鏈長很多,而一個長的hash鏈以及對該hash鏈上一定百分比的元素調用
  12. 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

    摘要提出了一種數據結構的演算法,通過利用列節點元素自身空間來記錄信息,把過程中需要的空間開銷限制在常量范圍之內。
  13. This is a heuristic strategy. it can reduce the intersection tests need to be computed between bounding volumes by tracing the traverse process in previous time to gain traverse path in current time. the correctness and validity of collision detection can be guaranteed by maintaining the tracing list

    這是一個啟發式的策略,通過跟蹤國防科學技術大學研究生院學位論文上一時間采樣點對包圍盒樹的過程,確定當前時間采樣點的路徑,從而有效地減少了過程中包圍盒相交測試的次數,提高了演算法效率,同時通過對跟蹤的維護,保證了碰撞檢測的正確性和有效性。
  14. May involve more computation than is obvious - when traversing a hash bucket to find a specific key,

    ,可能比面上要進行更多的處理當一個hash的bucket以期找到某一特定的key時,
  15. An accelerated direct rendering algorith of isosurface for 3d data sets is presented. the problem for calculating the intersections of the ray and the bounding cells pierced by the isosurface can be viewed as the problem of sampling alonga 3d discreteray. it is shown that the algorithm is better on memory requirement and speed than traditional algorithm through its realization on pc

    提出等值面直接顯示演算法,充分利用數據空間的相關性,把體素分為邊界體素和內部體素,並採用體數據邊界示法,降低了內存.繪制等值面時,將視線與邊界體素的求交運算轉化為對離散視線上點的掃描,避開對整個體數據空間的,從而減少了計算量。
  16. This could result in race conditions if one thread is adding to the end of the list while another is iterating through it

    如果將某個線程添加到列末尾時,其他線程正在該列,那麼可能會產生競態條件( race condition ) 。
  17. Number of times the dbcc statement moved from one extent to another while the statement traversed the pages of the table or index

    遍歷表或索引的頁時, dbcc語句從一個區移動到另一個區的次數。
  18. You can then use resulting objects as the starting point for a chained traversal expression in the following way

    接下來,您可以象下面這樣把結果賓語用作鏈狀遍歷表達式的起點:
  19. The third part of the traversal expression is a boolean expression

    遍歷表達式的第三部分是布爾達式。
  20. Versa takes care of this with list operations which work on the results of traversal expressions

    Versa使用列操作實現這一點,列操作運行在遍歷表達式的結果之上。
分享友人