迭代規則 的英文怎麼說

中文拼音 [diědàiguīzé]
迭代規則 英文
iteration rule
  • 迭 : Ⅰ動詞（輪流; 替換） alternate; change Ⅱ副詞1 （屢次） repeatedly; again and again 2 （及） in tim...
  • 代 : Ⅰ動詞1 （代替） take the place of; be in place of 2 （代理） act on behalf of; acting Ⅱ名詞1 （歷...
  • 規 : Ⅰ名詞1 （畫圓形的工具） instrument for drawing circles 2 （規則; 成例） rule; regulation 3 [機械...
  • 則 : Ⅰ名詞1 （規范） standard; norm; criterion 2 （規則） regulation; rule; law 3 （姓氏） a surname Ⅱ...
  • 規則 : 1. （規定的制度或章程） rule; regulation; ordination; prescribed procedure; rope 2. （整齊） regular
  1. In chapter five to reconst ruct the three - dimensional object cubes, various deconvolution algorithms : nearest neighbor, inverse filtering and constrained iterative deconvolution are developed and applied to both computer generated and experimentally measured image cubes. the best results are obtained using an svd inverse fourier deconvolution algorithm with regularization for noise suppression

    第五章為了重建三維目標立方，發展了各種去卷積演算法：最近鄰、逆濾波和帶約束的迭代去卷積，並應用到計算機產生和試驗測量的圖像立方中，最好的結果是利用具有規則抑制噪聲的svd逆傅立葉變換去卷積演算法獲得的。
  2. The search algorithm makes use of rewritting rules to get a set of equivalent b _ schemas, utilize the cost model to estimate the cost of each b _ schema and iterative search the min - cost b _ schema

    引入一種搜索演算法進行優化處理。該演算法利用改寫規則得到一組等價的b _ schema集合，對b _ schema進行代價估計、比較，迭代得到代價最小的b _ schema 。
  3. Such methods are generally decreasing method, such as, feasible direction methods, constrained variable metric methods, etc. another class is sub - problems method, which approximates the optimal solution by solving a series of simple sub - problems, such as penalty function methods, trust region methods, and successive quadratic programming sub - problems, etc. the same property of two classes of methods is that they determine whether the next iterative point is " good " or " bad " by comparing the objective function value or merit function value at the current point and next iterative point

    另一類叫做子問題演算法，這種演算法是通過一系列簡單子問題的解來逼近原問題的最優解，如罰函數法、信賴域演算法、逐步二次規劃演算法等。這兩類演算法的一個共同特點是，通過比較當前點和下一個迭代點的目標函數值或評價函數值來確定迭代點的「優」或「劣」 ，若迭代點比當前點「優」則該迭代點可以被接受，否則須繼續搜索或調整子問題。
  4. On the basis of the geochemistry digital model arithmetic of triangulated irregular network, i change the arithmetic of auto - tracing isoline. in process of auto - tracing isoline, the proplem of tracing - crossand and mini - heave was resolved. the isoline is smoothec by linear overlap algorithm. in addtion, the model can build other unit of map such as extramum point, polygon

    在不規則三角網數字模型的基礎上，改進並實現了等值線生成演算法，解決了等值線生成中的分叉問題，解決了等值線上的小凸起問題；對等值線採用線性迭代演算法進行了圓滑處理；提出延伸三角網演算法，用於實現了開等值線的閉合；生成用於地學分析的區域圖元，等值線圖元，極值點圖元等。
  5. The diagnosis program is made in visual c + +. the samples are trained with this network, during which the relationships between the network parameters ( such as rule number, study rate, expert network initial error and gate network error, circulation times and power index ) and learning error were probed into, and the outcome can provide the basis for network parameter selecting

    並採用visualc + +編制了系統程序，首先通過分層混合專家網路對故障樣本進行訓練，在訓練中對分層混合專家網路各參數（規則數、學習率、門網路中止誤差、專家網路初試迭代誤差、循環次數、加權指數等）與學習誤差平方和的關系進行了探討，其結果為樣本網路參數的合理選取提供了依據。
  6. To many not strictiy self - similar image, the usual fractal image compression method based on block partition divides the image into non - overlap regular shape block collection. every block ' s iterate function system is found out by local self - similarity. the parameters of all iterate function system form fractal image compression code

    這種方法將圖象劃分為規則形狀的不重疊的子塊集，根據子塊的局部自相似性，找出集中每一個子塊的迭代函數系統，由全體子塊的迭代函數系統參數形成分形圖象壓縮編碼。
  7. The main process of the method is : after the converged solution for a certain layer of grid is obtained, all elements that are required to be refined based on error analysis are automatically found and output. as the distribution of the elements to be refined is often discrete and irregular, regular square blocks consisting of elements to be refined need to be manually built and input to the computer. the computation for the refined layer grid is then carried out and the procedure is repeated until the final convergence criterion is satisfied

    該方法的特點是：當某一層次網格取得收斂解后，程序根據誤差分析自動判別並輸出該層次網格內需加密的單元，由於需加密單元的分佈一般較為離散和不規則，因此通過人工介入對這些單元進行組塊並輸入到計算機，程序便開始進行下一層次網格的迭代計算，直至得到滿足最終收斂判據的解。
  8. M there are considerable number of research concendng finie elemen method on contat problem and lot of techniques such as iteraion methd, mathematics propoming, penalty method, langrange multiplier and so on hav been developed, it is not easy to popularize the presemed methods to engineering. " field due to their complicate techniques. ms prompts the author to develop an wash that is simpler in techniques and can be @ plied to geotecilllital problems iv with less difficulty

    雖然目前接觸問題有限元計算已有大量的研究成果，所提出的求解方法也很多，如直接迭代法、數學規劃法、罰函數、 langrange乘子法等，但其求解技巧普遍比較復雜而不易在工程領域推廣應用，在巖土工程中的應用則更少，因此，本文的主要工作是建立一種比較簡單、方便、能夠用於工程問題的接觸問題的計算方法，而其關鍵是相應的有限元計算公式的建立。
  9. Not only the existing algorithms of mining negative association rules and association rules with negative items are very few, but also they are essentially based upon the iterative algorithms of apriori idea, which needs multiple times scanning data sets and generating large amounts of frequent candidate sets

    現有的挖掘負關聯規則以及含負項目的關聯規則演算法為數不多，而且本質上都是基於apriori思想的迭代演算法，需要對數據集進行多次掃描，同時生成大量的候選頻繁項集。
  10. Penalty function is introduced in the adaptive value function to speed up the convergence of the algorithm and ensure that the assignment reduction includes fewer attributes with stronger support

    在交叉規則中，採用了單點交叉，最大迭代代數被作為停止準則，演算法獲得較佳的搜索效果。
  11. The pheromone - based parameterized probabilistic model for the aco algorithm is presented as the solution construction graph that the combinatorial optimization problem can be mapped on. based on the solution construction graph, the unified framework of the aco algorithm is presented. an iterative update procedure of the solutions distribution in the problem ' s probabilistic model is proposed, that will converge to the optimal solutions with probability one, then the minimum cross - entropy pheromone update rule is proposed to approximate the iterative update procedure by minimizing the cross - entropy distance and monte - carlo sampling

    基於解空間參數化概率分佈模型，首先提出了一個以概率1收斂于最優解的解空間概率分佈的迭代更新過程，然後提出了通過最小化不同分佈間的交互熵距離以及蒙特卡洛采樣來逼近此迭代過程的最小交互熵信息素更新規則，接著分別給出了弧模式以及結點模式信息素分佈模型下的最小交互熵等式。
分享友人
分享到 Line

分享到臉書