斂容 的英文怎麼說

中文拼音 [liǎnróng]
斂容 英文
[書面語] （收起笑容） assume a serious expression
  • 斂 : Ⅰ動詞1 （收起; 收住） hold back; keep back 2 （約束） restrain 3 （收集; 徵收） gather; collect; ...
  1. The experimental results indicate that it is easy to be realized, can save the calculating cost and improve the constringency speed

    試驗結果表明，用粒子群演算法來訓練樣本集具有容易實現、節省計算成本和提高收斂速度等優點。
  2. Annie's smile disappeared and she dropped a curtsey.

    安妮收斂了笑容，行了個屈膝禮。
  3. The presence even for a moment among a party of debauchees of a woman endued with every quality of modesty and not less severe than beautiful refrained the humorous sallies even of the most licentious but her departure was the signal for an outbreak of ribaldry

    一賢淑端莊容貌標致之淑女一時出現于蕩子群中，彼等淫蕩之徒便即刻收斂其輕佻猥褻。然而俟伊退出后，穢言穢語剎那間重新爆發。
  4. The freezed euphorbia thymifolia has qualities of endurability and softness. it has beautifying effects and are suitable to grow in humid and nutritious environments. it symbolized female glow and strength

    古有雲：千根草纖弱卻有耐性，適合濕潤及滋潤之環境，有收斂美容之效用，冰結千根草之氣質出眾，纖弱有耐力，象徵女性光輝，柔以刻剛。
  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. First, we consider an additive schwarz algorithm for the solution of ax 4 - f ( x ) 0, x when coefficient a is an m - matrix and f ' ( x ) 0. by applying the theory of weak regular splitting of matrices to the above considered algorithm, we obtain the weighted max - norrn bound for iterations. moreover, under the assumption that f ( x ) is concave, we establish monotone convergence of the considered algorithm

    本文內容如下：首先，應用加性schwarz演算法求解非線性互補問題，其中a是m陣，應用弱分解理論，我們獲得了在加權范數意義下誤差的幾何收斂速度，在f （ x ）是凹函數的假設下我們還獲得了此演算法的單調收斂性，同時我們給出此演算法的一種修改演算法，無需前面的假設，該演算法具有單調收斂性。
  7. This dissertation deals with the content - based image retrieval ( cbir ) theory and technique ; some new features and tools for more concisely and discriminatingly charactering the content of an image are proposed, such as region - based color histogram, grey - primitive co - occurrence matrix, ratio of centripetal moment, ratio of eccentric moment and ratio of inertial moment. a new modified genetic algorithm is also described in this dissertation, which can upgrade the performance of standard genetic algorithm ( sga ) while used in image segmentation

    本文以圖像數據庫檢索為主線，討論了基於視覺內容的圖像檢索方法，提出包括基於區域顏色直方圖、灰度?基元共生矩陣及向心矩比、偏心矩比、慣性矩比的特徵描述方式；對遺傳演算法存在的早熟、收斂到最優解慢等問題提出了解決方法，並將改進遺傳演算法應用到圖像分割中，編制了相應程序。
  8. 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演算法容易陷入局部極小區域的弊端，使訓練過程能夠很快的「跳出」局部極小區域而達到全局最優。
  9. Exhausted by emotion, my language was more subdued than it generally was when it developed that sad theme ; and mindful of helen s warnings against the indulgence of resentment, i infused into the narrative far less of gall and wormwood than ordinary

    我還記住了海倫的告誡，不一味沉溺於怨詞，敘述時所摻雜的刻薄與惱恨比往日少得多，而且態度收斂，內容簡明，聽來更加可信。
  10. Lennie lost his smile.

    倫尼笑容盡斂。
  11. Here the unfeeling toad broke into a snigger, and then pulled himself together and tried to look particularly solemn

    聽到這里，沒心肝的蟾蜍居然偷偷地噗嗤笑了出來，跟著又斂容正色，做出特別莊重嚴肅的樣子。
  12. Traditional static crosstalk identification methods identify crosstalk targets only using coupling capacitance and noise amplitude information, which lead to the pessimistic results and induce a long time to ic design convergence

    摘要傳統的靜態串擾噪聲識別演算法只驗證耦合電容和噪聲幅值信息，沒有考慮噪聲寬度對電路邏輯功能的影響，所以給出的結果過于保守，導致設計收斂的時間被延長。
  13. 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

    最後，對於一個實際的非線性函數，用本文介紹的方法來設計小波神經網路來逼近函數，模擬結果表明該方法的有效性，並且表明小波神經網路在函數逼近上，網路的收斂速度快，逼近精度高的特點，並且網路具有很好的泛化能力和容錯性。
  14. 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演算法收斂速度慢以及容易陷入局部最小點的缺點，從而提高了神經網路用於負荷預測的效率和精度。
  15. Based on the theory of cooperation between foundation and structure, paper uses ansys finite element software forming three - dimensional finite element model of. paper also anglicized element type choose, material attribute choose, loading determination, terminal condition determination, anyslys type determination and solution choose, etc. correcting buildings with the method of drawing out soil was analyzed through ninth aspects listed below

    本文借鑒結構設計中的基礎與上部結構共同作用理念，運用ansys有限元分析軟體，在探討了單元類別的選擇、材料屬性選擇、載荷、邊界條件和分析類別的確定、求解器、求解方法與收斂準則的選擇等與有限元建模相關內容的基礎上，建立了上部結構和土體共同作用的三維有限元模型。
  16. Regarding social behaviors, it is responsive, inter - protocol fair ( tcp - compatible ), intra - protocol fairness convergent, and efficiency convergent

    在集體行為方面，它是易響應的，協議間公平（ tcp -兼容）的，協議內部公平收斂及有效收斂的。
  17. Finally, the paper clarified the concept of hard ecotourists, frequent ecotourists and experienced ecotourists ever used in others s research

    分類結果經預測有效性內容有效性理論有效性和收斂有效性檢驗，效果較好。
  18. Iterative tfidf algorithm belongs to hill - climbing algorithm, it has the common problem of converging to local optimal value and sensitive to initial point

    迭代tfidf演算法屬于爬山演算法，初始值的選取對精度影響較大，演算法容易收斂到局部最優值。
  19. The reason why we integrate them is that k - means algorithm is a mountain climbing method, which is easy convergent to local extremum, and sensitive to the original condition, but its convergent speed is relatively fast, and that genetic algorithm is a random searching method, which can find the whole extremum in a rather big probability, and non - sensitive to the original condition, but its convergent speed relatively slow

    之所以將：二者結合在一起，是回為k一均值演算法是一種爬山法，容易收斂到岡部極小值，對初始條件較敏感，但收斂速度較快，而遺傳演算法是卞dl隨機搜索演算法，能夠以較大概率找到全局最憂解，且對們始條件個敏感，但收斂速度較慢。
  20. This paper consists of two parts : in the first part, we will discuss the prob - lem of the pth - mean, complete consistency for the estimators of a nonparamet - ric and linear model with l ~ p - mixingale errors ; in the second part, we will dis - cuss the problem of the rth - mean 、 complete consistency for the estimators of themodels above with weak stationary linear process errors and the uniformly mean consistency. to the nonparametric model y _ ni = g ( x _ ni ) + _ ni, 1 i n, let g _ n ( x ) = w _ ni ( x, w _ n1, … ? xnn ) y _ ni estimate the unknown function g ( x ). to the linear model y _ i - x _ i1 1 + … ? + x _ iq ? _ q, we use lse _ nj to estimate the unknown parametric _ j

    本篇論文主要是由兩大部分內容構成：一是關于誤差是l ~ p ?混合序列的線性回歸模型參數的最小二乘估計與非參數回歸模型未知函數的權函數估計的p ~ -階平均相合性和完全收斂性問題；另一部分是關于誤差是弱平穩線性過程的線性模型參數的最小二乘估計與非參數回歸模型未知函數的權函數估計的r ?階平均相合性和完全收斂性以及權函數估計的一致平均相合性問題。
分享友人
分享到 Line

分享到臉書