簡化路徑 的英文怎麼說

中文拼音 [jiǎnhuàlùjìng]
簡化路徑 英文
simplify path
  • 簡 : Ⅰ形容詞（簡單） simple; simplified; brief Ⅱ動詞1 （使簡單; 簡化） simplify 2 [書面語] （選擇人才...
  • 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
  • 徑 : Ⅰ名詞1 （狹窄的道路; 小路） footpath; path; track 2 （達到目的的方法） way; means 3 （直徑的簡稱...
  • 簡化 : simplify; facilitate; idealization; dilution; simplification; reducing; simplifying; [自動化] red...
  • 路徑 : 1. （道路） way; route; trajectory; path; tail; travel2. （門路） method; ways and means
  1. Third, this dissertation analyzes the complicacy of result size estimation problem for xml structure based query optimization compared to its counterpart in traditionally relational database, and proposes a full - featured result size estimation algorithm for xml query, sxm. for simple path expression query, this dissertation proposes a dynamic synopsis model for xml data based on the concept of f - stable and b - stable, xmap. for complicated path expression query, this dissertation adopts an improved bifocal sampling method for result size estimation

    第三，分析了xml結構化查詢優化中的查詢代價估計問題與傳統關系型數據庫中的查詢代價估計問題的區別，提出了一套完整的xml結構化查詢代價估計體系sxm ，包括對簡單路徑表達進行查詢代價估計的動態xml數據統計模型xmap ，對復雜路徑表達進行查詢代價估計的雙焦點例舉法，以及對值匹配條件進行查詢代價估計的基於小波的多維直方圖方法，並能將多種查詢表達的查詢代價估計結果結合在一起，以給出一個完整的xpath查詢的代價估計。
  2. Domain ontology can be modeled a simple directed acyclic network, subsumption relation between two concepts can be computed by the ( immediate ) ancestor or descendent algorithm in a ~ ( h ), association degree between two concepts can be computed by the shortest path algorithm in a ~ ( h )

    領域本體可以模型化為一個簡單有向無環網路，概念之間的包含關系可以通過a ~ h中的（直接）前驅后繼演算法來求解，而概念之間的關聯度可以通過a ~ h中的最短路徑演算法來求解。
  3. In computation of swept volume approximation, an improved technique to generate the swept volume approximation for arbitrary meshes is presented by introducing generator simplification and path resample using frenet moving frames along the discreted sweeping trajectory. other steps, such as a directed distance field computation on a uniform grid based on the hardware accelerated computation technique and iso - surface extraction using marching cubes algorithm, are also included in this algorithm. in addition, the simplification scheme and smoothing technique are applied to the swept volume generated from iso - surface extraction

    本文的主要貢獻在於：在掃描體逼近計算方面，在原有任意多邊形網格模型沿任意路徑運動生成掃描體逼近演算法的基礎上，提出了加入對掃描母體簡化的預處理和用活動標架對掃描路徑進行重采樣等過程，演算法的其它過程還包括：計算掃描體中幾何基元的排列，用硬體加速構造無符號的有向距離場，將無符號距離場轉化為有符號距離場，從有符號有向距離場提取等值面等。
  4. In this article, we use eclipse 3 because it has the ability to include a manifest file in the project, which simplifies the process and allows more advanced control of the classpath for a plug - in

    。在本文中，我們使用eclipse 3 ，因為它可以在項目中包含manifest文件，這樣可以簡化過程並允許對插件的類路徑進行更高級的控制。
  5. Because of limited memory resource in spce061a, the whole section ’ s dtw algorithm is simplified to segment dtw algorithm. the segment dtw algorithm reduces the memory spending for the matching paths. in addition, early termination technique is adopted, thus the calculating amounts are greatly reduced

    根據spce061a的存儲資源限制，將全段dtw匹配簡化為分段dtw匹配，從而減少了對搜索路徑的存儲開銷;另外在匹配過程中採用早期終止策略，即在匹配過程中，一旦部分累積失真距離超過判決閾值，立即終止匹配，拒絕該說話人，從而減少了計算量。
  6. Combining it with classical algorithm, the electromagnetic coupling path needing to be improved ( viz. weak paths ) are founded, and by using linear programming theory, this paper gives the optimum restroration of the weak paths

    該模型中的電磁拓撲圖簡明且利於分析，與已有的演算法結合，得到了需要改進的電磁耦合路徑（即薄弱路徑） ，並利用線性規劃理論對模型中的薄弱路徑進行優化修復。
  7. The different degradation pathways of o - chlorophenol were revealed in the anodic oxidation and the cathodic reduction through chromatographic analysis

    通過色譜分析簡單揭示了鄰氯苯酚在陽極氧化和陰極還原中的不同降解路徑。
  8. In addition, several way are adopted to optimize the one dimensional transform architecture. improving the architecture resulting from the standard lifting scheme reduces the critical path delay ; an embedded boundary extension algorithm is adopted instead of the standard symmetric extension and it ’ s easier to implement ; the pipeline technique is adopted to increase the speed of processing ; coefficients of the multipliers are transformed into csd forms and the multiplications are substitute by minimum shift - add operations

    改進了由標準的提升演算法得到的變換結構，減小了關鍵路徑上的延時;採用內嵌的邊界延拓來代替標準的對稱延拓，實現更加簡單;採用流水線技術顯著提高了處理的速度;把乘法器系數表示為csd形式，將常系數乘法優化為最少的移位加操作。
  9. The primary task of masonry homogenization is to pose an integrated theory path of equivalent processes that give the integral behaviors of masonry form local behaviors of blocks and mortar, and of characterizing complete structures. with the help of the theory, the masonry experiments can be greatly simplified

    砌體均質化理論的主要任務是建立一個從微小單元到整體結構等效過程的理論體系，形成從砌體組成相的性質等效至微小砌體rve ，再反映至整個結構的一條完整理論路徑，從而可以簡化砌體的試驗研究工作。
  10. The final result of the vrpo is gotten by alternatively solving the two sub - problems together

    採用原對偶路徑跟蹤法求解逐次線性化的電容器投切優化問題時，適當簡化電壓約束，提高了求解速度。
  11. In sum, we should consider the disequilibrium effects of financial development and advance the market mechanism of the distribution of capital that financial development optimizes. name : mazheng - bing ( finance ) directed by - wu hai - hua

    具體建議是:以金融發展「實質化」為原則目標，考慮金融發展對資本部門分配的非均衡性作用，建立市場化的金融機制，改變金融發展簡單「模仿」經濟體制的路徑依賴。
  12. A simplification in the foundation of actual dynamics model and the differential equation of aircraft movement are put forward, we have non - dimensionalized the equations. an optimal guidance model for orbit transfers is accomplished by the optimal control theory

    本文圍繞平面情況下飛行器最佳變軌路徑這一主題，在實際力學模型基礎上進行簡化，建立飛行器運動微分方程，並加以無量綱化處理。
  13. Even though hms can be prepared much more easily than mcm - 41 and has certain advantages such as thicker framework walls, superior thermals stability, and a smaller crystalline size. hms have more recently been shown to possess wormhole - like or sponge - like framework structure rather than the long - range hexagonal framework structures characteristics of electrostatically assembled mcm - 41. the wormhole channel motif is a potentially important structure feature for favorable catalytic reactivity, in part, because channel branching within the framework can facilitate access to reactive sites on the framework walls. furthermore the wormhole channel motif suggest that they could serves as ideal hosts for rational nanomanufacturing

    1995年， tanev和pinnavaia報道，用中性模板劑合成了一類新的六方介孔固體（ hms ） ，它具有不同於用靜電路徑合成的mcm - 41介孔固體的物理和化學性能，如制備工藝簡單、孔壁厚、熱穩定性好和晶粒尺寸小等。 hms還具有蜂巢或海綿狀結構特徵，而不象mcm - 41那樣是長程有序的六方結構。這種蜂巢或海綿狀結構特徵除有利於催化反應，反應物易於接近孔壁上的反應位外。
  14. The vehicle load is simplified as static load. the influence of asphalt concrete temperature, the resilient modulus of the semi - rigid base and the composite foundation on the maximum deflection of the road surface, retained deflections, the radial stress of the base bottom and sub - base bottom is discussed. the working properties are analyzed by fem based on elasto - plastic dynamic mechanics

    第三，採用drucker - prager屈服準則模擬復合地基和軟土地基，將車輛荷載簡化為靜荷載，分析瀝青混凝土的溫度、半剛性材料回彈模量、復合地基材料參數和厚度對路表的最大彎沉、殘余變形、基層和底基層層底的徑向應力的影響。
  15. Then, using recursive arithmetic calculated reliability indices for directory tree, the method was realized by vb program ; the other is a method of reliability evaluation by interval arithmetic, which is the use of interval arithmetic to evaluate reliability, and the computation theory is also given. during the calculation, interval number replaced the component " s parameter and it takes into consideration the uncertainty of all of the parameters. in the study of power distribution system configuration, a new configuration model is set up which takes into account simultaneously the losses minimization and system reliability, then improved genetic arithmetic is described detail and of advantage for solving this problem

    在配電網可靠性評估的研究中，提出了兩種實用的配電網可靠性評估方法：其一是利用網路分層和遞歸演算法理論，使用高級語言進行程序設計，提出了一種基於vb編程的配電網可靠性評估方法，該方法通過程序實現了網路拓撲結構的分層等效和可靠性指標的遞歸計算，使整個計算過程得到了簡化，並且界面窗口的可視化，使得評估過程便捷、形象；其二是提出了一種基於區間演算法的配電網可靠性評估方法，該方法是一種利用區間理論計算配電系統可靠性的不確定性評估方法；文章給出了區間運算的原理；討論了配電系統中區間數據的來源途徑，並用區間數代替元件的可靠性參數，對輻射形配電網進行了可靠性評估。
  16. Different from the previous work, kf - diff + is tailored to both ordered trees and unordered trees. while dealing with the key path, the notion of the key constraint for semi - structure data and the notion of the multi - instance based keys are identified, which will greatly simplify the complexity of the algorithm

    在特徵路徑相關的計算中，本文引入面向半結構數據的key約束思想，並且針對先前判定演算法過于復雜的問題，提出了基於多實例結點集合的key約束的概念以及相關的處理方法，在一定程度上簡化了計算。
  17. To the former one, since most previous work depends on the signature of nodes, which would be costly to be computed, a new way is proposed to discriminate those nodes that have the same paths in the intrinsic properties of the xml document. towards this end, the thesis introduces a series of notions related to the key path, which make the change detection of xml document easier. based on the notions, a change detection algorithm named kf - diff is presented, which is tailored to unordered trees

    對於前者，針對已有演算法大多依賴非常耗時的結點簽名，並且演算法過程復雜的問題，本文提出了一種文檔變化檢測的處理方法，該方法利用文檔固有信息建立特徵參照體系，通過特徵路徑相關的一系列概念的引入，將傳統標號樹匹配問題轉化為無重復路徑的標號樹匹配問題，有效地解決了路徑等價類比較的問題，簡化了xml文檔的比較。
  18. The obstacles ifl deriving system of constraints aie how to analyze and reduce the state - ment components and data types of variables on w, and derive system of con8traints as concise as possibie. and the primary obstacle in solving system of constraints is how to process the nonlinear constraint ( s ) among them

    建立約束系統的困難是分析、化簡路徑w上的各種語句成分和各種數據類型，建立盡可能簡潔的約束系統；求解約束系統的主要困難是處理可能存在的非線性約束。
  19. A large number of analytical data is extracted from well - designed experiments, with which the influence of the generator simplification and the trajectory resample to the last swept volume is analyzed

    通過大量實驗數據，著重分析了掃描母體的簡化和利用活動標架對掃描路徑進行重采樣兩個步驟對掃描體逼近的影響。
  20. Zhu has studied unconstrained optimal problem by combining optimal path and modified path with nonmonotonic trust region methods in [ 9 ], and the use of l2 norm by trust region method in [ 1 ] in seeking the solution of unconstrained optimization has formed simple approximate trust region path, which enlightens us to solve nonlinear programming problem by curvilinear path

    朱德通在文[ 9 ]中將最優路徑和修正梯度路徑與非單調信賴域方法相結合討論無約束優化問題，且文[ 3 ]中用信賴域方法解無約束優化問題取l _ 2范數形成了形式簡單的近似信賴域路徑，此類思想啟發作者用弧線路徑來解決約束優化問題。
分享友人
分享到 Line

分享到臉書