grid distance 中文意思是什麼

grid distance 解釋
柵格間距
  • grid : n 1 格子,格柵。2 (蓄電池的)鉛板。3 【無線電】柵級。4 鐵道網;【電學】電力網;〈英國〉(全國)...
  • distance : n 1 距離,路程。2 遠隔,遠離;遠處,遠方。3 (時間的)間隔,長遠,長久。4 懸殊。5 隔閡,疏遠。6 ...
  1. Grid reference of distance post

    標距柱(地圖座標)
  2. Location grid reference the number of the nearest distance post paragraph 6. 2

    C .位置方格座標最近之標距柱號碼。
  3. Also, i didn t know the numbers and grid reference on the distance posts show location

    更加不知道標距柱上的號碼及地圖座標
  4. The grid division was used to sign the environment, and the grid side expressed the element information and the distance information, thus reducing the computation quantity of the algorithm

    採用柵格劃分環境、柵格之間的邊表示信息素和距離信息減少了演算法計算量。
  5. The method can guarantee distance protection will not have a wrong operation and enlarge the fault ' s range when the power flow of electricity grid diverts in a wide scope

    該方法能夠可靠保證在電網潮流發生大范圍轉移時后備保護不誤動作,避免引發連鎖反應,擴大電網事故。
  6. 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

    本文的主要貢獻在於:在掃描體逼近計算方面,在原有任意多邊形網格模型沿任意路徑運動生成掃描體逼近演算法的基礎上,提出了加入對掃描母體簡化的預處理和用活動標架對掃描路徑進行重采樣等過程,演算法的其它過程還包括:計算掃描體中幾何基元的排列,用硬體加速構造無符號的有向距離場,將無符號距離場轉化為有符號距離場,從有符號有向距離場提取等值面等。
  7. The article build the mathematic model of terrain surface with the nonlinear insert calculation using the distance entropy function as the insert calculation function in terrain surface fitting and deal the visualization with grid method

    採用非線性插值方法,用距離熵函數作為地表曲面擬合的插值函數,構造地表曲面的數學模型,並採用規則格網法進行表面剖分,最終實現地形的三維可視化效果。
  8. The paper puts forward the clustering algorithm includes : clustering based on grid and iterative, enhanced clustering algorithm base on density and k - medoids, enhanced k - means algorithm ( optimize chooseing consult _ points in iterative process ), enhanced clustering algorithm base on distance. they can overcome many limitations ( some traditional algorithms terminate in local optimization. many results of cluster are roundness, too many times in partition iterative process ), which are related to the static architecture of traditional model

    在傳統聚類演算法的基礎上,結合我們科學數據挖掘的應用對象?分子動力學數據,提出了迭代網格聚類演算法, k -平均和基於密度結合的聚類演算法,迭代過程中優化選擇中心點的k -平均方法,以及改進型的基於距離的聚類演算法等模式識別方法,能夠解決傳統演算法帶來的諸多問題(比如一些傳統的聚類演算法常常收斂于局部最優,發現都模式都趨近於球形,劃分方法中迭代次數過多帶來的效率問題) 。
  9. In order to achieve the design goal, exhaustion and carbonating procedures need to be modified and perfected, uniformity of anode - grid space distance and grid surface treatment procedure need to be improved

    為了完全達到設計目標,尚需對試制過程中的排氣與碳化工藝進行調整和完善、提高陽柵空間距離的均勻性以及改進柵極表面處理工藝。
  10. The solution of route planning in ecdis is dynamic motion planning base on grid model ; while in the solution of the advanced navigation, safety is the most important premise of sailing, than it takes more consideration about the least distance in voyage

    在航線設計中採用了基於網格模型的動態規劃方法進行路徑的優選;在最優航法中主要考慮船舶如何航行可以在保障安全的前提下使航行距離最短。
  11. The explanation for this “ spooky action at a distance ” ( to borrow a term from quantum mechanics ) is that a grid of wires underneath the screen emits an electromagnetic field that causes a coil inside the pen to oscillate at a resonant frequency

    這種幽靈似的超距作用(從量子力學借來的術語) ,是因為螢幕下方的柵極線路會發出電磁場,讓專用筆內部的線圈以某個共振頻率振蕩。
  12. Solving the elliptic grid generation together with an algebraic method marching along the normal - to - wall direction, viscous grids around complex geometries are generated. the inner - layer grids with the algebraic method is othogonality and easy to control the distance to the wall. according to the hilgenstock, the source items are calculated to control the othogonality and spacing of grid lines on boundaries

    法向外推方法生成的內層代數網格具有很好的正交性,可隨意控制網格至物面距離,確保邊界層內有足夠多且密的網格;外層網格採用hilgenstock方法,根據網格線角度和距離與期望值之間的誤差不斷進行源項修正,實現網格對邊界正交性和距離的雙重控制,保證了網格的合理分佈並具有較高的質量。
  13. Portfolio companies industry : life sciences, power grid management, nano technologies, distance learning, bioengineering, hospital management

    投資案例公司的行業包括:生命科學、電力網管理、納米技術、遠程教育、生物工程和醫院管理。
  14. The simplicity and automation in the inter - grid - boundary definition are realized using the “ wall distance ” as a basic parameter

    以「壁距離」為基本參數,自動而高效地確立了網格重疊的邊界。
  15. This paper introduces the development of data mining and the concepts and techniques about clustering will be discussed, and also mainly discusses the algorithm of cluster based on grid - density, then the algorithm will be applied to the system of insurance ? among the various algorithms of cluster put forward, they are usually based on the concepts of distance cluster o whether it is in the sense of traditional eculid distance such as " k - means " or others o these algorithms are usually inefficient when dealing with large data sets and data sets of high dimension and different kinds of attribute o further more, the number of clusters they can find usually depends on users " input 0 but this task is often a very tough one for the user0 at the same time, different inputs will have great effect on the veracity of the cluster ' s result 0 in this paper the algorithm of cluster based on grid - density will be discussed o it gives up the concepts of distance <, it can automatically find out all clusters in that subspaceo at the same time, it performs well when dealing with high dimensional data and has good scalability when the size of the data sets increases o

    在以往提出的聚類演算法中,一般都是基於「距離( distance ) 」聚類的概念。無論是傳統的歐氏幾何距離( k - means )演算法,還是其它意義上的距離演算法,這類演算法的缺點在於處理大數據集、高維數據集和不同類型屬性時往往不能奏效,而且,發現的聚類個數常常依賴于用戶指定的參數,但是,這往往對用戶來說是很難的,同時,不同參數往往會影響聚類結果的準確性。在本文里要討論的基於網格密度的聚類演算法,它拋棄了距離的概念,它的優點在於能夠自動發現存在聚類的最高維子空間;同時具有很好的處理高維數據和大數據集的數據表格的能力。
分享友人