subtree 中文意思是什麼

subtree 解釋
樹狀子目錄
  1. In the third parts : based on davis ? self - quantization of subtrees, the fractal coding in the wavelet domain put forward orientaiton wavelet - subtree fractal coding, this coding encodes individually towards wavelet - subtree, at the same time, davis put forward the image coding concerning the disadvantage existing in rinaldo and calvagno ? fractal predictive case

    第三部分：以davis提出的小波樹的自量化（ self - quantizationofsubtrees ）編碼演算法研究現有小波域內的分形圖像編碼方法，在現有方法的基礎上，提出了方向性小波樹的分形編碼方法。
  2. Calling the function on a subtree of the document can diminish the risks, but xml s flexible nature makes it quite difficult to ensure that the subtree you are operating on has the structure you are expecting, and that it doesn t have spurious child nodes with the name you are searching on

    在文檔的子樹上調用該函數可能會降低風險，但由於xml的靈活本質，使確保您所操作的子樹包含您期望的結構，且沒有您正在搜索的名稱的虛假子節點就變得十分困難。
  3. This paper presents the conversion from dynamic logic gate to markov chain, the solution of dynamic subtree top event failure probability and the method of obtaining the failure mode of subsystem using markov model, that is sequence cutsets of the dynamic subtree. the typical approach to importance analysis of component is impractical for large systems in markov model, so this paper also provides a simple and intuitionistic graph solution based on markov chain

    論文研究了動態邏輯門向馬爾可夫鏈的轉化方法，利用馬爾可夫鏈法求解動態子樹頂事件概率，以及通過馬爾可夫狀態轉移圖直接找齣子系統的故障模式和薄弱環節，即得到動態子樹的順序割集。
  4. The provider uses a subtree search starting at the search point specified in the connection string

    提供程序從連接字元串中指定的搜索點開始執行子樹搜索。
  5. All other operations, including any search methods, perform subtree searches rooted at the container

    所有其他操作（包括所有搜索方法） ，都以該容器作為根來執行子樹搜索。
  6. The provider uses a subtree search starting at the search point specified in the connection string to determine whether a user exists

    提供程序從連接字元串中指定的搜索點開始執行子樹搜索，以確定用戶是否存在。
  7. By computing the cost of the cheapest subtree with size constraints of the partial tree ( this is an upper bound on the cost of the final optimal tree ) and lower bounds on the cost of subtrees of varying sizes that are rooted at nodes of the partial tree, the algorithms can identify and prune nodes that cannot possibly belong to the optimal constrainted subtree

    建樹階段設置大小限制的修剪演算法是通過計算出不完整樹的最小代價得到優化樹的代價上限，根據此上限以及計算出的節點的實際代價來修剪節點的。在預測模型中應用了在建樹階段加入大小限制條件的修剪演算法。
  8. Step 1 : creating a replicated subtree on a master server

    第4步：復制數據到復制服務器
  9. To delete an entire subtree in the directory

    結合使用可刪除目錄中的整個子樹。
  10. Select the subtree that you want to replicate and click

    選擇希望復制的子樹並單擊
  11. Adds an element to another element s subtree

    將元素添加到其他元素的子樹中。
  12. Credentials placed in the replicated subtree are created beneath the

    復制子樹中的憑證可以在
  13. Has the ability to read an xml dom subtree

    能夠讀取xml dom子樹。
  14. We add a new subtree so that this node can be expanded

    我們添加一個新的子樹以使這個節點可以展開。
  15. Enter the dn of the subtree i. e

    輸入希望復制的子樹dn ，比如
  16. True to recursively clone the subtree under the specified node

    ，則遞歸地克隆指定節點下的子樹；如果為
  17. Create replicated subtree on a master server and define what it contains

    在主服務器上定義復制子樹及其內容。
  18. Node in a separate subtree of the xml with user names grouped by particular interests such as acrobatics, bicycling, computers

    節點，並根據特定興趣（如特技、自行車、計算機）將用戶名分組。
  19. The same argument applies for ldap connections that require binding with a specific credential to an ldap subtree

    Ldap連接需要將ldap子樹與特定證書綁定，因而也有同樣的問題。
  20. A replicated subtree is a portion of the dit that is replicated from one server to another

    復制子樹是從一臺服務器復制到另一臺服務器的dit的一部分。
分享友人
分享到 Line

分享到臉書