good algorithm 中文意思是什麼

good algorithm 解釋
優質演算法
  • good : adj (better; best ) (opp bad)1 好的,良好的;漂亮的,優美的。2 愉快的,幸福的。3 善良的,有品...
  • algorithm : n. 【數學】演算法;規則系統;演段。
  1. Optimized association rules are permitted to contain uninstantiated attributes. the optimization procedure is to determine the instantiations such that some measures of the roles are maximized. this paper tries to maximize interest to find more interesting rules. on the other hand, the approach permits the optimized association rule to contain uninstantiated numeric attributes in both the antecedence and the consequence. a naive algorithm of finding such optimized rules can be got by a straightforward extension of the algorithm for only one numeric attribute. unfortunately, that results in a poor performance. a heuristic algorithm that finds the approximate optimal rules is proposed to improve the performance. the experiments with the synthetic data sets show the advantages of interest over confidence on finding interesting rules with two attributes. the experiments with real data set show the approximate linear scalability and good accuracy of the algorithm

    優化關聯規則允許在規則中包含未初始化的屬性.優化過程就是確定對這些屬性進行初始化,使得某些度量最大化.最大化興趣度因子用來發現更加有趣的規則;另一方面,允許優化規則在前提和結果中各包含一個未初始化的數值屬性.對那些處理一個數值屬性的演算法進行直接的擴展,可以得到一個發現這種優化規則的簡單演算法.然而這種方法的性能很差,因此,為了改善性能,提出一種啟發式方法,它發現的是近似最優的規則.在人造數據集上的實驗結果表明,當優化規則包含兩個數值屬性時,優化興趣度因子得到的規則比優化可信度得到的規則更有趣.在真實數據集上的實驗結果表明,該演算法具有近似線性的可擴展性和較好的精度
  2. We discuss the forecast method which based on wavelet neural networks by combining good time and frequency local analysis ability which wavelet analysis possesses with learning ability which neural networks possesses, and bring forward a frondose, banausic algorithm in this dissertation0 also, a essential thinking of combined forecast based on wavelet neural networks is described and a essential trait of combined forecast based on wavelet neural networks is pointed out

    結合小波分析所具有的良好的時頻局部化分析能力和神經網路所具有的學習能力,討論了小波神經網路預測方法,並給出了其具體、實用的演算法。文中還描述了基於小波神經網路組合預測的基本思想,指出了利用小波神經網路進行非線性組合預測的特點。
  3. This algorithm combines the advantages of barnard, which has good tolerance for the intensity of the illumination and contrast, and the advantages of log, which has good tolerance for the noise

    該演算法結合了barnard特徵對光照度和對比度不敏感的優點和log運算元對噪聲處理比較好的優點。
  4. Further more, this algorithm also provides the criterion distinguishing edge inflexion and sleek curve section and the method computing inaccurately curvature radius and approximate perimeter. the paper also introduces the use method with cell edge hollow repairing and overlap or conglutination cell segmentation. for example, this algorithm has proved high - speed and has a good effect of cell segmentation on more than twenty groups of conglutinate and absent cells which are gathered from three kinds of cells

    同時給出了利用這些參數判別邊界角點,邊界光滑段的判據,以及估算曲率半徑,等效周長的方法;最後,以細胞邊界凹陷的修補和重疊細胞粘連的分割為例驗證了演算法的可行性,該演算法在採集到的30餘組粘連和缺損細胞上進行了驗證,結果表明,該演算法處理速度快,分割效果良好。
  5. First this paper describes the composing and technics of drillers ; then the composing of control system based on s7 - 300plc is described ; then thinking of such characteristics of oil driller as complexity and long delay, this paper brings forward the control strategy of combining the fuzzy control with smith estimate control algorithm, and sets down the way of auto - driller based on discal hydraulic pressure brake. at last the experiment based on matlab by computer shows that the effect of this control mode is very good and all performance are famous

    首先本文闡述了鉆機的組成與工藝特點,然後描述了基於西門子s7 - 300plc的控制系統組成,然後針對傳統鉆機自動送鉆控制策略落後的缺陷,同時考慮到鉆機的復雜性、大滯后等特點,提出了模糊控制演算法與施密斯( smith )預估控制演算法相結合的控制策略,給出了基於液壓盤式剎車的自動送鉆智能控制策略, matlab的模擬實驗證明該控制方式控制效果良好,各方面性能指標都達到理想要求。
  6. Practical application results show that this adaptive algorithm can build better estimation models than the traditional modeling techniques, such as pls, mlr and bp neural network etc. meanwhile, the new cod model shows a good correlation between cod estimated values and cod analysis values

    實例分析表明,採用這種演算法建立的模型具有比用傳統技術(如pls , mlr , bp網路等)更好的預估效果,同時預估值與標準分析值之間也顯示了良好的相關性。
  7. In this paper, some flows around naca 0012 aerofoil, m6 wing and two different blunt vehicles are simulated, the results show that the present algorithm possesses good characteristics and capability for normal mach number and for hypersonic of simple configurations

    通過對naca0012翼型、 m6機翼、鈍頭以及雙鈍錐?柱體的算例驗證,本文能很好的解決一般馬赫數問題,能夠很好的求解簡單外形的高超聲速問題,對于復雜外形飛行器還需要進一步進行研究驗證。
  8. Immune clone strategy is introduced into c - means algorithm, which can effectively tackle those problems of nonstability, slow convergence and nonideal clustering that exist in ids with the traditional c - means. the experimental results reveal that the system can detect variety of unknown abnormal intrusions, and demonstrate that our combined clustering algorithm has good performance

    實驗結果證明該上述兩種演算法有效地克服了傳統c -均值聚類演算法在解決入侵檢測問題中的穩定性差、收斂性不好和聚類效果不理想等問題,並能在一定程度上檢測到未知的異常入侵行為。
  9. Then we present a toa / tdoa data fusion model based on mathematical statistics for radiolocation in cellular network, and fuse toa / tdoa measurements through a best linear fusion method and a mobile position based dynamic location algorithm, which shows good performance of robustness and accuracy

    然後,從數理統計的角度出發,構造了一個toa和tdoa進行位置估計的數據融合模型。主要利用一種最佳線性融合策略和基於移動臺位置的動態定位演算法對toa和tdoa測量數據進行融合,有效的提高了演算法可靠性和準確度。
  10. To improve the accuracy of node trust evaluation in a distributed network, a trust model based on the experience of individuals is proposed, which establishes a new trust assessment system by introducing the experience factor and the comparative experience factor. the new evaluation system considers the differences between individuals and interactive histories between nodes, which solves the problem that nodes have inaccurate assessments due to the asymmetry of nodes to a certain extent. the algorithm analysis indicates that the new model uses different deviating values of tolerance evaluation for different individuals and uses different updating values embodying node individuation when updating feedback credibility of individuals, which evaluates the trust value more reasonably and more accurately. in addition, the proposed algorithm can be used in various trust models and has a good scalability

    為了提高分散式網路中各節點信任評價的準確度,提出了一種基於個體經驗的信任模型.該模型通過引入經驗因子和相對經驗因子的方法,建立了新的信任評價體系.這種新的信任評價體系考慮了個體節點的差異問題,在計算節點的信任值時考慮了節點間的交互歷史,這在一定程度上解決了由於節點的非對稱性而導致的信任評價不準確的問題.演算法分析表明:新模型能夠針對不同的個體節點,採用不同的最大容忍評價偏差,並且對個體節點的反饋可信度進行更新時,採用不同的更新值,體現了節點的個性化特徵,使信任評價更加準確合理.此外,所提出的新演算法能夠運用到多種信任模型中,具有很好的可擴展性
  11. Through a lot of experiments and simulations, analyzing the uwb channel model, studying on many papers, a new synchronization algorithm based on barker code and a new channel estimation method based on music algorithm are given. the simulation results of synchronization algorithm in which uwb channel model is used are gotten, and the channel estimation algorithm is demonstrated by measurement data. anyway, both of them get good conclusions

    本文通過大量的模擬以及實測的數據分析了通道模型,在參考了大量文獻的基礎上給出了較為實際的同步方法和通道估計方法,並進行了大量的模擬驗證,其中同步方法在結合通道模型的基礎上給出了模擬結論,通道估計方法最後應用於實測數據當中,得出了較為理想的結果。
  12. A good algorithm is one that has a low computational complexity, provides a high quality of motion compensation and also ensures that the bitstream is as small as possible

    一個好的運動估計方法應當是:估計性能高、計算復雜度低、比特傳輸速率低。
  13. The original infomax is only applied in the instantaneous mixture and in the single channel blind deconvolution. this thesis applies the idea to blind sources separation in multiple channel convolutive mixture. through simulation, we can show that the algorithm has good performance

    Infomax演算法適用於瞬時混合情況下的盲分離和單通道盲解卷積問題,本文將infomax演算法推廣到多通道卷積混合,對演算法進行模擬,取得了不錯的效果。
  14. At last the algorithm of ddmf is achieved by the investigation tool of altera company ? quartus ii and the vhdl language, and its ip core is also achieved which is used not only in the satellite navigation position system, but also in the long pn code dsss system. ddmf investigated in the dissertation gives a good way to design the rapid pn code acquisition in the beidou project, and the technology has the definite theory and practice significance

    此外還應用altera公司的最新的fpga開發工具quartusiiv5 . 1 ,採用了國際標準的硬體描述語言? vhdl語言,對數字差動匹配濾波器和傳統匹配濾波器演算法予以實現,開發了該演算法的軟ip核,可以對所應用的擴頻碼長度, a / d采樣后的數據量化階數,所用擴頻碼等可進行隨意改寫。
  15. The algorithm of aimd, namely additive increase and multiplicative decrease, which is thought a good algorithm for congestion avoidance, has been applied widely in tcp congestion control

    Aimd ( additiveincreaseandmultiplicativedecrease )演算法是目前比較優秀的擁塞避免演算法,已經在網際網路的tcp擁塞演算法中得到了應用。
  16. In the preprocessing stage the method of user and session identification often adopt heuristic algorithm for the being of cache and agent. this induce the uncertainty of data resource. the cppc algorithm avoid the limitation and has no use for complicated hash data structure. in this algorithm, by constructing a userld - url revelant matrix similar customer groups are discovered by measuring similarity between column vectors and relevant web pages are obtained by measuring similarity between row vectors ; frequent access paths can also be discovered by further processing of the latter. experiments show the effectiveness of the algorithm. in the fourth part, this thesis bring some key techniques of data mining into web usage mining, combine the characteristic of relation database design and implement a web usage mining system wlgms with function of visible. lt can provide the user with decision support, and has good practicability

    本文演算法避免了這個缺陷,且不需要復雜的hash數據結構,通過構造一個userid - uel關聯矩陣,對列向量進行相似性分析得到相似客戶群體,對行向量進行相似性度量獲得相關web頁面,對後者再進一步處理得到頻繁訪問路徑。實驗結果表明了演算法的有效性。第四是本文將傳統數據挖掘過程中的各種關鍵技術,引入到對web使用信息的挖掘活動中,結合關系數據庫的特點設計並實現了一個具有可廣西人學頎士學位論義視化功能的web使用挖掘系統wlgms 。
  17. Good experiment results show that our algorithm is robust enough to solve the delocalization and false detection problem. and at the same time, our algorithm also gives high repeatability

    實驗表明,該演算法具有很高的興趣點重復度,並很好地解決了以往演算法的點位置偏差和誤檢問題。
  18. A large quantity of simulation data indicates that, the toggle rules found by this genetical algorithm have good avalanche effects and diffusibility

    通過大量的實驗統計數據表明這類演化規則具有良好的雪崩性、擴散性。
  19. Consequently, there is urgent need of good algorithm for calculating the crossing number of graph

    因此,迫切希望有較好的計算機演算法用以計算圖的交叉數。
  20. There may be a good algorithm to narrow choices, and i ve left the

    可能會有限制選擇的好演算法,於是我把
分享友人