極小解 的英文怎麼說

中文拼音 [jíxiǎojiě]
極小解 英文
minimal solution
  • 極 : i 名詞1 （頂點; 盡頭） the utmost point; extreme 2 （地球的南北兩端; 磁體的兩端; 電源或電器上電流...
  • 小 : Ⅰ形容詞1 （體積、面積、數量、強度等不大） small; little; petty; minor 2 （年紀小的; 年幼的） youn...
  • 解 : 解動詞（解送） send under guard
  1. Maximum and minimum bounds may be placed on any unknown thickness or index of refraction

    全局解決方案/最優化方法用於獲得最好的解決方案，因此避免局部最小風險，極小化測量誤差
  2. The minuscule pores keep the thinly spread catalyst in place and create the large surface area needed to break down the fuel effectively

    這些極小的小孔使分佈稀薄的催化劑保持在原位上，並且能留出有效分解這種燃料所需的盡量大的表面積。
  3. The parameter control methods are very similar to penalty function methods, both of them are to solve constrained optimization problems by solving a series of sub - unconstrained optimization problems. but parameter control methods are different from penalty function methods. firstly, the penalty coefficient of penalty function methods are preassigned, while the parameters of parameter control methodsare generated automatically according to some rule prescribed

    參數控制演算法雖然與罰函數法非常類似，都是通過求解一系列無約束極小化問題來逼近約束優化問題的最優解，但罰函數法中的罰因子是預先設定的，而參數控制演算法中的參數是自動產生的。
  4. 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帶寬動態分配的過程。
  5. This paper has proposed a method controlling iteration number and stability of solution according to thought of integral convergence algorithm minimizing nonlinear equations

    本文利用求非線性方程組極小化全局收斂法的思路，提出了控制迭代收斂次數、控制反演解穩定的方法。
  6. For a maximal subgroup m of a finite group g the normal index of m is the order of a chief factor h / k where h is minimal in the set of supplements of m in g. in this paper we can obtain some results about solvability and supersolvability by using the normal indexes of maximal subgroups of finite groups

    有限群g的極大子群m的正規指數是指g的主因子h k的階，其中h為m在g中的極小正規補。本文利用正規指數的概念，獲得有限群可解，超可解的若干結果。
  7. Similarly, cokernels of the flat envelope of a finitely gener - ated coreduced gorenstein flat module is also a finitely generated coreduced gorenstein flat module, moreover the flat envelope of the former is the flat cover of the latter. and then we prove that over these rings, in quotient categories mod every finitely generated module has a finitely generated coreduced gorenstein flat preenvelope, and its two such preenvelopes are isomorphic

    接著證明了這類環上每個模的極小平坦分解式的合沖模從第n個起都是有限生成的上約化的gorenstein平坦模，最後證明了在這類環上，商范疇dlaa中每個有限生y成模都有有限生成的上約化的gorenstein平坦包，並且這種蓋在同構意義下是唯一的
  8. In order to minimize total ordering and holding costs, a simple solution model using mixed integer programming techniques is presented to determine the optimal solution of the number of orders and timing of replenishment points, and quantity to be ordered at each replenishment

    此外，為達到極小化總訂購成本及總持有成本，本模型?用混合整?規劃技巧提供一個簡單求解方法，可同時求得最佳訂購次? 、訂購點及每次訂購? ? 。
  9. Even if each episode changed the inborn predilections of the hominids by only a small amount, the hundreds of repetitions of this scenario may explain some of the differences between human abilities and those of our closest relatives among the great apes

    即使每一次事件對人猿類的天生傾向，只造成極小的改變，但事件重復數百次后，就足以解釋人類和關系最近的大型猿類之間的能力差異。
  10. This paper mainly studies the backward perturbation methods in solving the linear systems, and total minimal backward perturbation ( tminback ) method for symmetric linear systems is presented

    本文研究了求解線性方程組的向後擾動方法。對求解對稱線性方程組的lanczos方法做出了向後擾動分析，給出了求解對稱線性方程組的總體極小向後擾動（ tminback ）方法。
  11. The flexible decision method of bargaining for the kind of cooperative game is presented. the solution by the method is egalitarian and efficient. under some condition, it is the lexicographic maximin solution

    柔性決策方法，根據這種方法求出的解具有公平性和有效性，符合管理科學的基本原則；在一定的條件下，這種解也是字典序極大極小解
  12. The special phenomenon, according to scientists, is a solar halo, or " mock sun ", which results from the refraction of ice crystal particles contained in clouds

    對這種奇怪的現象，科學家解釋說，這是由於雲層中極小的小水珠的反射而引起的，那個虛幻的太陽是日暈。
  13. 3 g 一 g g abasi 叱 加 ical pp 訕 howthe qquasi ghgsical 毗 quasi sociological methodmo 止 secondlx we uthuther nalsze the nhrsical model on which he quasi pnsical and quasi sociological methods for solving s 肛 problembased considering a physical hypothesis on this model ， we construct a counterexaxnple to showthatthe hypothesis is not eee ? howeve 二 itdoes notdamage the goodpractical effectof applpinp this phpsical model to solve s 盯 problem considering he existence of alsorithlnic region ， which reflects that the quasi sociological method is very necessw for ass 吶 ng the high efficient of theent whole algori 燦 m therefore deepens our comprehension on the quasi physical and quasi sociological methods mird1x we wpl … 叫 nas 恤 ysi 陰 1md q 阻 si 500i 吶 i0alm 毗 cd 引 0 咖 we mathematical problem ofcom 恤 non oforthogonal tmles m successfully es 恤 fish a physicalopttrizatbo model for sotring saturated o 汕 ogonal tables ， whwh ws provedto be correctintheo0 we thi 冰 。 w goodpersonated s 咖 egies forjumping out of the t 呷 oflocal minimum using quasi sociological method based onthe physical model thus wegetthe wholequasi physicaland quasi sociological algorim forthe problem ofconswction ofs 咖 med orthogonal tables he experimental results showthatthephysical model ishighly efficientthanthe conflmng nlllllber mode ！ based on me pure m 她 ematical 訕 kgfound 他 sucoes 訕 11y ? ? rk 咖 m 枷 ons 訕 卿 nal 郵 ie with 3 leve13 using th 叫 u 1 physical and quasi sociological algori 恤 we got some o 汕 ogonal t 勸 les ofl 。 ， （ 3 ’ ‘ ） which are not isomorphic moreove 乙 some ofour results are also not isomorphic to oe results pearedb 山 e open rekrences we got lip to now lastlx for 讓 卜 ancie 口 戊 扯 d importantproblemsofconstfutfuction oflatin square and orthogonal latin squares （ most of

    應用此演算法，我們成功地計算出難的三水平正交表本課題為國家重點基礎研究發展「九七三」規劃，國家「八六三」高技術發展計劃，高等學校博士學位點專項科研基金及中國科學院軟體研究所計算機科學開放研究實驗室課題基金資助項目1g一gs第四，應用擬物擬人方法嘗試求解古老而重要的拉丁方、正交拉丁方（它們事實上是正交表）問題。我們結合這些問題的特性，建立了新的物理模型，從理論上證明了這些物理模型的正確性，並設計出擬人化的「跳出局部極小值陷餅」的策略，得到了求解拉丁方、正交拉丁方的擬物擬人演算法。實驗表明， 」對某些問題演算法有好的效果。
  14. The paper is built as follows. in chap 1, we introduce the applied context of the minimal norm least square solutions for vandermonde matrix first. the fast algorithm of the minimal norm least square solutions for vandermonde matrix with mxn order and its transpose are presented later through constructing vtv ( or wt ) and seeking their inverses

    本文的結構如下：第一章先給出了vandermonde方程組的極小范數最小二乘解的一些實際應用背景，然後通過構造方陣v ~ tv （或vv ~ t ）並求其逆矩陣導出了求以m n階vandermonde矩陣及其轉置，以及m n階跳行vandermonde矩陣為系數陣的線性方程組極小范數最小二乘解的快速演算法。
  15. Simple genetic algorithm gets local minimization too easily and converges slowly. to solve these problems, adaptive crossover rate that has reverse hyperbolic rel ation with the numbers of iteration is designed, and adaptive mutation rate that has reverse proportion to the distances of parents and reverse exponential relat ion to the numbers of iteration is put forward. the practical simulation results show that the adaptive ga has greater convergence speed and larger probability o f getting the best solution

    簡單遺傳演算法存在著收斂速度慢、易陷入局部極小等缺陷.針對這些缺陷，本文設計出隨相對遺傳代數呈雙曲線下降的自適應交換率，並提出與父串間的相對歐氏距離成反比、隨相對遺傳代數指數下降的自適應變異率.實例驗證表明，具有自適應交換率和變異率的遺傳演算法在收斂速度和獲得全局最優解的概率兩個方面都有很大的提高
  16. In this paper, we discusse the stability of perturtation of m - p inverses of closed operator function and then the stability of least square solution of elliptic partial differential equations of second order with unbounded coefficients

    本文討論了閉運算元的m - p廣義逆的擾動，並由此討論首項系數本質無界的二階散度型橢圓型微分方程的最小范數極小二乘解的穩定性
  17. When the domain / is finite, j is infinite, sufficient and necessary conditions for existences of an attainable solution and a minimal solution are obtained

    當論域i為有限集合， j為無限集合時，給出了存在可達解以及存在極小解的充要條件。
  18. Solutions in detail was left out in many references. the time that mutual information first go to minimum is chosen as the time delay by compiling visual basic programs. which is a new probe

    此外，針對本文所用的時間序列屬于混沌時間序列，選用互信息第一次極小的時間為時間延遲，合理地解決了時間延遲的選取這一關鍵性的問題。
  19. Actually, this is to resolve an over - determined nonlinear system including six output values and eight input values. so newton - gauss iterative algorithms is used, set up the target function in the sense of the least squares. it is discussed whether the minimal solution to the function exist and is single one while the astringency of newton - gauss method is analyzed

    對于冗餘驅動振動臺，其位姿正解是求解具有八個輸入、六個輸出的超定非線性方程組，因此本文採用了最小二乘法中的牛頓?高斯迭代法，建立最小二乘目標函數，對目標函數極小解的存在性、唯一性以及牛頓?高斯迭代法的收斂性進行了理論證明和分析，將求出的最小值作為位姿正解的最優解。
  20. When / is infinite and 6 is a compact element and with an irredundant finite join - decomposition, it is showed that a sufficient and necessary condition that the solution set is nonempty. it is also proved that there exists a minimal solution if the solution set of the equation sup t ( ai, xi ) = b is nonempty

    當論域為無限集， b為緊元且有不可約有限並分解時，給出了解集非空的充要條件，證明了如果方程sup _ （ i i ） （ a _ i ， x _ i ） = b有解，則一定存在極小解。
分享友人
分享到 Line

分享到臉書