迭代的 的英文怎麼說

中文拼音 [diědàide]
迭代的 英文
iterative
  • 迭 : Ⅰ動詞（輪流; 替換） 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 （歷...
  • 的 : 4次方是 The fourth power of 2 is direction
  1. Finally, this thesis explored incremental algorithm, which featured normally in addable and non - iterative with some advantages, such as applicable to large and dynamic database, lower demand for memory, implementation of parallel processing and incremental update

    增量演算法的要求是聚類特徵一般是可加的、非迭代的，該文提出了一種基於密度的網格聚類演算法gdclus ，並在此基礎上提出了增量式演算法igdclus 。
  2. With the use of finite method we have developed computer simulation software for vacuum microtriodes with wedge - shaped and cone - shaped cathode on the basis of stduying deeply the field emission theory of vacuum microelectronics. the software included field section, grid point numbering, and the calculation of electric currents, transconductance and cathode capacitance, moreover, it can simulate the properties of vacuum microeletronic with variant structures and sizes. the relationship was studied and simulated among electic properties and device structures, sizes and cathode materials etc. the optimized design of vacuum microtiode was proposed

    本文在深入研究真空微電子器件場致發射理論的基礎上，根據圓錐形、楔形陰極真空微電子三極體的不同特點，分別建立了物理和數學模型，在考慮空間電荷密度影響的前提下，以有限元法為基礎採用迭代的方法計算出真空微電子三極體內的電勢分佈情況，繪制出了等勢線、電子軌跡線，並得到了器件電學性能隨幾何參數的變化情況。
  3. Conclusion r1 represent pixel - value of original image range block, r represent mean - value of original image range block, d represent mean - value of original image domain block, d1 represent pixel - value of resumptive image domain block, d represent mean - value of resumptive image domain block. superior perfermance of resumptive image range block is obtained as compared to conventional creative function by one iteration, that is,

    ） ， d _ i （ i = 1 ， 2 ， … ， n ）分別為某一恢復圖像定義域塊的均值和每一像素的像素值，我們用傳統的和改進的生成函數分別進行一次迭代，則用改進的生成函數進行迭代的恢復圖像每一值域塊的效果較好，即：
  4. By picking up actual load on road of car body, use the electro - hydraulic servo road simulating system and the remote parameter cantrol system to iterate, take the iterating control target as an accelerated speed signal of spindle nose, iterate separately the loading spectrums on different road surfaces and finally merge the iterated results to obtain the loading spectrums for tests in the test bench

    通過對轎車車身實際道路載荷的採集，採用電液伺服道路模擬系統和遠程參數控制系統進行迭代（迭代控制目標為軸頭加速度信號，對不同路面的載荷譜分別進行迭代，最後將迭代的結果合併） ，得到用於臺架試驗的加載譜。
  5. Consequently, on the basis of non - winkler foundation model, a finite - element method that utilizes foundation flexibility matrix into iterative calculation is proposed in this paper originated from the item " the optimal design theory and research of pile capping beam " sponsored by natural science fund of hunan province, which the continuity of soil mass can be accounted for under various boundary conditions, different loadings and irregular beam characters

    本文結合湖南省自然科學基金項目「樁基承臺梁優化設計理論與方法研究」 ，針對非文克爾地基（半空間、線性變形層或單向壓縮層地基模型等）上的樁基承臺梁，提出一種利用地基柔度矩陣來進行迭代的有限單元法，可充分考慮梁下土體的連續性，並對基礎與土體脫開、承臺梁截面變化、梁體邊界條件復雜、上部荷載類型變化以及梁下基樁承載力差異等情況進行分析計算。
  6. To overcome the limitations of general fnns and bp algorithm, this thesis introduced a hybrid feed - forward neural network, which is composed of a linear model and a general multi - layer fnn, and proposed a new learning algorithm for the hybrid fnn

    其次，針對bp網路存在的缺陷，結合前向神經網路和線性最小二乘法的優點，構造了一種基於混合結構的神經網路，提出了相應的非迭代的快速學習演算法。
  7. Abstract : based on the iterative bit - filling procedure, a computationally efficient bit and power allocation algorithm is presented. the algorithm improves the conventional bit - filling algorithms by maintaining only a subset of subcarriers for computation in each iteration, which reduces the complexity without any performance degradation. moreover, a modified algorithm with even lower complexity is developed, and equal power allocation is introduced as an initial allocation to accelerate its convergence. simulation results show that the modified algorithm achieves a considerable complexity reduction while causing only a minor drop in performance

    文摘:基於迭代的比特和功率分配機制，提出了一種低復雜度的比特和功率分配演算法.與傳統的迭代分配演算法不同，該演算法在每次迭代中只需要比較幾個特定的子載波.該方法在保持傳統迭代演算法性能的前提下極大地減小了迭代分配演算法的復雜度.此外，通過選擇等功率分配方案作為初始方案加快了演算法的收斂速度，進一步降低了演算法復雜度.模擬結果表明，提出的改進演算法在基本不犧牲系統性能的前提下有效地降低了演算法復雜度
  8. The result indicates that the nonlinear elastic model is appropriate for better foundation condition, while the viscoelastic model is appropriate for worse foundation condition. according to the uniqueness of back analysis solution, it is put forward a method for the back analysis of layer - wise and section - wise iteratively. which is showed advantage by the calculation result

    分析表明，非線性彈性模型一般適合地基較好的情況，而對于地基較差的情況宜採用粘彈性模型；針對反演計算解的唯一性問題，提出了分層分部反演迭代的計算方法，計算表明，該方法具有一定的優越性。
  9. As a result, invisible points can be culled view - dependently in high efficiency for hardware acceleration, and at the same time, the advantage of sequential point trees could be still fully taken. therefore, the new method can run much faster than the conventional sequential point trees, and the acceleration can be highly promoted particularly when the objects possess complex occlusion relationship and viewed closely because invisible points would be in a high percentage of the points at finer levels

    具體地說，從根結點開始，我們將點模型樹按照廣度優先的方式一層結點一層結點地順序排列在排列一層結點時，我們引入迭代的z型序列來安排這些結點在序列中的位置，使得空間上鄰近的點在序列中的位置也是靠近的而在每個非葉子結點，還記錄它的兒子結點在序列中所處的片段位置。
  10. Especially, to solve the functional heated calculation, which is the core work of boiler project analysis, the dissertation contributes a sequential modular iterative algorithm by referring to the theory of process system simulation

    其中，本文基於過程系統模擬理論，對鍋爐方案分析活動中最為重要的功能性熱力計算提出了一種序貫模塊迭代的新演算法。
  11. Then again, 65 million readers can ' t be wrong ; the spare, propulsive style that drove the alchemist, eleven minutes and coelho ' s other books will easily carry fans through myriad iterations of the ways and means of amor

    再說， 65萬讀者不能錯;備用，推進風格驅使方士， 11分鐘和科埃略的其他書籍，容易攜帶球迷通過無數次迭代的方法和途徑阿莫爾。
  12. A combined iterative classification method for scientific documents

    一種協調迭代的科技文獻分類方法
  13. Genetic algorithm ( ga ) is a set of new - global - optimistic search algorithm repeatedly which simulate the process of creature evolution that of darwinian ' s genetic selection and natural elimination

    遺傳演算法是模擬達爾文的遺傳選擇和自然淘汰的生物進化過程的一種新的迭代的全局優化搜索演算法，已經廣泛地應用到組合優化問題求解、自適應控制、規劃設計、機器學習和人工生命等領域。
  14. The analysis becomes an iterative process.

    這一分析計算工作實際上是一個逐次迭代的過程。
  15. Instead, with an iterative approach, an initial guess for the solution of (6. 109) is used.

    取而代之的是迭代的逼近法，並使用（6109）的解最初的估值。
  16. The second part studies optimal pure proportional navigation ( ppn ), with time - dependent gain of navigation to maneuvering target based on proportional navigation theory. optimal gain of navigation is constant for ppn without maneuvering ; based on this, solution of time - dependent gain of navigation is given by iteration approach, and the time required for capture is given, the times of iteration is decided by comparing this time with the iteration step

    對目標機動的追逃問題，考慮導航增益可為任意實數，且隨時間和初始條件改變，這一思想是建立在目標非機動的純比例導引制導規律，最佳導航增益為常數的基礎之上，利用迭代的方法，給出了時變的導航增益的求解方法，並給出了實現捕獲所需的時間，用此時間與迭代步長進行比較，判定迭代次數。
  17. Compared with normal weight selection method, the new method can reduce the iteration times of weight function selection, and ensure the synthetical performance of the resulting h ( subscript ) loop shaping controller

    與常規的權重函數選取方法相比，該方法能夠減少權重函數選取時迭代的次數，保證控制器的綜合性能。
  18. This paper adopts multi - grid and the optimal selection of the relaxation gene, so it quickens the convergent speed of iteration

    方程組的求解過程中，採用了多重網格法的思想和優選法試驗鬆弛因子法，來加快迭代的收斂速度。
  19. In chapter two, under non - lipschitz condition, the existence and uniqueness of the solution of the second kind of bsde is researched, based on it, the stability of the solution is proved ; in chapter three, under non - lipschitz condition, the comparison theorem of the solution of the second kind of bsde is proved and using the monotone iterative technique, the existence of minimal and maximal solution is constructively proved ; in chapter four, on the base of above results, we get some results of the second kind of bsde which partly decouple with sde ( fbsde ), which include that the solution of the bsde is continuous in the initial value of sde and the application to optimal control and dynamic programming. at the end of this section, the character of the corresponding utility function has been discussed, e. g monotonicity, concavity and risk aversion ; in chapter 5, for the first land of bsde, using the monotone iterative technique, the existence of minimal and maximal solution is proved and other characters and applications to utility function are studied

    首先，第二章在非lipschitz條件下，研究了第二類方程的解的存在唯一性問題，在此基礎上，又證明了解的穩定性；第三章在非lipschitz條件下，證明了第二類bsde解的比較定理，並在此基礎上，利用單調迭代的方法，構造性證明了最大、最小解的存在性；第四章在以上的一些理論基礎之上，得到了相應的與第二類倒向隨機微分方程耦合的正倒向隨機微分方程系統的一些結果，主要包括倒向隨機微分方程的解關于正向隨機微分方程的初值是具有連續性的，得到了最優控制和動態規劃的一些結果，在這一章的最後還討論了相應的效用函數的性質，如，效用函數的單調性、凹性以及風險規避性等;第五章，針對第一類倒向隨機微分方程，運用單調迭代方法，證明了最大和最小解的存在性，並研究了解的其它性質及在效用函數上的應用。
  20. Point estimates on deformation

    迭代的點估計
分享友人
分享到 Line

分享到臉書