構造性證明 的英文怎麼說

中文拼音 [gòuzàoxìngzhèngmíng]
構造性證明 英文
constructive proof
  • 構 : Ⅰ動詞1 （構造; 組合） construct; form; compose 2 （結成） fabricate; make up 3 （建造; 架屋） bui...
  • 造 : Ⅰ動詞1 （做; 製作） make; build; create; produce 2 （假編） cook up; fabricate; concoct 3 [書面語...
  • 性 : Ⅰ名詞1 （性格） nature; character; disposition 2 （性能; 性質） property; quality 3 （性別） sex ...
  • 證 : Ⅰ動詞（證明） prove; verify; demonstrate Ⅱ名詞1 （證據） evidence; proof; testimony; witness 2 （...
  • 明 : Ⅰ形容詞1 （明亮） bright; brilliant; light 2 （明白;清楚） clear; distinct 3 （公開;顯露在外;不隱...
  • 構造 : structure; construction; constructional detail; tectonic; structural; makeup; anatomy; constituti...
  • 證明 : 1 （表明 、 斷定真實性） prove; testify; bear out 2 （證明書或信） certificate; identification; t...
  1. Conscious that the human organism, normally capable of sustaining an atmospheric pressure of 19 tons, when elevated to a considerable altitude in the terrestrial atmosphere suffered with arithmetical progression of intensity, according as the line of demarcation between troposphere and stratosphere was approximated, from nasal hemorrhage, impeded respiration and vertigo, when proposing this problem for solution he had conjectured as a working hypothesis which could not be proved impossible that a more adaptable and differently anatomically constructed race of beings might subsist otherwise under martian, mercurial, veneral, jovian, saturnian, neptunian or uranian sufficient and equivalent conditions, though an apogean humanity of beings created in varying forms with finite differences resulting similar to the whole and to one another would probably there as here remain inalterably and inalienably attached to vanities, to vanities of vanities and all that is vanity

    人體組織通常能夠抗得住十九噸的氣壓169 ，可是一旦在地球的大氣層里上升到相當的高度，越是接近對流層與平流層的境界線，鼻孔出血吸呼困難以及眩暈，隨著算術級數就越發嚴重起來。他曉得這一點，尋求解答時就設想出這樣一個難以證明是不可能的行之有效的假定：倘若換個更富於適應性，解剖學上的構造也有所不同的種族，說不定就能在火星水星金星木星土星海王星或天王星那充足而相同的條件下生存下來。然而那個遠地點170的人類種族，盡管在構造方面與地球上的人類有著一定限度的不同之處，整個來說彼此卻有著相似的種種形態。
  2. It is proven that these modified dual algorithms still have the same convergence results as those of the conceptional dual algorithms in chapter 2 and chapter 3. secondly, a dual algorithm is constructed for general constrained nonlinear programming problems and the local convergence theorem is established accordingly. the condition number of modified lagrange function ' s hessian is estimated, which also depends on the penalty parameter

    證明這些修正的對偶演算法仍具有同前兩章的概念性對偶演算法相同的收斂性結果，我們還進一步構造了一般約束非線性規劃問題的對偶演算法，建立了相應的局部收斂理論，最後估計了修正lagrange函數的hesse陣的條件數，它同樣依賴于罰參數。
  3. Further research of lithofacies pvove : lode country output points belongs to tidal - flat facies. and the two sides belong to littoral facies - estuarine facies. ore area petrochemistry analyse also prove : intraclast congeries silica rock in basin have higher cu, ag abundance than circumference pena. the prominence inhomogeneity of the cu distribution indicates reconstruct of the late construction

    礦區內巖石化學測量也證明：盆地內發育的內碎屑堆積硅質巖比周圍巖石具有更高的cu 、 ag元素地球化學豐度值， cu元素分佈的顯著不均一性，表明了後期構造的改造作用。
  4. The research shows that mineralization fitted well with the regional tectonic - magmatic - metallogenic events and deep structure in this district. 3

    研究證明，本區成礦作用與區域構造-巖漿-成礦事件及深部構造之間有很好的吻合性。
  5. How to find out the constructivity methed for proving a competition problem

    一個構造性證明的解法是這樣想出來的
  6. A constructive proof of existence theorem for rational form

    利用羅爾定理進行構造性證明的嘗試
  7. Using the combinatorial method of constructibility and the technique of exchanging colors, we present the best upper bounds of dynamic chromatic number of halin graphs and sp graphs, and determine the dynamic chromatic number of a type of sp graphs, we determine the incidence chromatic number of some descartes product graphs and some join graphs. at last we determine the entire coloring number of 1 - tree and prove a conjecture of edge - face coloring

    利用構造性組合方法和換色技巧給出了halin圖和系列平行圖動態色數的最小上界，並確定了一類特殊系列平行圖的動態色數，確定了某些笛卡兒積圖和某些聯圖的關聯色數，確定了1 -樹圖的完備色數並證明了有關邊面著色的一個猜想。
  8. Another proof of the converse lyapunov stability theorem

    有理標準形存在性定理的構造性證明
  9. The equivalent theorem of contraction operator and its constructing proof

    壓縮映射原理的等價命題及其構造性證明
  10. And a dynamic searching system of geometric theorem has been implemented, which can solve elementary geometric problems efficiently, including some non - constructive problems

    該系統不但可以證明構造性的初等平面幾何命題，而且也實現了對非構造性幾何命題的定理搜索。
  11. After the analysis of several important aspects of neural control, two novel neural controllers are then proposed. the first controller fam neural controller ( famnc ), based on pre - defuzzifing fam, is presented for bridging the gap between fam and nn. the equivalence of pre - defuzzifing and general fam is proved constructively

    在分析了神經網路控制的一些關鍵技術基礎上，提出了預去模糊fam原理和fam神經控制器，給出了預去模糊fam和一般fam的等價性的構造性證明。
  12. 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解的比較定理，並在此基礎上，利用單調迭代的方法，構造性證明了最大、最小解的存在性；第四章在以上的一些理論基礎之上，得到了相應的與第二類倒向隨機微分方程耦合的正倒向隨機微分方程系統的一些結果，主要包括倒向隨機微分方程的解關于正向隨機微分方程的初值是具有連續性的，得到了最優控制和動態規劃的一些結果，在這一章的最後還討論了相應的效用函數的性質，如，效用函數的單調性、凹性以及風險規避性等;第五章，針對第一類倒向隨機微分方程，運用單調迭代方法，證明了最大和最小解的存在性，並研究了解的其它性質及在效用函數上的應用。
  13. 10 xu h l, huang l s, wan y y et al. localized algorithm for coverage in wireless sensor networks

    本文的第四節給出了演算法的正確性證明，即演算法構造的路徑為最壞覆蓋路徑。
  14. ( 5 ) the constructively sufficient conditions of the approximating c1 functions and the explicit formula dealing with the approximation precision and the number of fuzzy rules are given for one kind of general fuzzy systems, using the methods different from the former ones which are based on the stone - weierstrass theory, therefore, the constructively sufficient conditions are also generalized from polynomial function to c1 function

    （ 5 ）針對一類一般的模糊系統，採用與通常的基於stone - weierstrass定理證明模糊逼近器不同的方法，首次給出了它們逼近c ~ 1函數的構造性充分條件，並給出了逼近精度與模糊規則條數之間關系的顯式表達式
  15. By constructing two functor, we have proved a representation theorem of the category stml that the category stml is equivalent with the category fsts, where fsts is consisted of - fuzzifying scott topological spaces and the mappings which are preserving directed - join and way - below relation and continuous. besides, the category stml ( c ) has been discussed, where c is a subcategory of the category of the completely distributive lattices and gohs, c, morphisms are ( 1, 2 ) - smooth continuous goh

    構造性地給出一對函子，並以此證明了范疇stml （ l ）的一個表示定理，即范疇stml （ l ）與范疇fsts （ l ） （由l - fuzzifyingscott拓撲空間與保定向並和way - below關系的l - fuzzifying連續映射所構成的范疇）等價。
  16. Then nonmonotone trust region algorithm is given and global convergence is proved. thirdly, based on complementary conditions and ncp theory, the minimax problem is transformed into nonsmooth equation. we introduce an numerical algorithm relating with splitting function method

    基於互補條件和ncp函數理論，將minimax問題轉化為一非光滑非線性方程組，利用分裂函數的思想，構造了一種新的演算法，並給出數值試驗和收斂性證明。
  17. This paper researches the three - layered b - spline neural network, which is commonly used in engineering and presents a constructive algorithm for selecting the number of the hidden nodes. it is proved that the proposes algorithm can be used to build a b - spline neural network with minimum hidden nodes to approximate any continuous function defined on compact set to a prescribed accuracy

    本文研究了工程上常用的三層b樣條神經網路，採用構造性的方法證明了b樣條神經網路的全局逼近能力，並且給出了構造幾乎最小隱節點的演算法，從而在理論上為b樣條神經網路的使用提供了依據。
  18. This thesis gives a model language and a moderately complete formal description which can be used to prove the properties of static and dynamic data dependencies, and defines the notions in the iterative relaxation method formally. the program theories about the iterative relaxation method and its improvement are investigated, whose results include : the generalization of the predicate slices proposed by neelam gupta et al to path - wise static slices, and the proofs of the soundness of the construction algorithm of path - wise static slices and the soundness of the improvement

    本文給出一種模型語言；給出一個比較完整的形式化描述，該描述可用於證明與靜態、動態數據依賴關系有關的程序性質；給出迭代鬆弛法中各概念的形式化定義；深入研究迭代鬆弛法及其改進后的方法的程序理論，其結果包括：將neelamgupta等人提出的謂詞片推廣為路徑靜態切片，證明路徑靜態切片構造演算法的正確性，證明改進后的方法與原方法所生成的線性約束系統相同。
  19. Such structure can be described with strict feedback system. motivated by vehicle cruise control, this paper investigates nonlinear robust control of strict feedback system and presents a lyapunov - based design method : dynamic surface control and proves the exponent stability and arbitrary small bounded tracking error of the closed loop system

    本文在汽車巡航控制應用背景下，討論了嚴格反饋非線性系統的魯棒控制問題，給出構造性的非線性控制器設計方法： dsc （ dynamicalsurfacecontrol ）魯棒控制器，並對閉環系統穩定性進行了分析，證明了調節問題的指數穩定性和任意有界誤差跟蹤性能。
  20. In second chapter, we chiefly express simply rationale of general genetic algorithm and simply algorithm foundation, then in fourth chapter, introducing the rationale of the distributed fusion genetic algorithm and model structure. because this paper is only a introducing assumption and simply application, it is not to prove the convergence of algorithm, and we must have work to do continuously

    在第二章，我們簡單描述了一般遺傳演算法的基本原理和簡單的演算法構造，然後在第四章提出了分散式融合遺傳演算法的原理和構造形式，當然由於本文只是一個初步的設想和簡單的實施，所以對于演算法的收斂性證明還不能得到，還有待進一步的解決和完善。
分享友人
分享到 Line

分享到臉書