鄰點 的英文怎麼說

中文拼音 [līndiǎn]
鄰點 英文
adjacent points; neighbouring points
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  1. An isolated point " s statistic excluding method is proposed in this paper to eliminate crassitude error in clouding data, which include plenty of oddity data. the method based on the distance between two neighbour points can eliminate the data beyond normal distribution. a error limitation of angle and chordal highness method is used to filtrate clouding point

    針對大量含奇異點的數據點雲，本文提出了剔除粗大誤差的孤立點統計排異法，該方法根據對相鄰點距離的統計，剔除在正態分佈以外的點；對大量數據的精減，利用角度和弦高的最大允許偏差法進行點雲精減。
  2. Seven years later more than 1000 research papers had been published on dominating sets and related sets in graphs, and the field is steadily growing. in this paper, we discuss the relationship between the total domination number and the least domination number. the total domination number of a graph g is the minimum cardinality of a dominating set of gsuch that every vertex in v has at least one neighbor in d. the least domination number of g is the minimum cardinality of a dominating set of g whose domination number is the minimum

    圖g的全控制集是滿足v中每個點都至少有一個鄰點在其中的控制集，而g的全控制數_ t （ g ） = nin { / d / | d是g的全控制集} ；圖g的小控制集是滿足其控制數在所有g的控制集中達最小的控制集，而g的小控制數_ l （ g ） = min { | x | | x是g的小控制集} 。
  3. Thus the value of the function at any grid point is the average of its values at the immediately neighboring points.

    因此，任一結點上的函數值就等於其直接鄰點上函數值的平均。
  4. Interpolation ; voronoi cells ; natural neighors

    插值voronoi cells自然鄰點
  5. Adjacent - vertex - distinguishing total chromatic numbers of k2n 1 - e 2k

    的鄰點可區別全色數
  6. On adjacent vertex - distinguishing total colorings of graphs pm 215 ; pn

    的鄰點可區別全染色
  7. The adjacent vertex - distinguishing total coloring of special graphs

    幾類特殊圖的鄰點可區別全染色
  8. On adjacent vertex - distinguishing total coloring of three special graphs

    三類特殊圖的鄰點可區別全染色
  9. Some new results on the adjacent vertex - distinguishing total coloring of graphs

    關于鄰點可區別全染色的幾個新結果
  10. A note on the upper bound of adjacent vertex distinguishing chromatic number of graphs

    關于圖鄰點可區別上界的一點注
  11. We obtain the adjacent - vertex distinguishing total chromatic numbers with the first moment principle, markov ' s inequality and some kinds of lovasz local lemma, respectively

    ） sz局部引理分別得到了任一最大度為d的圖g的鄰點可區別的全色數。
  12. Markov ' s inequality and some kinds of lovasz local lemma, respectively. in the last part, we discuss a new concept " adjacent - vertex distinguishing total colorings "

    第四部分引入了鄰點可區別的全染色這一新的概念，並用第一矩量原理， markov不等式以及幾種形式的lov （
  13. In order to modify the error created by original odometer, the iterative closest point algorithm ( icp ) is adopted in this paper

    為了糾正里程計的定位誤差，本文採用了迭代近鄰點（ icp ）演算法。
  14. In the third part, we discuss " " adjacent - vertex distinguishing edge colorings ". we obtain the adjacent - vertex distinguishing edge chromatic numbers with the first moment principle

    第三部分主要討論了鄰點可區別的邊染色這一概念，用第一矩量原理， markov不等式以及幾種形式的lov （
  15. And we provide a rule to set the parameter of the algorithm. a new method to solve hammerstein model using tabu search is also introduced. the conception of searching area is defined and the strategy of choosing neighboring points is given

    本文提出了一種利用改進型禁忌搜索演算法來解決hammerstein模型辨識問題的方法，定義了搜索域空間，給出了鄰點確定策略，提出演算法流程，並通過大量的模擬實驗，得出針對hammerstein模型合適的禁忌列表長度，可能解列表長度，以及合適的被劃分鄰域的數目。
  16. Every two consecutive points in the array specify a side of the polygon

    該數組中每兩個相鄰點指定多邊形的一個邊。
  17. The typical optimizing criterion of triangulation is max - min angle criteria, but it has some restriction when applying in three dimensions. we proposed some amelioration by taking into consider the relationship of points and their neighbors. that can make the triangulation ' s space variation more even, and can reach the surface fairness request

    對三角剖分中的典型優化準則?最小內角最大準則應用於三維空間中時的局限性問題提出了改進方法，充分考慮數據點與近鄰點的空間關系，使三角剖分的空間形狀變化盡量均勻，保證了三角剖分網格的光順性要求。
  18. In section 4. 2 we analyze its main idea and algorithm in detail, two relevant theorems included ; section 4. 3 provides plenty instances so to explain its nonlinear dimension reduction ability, section 4. 4 propose a combined method that integrates the advantage of various methods. in section 4. 5 we analyze some significant problems in lle, including the locality of manifold representation, the choice of the neighborhood, the intrinsic dimension estimation and the parametric representation of mapping. in section 4. 6 we design an algorithm for estimating the intrinsic dimension in the base of locally linear approximation and discuss the choice of its parameters

    第四章是本文的重點內容，研究一種全新的非線性降維方法? ?局部線性嵌入方法，對它的思想和演算法進行了詳細的分析，給出演算法兩個相關定理的證明；第三節對比主成分分析，通過實例說明局部線性嵌入方法的非線性降維特徵；第四節在此基礎上提出了旨在結合兩者優勢的組合降維方法；第五節提出了局部線性嵌入方法中存在的若干關鍵性問題，包括流形的局部性、鄰點的選擇、本徵維數的估計和降維映射的表示，第六節基於局部線性近似的思想提出了一種本徵維數的估計方法，設計了實用演算法，結合實例對演算法中參數的選取進行了討論；最後一節提出了一種基於局部線性重構的圖形分類和識別方法，將其應用於手寫體數字的圖像分類識別實驗，實驗得到的分類準確率達96 . 67 。
  19. In the research of flooding arithmetic, at first, we analyse the flooding efficient, robustness by the 3 - neighbor, 4 - neighbor and 6 - neighbor ’ s wsn. so we extend to the n - neighbor ’ s wsn. we give the formula about area of wsn ’ s deploy, count of wsn ’ s node, max distance of communications and average of neighbor ’ s count, and validate this formula by the simulate program. in the last, we analyse the flooding arithmetic ’ s lose rate, data efficient rate, energy efficient rate, network life, delay time by the simulate program

    在洪泛演算法研究中，首先針對3 -鄰點、 4 -鄰點和6 -鄰點的無線傳感器網路分析了洪泛效率、網路健壯性，然後推廣到n -鄰點的無線傳感器網路中，並給出無線傳感器網路部署面積、節點個數、最大傳輸距離、和平均鄰點數之間的經驗公式，並用模擬程序進行了驗證。
  20. We construct the algorithm of three - dimensions model surface reconstruction in three stages : first, we use oct - tree to describe scatter data points in space, second find adjacent points and tangent plane and use the triangulation method to realize 3d surface reconstruction in the end, in research on algorithm of three dimensions model surface reconstruction based on scatter data points

    在「基於散亂數據三維表面演算法的研究」這一章中，首先通過八叉樹的數據結構的演算法對三維散亂數據進行處理，然後再確定鄰點和微切平面，最後用三角網格化的方法完成三維物體表面重構。
分享友人
分享到 Line

分享到臉書