收上速度 的英文怎麼說

中文拼音 [shōushàngsùdù]
收上速度 英文
speed of retraction
  • 收 : Ⅰ動詞1 （把攤開的或分散的事物聚集、合攏） put away; take in 2 （收取） collect 3 （收割） harvest...
  • 上 : 上名詞[語言學] （指上聲） falling-rising tone
  • 速 : Ⅰ形容詞（迅速; 快） fast; rapid; quick; speedy Ⅱ名詞1 （速度） speed; velocity 2 （姓氏） a surna...
  • 度 : 度動詞[書面語] （推測; 估計） surmise; estimate
  • 速度 : 1. [物理學] velocity; speed; blast; bat 2. [音樂] tempo3. （快慢的程度） speed; rate; pace; tempo
  1. 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帶寬動態分配的過程。
  2. Film wind - up with easy removable bobbins. variable speed drive with clutch for windup

    薄膜收卷在易於卸除的卷軸上，收卷速度由帶有離合器的速度可調電機控制。
  3. Instruction detection technology is core in instruction detection system, it include abnormity instruction and abused instruction detection, on the basis of traditional network security model, ppdr model, instruction detection principle and instruction technology analysis, the author has brought forward instruction detection method based genetic neural networks, adopted genetic algometry and bp neural networks union method, and applied in instruction detection system, solve traditional bp algometry lie in absence about constringency rate slowly and immersion minim value

    入侵檢測分析技術是入侵檢測系統的核心，主要分為異常入侵檢測和誤用入侵檢測。作者在對傳統網路安全模型、 ppdr模型、入侵檢測原理以及常用入侵檢測技術進行比較分析的基礎上，提出了一個基於遺傳神經網路的入侵檢測方法，採用遺傳演算法和bp神經網路相結合的方法?遺傳神經網路應用於入侵檢測系統中，解決了傳統的bp演算法的收斂速度慢、易陷入局部最小點的問題。
  4. 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的總傳導率之比。
  5. Using cross - validation to select h as hn *. under proper conditions, this paper gives the bounds of hn *, and the convergence rate and the weak consistency of g ( t )

    ） ，在一定的正則性條件下，給出了（ ? ）的上下界估計和g （ t ）的估計的收斂速度。
  6. Compared with the classical bp algorithm, robust adaptive bp algorithm possesses some advantages as following : ( 1 ) increasing the accuracy of the network training by means of using both the relative and absolute residual to adjust the weight values ; ( 2 ) improve the robustness and the network convergence rate through combining with the robust statistic technique by way of judging the values of the samples " relative residual to establish the energy function so that can suppress the effect on network training because of the samples with high noise disturbances ; ( 3 ) prevent entrapping into the local minima area and obtain the global optimal result owing to setting the learning rate to be the function of the errors and the error gradients when network is trained. the learning rate of the weights update change with the error values of the network adaptively so that can easily get rid of the disadvantage of the classical bp algorithm that is liable to entrap into the local minima areas

    與基本bp演算法相比，本文提出的魯棒自適應bp演算法具有以下優點： （ 1 ）與魯棒統計技術相結合，通過訓練樣本相對偏差的大小，確定不同訓練樣本對能量函數的貢獻，來抑制含高噪聲干擾樣本對網路訓練的不良影響，從而增強訓練的魯棒性，提高網路訓練的收斂速度； （ 2 ）採用相對偏差和絕對偏差兩種偏差形式對權值進行調整，提高了網路的訓練精度； （ 3 ）在採用梯度下降演算法對權值進行調整的基礎上，通過將學習速率設為訓練誤差及誤差梯度的特殊函數，使學習速率依賴于網路訓練時誤差瞬時的變化而自適應的改變，從而可以克服基本bp演算法容易陷入局部極小區域的弊端，使訓練過程能夠很快的「跳出」局部極小區域而達到全局最優。
  7. Finally, in the third section, by constructing some functional which similar to the conservation law of evolution equation and the technical estimates, we prove that in the inviscid limit the solution of generalized derivative ginzburg - landau equation ( ggl equation ) converges to the solution of derivative nonlinear schrodinger equation correspondently in one - dimension ; the existence of global smooth solution for a class of generalized derivative ginzburg - landau equation are proved in two - dimension, in some special case, we prove that the solution of ggl equation converges to the weak solution of derivative nonlinear schrodinger equation ; in general case, by using some integral identities of solution for generalized ginzburg - landau equations with inhomogeneous boundary condition and the estimates for the l ~ ( 2 ) norm on boundary of normal derivative and h ~ ( 1 ) ' norm of solution, we prove the existence of global weak solution of the inhomogeneous boundary value problem for generalized ginzburg - landau equations

    第三部分：在一維情形，我們考慮了一類帶導數項的ginzburg ? landau方程，通過構造一些類似於發展方程守恆律的泛函及巧妙的積分估計，證明了當粘性系數趨于零時， ginzburg ? landau方程的解逼近相應的帶導數項的schr （ ? ） dinger方程的解，並給出了最優收斂速度估計；在二維情形，我們證明了一類帶導數項的廣義ginzburg ? landau方程整體光滑解的存在性，以及在某種特殊情形下， gl方程的解趨近於相應的帶導數項的schr （ ? ） dinger方程的弱解；在一般情形下，我們討論了一類ginzburg ? landau方程的非齊次邊值問題，通過幾個積分恆等式，同時估計解的h ~ 1模及法向導數在邊界上的模，證明了整體弱解的存在性。
  8. Abstract : the design problem of reduced - order state observer for a class of multi - input multi - output ( mimo ) nonlinear time - varying systems is studied in this paper. a new design method of nonlinear reduced - order state observer is proposed, and the exponential convergence is proved for the proposed state observer. the observer has the characteristics of that the speed of convergence is adjustable. finally, an example is given to show that this approach is effective

    文摘:研究一類多輸入多輸出（ mimo ）非線性時變系統的降維狀態觀測器設計問題.提出一種非線性降維狀態觀測器設計方案，並從理論上證明了狀態觀測誤差的指數收斂性.其中設計的降維狀態觀測器具有收斂速度可調的特性.最後給出了數值算例，模擬結果表明了本文方法的有效性
  9. Finally, take example for a non - linear function, method mentioned in this paper is used to design wavelet neural network to approximate this function. the computer simulations confirm the method that is brought out in this paper is useful, and prove that wavelet neural network has not only fast convergence and better precision of approximation, but also good capability of forecasting and escaping error

    最後，對於一個實際的非線性函數，用本文介紹的方法來設計小波神經網路來逼近函數，模擬結果表明該方法的有效性，並且表明小波神經網路在函數逼近上，網路的收斂速度快，逼近精度高的特點，並且網路具有很好的泛化能力和容錯性。
  10. This paper studies nonlinear dynamic problems of tall building structures, first, constitutes linear dynamic equation and elasto - plastic dynamic equation of structure by using qr method, later, solves the dynamic equation by using spline unconditional stable algorithm, last, programs corresponding computer programs with c program language, and calculates some example and a tall building in constructing the courses and the results prove that qr method is not only simple in calculating and fast in constringency rate, but also precise, that qr method is a effective and economic new method

    本文研究高層建築結構彈塑性動力問題，先利用qr法建立了結構線性動力方程及彈塑性動力方程，然後利用樣條無條件穩定演算法求解了動力方程，最後利用c語言編寫了相應的計算程序，計算了一些例題和分析了一個工程實例。 qr法在理論上及方法上不用有限元法及流動法則，避免了這些傳統方法在分析非線性問題時所帶來巨大困難的缺陷。計算結果表明，這種方法不僅計算簡便，而且精度高，收斂速度快，是一種經濟有效的新方法。
  11. In this paper, we give a kernel shape estimation of m ( x ) using variable bandwidth local linear refression approch, and discuss the asymptotic normality, the convergence rate of mean square and convergence rate with probability

    本文對上述模型，利用變窗寬局部線性回歸方法，給出了m （ x ）的核形估計，並討論了這一估計的漸近正態性、依概率收斂速度、和均方收斂速度。
  12. Among the adaptive beam - forming algorithms, the least mean square algorithm is widely used because it has a simple configuration and it is apt to come true and have nice convergence. on the other hand, it has a disadvantage that it converges slowly and there is a conflict between the fixed step and the convergence pace or the error in stabilization. so people have developed many improved least mean square algorithms which generally start from convergence, stabilization, misadjustment, and robustness and come to a formula about variational step in the end

    在自適應波束形成演算法中，最小均方（ lms ）演算法因結構簡單，易於實現，能穩定收斂而得到廣泛應用，但它也存在收斂速度受限的缺點：固定步長因子無法解決收斂速度和穩態誤差之間的矛盾。因此，人們提出了各種改進的最小均法演算法來解決這一問題。改進的最小均方演算法通常從如何改進收斂速度、穩態誤差、失調量和魯棒性等指標上出發，最後在新演算法最終表達式中的步長公式上變化。
  13. When analyzing network ' s capability, the new method and the method based on conventional bp algorithm are respectively applied to predicting reservoir water saturation in lin pan - shui oil field. the result shows that the former is more improved than the latter in the convergent speed and the error precision

    在進行性能分析時分別用新方法和基於傳統神經網路的方法建立臨盤水油田儲集層含水飽和度預測模型，前者比後者在收斂速度和誤差精度上有較大的提高。
  14. The coupling analysis program of surface flow and subsurface flow over porous media is developed based on the conversion principles of water on the surface under rainfall conditions. a new method to judge the saturation of the surface is proposed in this thesis, the convergence is speeded up and the cpu time is saved by using this method

    根據非飽和土上水的轉化機理，編制了降雨條件下地表水入滲和產流耦合的計算程序，並根據土-水特徵曲線，提出了判斷地表飽和的條件，根據此條件，加速了收斂速度，節省了cpu的時間。
  15. The characteristics of quantum computing and the mechanism of immune evolution are analyzed and discussed. inspired by the mechanism in which immune cell can gradually accomplish affinity maturation during the self - evolution process, a immune evolutionary algorithm based on quantum computing ( mqea ) is proposed. the algorithm can find out optimal solution by the mechanism in which antibody can be clone selected, memory cells can be produced, similar antibodies can be suppressed and immune cell can be expressed as quantum bit ( q - bit ). it not only can maintain quite nicely the population diversity than the classical evolutionary algorithm, but also can help to accelerate the convergence speed and converge to the global optimal solution rapidly. the convergence of the mqea is proved and its superiority is shown by some simulation experiments in this paper

    分析和探討了量子計算的特點及免疫進化機制，並結合免疫系統的動力學模型和免疫細胞在自我進化中的親和度成熟機理，提出了一種基於量子計算的免疫進化演算法.該演算法使用量子比特表達染色體，通過免疫克隆、記憶細胞產生和抗體相似性抑制等進化機制可最終找出最優解，它比傳統的量子進化演算法具有更好的種群多樣性、更快的收斂速度和全局尋優能力.在此不僅從理論上證明了該演算法的收斂，而且通過模擬實驗表明了該演算法的優越性
  16. Abstract : the characteristics of quantum computing and the mechanism of immune evolution are analyzed and discussed. inspired by the mechanism in which immune cell can gradually accomplish affinity maturation during the self - evolution process, a immune evolutionary algorithm based on quantum computing ( mqea ) is proposed. the algorithm can find out optimal solution by the mechanism in which antibody can be clone selected, memory cells can be produced, similar antibodies can be suppressed and immune cell can be expressed as quantum bit ( q - bit ). it not only can maintain quite nicely the population diversity than the classical evolutionary algorithm, but also can help to accelerate the convergence speed and converge to the global optimal solution rapidly. the convergence of the mqea is proved and its superiority is shown by some simulation experiments in this paper

    文摘:分析和探討了量子計算的特點及免疫進化機制，並結合免疫系統的動力學模型和免疫細胞在自我進化中的親和度成熟機理，提出了一種基於量子計算的免疫進化演算法.該演算法使用量子比特表達染色體，通過免疫克隆、記憶細胞產生和抗體相似性抑制等進化機制可最終找出最優解，它比傳統的量子進化演算法具有更好的種群多樣性、更快的收斂速度和全局尋優能力.在此不僅從理論上證明了該演算法的收斂，而且通過模擬實驗表明了該演算法的優越性
  17. Based on this division, with the method of iteration, the influencing factors and formulas for convergence speed are deduced and discussed

    在此基礎上，對于主動變形引起的被動變形，採用迭代分析的方法，得出了收斂速度的影響因素及其表達式，並進行了相關討論。
  18. The multistage constant modulus ( cm ) array is a cascade adaptive beamforming system that can recover several narrowband co - channel signals without training. the main idea of the smi - cma is to use smi to determine the initial weight for cma operation. the method can come up with the desire signal in despite of the interfering signal is stronger than the desire signal

    基於以上考慮，我們提出了基於smi - cma聯合自適應方法，該演算法可以分離多個同通道信源，由smi演算法決定cma演算法的初始權向量，在干擾信號較強時，仍有穩定的sinr輸出，具有較快的收斂速度。
  19. As a result, a de - noising algorithm with lift scheme that can work online has been presented. by using wavelet as a pre - filter, the convergence speed of kalman filter can be accelerated

    將小波技術應用於機抖激光陀螺系統的初始對準過程，一定程度上提高了卡爾曼濾波器的收斂速度。
  20. Based on x - filtered lms algorithm and - filtered lms algorithm adaptive inverse control, we use a new variable step size lms algorithm. adding little computation, variable step size lms algorithm can result in fast convergence speed and low residual error simultaneously. the adaptive feedback control can counteract the beginning error of the system

    在原來的x -濾波lms演算法自適應逆控制和-濾波lms演算法自適應逆控制方法的基礎上，引入了新的變步長lms演算法，在計算量增加不多的前提下，能同時獲得較快的收斂速度和較小的穩態誤差；引入自適應的反饋補償控制克服了被控系統的直流零頻漂移，使控制系統在初開始工作階段快速收斂；還引入自適應擾動消除器，它能最大限度的消除擾動。
分享友人
分享到 Line

分享到臉書