斂步 的英文怎麼說

中文拼音 [liǎnbù]
斂步 英文
slow down one's steps; hesitate to advance further; hold back from going
  • 斂 : Ⅰ動詞1 （收起; 收住） hold back; keep back 2 （約束） restrain 3 （收集; 徵收） gather; collect; ...
  • 步 : Ⅰ名詞1 （步度; 腳步） pace; step 2 （階段） stage; step 3 （地步; 境地） condition; situation; st...
  1. It is proven that these modified dual algorithms still have the same convergence results as those of the conceptional dual algorithms in chapter 2 and chapter 3. secondly, a dual algorithm is constructed for general constrained nonlinear programming problems and the local convergence theorem is established accordingly. the condition number of modified lagrange function ' s hessian is estimated, which also depends on the penalty parameter

    證明這些修正的對偶演算法仍具有同前兩章的概念性對偶演算法相同的收斂性結果，我們還進一步構造了一般約束非線性規劃問題的對偶演算法，建立了相應的局部收斂理論，最後估計了修正lagrange函數的hesse陣的條件數，它同樣依賴于罰參數。
  2. The iterative process may be continued until some criterion for convergence is met.

    這種迭代步驟可繼續下去，直到符合某種收斂要求為止。
  3. According to the lms criterion, steps for calculation implement is proposed., and simulations on convergency and ber properties blind algorithm has been done. in addition, as a introduction of blind algorithm, subspace decomposition, minimum output energy ( moe )

    針對該檢測器，將最小均方演算法（ lms ）應用於該檢測器，給出了演算法實現的計算步驟，模擬了演算法收斂特性及課碼性能，分析了自適應能力。
  4. Now the towers have already been link by a lately - set up on foot street, the west temple tower is fix a new, the east temple tower still keeps the original, new and old contrast under, pour to feel the bright and new west temple tower a the parties nouveau riche imposing style, let hard compliment of person, read the east temple tower of the exhausted vicissitudes of life but cool - headed astringent, let the persons extremely regret

    現在東西寺塔已經被一條新建的步行街連接起來，西寺塔被修葺一新，東寺塔仍保持原貌，新舊對比之下，倒覺得簇新的西寺塔一派暴發戶氣派，讓人難以恭維，閱盡滄桑的東寺塔卻沉穩內斂，讓人不勝感慨。
  5. This article puts forward a solution named divide - assemble by deducing the size of bp neural network to overcome entering the local best point, the dividing process is that a big bp neural network is divided into several small bp neural networks, every small bp neural network can study alone, after all small bp neural networks finish their study, we can assemble all these small bp neural networks into the quondam big bp neural networks ; on the basis of divide - assemble solution, this article discusses the preprocessing of input species and how to deduce the size of bp neural network further to make it easy to overcome entering the local best point ; for the study of every small bp neural network, this article adopts a solution named gdr - ga algorithm, which includes two algorithms. gdr ? a algorithm makes the merits of the two algorithms makeup each other to increase searching speed. finally, this article discusses the processing of atm band - width distribution dynamically

    本文從bp網的結構出發，以減小bp神經網路的規模為手段來克服陷入局部極小點，提出了bp神經網路的拆分組裝方法，即將一個大的bp網有機地拆分為幾個小的子bp網，每個子網的權值單獨訓練，訓練好以後，再將每個子網的單元和權值有機地組裝成原先的bp網，從理論和實驗上證明了該方法在解決局部極小值這一問題時是有效的；在拆分組裝方法基礎上，本文詳細闡述了輸入樣本的預處理過程，更進一步地減小了bp網路的規模，使子網的學習更加容易了；對于子網的學習，本文採用了最速梯度? ?遺傳混合演算法（即gdr ? ? ga演算法） ，使gdr演算法和ga演算法的優點互為補充，提高了收斂速度；最後本文闡述了用以上方法進行atm帶寬動態分配的過程。
  6. The viscid flux is discretized by second - order central difference scheme. baldwin - lomax turbulence model is implemented in navier - stokes flow solver. for steady - state calculations, a four - stage runge - kutta scheme with convergence acceleration techniques such as local - time stepping and implicit residual smoothing is used

    其中，定常計算中的時間推進採用四步runge ? kutta方法，並應用了當地時間步長、隱式殘值光順等加速收斂措施；非定常計算中的時間推進採用jameson的隱式雙時間方法。
  7. In this dissertation, we firstly prove that any dirichlet problem is indeed equal to a voltages problem of networks. we give five solutions to dirichlet problem in two dimensions ; among these five solutions, we prove that the iteration solution and the solution of relaxations are exponential convergence, then we estimate their respective convergence rates ; secondly, we discuss random walks on general networks, prove that there is an one to one correspondence between networks and reversible ergodic markov chains ; thirdly, we give probabilistic interpretation of voltages for general networks : when a unit voltage is applied between a and b, making va = 1 and vb = 0, the voltage vx at any point x represents the probability that a walker starting from x will return to a before reaching b ; furthermore, we study the relationship between effective resistance and escape probability : starting at a, the probability that the walk reaches b before returning to a is the ratio of the effective conductance and the total conductance

    本文證明了任何邊值的dirichlet問題都可轉化為求解電路電壓的問題：給出了計算平面格點上dirichlet問題的5種方法：證明了迭代法和松馳法都是指數收斂的，並分別給出收斂速度的估計；討論了一般電路上的隨機徘徊，驗證了電路與可逆的遍歷markov鏈是一一對應的；給出了電路電壓的概率解釋：當把1伏電壓加於a ， b兩端，使得v _ a = 1 ， v _ b = 0時，則x點的電壓v _ x表示對應的markov鏈中，從x出發，到達b之前到達a的概率；進一步地，給出了逃離概率與有效電阻之間的關系：從a出發，在到達b之前到達a的概率為有效傳導率與通過a的總傳導率之比。
  8. 4. a 2 - d and 3 - d euler equations and n - s equations are solved using the cell - centered finite volume method and four - step runge - kutta scheme on the cartesian grids with standard convergence acceleration techniques such as local time stepping, enthalpy and implicit residual smoothing

    使用jameson中心有限體積法和runge - kutta時間推進方法，求解了關於二維、三維復雜流場的euler 、 navier - stokes方程，採用了當地時間步長、隱式殘值光順等多種加速收斂方法。
  9. In this paper, the upwind scheme and the central scheme are presented for solving 3 - d n - s equations using the cell - center finite volume spatial discretization and four - stage runge - kutta time stepping scheme, with standard convergence acceleration techniques such as local time stepping and implicit residual smoothing

    在n - s方程的數值計算上，採用了中心差分格式和迎風格式，用格心格式的有限體積法進行了空間離散，用四步龍格?庫塔法作顯式時間推進，並採用了當地時間步長和隱式殘差光順等加速收斂措施。
  10. Some sufficient and necessary conditions for the multi - step iterative sequences of the asymptotically quasi - nonexpansive mappings ti to converge to certain common fixed points in the convex metric space are obtained

    摘要研究了凸度量空間中用多步迭代序列來逼近漸近非擴張映象的不動點，並給出了其收斂于不動點的充分必要條件。
  11. In solving the helmholtz equation in the acoustical waveguides with a curved bottom, slow convergence may occurs when the linear local orthogonal transformation is adopted. in this paper, a class of nonlinear local orthogonal transformations ( nlot ) is proposed. it is an approach to improve the slow convergence mentioned above

    本文嘗試通過在深度方向選取非線性局部正交變換，將曲底求解區域化為平坦求解區域，然後求解helmholtz方程的辦法，來改善用線性（深度方向）局部正交變換時，步進求解時會出現的局部收斂慢的問題。
  12. It has been improved, and specially proposed : firstly, we has increased run speed and ensure the diversity of population is with constructing non - dominated set by throwing off the dominated solutions, expressing the interior relation of individuals each other by the crowding distance, and constructing new population. secondly, we have further improved its convergence performance by clustering in precondition of ensuring a better distribution of individuals

    該文以nsga -為基準，對演算法進行了改進，具體提出了：用排除法構造非支配集、用聚集距離刻畫個體間的內部關系以及構造新群體，來提高運行速度和保持群體的多樣性；用聚類演算法在保持原有特性的前提下，進一步改善收斂性能等。
  13. We also give a variation of the em algorithm for gaussian mixtures

    進一步給出了高斯混合體em演算法的變形及其收斂性質。
  14. 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

    文摘:基於迭代的比特和功率分配機制，提出了一種低復雜度的比特和功率分配演算法.與傳統的迭代分配演算法不同，該演算法在每次迭代中只需要比較幾個特定的子載波.該方法在保持傳統迭代演算法性能的前提下極大地減小了迭代分配演算法的復雜度.此外，通過選擇等功率分配方案作為初始方案加快了演算法的收斂速度，進一步降低了演算法復雜度.模擬結果表明，提出的改進演算法在基本不犧牲系統性能的前提下有效地降低了演算法復雜度
  15. This method allows an increase in the objective function value at some step, while retaining global convergence

    此方法允許目標函數值在迭代過程中在某些步可以上升。而保持其全局收斂性。
  16. He also sees it as a way for the local government of the federal district, which comprises mexico city, to take in more revenue

    他也把它看作是墨西哥城聯邦地區地方政府進一步斂財的一種手段。
  17. The results show this rejoin is helpful, active learning reduces the classification bias and boosts the accuracy

    實驗結果表明，主動學習可以有效的抑制演算法收斂到局部最優值，進一步提高了演算法精度。
  18. In addition, the paper makes a research into fft in asynchronous sampling from the angle of iteration, and obtains a iterative formula

    此外，本文從迭代收斂的角度研究了非同步取樣時的fft ，得出了一個迭代公式。
  19. The artificial neural net ( ann ) way is universal regard as one of the most effective ways of stlf. in this paper, some research is developed for stlf using ann ways in several parts : the first part is about the arithmetic of ann based on bp model, namely the advanced of traditional bp arithmetic, one alterable step and scale bp arithmetic based on comparability of model and probability of accepting bp arithmetic is used to enhances a lot the convergence rate of learning process of bp network, but also avoid the stagnation problem to some extent. it indicates that the ann ' s efficiency and precision by the way can be ameliorated by the simulation of real data

    神經網路方法在短期預測中已經被公認為較有效的方法，本文針對神經網路用於電力系統短期負荷預測的幾個方面展開研究工作：第一部分研究一般用於負荷預測的神經網路bp模型的演算法，即對傳統的bp演算法的改進，將一種基於模式逼近度和接受概率的變步長快速bp演算法應用到短期負荷預測，模擬結果表明該方法有效的改善了bp演算法收斂速度慢以及容易陷入局部最小點的缺點，從而提高了神經網路用於負荷預測的效率和精度。
  20. The signal ' s energy is made unitary by whiten before detection in order to simplify the expression of kurtosis. after that we also make use of the advantage of subspace separation to reduce the rank of the signal. thirdly, in order to suppress the effect of time various channel, the adaptive signal processing techniques are studied and an improved adaptive method based on lms ( least mean square ) is proposed

    為了能更好的跟蹤通道的變化，論文還研究了自適應信號處理的方法，並針對最小均方誤差的方法進行了改進，改進后的方法在收斂速度比傳統的最小均方誤差方法有很大改進，並且和傳統方法相比它還有收斂速度對收斂步長不敏感的優點。
分享友人
分享到 Line

分享到臉書