minimal solution 中文意思是什麼

minimal solution 解釋
極小解
  • minimal : adj. 1. 最小的，極微的，最低（限度）的。2. 最簡單派藝術的。n. 最簡單派藝術作品〈抽象藝術的一種〉。
  • solution : n. 1. 溶解；溶液，溶體，溶劑。2. （補輪胎用的）橡膠水；〈美國〉藥水。3. 解決，解答 （of; for; to）; 解釋；（數學等的）解法，解式。4. 免除，解除。5. 【醫學】消散，消退。
  1. A solution of the fuzzy network minimal flow problem

    具有模糊約束的廣義預測控制
  2. This thesis focuses on techniques of dynamic fault tree in system reliability modeling and its qualitative and quantitative analysis. it studies bdd solution for static sub trees 、 markov chain solution for dynamic sub tree briefly and the modularization of dynamic fault tree ; presents the algorithm for top event occurrence rate of dynamic fault tree based on weibull distribution. then this thesis presents a new approach to solve top event occurrence rate and a new generation algorithm of minimal cut sequence of dynamic fault tree that deviate from markov model completely

    本文著眼于動態故障樹在系統可靠性建模及定性定量分析中的技術，研究了基於bdd的靜態子樹分析方法、基於馬爾可夫模型的動態子樹分析方法以及動態故障樹模塊化方法，並提出了基於威布爾分佈的動態故障樹頂事件發生概率計算方法;提出了一種完全脫離馬爾可夫模型的求解動態故障樹頂事件發生概率的方法和一種最小順序割集的生成方法。
  3. Relative to sde, the study for the solution of bsde under non - lipschitz condition is absence, especially when the uniqueness of the solution can not be guaranteed, the existence of minimal and maximal solution of bsde are not be studied

    相對于正向隨機微分方程，非lipschitz條件下倒向隨機微分方程解的性質的研究尚不夠豐富，特別是條件不能保證方程解唯一時，倒向隨機微分方程最大最小解的存在性尚未見有成果。
  4. In the end, when the domain is finite, b is a meet - irreducible element or 6 has an irredundant finite meet - decomposition, a sufficient and necessary condition that the solution set is nonempty is given and the number of distinct minimal solutions is formulated

    最後，當論域為有限集， b為交既約元或有不可約有限交分解時，給出了方程inf _ （ i j ） （ a _ j ， x _ j ） = b解集非空的充要條件以及極大元的個數公式。
  5. 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為無限集合時，給出了存在可達解以及存在極小解的充要條件。
  6. In chapter two, under non - lipschitz condition, the existence and uniqueness of the solution of the second kind of bsde is researched, based on it, the stability of the solution is proved ; in chapter three, under non - lipschitz condition, the comparison theorem of the solution of the second kind of bsde is proved and using the monotone iterative technique, the existence of minimal and maximal solution is constructively proved ; in chapter four, on the base of above results, we get some results of the second kind of bsde which partly decouple with sde ( fbsde ), which include that the solution of the bsde is continuous in the initial value of sde and the application to optimal control and dynamic programming. at the end of this section, the character of the corresponding utility function has been discussed, e. g monotonicity, concavity and risk aversion ; in chapter 5, for the first land of bsde, using the monotone iterative technique, the existence of minimal and maximal solution is proved and other characters and applications to utility function are studied

    首先，第二章在非lipschitz條件下，研究了第二類方程的解的存在唯一性問題，在此基礎上，又證明了解的穩定性；第三章在非lipschitz條件下，證明了第二類bsde解的比較定理，並在此基礎上，利用單調迭代的方法，構造性證明了最大、最小解的存在性；第四章在以上的一些理論基礎之上，得到了相應的與第二類倒向隨機微分方程耦合的正倒向隨機微分方程系統的一些結果，主要包括倒向隨機微分方程的解關于正向隨機微分方程的初值是具有連續性的，得到了最優控制和動態規劃的一些結果，在這一章的最後還討論了相應的效用函數的性質，如，效用函數的單調性、凹性以及風險規避性等;第五章，針對第一類倒向隨機微分方程，運用單調迭代方法，證明了最大和最小解的存在性，並研究了解的其它性質及在效用函數上的應用。
  7. ( 2 ) the equation satisfies the transient distribution of the waiting time w ( t ) is obtained, to which the minimal nonnegative solution is the unique bounded solution

    （ 2 ）給出等待時間w （ t ）的瞬時分佈所滿足方程，並證明它為該方程的最小非負解，也是唯一有界解。
  8. In this dissertation, we first state briefly the developmental history, the present condition of queueing theory, the markovization of queueing system and the research situation for several types of ergodicity, and induce the preliminary knowledge of markov processes and markov skeleton processes, and then the dissertation discusses mainly focus on several problems which exist in researching gi / g / l queueing system, which are categoried as follows : ( i ) non - equilibrium theory for gi / g / 1 queueing system ( l ) we present the equation which satisfies the transient distribution of l ( t ) for the three special cases m / m / 1, gi / m / 1 and m / g / 1 queue of gi / g / 1 queueing system, and proves that the length l ( t ) of gi / g / 1 queueing system satisfy three types of equation, and their minimal nonnegative solution are unique bounded solutions

    歸納了馬爾可夫過程和馬爾可夫骨架過程的有關的初步知識。然後，本文重點討論了當前在gi g 1排隊系統中待研究的如下幾個問題： （一） gi g 1排隊系統的非平衡理論（ 1 ）給出gi g 1排隊系統及其三個特例m m 1 ， gi m 1和m g 1排隊系統的隊長l （ t ）的瞬時分佈所滿足的方程。證明gi g 1排隊系統的隊長l （ t ）滿足三種不同方程，並且是這些方程的最小非負解，也是唯一有界解。
  9. The degenerate elliptic problems we shall study is very closely related to rigidity problems arising from infinitesimal isometric deformation, as well as other geometry problem, such as minimal surface in hyperbolic space. in particular, the existence of solution with high order regularity is very important to investigate geometry problems. one would like to know under what conditions the solution of such equations are as smooth as the given data

    通過構造輔助邊值問題，建立了各種能量不等式，並利用這些先驗估計，以及banach - saks定理得到了h ~ 1弱解存在性；利用退化橢圓型方程弱解與強解的一致性和已知的先驗估計，還得到h ~ 1弱解的唯一性。
  10. 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

    對于冗餘驅動振動臺，其位姿正解是求解具有八個輸入、六個輸出的超定非線性方程組，因此本文採用了最小二乘法中的牛頓?高斯迭代法，建立最小二乘目標函數，對目標函數極小解的存在性、唯一性以及牛頓?高斯迭代法的收斂性進行了理論證明和分析，將求出的最小值作為位姿正解的最優解。
  11. Based on the theory of reyleigh minimum, the minimum of energy function of neural network was mapped to the eigenvector that was mapped to the minimal eigenvalue of the generalized eigenvalue problem, by which the precise solution of minimal eigenvalue was gained while the neural network moving to the minimum of energy function

    本文應用reyleigh極小值原理，將神經網路的能量函數的極小點對應于廣義特徵值問題的極小特徵值所對應的特徵向量，在神經網路向著能量函數極小點運動的同時得到了極小特徵向量的精確解答。
  12. Further, it is proved that there exists a minimal solution such that for every if the solution set

    進一步，證明了如果方程的解集非空，則解集中的每一解都存在一個大於等於它的極大解。
  13. After a minimal primer on functional differentiation, we obtain the general form of the regularized solution as a weighted sum of kernel functions centered at the data points

    我們會利用這理論來獲得正規化解法的一般形式，例如，如何于泛函數微分之後取得數據中核心函式的加權和。
  14. 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有解，則一定存在極小解。
  15. The minimal norm solutions of the equation f4 ( x ) = 0 over srmxm are derived, and also the necessary and sufficient conditions for the existence of and the general expressions of the skew - symmetric solution of the equation f4 ( x ) = 0 are obtained, the related l - s problem f4 ( x ) = min is solved. 5. the necessary and sufficient conditions for the existence of and the general expressions of the skew - symmetric solution of the generalized sylvester equation f5 ( x, y ) = 0 are obtained, and the related optimal approximation solution is obtained, too

    得到了矩陣方程f _ 4 （ x ） = 0在sr ~ （ m m ）上的極小范數解，同時導出了此方程具有反對稱解的充分必要條件和解的通式，解決了相應的l一s問題人（ x ）二min . 5 .得到了廣義sylvester方程兒（ x ， y ） = 0具有反對稱最小二乘解的充分必要條件和解的通式以及解的最佳逼近問題的解，導出了幾（ x ， y ）二0具有置換對稱解的充分必要條件，解的通式及解的最佳逼近問題的解
  16. We also research the power flow calculation and reliability analysis of urban radial network, and a forward - backward sweeping method of power flow solution and a kind of reliability evaluation based on the minimal path method, are presented in this thesis

    在前人研究成果的基礎上，提出了採用前推回推法計算配電網路潮流以及基於最小路的實用快速可靠性評估演算法.其中對于潮流計算，本文用c語言編制了相應的計算程序。
  17. In this thesis, the methods that used to separate and pick up the magnetic anomalies, and the methods used to find the minimal norm solution are especially introduced

    本文主要研究了可以用於分離和提取高精度磁異常的方法，以及反演中求最小范數解的原理方法。
  18. Builders are also a fabulous option when it comes to prototyping, or for when minimal development time and effort are required to produce a working solution

    對于原型化，或者當需要以最少的開發時間和精力來產生可工作的解決方案時，生成器也是一個不錯的選擇。
  19. In this paper, we will investigate the matrix equation in composition over a complete brouwerian lattice. first, we give an equivalent condition for the solvability of this equation, i. e. theorem 2. 2. 3 in this paper : the matrix equation in composition over a complete brouwerian lattice is solvable iff is the minimal solution of this equation

    本文主要探討完備brouwer格上的型矩陣方程，首先給出該類矩陣方程可解的一個等價條件，即本文的定理2 . 2 . 3 :完備brouwer格上的型矩陣方程可解的充要條件是是它的解，且是最小解
  20. This paper introduces the concept of minimal perturbation efficient solution in minimal perturbation constraints programming

    文中引進了極小擾動約束規劃的極小擾動有效解概念。
分享友人
分享到 Line

分享到臉書