selecting algorithms 中文意思是什麼

selecting algorithms 解釋
選擇演算法
  1. Analysis method of property and spatial information has been discussed. and the algorithms for distinguishing geographic objects " location relations also been fulfilled in the paper. with these algorithms area selecting of graphs, handling graphs, and information statistics, etc. can be fulfilled successfully

    討論了gis中屬性分析的方法和空間信息的分析方法,實現了空間實體間位置關系的判別演算法,通過空間實體間位置的分析,實現圖形的區域選擇,進而實現圖形的操作和gis中信息統計和分析功能。
  2. Firstly, we propose a framework of selecting xml views for caching, including algorithms of enumerating frequent query sub - patterns, computing frequency of query sub - patterns and selection of materialized views for caching

    第一,我們提出一套選擇實體化視圖進行緩存的基本方法,包括頻繁查詢子模式的枚舉演算法、查詢模式頻度的計算方法和選擇實體化視圖裝入緩存的演算法。
  3. Finally, lossless compression by means of integer lifting scheme is realized. after selecting a practical bases of lifting scheme transform, we put forward to two lossy compression algorithms based on adaptive transform and demonstrate its feasibility and validity by simulation and experiment

    實現了將整數提升框架應用於無損壓縮;選擇了一個實際可行的提升變換基庫,給出了兩種基於自適應變換的有損圖像壓縮演算法,實驗模擬結果證明了演算法的可行性及有效性。
  4. This paper presents a new face detection algorithm for color video images based on skin color and multimodal information fusion. first, this paper presents a new means for selecting skin samples ; and then comparing skin distribution in the eight color spaces and analyzing the adaptability for different skin patterns, poses a face initial orientation ' s method which uses the single gaussian model in the tsl color spaces, and calculates skin probability images ; afterwards comprehensive comparing three typical threshold value separating algorithms, put forwards a face separating method which bases on region growing and fuses multimodal informations ; final, raises a face confirming algorithm which fuses three shape features

    首先提出了?種新的膚色樣本選取方法;然後通過對八種色空間膚色分佈的比較以及不同膚色模型適應性的分析,提出了在tsl色空間上用單峰高斯模型模擬膚色分佈,求得膚色概率圖進行人臉初定位的方法;隨后在綜合比較三個典型閾值化分割演算法的基礎上,提出了融合多源信息進行區域生長分割人臉的演算法;最後提出了融合三個形狀特徵的人臉確認演算法。
  5. Then, by introducing a simple route selecting algorithm in chooser, a capacity - consistent restoration path set in one flooding wave can be obtained, so avoiding the multiple flooding waves in conventional algorithms

    同時以時鐘驅動的方式驅動網路中各參與恢復進程的節點發送消息包,以確保所形成的恢復路由集合為ksp集合。
  6. On the condition of selecting east - north - up coordinate as navigation coordinate and supposing the updating periods for attitude, velocity and position all the same, the digital algorithms for sins are deduced in details

    以東北天坐標系為導航坐標系,假定姿態、速度和位置更新周期相同時,詳細推導了捷聯慣導的數字迭代演算法。
  7. First, the paper gives an overview on the basic theory of multicast, including multicast routing algorithms, multicast routing protocols and internet group management protocols. on the basis of this, a new algorithm of selecting multicast route was brought up, which applies in the case that there are only one multicast sender and many receivers. the algorithm is independent of the unicast routing protocol

    首先,本文對組播技術的基礎理論,包括組播路由選擇演算法、組播路由協議和網際網路組管理協議等進行了綜述,在此基礎上,提出了一種新的組播路由選擇演算法,它適用於只有一個組播源的組播網路。
  8. One is based on the discriminated matrics, the other is based on ga. we use many new ways to make the algorithms more effective, such as reducing dimension and sparsiting elements of the discriminated matrics, effectively selecting elements of the positive examples set and the counter examples set for the jointing - spreading matrics, using a new selecting operator, and so on

    其次,實現了基於粗集理論的屬性約簡方法? ?基於可分辨矩陣的屬性約簡法和基於遺傳演算法的屬性約簡法,並通過降維、稀疏化、正例集和反例集的有效選取、新的選擇運算元等方法對原演算法進行了改進。
  9. Two algorithms of selecting source images in color transferring

    圖像色彩傳遞中的兩種源圖選擇演算法
  10. While most evaluators of the algorithms want to avoid complexity by selecting one to serve as a standard, there ' s a minority that wants to select more than one

    大多數演算法鑒定者都選擇一個作標準以避免復雜性,但也有一小部分人要選擇多個演算法。
  11. Both methods provide good performance, and the latter is better since it can give a better describing of the residual distribution of matches. in the study of camera self - calibration, firstly, based on discussion of using and the selecting of scene constraints, two new robust vanishing point estimation algorithms are presented. one is based on peransac, and the other is based on clustering

    在相機自定標技術的研究中,首先,在討論利用和選擇景物約束的基礎上,提出兩個新的消失點估計演算法:基於peransac的估計演算法和基於聚類分析的估計演算法,後者在估計精度上優於前者;其次,提出了綜合利用空間平行線約束和相機主點位置約束的線性迭代自定標方法,提高了相機自定標的魯棒性。
  12. Raw audit data of the system or network is first preprocessed into records with a set of basic features. then the association algorithms and the frequent algorithms are used to compute the frequent patterns from the records, which are the basis for building or selecting system features

    系統中各代理相互協作,對系統或者網路的原始審計數據進行預處理生成包含基本特徵的連接記錄;利用數據挖掘中的關聯規則挖掘演算法和頻繁序列規則挖掘演算法,得到系統事件在屬性間和時間序列上的頻繁模式。
  13. The work involves : 1 based on the analysis of previous ddm schemes, considering source - based, destination - based, intermediate filtering mechanism, this paper gives clearly reason and excellence of selecting light - weight mode architecture ; 2 the paper displays light - weight ddm scheme in details, including the relationship of ddm service with other services and object attributes, relevant element designment and algorithm designment ; the paper analyses information flow in light - weight ddm scheme, dividing all implementing classes of ieee 1516 interface specification, showing ddm federate process and explaining how to use " infantry division landing island joint warfare simulation system " to test all ddm implementation algorithms

    這主要包括: 1 、在綜合分析ddm所有實現方式的基礎上,包括基於agent 、網格和區域等實現方法,結合源端、中介端、目的端過濾機制,首次提出了ddm弱服務器模式體系結構; 2 、論文首次給出ddm弱服務器模式方案的具體設計,包括ddm與聲明服務、對象服務、所有權服務、時間服務及與對象屬性的關系,相關基礎設計和詳細演算法設計等。 3 、最後,論文給出了弱服務器實現模式的信息流向,分析了ieee1516介面規范實現時用到的所有實現類,以及符合ieee1516規范的ddm成員流程,論述了利用「 xxx作戰」模擬工程綜合測試數據分發管理的過程。
  14. Through stereo matching we can find image positions of identical object point in twain images. characteristic selecting, criterions determination and algorithms achieving are three important procedures

    雙視覺立體匹配是尋找同一目標點在兩幅圖像中的成像位置,匹配特徵的選取、匹配準則的確定、匹配演算法的實現是立體匹配的三個重要步驟。
  15. From the mapping relationship between information vector matrix and relative vectors, rough approximation, attribute relative reductions and selecting optimal attribute reductions set algorithms based on binary vector matrix were proposed

    摘要根據向量矩陣與向量之間的映射關系,研究了基於二元向量矩陣演算法的粗糙近似、屬性約簡以及最優屬性約簡集的獲取。
  16. After the existing algorithms for knapsack problem and selecting the base point of ecc over gf ( p ) are deeply analyzed, a parallel algorithm for knapsack problem and that of selecting the base point of ecc are respectively proposed

    在深入分析背包問題的現有并行演算法和gf ( p )上ecc的基點選取演算法性能的基礎上,分別提出一種基於采樣和mimd結構的背包問題并行演算法和gf ( p )上ecc的并行基點選取演算法。
  17. It studied lots of examples overseas of logistics delivery and algorithms, analyzed many factors that affect the efficiency of delivery, and investigates the models of delivery that are popular adopted. based on it the two new reference algorithms are proposed in this thesis. one algorithm is for selecting locations of dedicated logistics distribution center, and the other is for selecting optimal routines of transportation

    本文在學習了大量電子商務理論及物流配送理論的基礎上,研究了大量的國內外的物流配送實例及物流配送演算法,對各種影響物流配送效率的因素、目前廣泛採用的物流配送方式等進行了分析,給出了一種適合於我國電子商務現狀的物流配送參考模式,提出了基於internet環境的電子商務物流配送系統參考模型,設計了適合於實際的配送中心選址模型、演算法和運輸路線選擇模型及演算法。
  18. The improved parallel algorithm for selecting the base point of ecc over gf ( p ) is implemented by 2m ( m n, m 1 ) processors, m circular buffers and one shared table, which comprises two sub - algorithms : parallel finding the random points of ecc and parallel judging whether or not the random point is the base point

    採用2m ( m n , m 1 )個處理器、 m個循環緩存和一個公共表改進的gf ( p )上ecc的并行基點選取演算法分兩步實現:并行隨機點產生演算法和并行基點判斷演算法。
  19. We think there are mainly three problems should be resolved to acquire good restoration results. those include getting correct blur model and parameters, denoising and selecting proper restoration algorithms

    所以要想達到較好的圖像復原效果,主要有三方面的工作要做,它們分別是正確估計出退化模型和退化參數,有效地減少圖像噪聲和選取適當的圖像復原演算法。
  20. Besides the designing of data structure and algorithms, it made comparisons between its design scheme and some other schemers. it analyzed their advantages and disadvantages and made some advice for selecting the schemes

    除了將這些方面的數據結構與演算法引入防火墻外,本文還進行了這些方法和其它一些實現方法之間的比較,綜合分析了各自的優點與缺點,為將來從事設計的人員提供了一個參考。
分享友人