cluster of points 中文意思是什麼

cluster of points 解釋
點叢
  • cluster : n 1 叢集；叢；（葡萄等的）串，掛；（花）團；（秧）蔸；組。2 （蜂、人等的）叢，群，群集。3 【物理...
  • of : OF ＝Old French 古法語。
  • points : 波因茨
  1. The innovations of this thesis can be summarized into three points. firstly, the average relative velocity is introducd into a novel adptive weighted clustering algorithm as one important parameter of weight, then it increases the stability and self - adaptability of cluster head. secondly, a new approach to calculating weight is suggested by integrating subjective and objective factors. it is verified by comparison with other approaches to selecting weight. thus the velocity of weight responding to the changes of network topology is increased. finally, using a som neural network to create a classifying model enables every node to learn to identify by itself the role in manet

    本文的創新點有三個:首先本文在wca和aow分簇演算法的基礎上，引入了平均相對移動速度作為權值重要的參數，提出了一種新的基於權值的自適應分簇演算法，提高了簇頭在移動中的穩定性和自適應性;其次，提出了利用主客觀綜合賦權法確定權重的權值計算方法，通過與其他權重選擇方法比較，網路結構變化的權值響應速度得到了改進;最後，論文利用自組織特徵映射神經網路建立分類模型，使得網路中的節點可以自學習地確定簇中角色。
  2. This paper points out that library cluster will become the final expression form of library construction and development through the research and analysis of theoretical basic, conceptual analysis, practical application, structure pattern and target tendency, etc

    通過對圖書館集群的理論基礎、概念分析、實踐借鑒、結構模式、目標趨勢等方面的研究分析，認為圖書館集群將成為區域性圖書館建設和發展的最終表現形式。
  3. 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 -平均方法，以及改進型的基於距離的聚類演算法等模式識別方法，能夠解決傳統演算法帶來的諸多問題（比如一些傳統的聚類演算法常常收斂于局部最優，發現都模式都趨近於球形，劃分方法中迭代次數過多帶來的效率問題） 。
  4. Qiandaohu lake was very famous for its clean water quality. but in recent years the water body has become seriously eutrophic especially during summer months in some areas of the lake and came to the attention of national, provincial and city environment protection agency. the main objective of this study involved the following : sampling and monitoring water from the lake ; water quality assessment and biological assessment ; ascertain the limiting factors for phytoplankton growth ; fuzzy cluster analyse of water pollution of all sampling points ; predicting total phosphorus concentration in the lake by using static models ; setting up regression models and their application ; setting up an eco - dynamic model and its simulation

    本研究根據1998 - 2000年連續監測數據，對千島湖進行了水質評價和生物評價；分析了千島湖水體富營養化的限制性因子；同時根據千島湖各個取樣點的污染狀況，對千島湖進行水環境質量區劃；利用前人的經驗統計模型預測了千島湖現有的磷濃度水平及治理所需要削減的污染物負荷量；並且組建了多個回歸統計模型，運用這些模型預測千島湖水體中的總磷濃度；最後根據多年水質、底質、生物等方面的監測數據以及千島湖流域的氣象和社會經濟狀況的資料組建機理性的千島湖富營養化模擬模型。
  5. ( 2 ) although phylogenetic analysis of h9 ha1 section shows that all of the duck h9n2 viruses cluster within the lineage represented by ck / hk / g9 / 97 or dk / hk / y280 / 97, they appear closely related to h9n2 viruses isolated from chickens at different points of time during their evolutionary process

    （ 2 ） hg的m進化樹表明hgnz病毒屬于ck bet l 94或dk hk y280 97樣病毒系列，但是它們處于進化的不同階段，有些病毒與早期的ck bet 1 94相似，而有的病毒與1997年及最近從陸地禽類中分離的hg病毒最相近。
  6. The paper puts forward many solutions, but they can sum up to four points, as list : begin with, we must enforce structure of system ; in mean time we should give capital supporting in the process of our middle and small enterprises ; thirdly, we need deepen the initiative of technology and mechanism ; at last, we should do our best work in developing industry cluster

    有的與歷史因素、體制因素有關，也與理論認識上的失誤分不開。如何發展我國的中小企業?思路為以下四點：一是加強制度平臺建設；二是加強對中小企業的資金扶持；三是深化技術創新和制度創新；四是大力發展中小企業群落。
  7. This paper sums up some new points about the scanning circuit, like the compensating state and jumping in the cluster of non - linearity coefficient

    摘要本文綜述了補償狀態和非線系數曲線中的跳變等有關掃描電路的新論要點。
  8. This algorithm adopts a middle ground between centroid - base and all - points - based approaches. instead of using a single centroid or all points to represent a cluster, a fixed number of representative points in space are chosen, these points represent and capture the geometry and shape of the cluster. in addition. the representative points of a cluster are generated by first selecting well - scattered objects for the cluster and then " shrinking " or moving them toward the cluster center by a specified fraction, or shrinking factor. the shrinking helps dampen the effects of outliers. therefore, cure is more robust to outliers

    該演算法選擇基於質心利基於代表對象方法之間的中間策略，它不用單個質心或簇中全部對象米代表一個簇，而是選擇數據空間中定數目的只有代表性的點，這些點代表和捕捉到了簇的形狀。此外，由於引入了收縮因子使代表點向簇小心「收縮」而使該演算法能夠較好地消除孤立點的影響，在處理孤立點上也更加健壯。
  9. Assuming that you use only one drive letter for the operating system, and all other drive letters are available as normal cluster drives or cluster drives hosting mount points, you are limited to a maximum of 25 instances of sql server per failover cluster

    假設您的操作系統只使用一個驅動器號，而所有其他驅動器號均用作正常群集驅動器或群集驅動器宿主裝入點，則每個服務器上最多25個sql server實例。
分享友人
分享到 Line

分享到臉書