樹形文法 的英文怎麼說
中文拼音 [shùxíngwénfǎ]
樹形文法
英文
tree grammar-
In this paper, the morphological characteristics of nine endophytes isolated from the barks, stalks, branches of taxus cuspidate sieb et zucc. grown in changbai nature reserve in northeast china ' s jilin province are studied through observation, description, shooting of culture - characteristics and microstructure
本論文通過培養性狀觀察、製片檢查，描繪及攝影等方法研究了分離自長白山自然保護區東北紅豆杉（ taxuscuspidatesiebetzucc . ）樹皮、樹莖和樹枝的9株內生真菌的形態學性狀。Firstly the patterns of the multifingered hands are detailed, eight patterns are defined. the classical bayes method is used in the classification of pre - grasp of multiple fingers based on three patterns which are grasping, holding and pinching. based on the eight pre - grasp patterns, bp neural network is applied in the classification of the pre - grasp of multifingered hands and gets a good effect. the method solves the shortcoming input sample relying on the propobility density and simplified the un - insititution characters extraction. in this paper, support vector machine ( svm ) and binary - tree with clustering is applied in the classification. this method can solve the slow speed and effect with fewness sample in the classification, achieving a good effect. in this papper, we extract the characters of the regulation object with geometry characters and extact the unregulation object with the image analysis
此法解決了輸入樣本依賴物體的概率密度的特點，簡化了分類特徵提取的不直觀性。本文還採用了支持向量機（ svm ）和聚類二叉樹相結合的方法對機器人手預抓取八類模式進行分類，解決了預抓取模式分類訓練速度過慢以及在分類中樣本數量偏少而影響分類效果的問題，得到了較高的正確率。本文對預抓取幾何形狀規則的物體採用直接提取其幾何特徵，對于預抓取幾何形狀不規則的物體採用圖像分析的方法進行特徵提取。Fractal coding has been proved useful for image compression. it is also proved effective for content - based image retrieval. in the paper, we present a block - constrained fractal coding scheme and a matching strategy for content - based image retrieval. in this coding scheme, an image is partitioned into non - overlap blocks of a size close to that of a query iconic image. fractal codes are generated for each block independently. in the similarity measure of fractal codes, an improved nona - tree decomposition scheme is adopted to avoid matching the fractal codes globally in order to reduce computational complexity. our experimental results show that our coding scheme and the matching strategy we adopted is useful for image retrieval, and is compared favorably with other two methods tested in terms of storage usage and computing time
分形編碼在圖像壓縮方面取得了很好的效果，同時，分形編碼也能夠用於基於內容的圖像檢索.本文提出了一種基於塊限制的分形編碼演算法和匹配策略，並將它們用於圖像檢索.在我們編碼演算法中，圖像會被預先分成互相不重疊的子圖像塊，然後對這些子圖像進行獨立地分形編碼，從而獲得整幅圖像的分形碼.該編碼演算法能夠在很大程度上減少編碼時間.在進行圖像間相似性的匹配時，我們採用改進的基於九叉樹的分配策略，從而避免全局地進行分形碼的匹配，減少了計算量.實驗結果說明，我們的編碼演算法和匹配策略能夠比較有效地應用於基於內容的圖像檢索，在計算時間和存儲時間上都優于實驗中其它兩種方法How it would be a weakness in the government to break down in this attempt to practise for popularity on the lowest national antipathies and fears, and therefore mr. attorney - general had made the most of it ; how, nevertheless, it rested upon nothing, save that vile and infamous character of evidence too often disfiguring such cases, and of which the state trials of this country were full
如果政府竟想借最卑下的民族對立情緒和畏懼心理做文章來進行壓制，樹立威信檢察長先生對此曾大加渲染，那恐怕只會成為政府的一種弱點。可惜這種做法除了證詞那邪惡的不光彩的性質只會歪曲這類案件的形象之外全無根據。它只能使我國的國事審判里充滿了這類案件。On the view of customization theory, the method of information processing for customization is summarized : quality function development and product function architecture, then the need function development ( nfd ) as the design way of implementing sub - system of customization information dealing is proposed based on them. the configuration include three parts : transmission function, need function and developing function. the adapting four steps for implementing are proposed : the collection and classification stage of customization information, the analysis stage of customization information, matching stage and evaluating stage for producing
尤其是從mc個性化理論出發，總結前人個性化信息處理方法：質量功能配置法和產品族構建法的基礎上，提出基於樹形的兩極需求功能配置法的框架：傳導函數、需求函西安理工大學碩士學位論文數、配置函數，作為個性化信息處理子系統的設計思路，並詳細闡明了該方法的四個實施步驟：個性化信息收集和分類階段、個性化需求分析階段、個性化需求信息配置階段、可製造性評價階段，指明了各個階段的方法在個性化信息處理子系統中的應用，為個性化信息處理于系統的實現奠定了基礎。The techniques related terrain lod is systematically studied based on the quadtree data structure. combining the data block attemperation idea, we solved the data integrating and preculling problem, presented the boundary constraining solution, and calculated the collision detection for rambling
本文在四叉樹結構的基礎上較為系統的研究了地形相關lod技術，結合數據分塊調度思想，解決了數據連接和預裁剪問題，給出了邊界約束問題的解法，並針對漫遊計算了特定的碰撞檢測。This thesis gives a brief account of the basic theories of software engineering and computer graphics, of the data structure of individual component modeling, of the design of the software structure and of the method of realizing software. meanwhile, this thesis put more emphasis on the exploration of the arithmetic of the delaunay triangle network, nurbs curve integration, the filling - in arithmetic of triple - tree, and the arithmetic based on the scan - line arithmetic and the filling - in of complex section
文章介紹了關于軟體工程學與計算機圖形學的基本理論及其各組件模型的數據結構、軟體結構設計與軟體實現的技術方法，並重點討論了基於約束條件的delaunay三角網格化演算法、 nurbs （非均勻有理b樣條）曲面擬合、三叉樹等值線填充演算法和基於掃描線的復雜剖面填充演算法。Aiming at this problem, the main research issues and achievements in this paper are as follows : bi - directional data transformation between rdb and xml with semantic constraints preserved for most of existing researches on static data transformation between xml and rdb, dtd is taken as the schema description language for xml, and the semantic constraints are often lost during the transformation process. to overcome these disadvantages, the author adopts xml - schema, a standard schema description language proposed by w3c to replace dtd, as the description method owing to its more powerful functions than dtd, and of course with the syntax much more complicated. after analyzing the constraints characteristics in both xml - schema and relational schema, a semantic constraints - preserved algorithm is proposed which can realize the bi - directional schema mapping between rdb and xml through a formalized description of xml based on regular tree and a general expression for relational schema based on direct graph approach
保留語義約束的xml與rdb雙向靜態數據轉換技術現有研究大多採用dtd （ documenttypedefinition ，文檔類型定義）作為xml的模式描述語言，並且在模式映射過程中丟失語義約束信息，本文分析了xml - schema （ xml - schema採用與dtd完全不同的語法，數據描述能力更強同時也更為復雜，已被w3c確定為替代dtd作為xml模式描述語言的標準）及關系模式的語義約束特徵，通過基於正則樹的xml形式化描述方法以及基於有向圖的一般關系模式表示方法的研究，建立保留語義約束的xml - schema與關系模式的雙向模式映射演算法，實現了xml與rdb的雙向數據轉換，較好地解決了xml與rdb在靜態數據轉換層面的數據集成問題，可有效滿足企業大量rdb數據面向xml的發布以及與日俱增的xml數據存入rdb的應用需求。We analyze the assembly model and propose a mathematics model and tree - representing model of the assembly who not only has a small data size, but also can be manipulated easily. this thesis not only gives the virtual representing concept the instance representing one, but also defines the concept of assembly constraint such as coupling, being alignment, being coaxial and being equidirectional. based on such concepts, a revised newton - raphson iterative algorithm is proposed, which can deal with the singularity and ill - condition of jacobi matrix
首先分析了裝配體的模型問題，提出了裝配體的數學模型及樹形式表示的裝配體表示模型，模型具有數據量小、操作簡單的優點：文章對所涉及的約束諸如耦合、對齊、同軸、同向的裝配體位置描述概念進行了定義，引入了裝配約柬概念，從而提高了裝配設計效率；在此基礎上，文章討論了裝配約束的求解方法，提出了newton rapson迭代法的改進演算法，使得系統能更好地處理jacobi矩陣的奇異和病態的情形。This article, according to the common digital keyboard on the mobile communication equipment, make essential research for windows ce - embedded operation system in chinese character input technology and realize with digital keyboard. using tree - like structure that has the space complexity o ( n ) and the time complexity of o ( n ) when searching to store chinese information. chinese input method applying this kind of store technique in chinese table has the quality of high input speed and low memory space
本文就根據移動通信設備上常見的數字鍵盤，為windowsce嵌入式操作系統在漢字的數字鍵盤輸入技術及其實現方面作了必要的研究；並使用了一種在查找時空間復雜度為o （ n ） 、時間復雜度為o （ n ）的樹形結構來存儲中文信息，使用這種存儲技術作為碼表內存存放方式的漢字輸入法具有輸入速度快、佔用空間少的優點。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二級結構中的公共拓撲模式。Establishing 3 - d terrain models with vector contour lines and elevation terrain models with the help of the determination of space corresponding relations between contour lines, tile operation and branch operation. explanation of real - time reflection of terrain models, including three algorithms in lod technology, compared with quadtree algorithm, roam algorithm and the algorithm based on the intermediate belt, to show the advantages and disadvantages of the different situations of the terrains, so as to find out the right algorithm, the quadtree algorithm. developing and implementing the fast demonstration on the vc platform with three - dimentional visualization techniques, such as vrml and opengl, providing a persuasive argument for the research
論文首先概括介紹了用等高線快速建立3d地面模型和顯示的相關技術，並論述了課題研究的背景和選題依據;其次，論文闡述了如何對等高線數據進行預處理，提出了有效的得到矢量化等高線的方法;再次用矢量化的等高線數據建立三維地面模型，通過等高線間的對應關系的確定、瓦片操作、分支操作建立地面的高程模型;然後論文對地面模型的實時渲染問題進行了深入闡述，主要是從lod技術的三種演算法著手進行研究，通過對比四叉樹演算法、 roam演算法和基於過渡帶演算法對不同種情況的地面數據顯示的優缺點，再結合本系統的地形數據的特點選擇了適合的演算法:四叉樹演算法;最後，用vrml和基於opengl的三維可視化技術在vc平臺上開發並實現了地形的三維快速顯示系統，為論文的研究內容提供了有力的論證。Otherwise, ktrp has resulted in bypass routing between some wr. this thesis brings forward a method to improve ktrp aiming at the bypass routing problem. to improve ktrp, we basicly kept the tree - shaped topology, adding some physical loop to generate sigle - hop routing between some wr
針對ktrp協議中樹形拓撲可能造成部分wr之間形成迂迴路由的問題，本文提出了一種改進方法，在基本保持wr的樹形拓撲基礎上，增加少量物理環路，使部分wr之間形成單跳路由。Now the method of lever set is wildly used like crystal grows, etc. this paper mainly explains the application in the moving interface aspect of the method, which based on fast tree redistancing for moving interface, including definition of level set method, adaptive mesh ( octatree ) and interpolation of scattering points
水平集方法現已得到廣泛的應用，如晶體增長等。本論文主要闡述了水平集方法在求等距問題方面的應用，即一種基於樹形結構的快速等距面計算方法，包括水平集方法的定義，自適應網格剖分（本論文採用八叉樹的方法）以及離散點的插值。The local structure of chain - type models and tree models based - on bayesian dirichlet metric are mainly studied, and the theoretic foundation for creating those models is provided. simultaneously, the algorithms to create chain - type and tree models are presented. these chain - type and tree models to be investigated have obvious causality with high posterior probabilities
本文通過研究基於bd度量的鏈形和樹形模型結構性質，給出了構建鏈形和樹形模型的演算法步驟，使所構建的圖形模型具有明顯的因果關系和較大的后驗概率。After shot cutting and clustering, the thesis studies the approaches of detecting shots which contains the anchorperson and the methods of news story detection. based on these, a meaningful story and the hierarchical structure of the video content can be produced
本文在有效進行視頻鏡頭切分和聚類的基礎上，研究歸納了播音員鏡頭探測和新聞故事單元探測的一般方法，生成有意義的視頻故事，同時形成了樹形的視頻內容層次化結構。In chapter 5, common representations of user profiles are introduced firstly, and then the representation based on huffman tree is discussed. on the base of this representation, documents filtering a
本文分析了表示用戶個性化模式常用的幾種表示方式，並提出了一種基於huffman樹形式的個性化模式表示方法。4. advancing a new representation of user profiles and corresponding filtering algorithm based on huffman tree how to provide users what they really want faster and more exactly is the development focus of information retrieval systems
提出一種基於hudria n樹形式的個性化模式表示方法及相應的文檔過濾演算法如何更快、更準確的向用戶提供其所感興趣信息是當前搜索引擎系統發展的方向之一。The paper briefly introduces the basic theory of fault tree analysis and rule - based expert system, and offers to combine fault tree analysis with rule - based expert system. by connecting fault tree to diagnosis knowledge base through cut set, we can express expert knowledge totally, systematically, and logically by building fault tree. it makes automatic knowledge acquisition come true to obtain diagnosis rule base automatically according to the fault tree
本文簡要闡述了故障樹分析法和基於規則的診斷專家系統的基本原理，提出將故障樹分析法與基於規則的診斷專家系統相結合的方法，通過割集將故障樹與診斷專家系統知識庫聯系起來，用建立故障樹的形式全面、系統、層次性地將專家知識表述出來，由故障樹自動生成基於規則的專家系統診斷規則庫，實現了診斷知識的自動獲取，並且確保了診斷知識的一致性和完備性。Both temporal and spatial views are taken account into creating sparse position number, lifespan and other node properties for every document node in the tree document structures of z - office. and a new algorithm based document update maintenance is proposed and implemented in the system. with the support of these works, z - office can retrieve all versions efficiently and quickly
具體來說就是利用空間性和時間性的概念，針對z - office文檔，為其樹形文檔結構上的每個節點位置進行稀疏編碼並賦予節點生存區間以及其它一些附屬信息，然後在文檔增量存儲上使用了本文提出的文檔更新維護演算法，使得改進后的方案不需要往前或往後推算即可直接獲取任意版本的z - office文檔。分享友人