極小項 的英文怎麼說
中文拼音 [jíxiǎoxiàng]
極小項
英文
canonical form-
Mea is an effective, minimally invasive procedure for the safe treatment of menorrhagia in a wide range of patients
Mea是一項用於治療大范圍的月經過多患者的安全有效且創傷極小的手術操作。A gmres based polynomial preconditioning algorithm
的多項式預處理廣義極小殘差法Hence an algorithm for the minimal polynomial of a block circulant matrix over the field is presented
） bner基，從而給出了求塊循環矩陣的極小多項式的演算法。So finding the minimal polynomial of a block circulant matrix is transformed into computing the reduced grobner basis of a kernel of a ring homomorphism
因此，將求域上塊循環矩陣的極小多項式轉化為求一個環同態的核的簡化gr （An algorithm for finding the minimal polynomial of a fls r - circulant matrix
循環矩陣的極小多項式的演算法Algorithms for finding the minimal polynomials and inverses of permutation factor circulant matrices
求置換因子循環矩陣的極小多項式和逆的演算法3 g 一 g g abasi 叱 加 ical pp 訕 howthe qquasi ghgsical 毗 quasi sociological methodmo 止 secondlx we uthuther nalsze the nhrsical model on which he quasi pnsical and quasi sociological methods for solving s 肛 problembased considering a physical hypothesis on this model ， we construct a counterexaxnple to showthatthe hypothesis is not eee ? howeve 二 itdoes notdamage the goodpractical effectof applpinp this phpsical model to solve s 盯 problem considering he existence of alsorithlnic region ， which reflects that the quasi sociological method is very necessw for ass 吶 ng the high efficient of theent whole algori 燦 m therefore deepens our comprehension on the quasi physical and quasi sociological methods mird1x we wpl … 叫 nas 恤 ysi 陰 1md q 阻 si 500i 吶 i0alm 毗 cd 引 0 咖 we mathematical problem ofcom 恤 non oforthogonal tmles m successfully es 恤 fish a physicalopttrizatbo model for sotring saturated o 汕 ogonal tables ， whwh ws provedto be correctintheo0 we thi 冰 。 w goodpersonated s 咖 egies forjumping out of the t 呷 oflocal minimum using quasi sociological method based onthe physical model thus wegetthe wholequasi physicaland quasi sociological algorim forthe problem ofconswction ofs 咖 med orthogonal tables he experimental results showthatthephysical model ishighly efficientthanthe conflmng nlllllber mode ！ based on me pure m 她 ematical 訕 kgfound 他 sucoes 訕 11y ? ? rk 咖 m 枷 ons 訕 卿 nal 郵 ie with 3 leve13 using th 叫 u 1 physical and quasi sociological algori 恤 we got some o 汕 ogonal t 勸 les ofl 。 ， （ 3 ’ ‘ ） which are not isomorphic moreove 乙 some ofour results are also not isomorphic to oe results pearedb 山 e open rekrences we got lip to now lastlx for 讓 卜 ancie 口 戊 扯 d importantproblemsofconstfutfuction oflatin square and orthogonal latin squares （ most of
應用此演算法，我們成功地計算出難的三水平正交表本課題為國家重點基礎研究發展「九七三」規劃，國家「八六三」高技術發展計劃，高等學校博士學位點專項科研基金及中國科學院軟體研究所計算機科學開放研究實驗室課題基金資助項目1g一gs第四，應用擬物擬人方法嘗試求解古老而重要的拉丁方、正交拉丁方（它們事實上是正交表）問題。我們結合這些問題的特性，建立了新的物理模型，從理論上證明了這些物理模型的正確性，並設計出擬人化的「跳出局部極小值陷餅」的策略，得到了求解拉丁方、正交拉丁方的擬物擬人演算法。實驗表明， 」對某些問題演算法有好的效果。Uim - the unique identification mark - application requirements for very small items using matrix symbols
Uim .唯一識別標記.使用矩陣符號的極小項的應用要求In this paper, we discusse the stability of perturtation of m - p inverses of closed operator function and then the stability of least square solution of elliptic partial differential equations of second order with unbounded coefficients
本文討論了閉運算元的m - p廣義逆的擾動，並由此討論首項系數本質無界的二階散度型橢圓型微分方程的最小范數極小二乘解的穩定性Algorithms for the minimal polynomial and the inverse of a given block symmetric circulant matrix over a group algebra of a finite group over a field are presented. and a method of determining singularity of this block symmetric circulant matrix is given
?給出了求域上有限群的群代數上的塊循環矩陣的極小多項式的演算法，西安電子科技大學博士學位論文:多項式代數及其應用奇異性判別法及其逆矩陣的求法The aim of this paper is to study the applications of grobner bases in finding the minimal polynomial of a given matrix and its inverse if it is nonsingular and to discuss selfdualities over a polynomial ring
） bner基理論在求矩陣極小多項式，判定矩陣可逆性和求逆矩陣等方面的應用，並討論了多項式環的分次自對偶問題。For standard genetic algorithm has the defects of slowly converging and easily falling into local extremum ， the author designed and realized the adaptive multi - population parallel genetic algorithm ( ampga ) to solve the reliability allocation problem of large and complicated software systems. finally, we experimented on the comity center subsystem, delivery center subsystem and system management subsystem of the project : the jiangsu province postal logistics information system
針對標準遺傳演算法存在著收斂速度慢、易陷入局部極小值等缺點，本文設計並實現了自適應多種群并行遺傳演算法（ ampga ） ，來解決大型、復雜軟體系統的可靠性分配問題。最後，對「江蘇省郵政物流信息系統開發」項目中的「禮儀中心子系統」 、 「遞送中心子系統」及「系統管理子系統」進行了可靠性分配實驗。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
本文從兩個方面發展了這種熵正則化方法，即將其從極大極小問題推廣到一般不等式約束優化問題上和用一般函數代替熵函數作正則項，建立新的正則化方法。In this paper, based on wu ' s method and the estimation for maximal and minimal polynomials, we extend the real root isolation algorithm from univariant integral polynomial to multivariant integral polynomial systems. it gives the solutions of polynomial systems in the form of multi - dimensional boxes
我們利用吳方法和極大，極小多項式估計，推廣多項式實根分離演算法（ realrootisolation ）到多項式組的情形（ mrealrootisolation ） ，該演算法以空間中的矩形區域形式給出了多項式組的實解This algorithm improves confidence in se by estimating parameters and states at the same time. simulation results on test power systems which range in size from 4 to 118 buses, have shown the virtues as follows : getting unbiased estimation without detecting and identifying bad data in measurements ; solving state and parameter estimation for power system with good convergence and excellent robust property ; increasing the numbers of iterations a little bit with the test systems expanded ; estimating many transformer taps simultaneously and remaining the main state estimation ; keeping the estimated relative error within + 0. 1 % and processing efficiently equality constraints and ill condition with polynomial complexity
對ieee ? 4 118節點系統和廣西主網進行的模擬結果表明： l1范數估計具有不良數據拒絕特性，當量測量中存在不良數據時，該演算法在不經檢測和辨識不良數據情況下仍是無偏估計，具有良好收斂性，所需迭代次數隨著問題規模擴大而增長極小；能夠同時估計多個變壓器抽頭，並保持狀態估計主體；在滿足可觀測性條件下，估計的相對誤差保證在0 . 1以內；能夠有效處理等式約束和病態條件，並具有多項式時間性。4. a fast algorithm for computing the linear complexity and the minimal polynomial of a binary sequence with period t ? m is proposed, and generalized one for determining the linear complexity of a sequence with period pmqfl over gf ( q )
提出確定周期為2 ~ np ~ m的二元序列的線性復雜度和極小多項式的一個快速演算法，並推廣為計算gf （ q ）上周期為p ~ mq ~ n序列的線性復雜度和極小多項式的快速演算法。Maximum entropy method is an effective smoothing one for the finite min - max problem, which, by adding shannon ' s informational entropy as a regularizing term to the lagrangian function of min - max problem, yields a smooth function that uniformly approaches the non - smooth max - valued function
極大熵方法是解有限極大極小問題的一種有效光滑化法，它通過在極大極小問題的拉格朗日函數上引進shannon信息熵作正則項，給出一致逼近極大值函數的光滑函數。The high sensiti vity of the technique, the minimal sample preparation that it requires, and its suitability to remote measurements are generally concerned by scientific researchers. the focus of this paper will be on solid sample
這項技術所具有的潛在高靈敏度、對分析樣品具有極小的破壞性以及可用於遠程測量等特點，已引起人們的廣泛關注。Generally the events of interest are quite rare ( many orders of magnitude slower than the vibrational movements of the atoms ), and therefore direct simulations, tracking every movement of the atoms, would take thousands of years of computer calculations on the fastest present day computer before a single event of interest can be expected to occur, hence the name eon, which is an immeasurable period of time
某些我們感興趣的現象是非常罕見的（例如一些以極小的數量級速度運動的原子） ，所以用當前最為快速的計算機直接模擬、跟蹤一個可能每天僅僅只能唯一觀察到一次的我們期望它能運動的原子，需要花費成千上萬年的計算機處理時間，所以我們將我們的項目命名為eon ，它是一段不可計量的時間。5. a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period 2pfl over gf ( q ) is proposed, and a new algorithm for determining the linear complexity of a sequence with period pfl over gf ( p ? ) is introduced
提出一個計算gf （ q ）上周期為2p ~ n序列的線性復雜度和極小多項式的快速演算法；提出一個計算gf （ p ~ m ）上周期為p ~ n的序列的線性復雜度的新演算法。分享友人