computation attribute 中文意思是什麼

computation attribute 解釋
計算屬性
  • computation : n. 1. 計算，估算。2. 計演算法。3. 計算結果，得數。
  • attribute : vt. 1. 把（某事）歸因於…。2. 認為…系某人所為。n. 1. 屬性，特質。2. （人物、官職等的）標志，表徵。3. 【語法】屬性形容詞。
  1. Therefore, we use pgm grouping road candidates to line segments and delineating segments instead of candidates. a new approach is proposed to cut off the huge computation of pgm by making a prejudgment using direction attribute of candidates

    相位編組方法能夠將相鄰的且屬性相似的單元進行編組，所以，文中利用了相位編組的方法將基元組織為線段，並對得到的線段進行特徵描述。
  2. The appraisal takes the ecology material, the environment material, chemistry material, the toxicology material as the foundation, through the project analysis, the source strong analysis sets a target the pollutant, distinguishes its hazardous nature, the probability, the degree, the scope which the computation risk occurs and so on, the choice appraisal end point, the use appraisal model forecast goal pollutant exposed density, the analysis risk source to the acceptor the harm degree, carries on the risk attribute

    評價以生態資料、環境資料、化學資料、毒理學資料為基礎，通過工程分析、源強分析，確定目標污染物，鑒別其危害性，計算風險發生的概率、程度、范圍等，選擇評價終點，利用評價模型預測目標污染物的暴露濃度，分析風險源對受體的危害程度，進行風險表徵。
  3. According to the research mentioned above, this paper analyzes the bbk trust model whose critical attribute is binary, and indicates its disadvantages : trust failure punishment equals to that of success, which deviates reality ; malicious recommendation and unfair phenomenon is serious ; trust value fluctuates due to simple arithmetical average algorithm and computation lasts long

    基於以上工作，分析了關鍵屬性為二元屬性的bbk信任計算模型，指出其存在的問題：信任理解與現實存在偏差?信任失敗的懲罰尺度等於成功信任尺度；存在嚴重的惡意推薦現象和不公平現象；採用簡單的算術平均計算信任值可能導致波動很大；計算時延較大。
  4. To the problem that finding rules in enormous data is very time - consumable and the expansibility of existed algorithms is not very good, the thesis proposes a new method to discompose large data table based on the concepts of positive region and the importance of attribute in rough set theory. existed algorithms of rule deduction can be applied directly on the tree structure obtained by partition and the times for computation will be reduced observably. validation of information entropy on the partition structure shows that the partition of data table will not lead to the loss of information, while the computing speed increases at the same time, which reflects the practicability and rationality about the partition of large data table

    針對海量數據處理起來極為耗時，現有演算法拓展性較差的問題，基於rough集理論中的集合正域概念以及由此定義的屬性重要性概念，提出一種大型數據表分解演算法，現有的規則歸納演算法可直接在分解得到的樹型結構上應用，將大大降低知識發現的時間，並從信息理論的角度利用信息熵概念對該分解結構進行了驗證，分析了這種分解的實用性及合理性，揭示了這種分解結構在提高計算速度的同時不會損失信息量。
  5. Results showed that, attribute data obtained by this way avoided deficiency of polygon overlap way, as a result, the logistical consistency between map data and attribute data reached over 90 % on average. database pivot precision was 0. 18mm, data quantity during manipulation was decreased greatly, data treatment was more convenient, computation velocity was boosted greatly. workload of map and table pretreatment and edition was mitigated on large scale, spatial data precision was increase

    研究表明：用該方法獲得的屬性數據，避免了多邊形疊加方法的不足之處，能使圖形數據和屬性數據邏輯一致性平均達到90以上，數據庫點位精度達到0 . 18mm ，且操作中圖層數據量大大減小，數據處理更為方便，運算速度大為提高；減輕了圖表預處理和編輯的工作量，使空間數據精度提高。
  6. In this article, we compare and analyze the model of distributed computation, the technologies of storage and management of spatial data, the technologies of geographic data transmission in internet, and the methods of developing webgis. combined with the developments of gis and database, a webgis solution is presented, which uses spatial database to manage spatial data and non - spatial attribute data, and uses gml as the transmission format of geographic data in internet. at last, we use java to develop an experimental webgis system, which is based on oracle spatial and gml

    本文分析和比較了目前webgis所採用的分散式計算模式、空間數據存儲管理技術、數據的網路傳輸技術以及webgis的各種實現技術的不足，結合當前gis技術和數據庫技術的發展，提出了採用空間數據庫實現對空間數據和屬性數據的統一存儲和管理、採用gml作為空間數據的網路傳輸格式的一種webgis解決方案，並在此基礎上使用java實現了一個基於oraclespatial和gml的webgis實驗系統。
  7. ( 3 ) the evolutionary computation - based algorithm for discretizing values of quantitative attributes, whose advantage is that it can finding the best cuts of a quantitative attribute

    （ 3 ）根據進化計算的極強魯棒性及尋優能力，提出了基於進化計算的數量型屬性離散化演算法?進化c均值演算法。
分享友人
分享到 Line

分享到臉書