computed path 中文意思是什麼
computed path
解釋
計算途徑-
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中的最短路徑演算法來求解。 -
This is a heuristic strategy. it can reduce the intersection tests need to be computed between bounding volumes by tracing the traverse process in previous time to gain traverse path in current time. the correctness and validity of collision detection can be guaranteed by maintaining the tracing list
這是一個啟發式的策略，通過跟蹤國防科學技術大學研究生院學位論文上一時間采樣點對包圍盒樹的遍歷過程，確定當前時間采樣點的遍歷路徑，從而有效地減少了遍歷過程中包圍盒相交測試的次數，提高了演算法效率，同時通過對跟蹤表的維護，保證了碰撞檢測的正確性和有效性。 -
Path name to the main storage file. the names for supplemental files, including index and lock files, will be computed from this
主存儲文件的路徑名。追加的文件名稱，其中包括索引和鎖文件，都是從這里計算的獲得的。 -
Third, the linear dynamic model of two - stage split - path star - type gear train has been founded in the case of multi - freedom and complex errors. the basic theory of dynamic load sharing mechanism has been studied. the dynamic load sharing coefficient and dynamic load coefficient of the system have been computed
第三，建立了星型齒輪傳動系統的動力學計算模型，研究了動力學均載分析的基本原理，計算了系統的動力學均載系數和動載系數；研究了系統的動力學特性，對系統作了動力學分析與模擬；分析了兩級齒輪嚙合剛度對系統動力學均載的影響，比較了各級齒輪嚙合剛度對系統均載系數影響的大小。 -
A differentiated routing algorithm is proposed to route network traffic based on rdm bandwidth allocation model. advertising rdm model parameters and bandwidth utilization statics, different routing path is computed and established for different traffic class by using corresponding logical view of network. it is shown that diffroute can improve service quality in differentiated network effectly while improving resource utilization
提出一種多路區分路由演算法：針對區分服務網路中存在的「類間效應」 ，以rdm鏈路帶寬分配模型為基礎，通過為不同類負載計算不同的傳輸通路，區分路由可以在確保資源分配公平性的基礎上有效改善各類網路負載的分佈狀況，提高區分服務網路的服務質量； 4 -
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文檔的比較。
分享友人