正則代數 的英文怎麼說
中文拼音 [zhēngzédàishǔ]
正則代數
英文
regular algebra-
The signal we named it fundamental wave ; according to the fundamental wave, coefficients of the fundamental wave can be lined in a sequence. when the unique of the dissolve of the fundamental wave can be confirmed, the sequence of the coefficients can be regarded as one of representation forms of the signal itself ; theory of dissolvable signal shows that when order of the matrix of fundamental wave sampling equals to number of fundamental waves, the sequence of the sampling values from sampling points must be matched one by one with the sequence of the coefficients of fundamental waves. the sampling composed by sequences of the sampling values must be full sampling ; the relevant deductions of the theory of dissolvable signal shows that when sampling the signal, sampling frequency must be lager than the ratio of the number of fundamental waves to the occupation time of the fundamental waves ; to band - limited signals, when the fundamental wave is a sine signal, the results from the relevant deductions of theory of dissolvable signal is coherent to the classic sampling theory
本文通過分析認為，當信號集中的任一信號可表示為一系列已知信號的線性代數和時，信號集便構成可分解信號集，已知信號稱為基波信號；對可分解信號而言，基波系數構成一序列，當對指定的基波信號集分解唯一確定時，系數序列本身便是信號的一個表示；可分解信號采樣定理指出當基波樣值矩陣的秩等於基波數時，則由采樣點處的采樣樣構成的樣值序列必與基波系數序列一一對應，從而由該樣值序列構成的采樣必為完全采樣；可分解信號采樣定理中的推論指出，對信號集進行采樣，采樣頻率必須大於其信號分解的基波數與其對應時長之比；對有限帶寬信號，若基波信號為正弦信號時，由可分解信號采樣定理推論給出的結論與經典采樣定理一致。For the regular curves, we find two killing fields for the purpose of integrating the structural equations of the p - elastic curves and express the p - elastica by quadratures in a system of cylindrical coordinates. for the star - like affine curves, we solve the euler - lagrange equation by quadratures and reduced the higher order structure equation to a first order linear system by using killing field and the classification of linear lie algebra sl ( 2, r ), sl ( 3, r ) and sl ( 4, r ). we solve the centroaffine p - elastica completely by quadratures
對于正則曲線的情形，我們發現了兩個用於求解p -彈性曲線的結構方程的killing向量場並用積分將p -彈性曲線在一個柱面坐標系中表示出來，而對仿射星形曲線的情形，我們用積分方法解出了歐拉-拉格朗日方程，利用killing向量場及線性李代數s1 （ 2 ， r ） 、 s1 （ 3 ， r ）和s1 （ 4 ， r ）的分類將高階結構方程降為一階線性方程，因此我們用積分完全解出了中心仿射p -彈性曲線。Aiming at this problem, the main research issues and achievements in this paper are as follows : bi - directional data transformation between rdb and xml with semantic constraints preserved for most of existing researches on static data transformation between xml and rdb, dtd is taken as the schema description language for xml, and the semantic constraints are often lost during the transformation process. to overcome these disadvantages, the author adopts xml - schema, a standard schema description language proposed by w3c to replace dtd, as the description method owing to its more powerful functions than dtd, and of course with the syntax much more complicated. after analyzing the constraints characteristics in both xml - schema and relational schema, a semantic constraints - preserved algorithm is proposed which can realize the bi - directional schema mapping between rdb and xml through a formalized description of xml based on regular tree and a general expression for relational schema based on direct graph approach
保留語義約束的xml與rdb雙向靜態數據轉換技術現有研究大多採用dtd （ documenttypedefinition ，文檔類型定義）作為xml的模式描述語言，並且在模式映射過程中丟失語義約束信息，本文分析了xml - schema （ xml - schema採用與dtd完全不同的語法，數據描述能力更強同時也更為復雜，已被w3c確定為替代dtd作為xml模式描述語言的標準）及關系模式的語義約束特徵，通過基於正則樹的xml形式化描述方法以及基於有向圖的一般關系模式表示方法的研究，建立保留語義約束的xml - schema與關系模式的雙向模式映射演算法，實現了xml與rdb的雙向數據轉換，較好地解決了xml與rdb在靜態數據轉換層面的數據集成問題，可有效滿足企業大量rdb數據面向xml的發布以及與日俱增的xml數據存入rdb的應用需求。Regular function algebra
正則函數代數Brahmagupta ", " as the sun eclipses the stars by its brilliancy, so the man of knowledge will eclipse the fame of others in assemblies of the people if he proposes algebraic problems, and still more if he solves them. ",
正如太陽之以其光芒使眾星失色，學者也以其能提出代數問題而使滿座高朋遜色，若其能給予解答則將使儕輩更為相形見絀.Then the relation of regular operators, bounded operators and linear operators on banach lattices are given, that is lr ( e, f ) lb ( e, f ) l ( e, f ) ; order dual, operator dual and algebra dual are related, i. e. e " c e * c e #
然後給出banach格空問上正則運算元，有界運算元和線性運算元的關系： lve ； f ） of 。 ef ） clp ， f ） ；給出了序對偶，運算元對偶和代數對偶的關系： e 』 ce 」 ce個然後引入賦值映射人證明了j是保格運算的格同態Pre - symmetry regularized method for positive definite symmetrizable system of linear algebraic equations
關于正定可對稱化線性代數方程組的預對稱正則化演算法On one hand, from the technique of constrained least squares and limited energy of additive noise, an effective restored approach by adopting regularization method to overcoming ill - posed problem, solving an equation with a single variable, and using space iterative algorithm is proposed ; on the other hand, aiming at the restoration of blurred image, another effective restoration approach based on least - square algorithm is also proposed in this paper. this method firstly adopts increment iterative algorithm to improve convergence and meanwhile applies regularization technique to overcome ill - posed problem. in the computations, the regularized parameter has its adaptive character, which can be determined in terms of the restored image at each iteration step therefore automatically correct to the appropriate value
一是從約束最小二乘出發，在加性噪聲能量有界的前提下，採用正則化方法來克服病態問題，通過解一個單變量方程，並利用空域迭代運算實現了一種有效的圖像復原;二是針對模糊圖像的復原問題，從最小二乘演算法出發，採用增量迭代的方法改善演算法的收斂性，同時結合正則化技術克服問題的病態性質，並引入自適應的正則化參數，使其與圖像復原的迭代運算同步進行並自動修正到最優值。Lemma 7 h = be a weak hopf - coalgebra and is a normalized left integral of h1 ; then for all theorem 5 let h = be a finite - dimension weak hopf - coalgebra, then h is semisimple if and only if h1 is semisimple
一余代數，則下列命題等價： （ hi半單問hi中存在正規左積分iehi問hi是可分的卜代數引理5對弱hopf7t一余代數h khalh ，八，乙）而言1是從的正規積分有： voe 。We shall use algebraic methods to study graphs which are highly regular although this regularity is not expressed in terms of the automorphism group.
我們將用代數方法來研究高度正則的圖，盡管這種正則性不是用自同構群來表達的。Complemented algebra and the representation theorem for its left regular algebra
可補代數及其左正則代數的表示定理Lemma 5 let ( m, p ) be a right weak hopf - comoduleover h = a weak hopf - coalgebra, then for all ( 1 ) is a right submodule over ha of m. theorem 3 if h is a weak hopf - coalgebra and m = { ma } a is a right weak hopf - comodule over h ; we claim that : in the fourth section, we mainly study the weak integrals of h and the semisimplicity of h. we discuss the relation between the - integral and the antipiode of h, we get the following main results : lemma 6 let h = be a weak hopf - coalgebra, then the following statements for an element are equivalent ( a ) 1 a integral of h1 ( b ) ( c ) ( d ) ( e ) ( f ) is a right integral of h theorem 4 let h = be a weak hopf - coalgebra. then the following conditions on h1 are equivalent ( a ) h1 is semisimple
） ?喇） （ 1 ， 1 ） ）二m仰n m 」 」 「是m的右從子模定理3設h為弱hopf7t一余代數， m ma人h是h上的右弱hopf7t一余模n h是h在m上的余不動盧、 。則第四節我們主要討論了弱horf 。一余代數的半單性與h ；中的弱積分的關系；牙用（ h ，上門， l ） ， 3 ， si ）為弱hopf代數這一q點；我來觀察hi的正規弱積分與h的半單性之間的關系；該節第部分主要是給出弱hopf 。The main idea is to make full use of the decorrelation of two complex - valued vectors in generating independent components by non linear decorrelation
結合非正則復向量的協方差矩陣和偽協方差矩陣構造出了新的代價函數，進而提出新演算法，通過復非線性不相關，從混合信號中提取出復值獨立分量。In this thesis, we extend the entropy regularization method in two ways : from the min - max problem to general inequality constrained optimization problems and from the entropy function to more general functions
本文從兩個方面發展了這種熵正則化方法，即將其從極大極小問題推廣到一般不等式約束優化問題上和用一般函數代替熵函數作正則項，建立新的正則化方法。First, the paper researches the format and semantic features of iso apt in detail, next, applies regular expression to describe the definition of apt ’ s tokens and uses context - free grammar to describe apt ’ s syntax rules, last, designs the intermediate code format which keeps on the source code semantic and designs a complete module to check lexical and syntax errors of nc code by using modern compiling techniques
在代碼預處理技術方面，詳細研究了標準數控代碼語言的格式和語義並採用現代編譯技術中的正則表達式和上下文無關文法分別描述了標準數控代碼語言的記號定義和語法結構定義;設計了保持源代碼語義的中間標準數控代碼格式，在此基礎上，設計並構建了數控代碼的詞法和語法檢查模塊。Regular algebraic equation
正則代數方程The following code example illustrates the use of this constructor to instantiate a regular expression with a specified pattern
下面的代碼示例演示如何使用此構造函數以指定的模式實例化正則表達式。The following code example illustrates the use of this constructor to instantiate a regular expression with a specified pattern and options
下面的代碼示例演示如何使用此構造函數以指定的模式和選項實例化正則表達式。Some properties of partial order in banach algebras
代數的正則性及其乘子Regular open algebra
正則開代數分享友人