sub tree 中文意思是什麼
sub tree
解釋
子樹-
The tree shrew, which was selected as the experimental animal in our research, is he representative tropic and sub - tropic small mammal distributed in the south of china
中緬樹?是分佈於我國南方的典型熱帶、亞熱帶小型哺乳動物。本實驗室的工作主要涉及到ucp1蛋白質及基因序列的研究。 -
The essence of edid is to set up a normal behavior fuzzy sub collection a on the basis of watching the normal system transfer of the privilege process, and set up a fuzzy sub collection b with real time transfer array, then detect with the principle of minimum distance in fuzzy discern method the innovation point of this paper is : put forward the method of edid, can not only reduce efficiently false positive rate and false negative rate, also make real time intrusion detection to become possibility ; have independent and complete character database, according to the classification of monitoring program, design normal behavior and anomaly behavior etc., have raised the strongness of ids ; use tree type structure to preservation the character database, have saved greatly stock space ; in detection invade, carry out frequency prior principle, prior analysis and handling the behavior feature of high frequency in information table, have raised efficiency and the speed of detection, make real time intrusion detection to become possibility ; have at the same time realized anomaly intrusion detection and misuse intrusion detection, have remedied deficiency of unitary detection method
這種方法的實質是在監控特權進程的正常系統調用基礎上建立正常行為模糊子集a ，用檢測到的實時調用序列建立模糊子集b ，然後用模糊識別方法中的最小距離原則進行檢測。本文的創新點是：通過對特權進程的系統調用及參數序列的研究，提出了基於euclidean距離的入侵檢測方法edid ，不僅能有效降低漏報率和誤報率，而且使實時入侵檢測成為可能；設計有獨立而完整的特徵數據庫，根據被監控程序的類別，分別設計正常行為、異常行為等，提高了檢測系統的強健性和可伸縮性；特徵數據庫按樹型結構存儲，大大節省了存儲空間；在檢測入侵時，實行頻度優先原則，優先分析和處理信息表中的高頻度行為特徵，提高檢測的速度和效率，使實時入侵檢測成為可能；同時實現了異常入侵檢測和誤用入侵檢測，彌補了單一檢測方法的不足。 -
This thesis focuses on techniques of dynamic fault tree in system reliability modeling and its qualitative and quantitative analysis. it studies bdd solution for static sub trees 、 markov chain solution for dynamic sub tree briefly and the modularization of dynamic fault tree ; presents the algorithm for top event occurrence rate of dynamic fault tree based on weibull distribution. then this thesis presents a new approach to solve top event occurrence rate and a new generation algorithm of minimal cut sequence of dynamic fault tree that deviate from markov model completely
本文著眼于動態故障樹在系統可靠性建模及定性定量分析中的技術，研究了基於bdd的靜態子樹分析方法、基於馬爾可夫模型的動態子樹分析方法以及動態故障樹模塊化方法，並提出了基於威布爾分佈的動態故障樹頂事件發生概率計算方法;提出了一種完全脫離馬爾可夫模型的求解動態故障樹頂事件發生概率的方法和一種最小順序割集的生成方法。 -
A query tree can be got from the query decomposing rules, and a query graph can be generated by optimizing the query tree and applying the arithmetic of generating a query graph. at last, a query plan will be generated by using kruskal heuristic arithmetic two times on query scheduler and sub - query combination
通過查詢分解規則可得到查詢樹，對查詢樹進行分解優化並按照查詢圖生成演算法可得到一個查詢圖，然後兩次運用kruskal啟發式演算法對查詢調度和子查詢合併進行了優化，最後產生查詢計劃。 -
According to the complexity of pattern, the mined characteristic patterns could be sorted as frequent item, frequent sequence and frequent sub tree, etc. the paper builds tree - model of rna molecules and utilizes frequent sub tree mining algorithm to mine common topological patterns among rna secondary structures
根據特徵模式復雜性，可分為頻繁項模式、頻繁序列模式以及頻繁子樹模式等。本文對rna分子建立樹形模型，利用頻繁子樹挖掘演算法挖掘rna二級結構中的公共拓撲模式。 -
The basic idea for hierarchy - based method is that creating and maintaining a tree of clusters and sub - clusters according to some kind of criterion to measure the distance of clusters, the procedure will be sloped until some terminal conditions are satisfied. hierarchical clustering method can be further classified into agglomerative and divisive hierarchical clustering, depending on whether the hierarchical decomposition is formed in a bottom - up or top - down fashion. most hierarchical clustering methods can produce the better results when the clusters are compact or spherical in shape. but they do not perform well if the clusters are any shape or there are outliers. a main reason is that the most hierarchical clustering methods employ medoid - based measurement as distance between clusters
基於層次方法的聚類的基本思想足：根據給定的簇間距離度量準則，構造利維護一棵由簇利子簇形成的聚類樹，直至滿足某個終結條件為止。根據層次分解是自底向上還是自頂向下形成，層次聚類方法可以分為凝聚的（ agglomerative ）和分裂的（ divisive ） 。人多數層次聚類演算法在緊密簇或球形簇結構下能夠產生較好的聚類效果。 -
In the thesis, compatible data storage fashion and data structure for a large - scale 3d scene is discussed firstly. then the process technique for dem, spatial object geometry data, texture image data and scene metadata are discussed in turn. finally, a new nested index, scene pyramid + sub scene regular dividing quad - tree is brought forward, which consumes less memory and reduces the complexity of spatial data query
本文首先確定了適用於大規模三維場景可視化的數據結構和存儲方式；然後分別針對dem數據、地物模型數據、紋理影像數據及場景元數據論述了分割與lod處理的方法；最後給出場景金字塔與子場景規則分割四叉樹兩套索引的建立以及具體應用策略，該索引機制減少了內存消耗，降低了數據查找的復雜性。 -
The paper presents a novel algorithm distincttm ( distinct tree mining ), which can mine embedded sub tree
本文提出了挖掘嵌入子樹的演算法distincttm （ distincttreemining ） 。 -
After that, the existent frequent embedded sub tree mining algorithms, treeminer and patternmatcher, are analyzed
在此基礎上，對挖掘嵌入子樹的treeminer演算法和patternmatcher演算法進行了分析。 -
This method can improve analysis efficiency greatly if the size of each dynamic sub tree is far smaller relative to that of system
當每個動態子樹的規模與系統規模相比不大時，可以大大提高分析的效率。 -
Then the paper formulates related notions of frequent sub tree, distinguishes embedded sub tree from direct sub tree, and defines isomorphic overlapped sub tree and minimum
然後給出了與頻繁子樹有關的概念，區分了嵌入子樹和直接子樹，定義了同構交疊子樹和最小性。 -
Dynamic fault tree combines the advantages of both fault tree and markov model. dynamic fault tree is modularized into independent static sub trees and independent dynamic sub trees, then solved by bdd and markov model separately
該方法首先將動態故障樹模塊化，得到獨立的靜態子樹和動態子樹，再分別用二元決策圖法和馬爾可夫過程方法求解。 -
The paper summarizes the history of frequent pattern mining technology and the development of frequent sub tree mining algorithms ; introduces the main methods of rna secondary structure prediction ; analyzes the deficiency of the applications of data mining in bioinformatics
本文首先概括了頻繁模式挖掘技術及頻繁子樹挖掘演算法的現狀，介紹了rna二級結構預測的主要方法，探討了目前數據挖掘技術應用於生物數據所存在的問題。 -
Because ec is simple and it seldom needs any additional information about the problem, ec becomes a general solver of challenge problems. according to the essential property of the discontinuous function, we design a new hybrid coding structure - - point - tree structure, which uses a point to present a discontinuity and a tree to present a sub - function
我們根據間斷參函數識別問題的本質特徵? ?間斷性，設計了一種新的復合編碼結構? ?點樹結構，用點來表示間斷點信息，用樹來表示子函數信息，通過對點和樹的聯合演化來達到尋求最優解的目的。 -
Publishing their findings in the journal of antimicrobial chemotherapy, the scientists said : " although tea tree oil may be an effectie antimicrobial agent when appropriately used at high ( bactericidal ) concentrations, its application at low ( sub - lethal ) concentrations may contribute to the deelopment of antibiotic resistance in human pathogens "
該研究結果發表于《抗菌化學療法》雜志上，科學家們說道： 「盡管茶樹油在高劑量應用時能夠作為抵抗微生物的有效制劑，但其低濃度應用可能會導致人類病原體耐藥性的增加。 」 -
In terms of sub - shifts of finite type determined by an irreducible matrix, affine maps of compacted connected metric abelian group and continuous maps of tree, the two concepts of topologically ergodic map and topologically transitive map are identical
指出對于由不可約方陣所決定的符號空間有限型子轉移而言，或緊致交換群的仿射變換及樹上連續自映射而言，拓撲遍歷與拓撲可遷這兩個概念是一致的。
分享友人