極大極小論 的英文怎麼說

中文拼音 [jídàjíxiǎolún]
極大極小論 英文
theory of maxima and minima
  • 極 : i 名詞1 （頂點; 盡頭） the utmost point; extreme 2 （地球的南北兩端; 磁體的兩端; 電源或電器上電流...
  • 小 : Ⅰ形容詞1 （體積、面積、數量、強度等不大） small; little; petty; minor 2 （年紀小的; 年幼的） youn...
  • 論 : 論名詞（記錄孔子及其門徒的言行的「論語」） the analects of confucius
  1. There are three parts in the article. the beginning is the summary about especial credit risk in city commercial bank management. at first, via the data explains that the loan object of the city commercial bank mainly concentrates small enterprises, then discusses why the city commercial bank concentrates this lay, then further via the small enterprise livability, compensative resource, the finance

    首先，通過調查所得的數據說明了城市商業銀行的貸款對象主要集中於小企業這個層次，然後詳細論述了城市商業銀行為什麼會將貸款對象主要集中在這個層次，再進一步通過對小企業存活率、償債來源、財務管理狀況、管理者素質等方面的分析，說明了為什麼將貸款對象集中於小企業會極大的增大城市商業銀行的貸款信用風險。
  2. 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帶寬動態分配的過程。
  3. We think that the main contributions of the book is in two aspects : one is the revolution of some concepts such as utility theory, aximatization of game, extended game ; the other is the breaking through in zero - sum two - person games centered on minimax and corporation game centered on characteristic function. this was, in fact, the development and extension of von neumann ' s classic game paper of 1928. our research shows that these contributions were a pure new theoretical creation, rather than an

    認為《博弈論與經濟行為》的主要貢獻有二個方面：一個方面是在效用理論、博弈的公理化、博弈的擴展形式等等概念上的創新，另一方面是在以極小極大值定理為中心的三人零和博弈理論和以特徵函數為中心的合作博弈理論上的創新，這些實際上主要是馮?諾伊曼對其1928年的經典博弈論文章的理論框架的發展和延伸
  4. 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為狀態變量的活性污泥曝氣過程的基本狀態方程;運用現代控制理論的觀點和污水處理理論，在現有關于污水處理最優控制問題研究的基礎上，建立了有約束條件多變量能耗最小數學模型，該數學模型是以有機物排放總量和狀態變量的末值條件作為約束條件，曝氣過程的能耗最小作為目標泛函;採用增廣拉格朗日乘子法對最優控制問題進行轉化，並對應用極大值原理求解能耗最小這一最優控制問題進行了詳細的解析;引入約束運算元，應用具有控制約束的共軛梯度演算法對能耗最小這一最優控制問題進行求解，並進行模擬實驗驗證。
  5. As a philosopher he knew that at the termination of any allotted life only an infinitesimal part of any person s desires has been realised

    作為一個哲學家，他曉得不論何人，在大限臨頭的時候，自己的慾望只實現了極其微小的一部分。
  6. In this paper, we study minimax inequalities and generalized l - kkm type theorems in the spaces without linear structure

    在此論文中，我們研究了沒有線性結構空間中的極大極小不等式以及廣義l ? kkm型定理
  7. The sample with low emitter efficiency has completed as the method of above. this lead to the greatly decrease of the reverse recovery time and the low reverse leakage and forward voltage, especially the excellent temperature character of the leakage. the test date shows that the samples reach the first class of international level

    本論文作者通過模擬測試，驗證了課題研究的理論設想，並設計製作了具有低陽極發射效率結構的高壓功率frd ，利用局域鉑摻雜和電子輻照相結合的壽命控制方式，實現器件反向恢復時間的極大減小，並且反向漏電流、軟度因子、正向壓降等關鍵參數也較理想，且具有極佳的漏電溫度特性，達到器件綜合性能的優良折衷，達到國際先進水平。
  8. In chapter two, we prove the existence and multiplicity results of some nonlinear biharmonic equations by using lower scmicontinuity method and minimax method

    在第二章中，通過下半連續方法和極大極小方法，我們證明了一類非線性雙調和方程解的存在性和多解性的結論
  9. Along with the development of minimax theory, it had been applied in game theory, mathematical economics, optimization theory, variational inequalities, fixed - point theory, potential theory, section problem, etc

    隨著極大極小理論的發展，它已經應用於博弈論，數量經濟學，最優化理論，變分不等式，微分方程，不動點理論，位勢論，截面問題等諸多領域。
  10. This dissertation studies mainly theories and according numerical implementation of a class of dual algorithms for nonlinear optimization problems, including unconstrained minimax problems and constrained nonlinear programming problems

    本文主要研究非線性優化中的一類對偶演算法，包括無約束極大極小問題的對偶演算法和約束非線性規劃問題的一類對偶演算法的理論與相應的數值實現。
  11. The second chapter reveals the mathematical essence of entropy regularization method for the finite min - max problem, through exploring the relationship between entropy regularization method and exponential penalty function method. the third chapter extends maximum entropy method to a general inequality constrained optimization problem and establishes the lagrangian regularization approach. the fourth chapter presents a unified framework for constructing penalty functions by virtue of the lagrangian regularization approach, and illustrates it by some specific penalty and barrier function examples

    第一章為緒論，簡單描述了熵正則化方法與罰函數法的研究現狀；第二章，針對有限極大極小問題，通過研究熵正則化方法與指數（乘子）罰函數方法之間的關系，揭示熵正則方法的數學本質；第三章將極大熵方法推廣到一般不等式約束優化問題上，建立了拉格朗日正則化方法；第四章利用第三章建立的拉格朗日正則化方法，給出一種構造罰函數的統一框架，並通過具體的罰和障礙函數例子加以說明。
  12. Chapter one has introduced the background and classification of minimax theorems ; chapter two summarizes several proof method of minimax theorems, which are illustrated with examples ; chapter three has explained the development general situation of minimax theorems for a function and for two functions with chapter four respectively, and according to the classification of the theorem, has illustrated some important conclusionses in quantitative minimax theorems, topological minimax theorems and quantitative - topological minimax theorems separately

    第一章介紹了極大極小定理的背景及其分類；第二章總結了極大極小定理的幾種證明方法，並舉出例子進行說明；第三章和第四章分別闡述了單函數的極大極小定理和兩個函數的極大極小定理的發展概況，在第三章中，按照極大極小定理的分類，分別對數量極大極小定理，拓撲極大極小定理和數量拓撲極大極小定理的一些重要結論作了介紹。
  13. Firstly, the duality principle is used to change the linear program problem into the minimax problem, an interval extension of the adjustable entropy function is set up and its order of convergence is discussed

    首先利用對偶理論將線性規劃問題轉化為極大極小問題，建立並討論了調節熵函數的區間擴張及其收斂階。
  14. In the chapter 1, a max - min theorem and a max theorem are proved on local convex topological linear spaces, as an application, it is obtained that there exists optimal mixed strategies in a game with an infinite pure strategy set on a compact hausdorff space on the basis of analytic methods

    第一章在局部凸線性拓撲空間上證明了一個極大極小定理與極大定理，作為應用，利用基於分析的方法討論了局中人無限純策略集為緊的hausdorff空間時的最優混合博弈問題。
  15. Due to the specialties of fault signals in missile fault diagnosis, we proposed a novel de - noising method applying wavelet analysis scale space filter by using the properties of the signal and noise modulus maxima across scales. and modified it by using information on neighboring coefficients into the decision making. this de - noising method can reduce noise to a high degree while preserving most of the important features of the signal such as edges and other singularities

    研究了小波理論在信號去噪方面的理論和演算法，並針對故障信號的特殊性，提出了基於小波變換模極大值理論的尺度相關信號去噪方法，並提出了改進方法，將臨近系數的信息也作為決策的依據，從而得到了既能保護信號的奇異性特徵，又可以取得較好信噪比的新的信號去噪方法，並將其應用於實際系統，取得了很好的效果。
  16. For real world implementation of wavelet theory, the selection of suitable wavelet bases and related algorithms is mainly focused on. then the application in signal de - noising with wavelet transform is investigated. due to the specialties of fault signals in motor control system fault diagnosis, a novel de - noising method applying wavelet analysis scale space filter by using the properties of the signal and noise modulus maxima across scales is proposed

    研究了小波理論在信號去噪方面的理論和演算法，並針對電機控制系統故障信號的特殊性，提出了基於小波變換模極大值理論的尺度相關信號去噪方法，並提出了改進方法，從而得到了既能保護信號的奇異性特徵，又可以取得較好信噪比的信號去噪方法，並將其應用於實際系統，取得了很好的效果。
  17. Considering the real market conditions, a minimax model with transaction costs as well as no short sales is developed for optimal portfolio selection and the dynamic rules with transaction costs rate changing is analyzed secondly ; ? the structure of m - v portfolio e ? cient frontier and its changes are studied if short sales are not allowed, by adjusting the original securities set such that the m - v e ? cient frontier of new securities set get better ;

    考慮到證券市場的實際條件，對存在交易費及不允許賣空的金融市場，建立了選擇最優投資組合的一個新的極大極小模型，並針對各個資產交易時交易費率的變化情況，從理論上研究了最優投資組合的動態變化規律；
  18. 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陣的條件數，它也依賴于罰參數。
  19. 4. the paper applies the minimax algorithm to the problem of computer go and adds the heuristic information about computer go to the minimax algorithm, therefore, it forms the main inference method of computer go in inference machine and improves the search efficiency

    論文把極大極小演算法應用於圍棋博弈問題，並且按照棋手計算死活的思路，在極大極小演算法中加入了有關圍棋博弈的啟發式信息，形成了推理機中主要的圍棋博弈推理方法，提高了搜索的效率。
  20. Since von neumann proved the first minimax theorem in 1928, rich fruits have been obtained about research on minimax theory

    自從vonneumann於1928年證明了第一個極大極小定理以來，關于極大極小理論的研究已經取得了豐碩的成果。
分享友人
分享到 Line

分享到臉書