塊中心網格 的英文怎麼說
中文拼音 [kuāizhōngxīnwǎnggé]
塊中心網格
英文
block-centered grid-
The algorithm generates three - dimensional terrain model and displays in real time. it uses an efficient and simple method to attain the dependency between sampling points on terrain, and refines the center points in top - down way. it incorporates the dependency of points into their errors so that the cracks inside the terrain block are avoided, at the same time eliminates the cracks at the edges of blocks through adjusting the elevations of those points that cause the cracks
該演算法基於規則格網數據實時生成三維地形模型，並實時顯示；採用了一種簡單而高效的方法來求解采樣點之間的依賴關系；以「從頂向下」方式細分中心頂點；並把頂點依賴關系融合進頂點誤差中，避免了地形塊內部的裂縫，同時通過調整塊邊界點的高程消除了塊邊界處的裂縫；演算法還具有利用幀間相關性，視相關等方面特點。This article first analyzes a paradoxical phenomenon that is predominant in campus lan settings where there is a large amount of idle cpu cycles available while at the same time the computing needs from many researchers ca n ' t be met. it proposes an idea of setting up a campus computing grid with a detailed plan for its implementation, discusses the challenges of upscaling a campus computing grid into an internet computing grid and suggests possible solutions. gram ( grid resource allocation manager ) of globus toolkit 3. 2 and relative technology on it is studied, and the solutions to extend gram to support task rescheduling and the cooperation type task are proposed. the design and implement of the gram client based on web that is the kernel part of the task anagement module are discussed, and the design of resource discovery module and task transfer module are gived
本文首先分析了校園網環境中存在大量計算資源閑置與科研人員科學計算需要得不到滿足之間的矛盾，給出了建立校園計算網格的構想及具體的設計方案，並提出了校園計算網格推廣到internet計算網格存在的問題及解決方案;研究了globustoolkit3 . 2中的資源分配管理器gram及其相關技術，並給出了擴展gram對任務再調度和協作型任務支持的解決方案;設計實現了校園計算網格中任務管理模塊的核心部分基於web的gram客戶端，並介紹了資源發現與任務遷移模塊的設計;然後在分析min - min調度演算法基礎上，借鑒qosguidedmin - min演算法的思想，並利用主機資源分類的思想，給出了在負載平衡和時間跨度都有較大改善的balance - qosguidedmin - min演算法模型的思想與實現;最後設計實現了調度演算法驗證模塊，並在此模塊上對比了改進的演算法balance - qosguidedmin - min與min - min演算法的調度性能。The core algorithms in the candidate set creating function module are code pretreatment algorithm and candidate set creating algorithm. candidate list creating function module is the most important module, its core algorithms include candidate list adjusting algorithm, candidate matrix creating algorithm, original word lattice creating algorithm, language element node creating algorithm, optimal candidate words searching algorithm and candidate list creating without code algorithm which
候選列表生成模塊是整個系統最主要的模塊，主要核心演算法包括候選字詞調整演算法、候選矩陣生成演算法、初步詞網格生成演算法、語言元素結點的生成演算法、尋找最佳語句候選演算法以及無編碼候選列生成演算法，無編碼候選列生成演算法利用對用戶已輸入的漢字進行切分標注，通過系統中的知識庫信息在沒有輸入編碼的情況下預測后續的輸入。Block - centered grid
塊中心網格分享友人