極大極小解 的英文怎麼說

中文拼音 [jídàjíxiǎojiě]
極大極小解 英文
minimax solution
  • 極 : i 名詞1 （頂點; 盡頭） the utmost point; extreme 2 （地球的南北兩端; 磁體的兩端; 電源或電器上電流...
  • 小 : Ⅰ形容詞1 （體積、面積、數量、強度等不大） small; little; petty; minor 2 （年紀小的; 年幼的） youn...
  • 解 : 解動詞（解送） send under guard
  1. The first one : fitting together ultimate values of every dimensions in one dimension - chain one by one, educing many equations by itself, calculating results, and comparing these results of close dimension to find maximal and minimal values. the second one : projecting all dimensions on two preestablished axis, then providing the solutions to analyze whether every projected dimensions is increscent or decreasing, and synthesize the effect of every projected dimensions to close dimension, educing many equations by itself, at last calculating the result of close dimension. the third one : according to monte carlo analysis, getting every dimensions " values from every dimensions " tolerances at random time after time, simulating the actual circumstances of mass production using these dimensions, and calculating reasonable results of close dimension economically

    鑒于這類系統在各大中小型企業的廣泛應用與相對滯后的研究水平，本文提出了三種新的能切實地解決目前尺寸鏈計算機輔助分析解算中存在的各種難題的設計方案，第一種方案將尺寸鏈中各組成環能取的極值組合起來，自動列方程組，求解每個組合情況下的封閉環尺寸，最後比較這些結果，得出封閉環的最大最小值；第二種方案將尺寸鏈各組成環向預先設定好的兩個方向投影，之後再分析各尺寸環投影分量的增減性，並且提供了組成環兩個方向上的投影分量增減性不一的復雜情況下的解決辦法，綜合組成環各投影分量的增減性，然後自動列出方程組，最後根據各組成環的投影分量以及所列的方程組來確定尺寸鏈封閉環的尺寸；第三種方案以蒙特卡洛法為原理，在尺寸鏈各組成環的取值范圍內使用計算機產生大量隨機數，模擬實際大批量生產中的零件尺寸分佈情況，以更經濟更合理的方式分析、計算封閉環尺寸。
  2. The project - learning curriculum must lay different particular emphasis on different learning - stage. it is because that the students of different ages have great difference in intellectual structure, body and mind character, lifer exprience., knowledge - level.,

    由於小學、初中、高中不同年齡段的學生在知識結構、身心特點、生活閱歷、認識水平和理解能力等方面存在著極大的差異，這就決定了研究性學習在不同的學段應有不同的側重。
  3. The minuscule pores keep the thinly spread catalyst in place and create the large surface area needed to break down the fuel effectively

    這些極小的小孔使分佈稀薄的催化劑保持在原位上，並且能留出有效分解這種燃料所需的盡量大的表面積。
  4. The most outstanding function of this wheelchair is its height which can be regulated with user ' s requirements. this function helps expand the user ' s available space, supplement the user ' s body defect and reduce the caregiver ' s burden. it get more improved than previous products. besides, the wheelchair has designed both manual and eletric mode. on one hand, it can save user ' s energy and power, on the other hand it won ' t leave users hopeless in case of powering off and relieve the user ' s worriness. in addition, the bigger basket on the tail part of the wheelchair provides the great convenience for user ' s carrying goods. multiangular back and height - regulated pedal add comfortableness to users. the minidesk with the wheelchair is very convenient for users to read, write and do other things

    本設計的多功能輪椅最突出的一個功能就是座位的高度可以根據使用者的需求隨意進行調節，這樣就可以大大擴展使用者的操作空間，補充了使用者在身體上的缺陷，也可以減輕照顧人員的工作負擔，比起以前的產品有了較明顯的改進；其他功能還有輪椅的手動電動兩種驅動方式，這樣可以解決老年人和殘疾人在體力上存在的問題，同時在外出時遇上沒電的情況也不至於顯得無能無力，消除了使使用者在長途奔波時的顧慮；此外位於輪椅尾部的超大儲物筐，給使用者攜帶物品帶來了極大的方便，靠背的多角度調節，腳踏板的高度調節大大增加了使用者的使用舒適度，輪椅上小桌的設計給使用者讀書，寫字，進行其他活動帶來了極大的方便。
  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. Fast algorithms of both discrete and orthonormal wavelet and wavelet packet coefficient are diagrammatized to be introduced. daubechies wavelet is applied to help to discuss the application and test on signal filtering and noise reduction with the principle and threshold implementation ; the basic principle to pickup the fault characteristics is introduced mainly about the relations between the maximum module and signal saltation point and how to characterize the saltation point with lipschitz exponent

    展示了離散正交小波變換的mallat快速演算法和小波包系數分解的快速演算法；重點應用daubeches小波探討了小波變換在信號濾波去噪中的應用和實驗，闡述了其基本原理和通過閾值化處理實現濾波的具體方法；探討了用小波變換進行故障特徵提取的原理，說明了小波變換模極大值和信號突變點之間的關系以及怎樣用李氏指數來表徵突變點的性質。
  7. 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中的極小正規補。本文利用正規指數的概念，獲得有限群可解，超可解的若干結果。
  8. 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

    即使每一次事件對人猿類的天生傾向，只造成極小的改變，但事件重復數百次后，就足以解釋人類和關系最近的大型猿類之間的能力差異。
  9. 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

    柔性決策方法，根據這種方法求出的解具有公平性和有效性，符合管理科學的基本原則；在一定的條件下，這種解也是字典序極大極小解
  10. Also, the author ’ s design strategy and creativity has been given in this paper. specifically, it includes : based on the feasibility analysis of the fit selection of control parameters in the aeration process, the aeration process of wastewater treatment of the joint - constructional complete - mixed activated sludge process has been aimed at in this paper. then, the state equations of the aeration process have been proposed in this paper, which is on the base of dissolved oxygen concentration ( do ) and discharge quantity of sludge ( qw ) as control variables, the concentration of bod and sludge as state variables. based on the present study on optimization control of wastewater treatment, the multivariable optimal control model with restriction factor has been presented in the paper with introducing modern control theory and system analysis into the field of activated sludge wastewater treatment,

    具體包括:以完全混合、表面曝氣合建式活性污泥工藝的污水處理曝氣過程為研究對象，在闡述了曝氣過程式控制制參數選取可行性的基礎上，建立了以溶解氧濃度do和活性污泥排放量qw為控制變量，以曝氣池中有機物濃度s和微生物濃度x為狀態變量的活性污泥曝氣過程的基本狀態方程;運用現代控制理論的觀點和污水處理理論，在現有關于污水處理最優控制問題研究的基礎上，建立了有約束條件多變量能耗最小數學模型，該數學模型是以有機物排放總量和狀態變量的末值條件作為約束條件，曝氣過程的能耗最小作為目標泛函;採用增廣拉格朗日乘子法對最優控制問題進行轉化，並對應用極大值原理求解能耗最小這一最優控制問題進行了詳細的解析;引入約束運算元，應用具有控制約束的共軛梯度演算法對能耗最小這一最優控制問題進行求解，並進行模擬實驗驗證。
  11. 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

    簡單遺傳演算法存在著收斂速度慢、易陷入局部極小等缺陷.針對這些缺陷，本文設計出隨相對遺傳代數呈雙曲線下降的自適應交換率，並提出與父串間的相對歐氏距離成反比、隨相對遺傳代數指數下降的自適應變異率.實例驗證表明，具有自適應交換率和變異率的遺傳演算法在收斂速度和獲得全局最優解的概率兩個方面都有很大的提高
  12. The innovative idea of the method is in that the analytic ability for high - frequency signals of wavelet packet is used to enhance information capacity. because the human vision is insensitive to high - frequency signals, one can make information of watermark mass and hightensile in the high - frequency domain. in this way, not only the quality of original image can be reserved, but also the robustness of the watermark improved

    其創新點就在於利用小波包對高頻信號進一步分解的能力，極大地拓展了信息嵌入的空間，由於人眼視覺對高頻信號的不敏感性，可以以較大的強度在高頻部分嵌入水印，這樣不但可以保證原圖質量，而且可以進?步提高水印的頑健性。
  13. The best approximations algorithm is just the method which can solve the mini - max solution of the least value of frequency deviation. because of the reason above, in this paper the best approximations algorithm is introduced into calculating the parameters of atcxo compensation network for the first time

    最佳一致逼近演算法正是能夠求解出使頻率偏差的絕對值最小的極小極大解的一種方法，為此將最佳一致逼近演算法首次應用於模擬溫補晶振補償網路參數的計算中。
  14. In chapter two, we prove the existence and multiplicity results of some nonlinear biharmonic equations by using lower scmicontinuity method and minimax method

    在第二章中，通過下半連續方法和極大極小方法，我們證明了一類非線性雙調和方程解的存在性和多解性的結論
  15. At first, we introduce a class of generalized s - r - kkm type mapping in g - convex space, and establish generalized s - r - kkm type nonempty intersection theorem under the noncompact setting of g - convex space. as for application, some new minimax inequalities, saddle point theorem and existence theorem of maximal elements are proved in g - convex spaces ; second, by using the generalized r - kkm mapping and generalized r - kkm theorems in [ 13 ], some new existence theorem of maximal elements, existence theorem of equilibrium point for the abstract generalized vector equilibrium problem and existence theorem of solutions for equilibrium problem with lower and upper bounds are obtained in topological spaces

    首先，我們在g -凸空間內引入了廣義s - r - kkm型映像，並在非緊設置下建立了一類新的廣義s - r - kkm型非空交定理，作為應用，證明了g -凸空間內一些新的極大極小不等式、鞍點定理和極大元存在定理；其次，利用文[ 13 ]中引入的廣義r - kkm映像和廣義r - kkm定理，在拓撲空間上得到了一些新的極大元存在定理、抽象廣義矢量平衡問題平衡點的存在定理和有上下界的平衡問題解的存在性定理。
  16. After analyzing the existing ambiguity resolution methods the dissertation investigates the baseline rotation method based on the antenna - swap idea, and develops the fixed axis rotation maximum - minimum method ? farmm and the equivalent rotation maximum - minimum method ? ermm applicable for static basement and moving vehicle respectively. the former lowers the demands on rotation device while the latter improves the flexibility of antennae installation. meanwhile the dissertation also brings forward an ambiguity function search method which needs only one single epoch data with the outer aided information, and investigates the accuracy requirements for the assistant pointing information

    其次，通過與gps等多星系統定向關鍵技術的對比分析，指出雙星定向模糊度確定的難度;在分析現有模糊度求解方法的基礎之上，研究了基於交換天線思想的轉動基線模糊度確定方法，並提出了適合於靜基座的定軸轉動極大/極小值farmm法，以及適合於地面運動載體的等效轉動極大/極小值ermm法，前者降低了對轉動機構的要求，後者則提高了天線安裝的靈活性;同時，提出了一種藉助外部輔助信息的模糊度函數搜索法實現單歷元雙星定向，並分析了對外部輔助單軸姿態信息的精度要求。
  17. Brown provided the lakers with a 100 - 99 victory over the memphis grizzlies and a much - needed sigh of relief after andrew bynum was injured

    布朗用自己應有的表現給湖人帶來了一場勝利（ 100 ： 99 ） ，極大地緩解了小拜受傷帶給隊員們的心理打擊。
  18. In this paper, based on wu ' s method and the estimation for maximal and minimal polynomials, we extend the real root isolation algorithm from univariant integral polynomial to multivariant integral polynomial systems. it gives the solutions of polynomial systems in the form of multi - dimensional boxes

    我們利用吳方法和極大，極小多項式估計，推廣多項式實根分離演算法（ realrootisolation ）到多項式組的情形（ mrealrootisolation ） ，該演算法以空間中的矩形區域形式給出了多項式組的實解
  19. Chapter 3 is devoted to the study of the convergence theory of a dual algorithm for unconstrained minimax problems. a dual algorithm for solving unconstrained minimax problems, based on the penalty function of bertsekas ( 1982 ), is presented. we prove that there exits a threshold of the penalty parameter satisfying that the sequences generated by the dual algorithm converge locally to the kuhn - tuker point of the unconstrained minimax problems when the penalty parameter is less than the threshold

    第3章給出無約束極大極小問題的一個對偶演算法的收斂理論，給出一個基於bertsekas （ 1982 ）罰函數的求解無約束極大極小問題的對偶演算法，證明罰參數存在一個閥值，當罰參數小於這一閥值時，該對偶演算法產生的序列局部收斂到問題的kuhn - tuker點，並建立了參數解的誤差估計式，同樣估計了罰函數的hesse陣的條件數，它也依賴于罰參數。
  20. Solving nonlinear minimax problems by gray coding genetic algorithm

    解非線性極大極小問題的格雷碼加速遺傳演算法
分享友人
分享到 Line

分享到臉書