L - lemma 中文

lemma 短語和例子lemma1n.(pl. lemmata, l...

短語和例子lemma1 n. (pl. lemmata, lemmas) 1.【邏、數】(輔)助定理，引(定)理，預備定理。 2.(詩等的)主題，題目。 3.(詞典的)詞目。 4.(圖畫等上的)題詞。 n. 【植物；植物學】(禾本科小穗的)外稃。 “lemma lemma“ 中文翻譯：引理“approximation lemma“ 中文翻譯：逼近引理“burnsides lemma“ 中文翻譯：伯恩賽德引理“euclid lemma“ 中文翻譯：歐幾里得引理“farkas lemma“ 中文翻譯：法卡斯引理“fatou lemma“ 中文翻譯：法都引理“five lemma“ 中文翻譯：五引理“fundamental lemma“ 中文翻譯：基本引理“infinity lemma“ 中文翻譯：無窮性引理; 無限性引理“keeled lemma“ 中文翻譯：龍骨瓣形外稃“nakayama lemma“ 中文翻譯：中山正引理“nine lemma“ 中文翻譯：九引理“poincare lemma“ 中文翻譯：龐加萊引理“pumping lemma“ 中文翻譯：泵引理; 激勵引理“schwarz lemma“ 中文翻譯：施瓦茨引理“snake lemma“ 中文翻譯：蛇引理“splitting lemma“ 中文翻譯：分裂引理“sterile lemma“ 中文翻譯：護穎; 空稃“urysohn lemma“ 中文翻譯：烏里申引理“baker-hausdorff lemma“ 中文翻譯：培克爾“bone indurate lemma“ 中文翻譯：骨質化外稃“fatou-lebesgue lemma“ 中文翻譯：法都-勒貝格引理“iterationslemma pumping lemma“ 中文翻譯：泵作用引理“kidane seifeselassie lemma“ 中文翻譯：賽費塞拉西“lemm“ 中文翻譯：萊姆“lemmatization“ 中文翻譯：詞形還原

lemming
Lemmas . l : the lax pair of system ( 1 . 3 ) takes the form where and in which z = ei h , and system ( 3 . 1 ) gives the “ lax representation “ of the discrete nls + equation ( 1 . 3 ) theorems 本節中一個關鍵的問題就是要找出定理3 . 2中給定的(引理4 . 2 ，定理4 . 3 ) ，即拉克斯對方程的一個解。
Many substances in our body need to be transited from here to there by blood , and some other substances need some proteins functioned as carriers in the plasma lemma to enter cells 體內不少物質需要通過血液從一處運送到另一處，也有一些物質需要質膜中的某些蛋白質作為載體而進入細胞。
The existence of solutions for a class of elliptic systems is denoted , by mountain pass lemma , the existence result for system of more general operator including p - laplacian , is obtained 摘要利用經典的山路引理，證明了在一般形式的算子下，橢圓型方程組非平凡解的存在性。
Markov ' s inequality and some kinds of lovasz local lemma , respectively . in the last part , we discuss a new concept “ adjacent - vertex distinguishing total colorings “ 第四部分引入了鄰點可區別的全染色這一新的概念，并用第一矩量原理， markov不等式以及幾種形式的lov (
Section two is about some concepts and lemmas involved as follows . section three provides the mainly results on the spectral moment of bicycle graphs and its lexicographical order 第二部分我們給出了本論文所涉及的基本概念，研究了圖的改變與譜矩序列排列之間的關系。
The authors have formalized a specification language and logic - calculus in lf , together with useful lemmas , and a user - oriented syntax has been designed 在本文中，我們考慮并行系統的驗證領域,并在lf中將特定論域的規范描述語言ccs和相關邏輯m - culculus形式化。
2 . polynomial - time approximation schemes ( ptas ) lemma 1 with 1 + cost , we can assume that all processing times and release dates are integer times of 1 + 引理1在修正費用不超過1 。的情況下，可以將原實例的加工時間和到達時間修改為1 。的整數次冪
By the control lemma of chart - radius and through using the method of integrating , the author estimates the existence range of the invariant set and its attractor 由譜半徑的控制引理，利用積分的方法，得到其解的不變集與吸引集的存在條件及存在范圍。
Each individual floret of the spikelet is also subtended by two bracts , the lower being called the lemma and the upper the palea 每一朵能發育的花的外面又有兩片鱗片狀的薄片包住，稱為稃片，外面的一片稱外稃，是花基部的苞片，里面的一片稱內稃。
We obtain the adjacent - vertex distinguishing total chromatic numbers with the first moment principle , markov ' s inequality and some kinds of lovasz local lemma , respectively ) sz局部引理分別得到了任一最大度為d的圖g的鄰點可區別的全色數。
We prove four kinds of lovasz local lemma with the method of probability theory and discuss the relationship among them and their different applicable ranges ) sz局部引理，并從中發現幾種lov ( ? ) sz局部引理之間的關系，找出其不同的適用范圍。
Main results are following : theorem 1 . 9 let 5 is a - pseudo - strong distributive lattice semiring , 0 is a congruence of the definition in lemma 1 . 4 所得的主要結果如下：定理1 9設為偽強分配格半環，為引理1 4中所定義的s上的同余。
In the second section , we introduce the define and one property of quasi - claw - free graph , and obtain the following theorem and lemma : lemma 2 . 1 let g is 本章第二節在定理b和定理c的基礎上把無爪圖的定理推廣到了受限圖得到了定理3
The proof is based on rosenthal type maximal inequality , rosenthal type inequality , several lemmas and properties of slowly varying function 定理的證明基于rosenthal型最大值不等式， rosenthal型不等式，幾個引理及緩變函數的性質。
For efficient reasons , the lemmas are represented in propositional formulas and a sat solver is used to perform the necessary reasoning 提出了一個新的直接搜索算法，它使用了在sat問題中行之有效的沖突分析和學習機制。
A new folms algorithm improved by lemma learning is presented . lemma learning is an important technique of sat research 為了提高folms本身搜索算法的效率，研究了如何借鑒sat問題算法現有研究成果來改進搜索算法。
It is easy to prove that the irreducible representation of finite group satisfies orthogonal relation through the usage of schur lemma 摘要利用舒爾引理，很容易證明有限群的不可約表示滿足正交關系。
In the third chapter , first we state some useful lemmas , then we study the convergence of gaussian quadrature formulas 第三章第一節主要給出了應用基本定理得到的幾個引理和另一個重要的引理。
In the fourth and fifth sections , by utilizing some relating proposed conditions we have proved the lemmas and theorems respectively 第四節和第五節利用有關假設條件分別證明了引理和定理。

名稱
說明
信箱
電話
圖片	移動背景圖固定背景圖重製上傳圖片

lemma

lemma 短語和例子lemma1n.(pl. lemmata, l...

lemming

2 . polynomial - time approximation schemes ( ptas ) lemma 1 with 1 + cost , we can assume that all processing times and release dates are integer times of 1 + 引理1在修正費用不超過1 。的情況下，可以將原實例的加工時間和到達時間修改為1 。的整數次冪

By the control lemma of chart - radius and through using the method of integrating , the author estimates the existence range of the invariant set and its attractor 由譜半徑的控制引理，利用積分的方法，得到其解的不變集與吸引集的存在條件及存在范圍。

Each individual floret of the spikelet is also subtended by two bracts , the lower being called the lemma and the upper the palea 每一朵能發育的花的外面又有兩片鱗片狀的薄片包住，稱為稃片，外面的一片稱外稃，是花基部的苞片，里面的一片稱內稃。

We obtain the adjacent - vertex distinguishing total chromatic numbers with the first moment principle , markov ' s inequality and some kinds of lovasz local lemma , respectively ) sz局部引理分別得到了任一最大度為d的圖g的鄰點可區別的全色數。

We prove four kinds of lovasz local lemma with the method of probability theory and discuss the relationship among them and their different applicable ranges ) sz局部引理，并從中發現幾種lov ( ? ) sz局部引理之間的關系，找出其不同的適用范圍。

Main results are following : theorem 1 . 9 let 5 is a - pseudo - strong distributive lattice semiring , 0 is a congruence of the definition in lemma 1 . 4 所得的主要結果如下：定理1 9設為偽強分配格半環，為引理1 4中所定義的s上的同余。

In the second section , we introduce the define and one property of quasi - claw - free graph , and obtain the following theorem and lemma : lemma 2 . 1 let g is 本章第二節在定理b和定理c的基礎上把無爪圖的定理推廣到了受限圖得到了定理3

The proof is based on rosenthal type maximal inequality , rosenthal type inequality , several lemmas and properties of slowly varying function 定理的證明基于rosenthal型最大值不等式， rosenthal型不等式，幾個引理及緩變函數的性質。

For efficient reasons , the lemmas are represented in propositional formulas and a sat solver is used to perform the necessary reasoning 提出了一個新的直接搜索算法，它使用了在sat問題中行之有效的沖突分析和學習機制。

A new folms algorithm improved by lemma learning is presented . lemma learning is an important technique of sat research 為了提高folms本身搜索算法的效率，研究了如何借鑒sat問題算法現有研究成果來改進搜索算法。

It is easy to prove that the irreducible representation of finite group satisfies orthogonal relation through the usage of schur lemma 摘要利用舒爾引理，很容易證明有限群的不可約表示滿足正交關系。

In the third chapter , first we state some useful lemmas , then we study the convergence of gaussian quadrature formulas 第三章第一節主要給出了應用基本定理得到的幾個引理和另一個重要的引理。

In the fourth and fifth sections , by utilizing some relating proposed conditions we have proved the lemmas and theorems respectively 第四節和第五節利用有關假設條件分別證明了引理和定理。