歸約演算法 的英文怎麼說

中文拼音 [guīyāoyǎnsuànfǎ]
歸約演算法 英文
reduction algorithm
  • 歸 : Ⅰ動詞1 （返回） return; go back to 2 （還給; 歸還） return sth to; give back to 3 （趨向或集中於...
  • 約 : 約動詞[口語] （用秤稱） weigh
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  1. This article canvass the status quo of the archive ' s automatization administration and the develop status of data mining, and discusses how to combine the data mining technology with the archive work from data cleaning means, data mining arithmetic, and data storage etc. and this article put forword a data mining syst em design idea. this article ' s structure is : first, in allusion to the archive data status quo, the pretreatment work of archive data that include data quality evaluation, data cleaning and data commut - ation process is bringed forword ; second, in the process of realizating data mining, the article discusses conception description, association rule, class three familiar means of applicating data mining, also put inforword the concrete arithmetic and the program design chart, and discusses the range and the foreground of all kinds of arithmetic when they are applicated in the archive ; third, the base of so you say, this article also discusses the importance of the archice applicate data storage and the means of realizing it ; last, the article discusses seval important problem of realizing an archive data mining system from data, diversity, arithmetic multiformity, mining result variety and the data pretreatment visibility, mining object descriptive visibility, mining process visibility, mining result visibil ity, user demand description and problem defining etc aspect. the article ' s core is how to import data mining technology in the archive work

    本文評述了檔案自動化管理現狀和數據挖掘技術的發展狀況，從數據清洗方法、數據挖掘演算法、數據倉庫的建立等方面論述了如何將數據挖掘技術與檔案工作相結合的具體思路，並提出了一個數據挖掘系統的設計思想。文章首先，針對檔案數據的現狀，提出了應對檔案數據進行預處理工作，包括數據質量評估、數據清理、數據變換和歸約等過程；其次，在具體實現數據挖掘過程中，本文結合檔案數據的特點探討了概念描述、關聯規則、分類等三種常見挖掘形式的實現方法，提出了具體的實現演算法和程序設計框圖，並論述了各種演算法在檔案工作中的應用范圍及前景；第三，在上述基礎上，又論述數據倉庫在檔案數據挖掘中的重要性並提出了實現一個檔案數據倉庫的方法；最後，從處理數據的多樣性、演算法的多樣性、挖掘結果的多樣性、數據預處理可視化、挖掘對象描述的可視化、挖掘過程可視化、結果顯示可視化、用戶需求的描述及問題定義等幾方面討論了實現一個檔案數據挖掘系統的幾個重點問題。全文以探討如何將數據挖掘技術引入到具體的檔案工作實踐中為核心。
  2. In distributed query optimization, this paper aims at how to reduce communication cost, adopting semi - join program

    對于用傳統的sdd - 1演算法來尋找全歸約程序進行改進。
  3. Firstly, a 0 - 1 integer programming mathematical model is constructed to describe tail - number - assigning work happened in domestic airline, since the problem is npc, a unified polynomial algorithm which satisfies engineering requirement is unavailable. illuminated by the practical experience, a specific tna problem is classified into one of three typical tna modes : tna based on fleet dispatching commands, tna based on fleet balance application, tna based on minimum fleet requirement ; secondly, by simplifying and relaxing some minor constraints, corresponding mathematical models and heuristic algorithms are reconstructed for each typical tna mode ; finally, computing complexities are discussed

    為此論文在借鑒手工編制排班計劃經驗的基礎上，將一個具體的飛機排班問題，歸結為三種典型排班模式中的一種，即：基於飛機調度指令要求的排班問題，基於飛機使用均衡要求的排班問題和基於最少需用飛機數的排班問題，對于每種典型的飛機排班模式，在對次要的約束條件進行簡化、松馳的基礎上構造出相應的能夠滿足工程應用要求的啟發式演算法，並分析了演算法的復雜性。
  4. In view of the fact that the genetic algorithm of stochastic programming based on random simulated technology has succeed greatly, this paper points out that changing parameters of genetic algorithm can obtain a sequence of optimum values of goal function. taking these genetic algorithm values as sampling data, we can get fitting optimum function by using multivariate spline regression and get the lipschitzs constant of the fitting optimum function. so for any chance constrained programming problem, we can get its interval estimate

    鑒于基於隨機模擬技術的遺傳演算法在求解隨機規劃問題上的優越性，本文指出，改變遺傳演算法的參數條件，在此基礎上求得機會約束規劃的若干個最優值，以這些最優值為樣本點，利用多元樣條回歸，擬合得到最優值函數，進而求出最優值函數的lipschitzs常數，從而對于任一機會約束規劃問題，都可以得到它的一個區間估計。
  5. 3 a novel recursive least - square ( rls ) blind space - time receiver algorithm based on the constrained condition, which can completely avoid the matrix inversion introduced into by constraints ( comparing with the normal rls ), is proposed for multi - path slow fading cdma channels. the computational complexity of this method is not only lower than that of the normal rls, but also lower than that of both lms and ls blind space - time receiver methods that are realized based on the rosen ' s gradient projection. and the speed of convergence of the presented rls blind space - time receiver algorithm is better than that of both lms and ls blind space - time receiver methods

    3 、針對多徑慢衰落通道下ds - cdma盲空時接收機中線性約束二次規劃問題提出一種新的遞歸最小二乘演算法，該演算法完全避免因約束而引進的矩陣求逆運算（相對于常規的遞歸最小二乘演算法） ，不但運算量比常規的要低，而且比基於rosen梯度投影實現的最小均方（ lms ）與最小二乘盲空時接收機演算法還低，且收斂速度比基於rosen梯度投影實現的最小均方（ lms ）與最小二乘盲空時多用戶檢測都好，將提出的新的遞歸最小二乘演算法與提出的數據選擇方案結合起來可以進一步降低其運算量，具有很大的實用價值，最後通過模擬實驗進一步分析了其性能。
  6. Combined with the data - selected schemes proposed, the computational complexity of this method can be lowered. the performance of the presented rls method is analyzed by simulations, and it is shown that this method is interesting for application. 4 time - selective channel signal model based on multipath - doppler diversity representation is given in multi - path fast fading channel, and rls space - time receiver algorithm based on time - varied constraint condition is presented and the computational complexity of this method is analyzed

    4 、針對多徑快衰落通道下的ds - cdma系統，給出了基於多徑-多譜勒觀點描述的1百安電弓卜科東兔j憶學協士學位論文時間選擇性通道的信號模型，提出了基於變約束條件下的遞歸最小二乘空時接收機演算法並分析演算法的運算量，最後通過模擬分析了所提出的方法的性能。
  7. With the coming of information age, more and more people realize the importance of information. useful information hidden in plenty of data needs mining energently. the technology of data mining arises and develops unders such circumstance. the main tast of data mining is to extract or mine the useful information from the data. we can get great amount of data from the computer transaction every day. the data is very useful for us to make decisions on management. the paper concludes and introduces association rule about its concept, sort, model and step for mining the data, measure and some basic algorithm on the basis of the at research. at the same time, we analyse hopfield - network ' smodel, character, energy - function, movement - equation and so on. moreover, to the requirement of the system of information of computer - saling, we have done the following and there are good result. fisrt, considering the weight and constraint, we propose the algorithm for the weighted and constraint association rule

    本文首先對數據挖掘中的關聯規則和神經網路的已有成果作了詳細深入的調研，歸納和整理了關聯規則的概念、分類、關聯規則挖掘的模型與步驟、關聯規則的度量方法以及一些基本演算法；還歸納和整理了hopfield網路的模型、特徵、能量函數、運動方程等，並在此基礎上，結合電腦賣場信息支持系統提出的需求，做了如下工作，並取得了一定的成果和成效： （ 1 ）考慮加權與約束兩種情況，提出了既帶權重又帶約束的關聯規則提取演算法。
  8. As an example, the parallel machine scheduling problem is mapped on a non - constrained matrix construction graph, and a aco algorithm is proposed to solve the parallel machine scheduling problem. comparison with other best - performing algorithm, the algorithm we proposed is very effective. the finite deterministic markov decision process corresponding to the solution construction procedure of aco algorithm is illustrated in the terminology of reinforcement learning ( rl ) theory

    本章最後提出了解決并行機調度問題的蟻群演算法，該演算法把并行機調度問題映射為無約束矩陣解構造圖，並在演算法的信息素更新過程中應用了無約束矩陣解構造圖的局部歸一化螞蟻種子信息素更新規則，與其他幾個高性能演算法的模擬對比試驗證明這種方法是非常有效的。
  9. The thesis, in the probability analysis and computation, considers the failure history of space frames and trusses, adopts the bound criterion and algorithms on the base of system ' s critical strength, and introduces the soft self - adaptation control bound into the identification of dominant failure modes ; at the same time, with the incremental load method and differential equalized recursive method, computes the limit - state function of failure mode and probability index precisely under no leaking the dominant failure modes

    文中在可靠性分析和計算部分，考慮空間剛桁架結構系統的失效演化歷程，採用基於系統臨界強度的約界準則和約界演算法，將柔性自適應控制邊界引入失效模式識別過程；同時，用荷載增量法和微分等價遞歸演算法相結合，確保在嚴格不遺漏主要失效模式的情況下，快速準確地求解失效模式的極限狀態方程和可靠度指標。
  10. After the paper sufficiently considered creation algorithmic of triangulated irregular network in time and space and analyzed three creation algorithms of tin - divide - conquer, triangulation growth, incremental insertion, the paper adopts to a new algorithm that takes advantages of divide - conquer and triangulation growth. it can create tin quickly. the paper also uses break lines, terrain feature lines, building borderlines to be restriction condition and creates triangulated irregular network based on restriction

    綜合考慮不規則三角網生成演算法的時間和空間性能，分析了常用的三種tin生成演算法：分割-歸並法、三角網生長法和逐點插入法，筆者採用分割-歸並法與三角網生長法相結合的演算法，快速生成了tin ，並以斷裂線、地性線、建築物邊界為約束條件，最終生成具有約束的不規則三角網。
  11. When solving the problems, we use the support vector regression ( svr ). first assuming the formula of function, then according to the differential and boundary conditions we transform the original problem to the quadratic programming problem. finally, use the learning algorithm of svr to decide the parameters

    只要事先假設出所求函數的表達式，然後根據已知的微分關系和邊界條件對待求函數進行約束將原問題轉化為二次規劃問題，再採用支持向量機回歸演算法對樣本進行學習即可求出參數，確定待定函數的關系式。
  12. The existing algorithms usually add damping term of the form. xlog. x into their objective function in order to control matching matrix ' s entropy. the shortcoming is that the two - way constraints need to be enforced by using sinkhorn method

    這類演算法為了控制匹配矩陣元素的熵，通常在目標函數中加入xlogx形式的阻尼項，其缺點是需要用sinkhorn交替歸一化方法或其它方法使匹配矩陣滿足雙向的行列約束。
  13. At last, parallel algorithm design is researched and applied to image edge detection, some good results are gained correspondingly on a simulation cluster system. at the same time, by using theoretical analysis and simulated computation, with reference to

    使用靜態負載平衡、多進程歸約兩種策略，實現了圖像邊緣檢測運算元在圖像處理中的并行演算法，並在模擬集群環境下實驗運行，獲得了相對比較好的實驗結果。
分享友人
分享到 Line

分享到臉書