intermediate tree 中文意思是什麼

intermediate tree 解釋
間型木
  • intermediate : adj 中間的，居間的。 The intermediate class （船的）特別三等。 An intermediate compound 中間化合...
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木，也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 2 木...
  1. Phylogenetic analysis based on the amino acids of the ubiquitin / ribosomal fused proteins of different animals well reflected the established phylogeny of the chosen organisms, and amphioxus was branched off from chordates and formed a separate cluster with an intermediate placement between invertebrates and vertebrates in the tree

    通過對ubiquitin的系統進化分析，發現文昌魚ubf80除了具有脊椎動物和無脊椎動物的特徵外，還具有自己的一些獨特的特徵，從分子水平上支持了文昌魚是脊索動物進化過程中的一側枝的觀點。
  2. The gcc compiler scales very well - from simple batch utility programs to multimillion - line systems. it is the clear syntax tree front end, the highly recapitulative intermediate language and the concise machine description back end that help gcc port to kinds of platforms

    其清晰的前端語法樹結構、高度概括的抽象機中間語言、簡潔有力的後端機器描述等三部分為快速實現多語種開發、多平臺移植提供了有力的支持。
  3. According to the program structure of ansi c, some syntax - tree - nodes are designed in front - end, including function, block, data structure, type, expression, identifier and so on. syntax tree is divided into three levels, namely program level, function level and block level, which are useful for analysis of syntax and semantic in compiler as well as transferring syntax tree into rtl. retargetable compiler mainly includes intermediate representation, machine description and interface technique between compiler and machine description

    編譯前端的實現技術包括詞法分析、語法語義分析和中間代碼生成技術等，針對ansic的程序結構，分別設計了函數、塊、數據結構、類型、表達式、標識符等語法樹結點，並將語法樹分成編譯層次、函數聲明和塊三個不同層次，使語法樹具有清晰的層次結構，有利於編譯程序的語法和語義分析，以及從語法樹到rtl中間表示的轉換。
  4. An abstract syntax tree is built after syntax analysis and traversed three times to do semantic analysis to generate the intermediate code

    在語法分析、語義分析及中間代碼生成方面，先經過語法分析建立抽象語法樹，然後對抽象語法樹進行三次遍歷完成語義分析並生成中間代碼。
  5. Data warehouse is a hot research area in 90s its main motif is to provide the decision - maker a powerful tool : gathering the data in pure consistent, relevant pattern, and making use of the data in managing analyzing, data - mining purposec that means that the decision - maker can use the tool to understand, grasp the situation of the business from different directions and forecast the future of it when using data warehouse, the processing speed determines data warehouse ' s practicability and processing ability the hoc ( highway decision center ) system realized before solves some key problems about intermediate scale data, mainly concentrating data warehouse performance coefficient when using hdc in large scale data, it encountered processing speed problem then the settlement of this problem becomes a major research point so, based on the former research achievements, the present task is to construct the renowned data warehouse architecture and its relevant algorithms, then adapts the system to the large scale dataset with data mining functions c this paper is a part of the research in order to construct the powerful system, a key problem is to cope with the processing - speed problem and the data space problem, etc, - caused by the large scale dataset and magnificent dataset this is also the core in the present data mining research this paper ' s motive is to design and realize a decision - tree classifier in the data warehouse system for large - scale dataset

    大型數據倉庫的處理速度問題目前是制約其推廣應用的關鍵所在，也是這一領域的一個重要研究課題，也正是我們當前工作的重點：在前期研究工作的基礎上圍繞提高大型數據倉庫處理速度問題，建立改進的數據倉庫系統模型和相關演算法，開發出面向中級以上企事業單位的、具有數據挖掘和分析能力的大型數據倉庫系統。建立大型數據倉庫所面臨的關鍵問題，是如何妥善解決實際業務數據的大規模、海量特徵所帶來的處理速度和空間等問題，這也是當前挖掘技術研究必然面對的核心問題。本研究的目的是設計並實現大型數據倉庫系統中的分類數據挖掘工具? ?決策樹分類器，主要工作是在綜合了解現有決策樹分類演算法的研究情況的前提下，對決策樹演算法適應大規模數據集的問題進行探討，力求設計出能較好地適應大規模數據的分類器演算法。
  6. Moreover, we present an intermediate representation for parsing tree of cfl sentence that can be easily implemented and needs less space occupancy

    此外，為上下文無關語言句子的分析樹設計了一種簡單表示形式，這種表示形式可以提高空間效率，並且易於實現。
  7. Learn a unique workflow to rendering in xsi and compositing using the integrated fx tree with over 2. 5 hours of project - based training. perfect for intermediate artists

    通過2 . 5小時以項目為基礎的訓練，學習一種獨特的工作流，在xsi中?進行渲染，混合使用完整的fx樹。
  8. Secondly, when processing branching queries, compared with the join method, the amount of nodes that need to be traversed in the xml data tree here could be reduced to a great extent, what is more, it would not need to store intermediate results to obtain the final result, which makes it engrosses little memory

    第二、對于分支查詢的處理，相比于join的方法，所需遍歷的節點數量得到很大程度的降低，並且無須保存中間結果即可得到最終結果集，內存開銷極小，使得分支查詢的處理效率明顯提高。
分享友人
分享到 Line

分享到臉書