tree performance 中文意思是什麼

tree performance 解釋
樹姿
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木，也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 2 木...
  • performance : n. 1. 執行，實行，履行；完成；實現；償還。2. 行為，動作，行動；工作。3. 性能；特性。4. 功績；成績。5. 演奏；彈奏；演出；（馴獸等的）表演；把戲。6. 【物理學】演績。
  1. Camptotheca acuminata is a tree unique to china, producing terpenoid indole alkaloid ( tia ) 10 - hydroxycamptothecin ( hcpt ) and camptothecin ( cpt ), which possess strong anti - cancer bioactivity. the dynamics of hcpt and cpt during seed maturation, seed germination, post - germinative development and daily growth were measured by hplc ( high performance liquid chromatography )

    應用高效液相色譜技術對我國特有樹種? ?喜樹（ camptothecaacuminata ）在種子形成、成熟、萌發、幼苗生長及高溫脅迫過程中喜樹堿和10 -羥基喜樹堿的代謝動態進行了詳盡的研究。
  2. The ultimate refinement of advanced-generation selection is the development of indices which optimize the relative weighting of half-sib full-sib and individual tree performance.

    下一代最後的精選，就是制定適合於全同胞、半同胞和單株表現的相對權重的指數。
  3. First, we have expatiated the working principle, performance parameters and major technologies. farther, we have analyzed the shortcomings of the existing catalog search engine and introduced the clustering analysis and the ant algorithm ; on the basis of this, we discussed the possibility and necessity of the connection between them, which avoids the local optimization of the clustering analysis to a degree. in the end, we appraise the idea that we deal with the information data by the data structure of the binary tree, m - branch tree and tree established by the ant algorithm, which can improve the efficiency of the search engine

    首先闡述了搜索引擎的工作原理，性能指標，主要技術；分析了現有目錄式搜索引擎的缺點，接著介紹了聚類分析演算法與螞蟻演算法的理論，並論述了二者結合的可能性和必要性，這種結合方法也在一定程度上克服了聚類分析演算法容易陷入局部最優的缺點，最終提出了通過使用螞蟻演算法建立二叉樹、 m叉樹和樹作為信息數據處理的思想，大大提高了搜索引擎搜索的效率。
  4. Searching in high - dimensional spaces : index structures for improving the performance of multimedia databases. acm computing surveys, 2001, 33 : 322 - 373. 2 guttman a. r - tree : a dynamic index structure for spatial searching

    本文試圖將高維空間中的每個點對應的兩種距離尺度通過線性組合的方式表達成復合距離尺度，從而能夠較好地縮小查詢空間，提高查詢效率。
  5. Space - time codes can be divided into tree mainly parts : bell layered space - time architecture ( blast ), space - time trellis codes ( sttc ) and space - time block codes ( stbc ). in this paper, we mainly compare the performance of blast and stbc in many aspects, such as design criterion, transmission rate, diversity gain, diversity combining, bit error rate and channel capacity etc. in this paper, we first respectively analysed the instantaneous received symbol energy - to - noise ratio of v _ blast in the diversity combining methods of maximal ratio combining ( mrc ), equal gain combing ( egc ) and selective combing ( sc )

    Mimo技術核心是空時編碼（ stc ） 。空時編碼主要分為三種:分層空時碼（ blast ） 、空時格碼（ sttc ）和空時塊碼（ stbc ） 。本文主要對分層空時碼和空時塊碼這兩種編碼方式在設計準則、傳輸速率、分集增益、接收合併、比特差錯率和通道容量等方面進行了較為詳盡的研究。
  6. An optimized method of clock - tree is introduced. the whole length of the clock - tree is reduced by decrease the load of new node, the performance of clock - tree is improved

    摘要介紹了一種新的時鐘樹優化策略。通過減小時鐘樹子節點的負載，從而減少整時鐘樹線長，使時鐘樹性能得到了提高。
  7. My performance and tuning tests were primarily focused around extracting an uncompressed kernel source tarball from a ram disk to the test filesystem, and then recursively copying the new source tree to a new directory on the same filesystem

    我的性能和調整測試主要是關于將ram磁盤中未壓縮的內核源文件tar包（ tarball ）抽取到要測試的文件系統，然後遞歸地將新源文件樹復制到同一文件系統中的一個新目錄中。
  8. Regulations of apparatus performance for tree seed testing

    林木種子檢驗儀器技術條件
  9. After this performance, the seoul initiates sang several other songs, followed by a great surprise by the young initiates - a short and humorous musical program based on a song master once sang for initiates : " tie a yellow ribbon round the ole oak tree.

    而最後的壓軸節目帶給漢城同修很大的驚喜，這是一場滑稽逗趣的歌舞表演，這個表演是根據師父以前為同修唱過的歌橡樹上的黃絲帶改編而成，小同修們充滿活力趣味橫生的演出，令每個人從頭笑到尾。
  10. Finally, the size of trees and the area required for field trails create considerable difficulties in assessing the performance. the technology of plant genetic transformation provides a efficient method to overcome many of these obstacles and to accelerate tree - breeding programs

    植物遺傳轉化能在分子水平上改造植物的遺傳物質，它可以打破物種之間的生殖隔離障礙，定向改造植物遺傳性狀，提高了育種的目的性和可操作性。
  11. In the design of crossover, we first merge two parent trees to a graph, and then create a multicast tree from the graph. based on the method, the algorithm have a good performance of crossover

    在雜交運算元的設計上，通過對兩個父代個體結合，然後再生成組播樹的方法，使演算法具有較好的雜交性能。
  12. I study mainly the storage of record and object, and bring forward the method of storage when the instance of object is embodied inside of record. 3 ) in the aspect of indexing, i presented a method that is generalized b - tree ( gbt ) and combining technique of founction template of c + + build the universal algorithm of queries, insert and delete. 4 ) finally, i analyze deeply and improve the query processing system of ormdbms, and confirm performance algorithm of linking and queries based on relational database. management system ( rdbms )

    在系統結構和特性中分析了系統所採用的兩層體系結構，並且詳細探討了在設計和實現數據庫時所涉及到的幾個主要問題：支持復雜對象、類型擴充、繼承機制和規則系統等；在存儲機制的討論中，主要研究了記錄和對象以及包含了對象實例記錄的存儲方法；在索引技術研究中，本文提出了類屬b樹的索引方法，通過c + +的函數模板技術給出了通用類屬b樹查詢、插入及其刪除的基本演算法；最後，文章以關系數據庫為基礎，深入分析並改進了在對象關系多媒體數據庫中的查詢處理系統，確定了選擇和連接操作的具體演算法。
  13. Support for multiple tree active directory forests. improved server api performance

    支援多重樹狀目錄的active directory樹系。
  14. A novel coding algorithm was presented for still ima ge using biorthogonal wavelet transform. combined with the visibility preaccentua tion before the quantization ， a new data structure named extended q _ tree was pro posed to organize wavelet transformation coefficients. experimental results show that the new algorithm is very practical and with good performance

    研究了一種基於雙正交小波變換的靜止圖象編碼演算法.結合帶視覺加權的標量量化技術，提出了一種新的數據結構? ?擴展四叉樹，從而實現了一種性能較好、復雜度較低的靜止圖象編碼方案
  15. The relationship between application and performance topology, and the feasibility, practicability of end - to - end measurement are analyzed ; then the network nodes are grouped by bottleneck bandwidth measurement to minimize the number of the nodes in sets, and detect the tree of the nodes by analyzing performance relationship especially ; finally, the feasibility and practicability of this method are verified by simulation

    分析了分散式應用與網路性能拓撲結構的關系，以及利用端到端測量進行拓撲劃分的可行性和實用性;然後通過測量瓶頸鏈路的方法對節點進行分組劃分以縮小集合節點個數，再具體分析利用性能相關性探測節點集合的樹型拓撲結構;最後通過實驗模擬檢驗了這一拓撲探測方法。
  16. An attribute means clustering binary tree is presented in this paper. the binary tree is extends naturally and turns to be a supervised classification method. the orl database is used to evaluate the proposed method. the performance of the attribute means clustering binary tree used in face recognition is compared with the standard eigenface approach and improves their performance much in the experiment

    在無監督的屬性聚類網路的基礎上，提出了一種二叉樹分類方法。此二叉樹自然地在無監督聚類的基礎上擴展開來，成為一有監督的分類方法。用orl人臉數據庫做了測試，同標準的特徵臉eigenface方法相比，識別率得到了較大的提高。
  17. According to the practice of the process of design performance system for china telecom xian branch, bsc has been introduced into performance management to certain the performance assessment element by made the indexes of finance / benefit, service / operation and develop all get together. then use the method named value tree tc make the enterprise strategy mission decomposed to every department and post, establish the system of performance management index by select kpi, and use moon chart to estimate the weight of index in order to ensure assessment emphasis. the last but not the least important is sign a performance agreement with every person, to achieve two - way communicate of performance objective and make personnel grow with enterprise

    在進行績效管理體系設計的過程中，引入「平衡計分卡」 ，確定該企業績效考核評價要素，使財務效益類指標與服務經營類、學習成長類指標相結合；使用「價值樹」方法，將該公司的總體戰略指標分解到各個部門、各個崗位；通過關鍵績效指標（ kpi ）的選擇，建立了部門和個人的績效考核指標體系；採用「月亮圖」法確定指標權重，明確崗位考核重點；最後，以逐級簽訂「績效協議」的方式，實現企業績效目標雙向溝通、企業與員工發展共進的績效管理目標。
  18. 3 a new group key management scheme based on a full and balanced tree scheme in conjunction with one - way hash chain is proposed. by comparison, we find that it has good performance of low re - key communication costs and scalable property

    提出一種採用單向哈希鏈結合完全平衡樹的分層密鑰管理方法，比較表明它在密鑰更新時通信次數較少，是一種高效的密鑰管理方案。
  19. After analyzing the performance of the coherent tree - structured optimal joint detection ( tsojd ) for qpsk signals and deriving a non - coherent multi - user weight / phase estimator, the dissertation proposes a low complexity non - coherent multi - user weight / phase optimal joint detection algorithm. besides, the dissertation proposes a partial coherent multi - user / iv weight / phase optimal joint detection algorithm and some useful conclusions are obtained in comparison experiments. 4. in the research on the diversity techniques for fast fading multi - path channels, the dissertation proposes a time - scale rake receiver, and analyzes its performance with the conception of auto - wavelet - transform ( awt ) and time - - scale resolution

    提出了過飽和低復雜度qpsk信號的樹型最佳聯合檢測演算法，並分析了相應最佳接收機的性能及相位偏差對性能的影響等問題；考慮了載波相位和多用戶信碼的聯合檢測問題，通過理論推導給出了過飽和多址系統中多用戶信碼/相位聯合估計子，提出了低復雜度非相干多用戶信碼/相位最佳聯合檢測演算法，並分析了此非相干最佳接收機的誤碼性能及相位提取誤差等有關問題；提出了部分相干多用戶信碼/相位最佳聯合檢測演算法，通過計算機模擬分析了該接收機的誤碼性能及相位提取誤差等有關問題，並與相干、非相干解調兩種情況作了比較，得出了一些有益的結論。
  20. Five novel algorithms are proposed. they are pca support vector machine algorithm which is based on the idea of combination multi - class classification, weighted pca support vector machine algorithm, wavelet support vector machine borrowed idea from the kernel function, rs - svm dynamic prediction and fuzzy binary tree support vector machine. the performance and applications of the algorithms are studied in depth

    本文分析和總結了現有的幾種典型支持向量機演算法，提出了基於組合式多類別分類器思想的pca支持向量機演算法、加權pca支持向量機演算法、借鑒核函數方法的小波支持向量機演算法、 rs - svm動態預測方法、模糊二叉樹支持向量機等演算法，對其演算法性能和應用作了深入研究。
分享友人
分享到 Line

分享到臉書