|
|
(0,2) ²åÖµ||(0,2) interpolation 0#||zero-sharp; ¶Á×÷Áã¾®»òÁ㿪¡£ 0+||zero-dagger; ¶Á×÷ÁãÕý¡£ 1-Òò×Ó||1-factor 3-Á÷ÐÎ||3-manifold; Óֳơ°ÈýάÁ÷ÐΡ±¡£ AIC×¼Ôò||AIC criterion, Akaike information criterion Ap Ȩ||Ap-weight AÎȶ¨ÐÔ||A-stability, absolute stability A×îÓÅÉè¼Æ||A-optimal design BCH Âë||BCH code, Bose-Chaudhuri-Hocquenghem code BIC×¼Ôò||BIC criterion, Bayesian modification of the AIC BMOAº¯Êý||analytic function of bounded mean oscillation; È«³Æ¡°ÓÐ½çÆ½¾ùÕñ¶¯½âÎöº¯Êý¡±¡£ BMO÷±||BMO martingale BSD²ÂÏë||Birch and Swinnerton-Dyer conjecture; È«³Æ¡°²®ÆæÓë˹ÎÂÄɶ٣´÷¶û²ÂÏ롱¡£ BÑùÌõ||B-spline C*´úÊý||C*-algebra; ¶Á×÷¡°CÐÇ´úÊý¡±¡£ C0 ÀຯÊý||function of class C0; Óֳơ°Á¬Ðøº¯ÊýÀࡱ¡£ CAT×¼Ôò||CAT criterion, criterion for autoregressive CMÓò||CM field CN Ⱥ||CN-group CW ¸´ÐεÄͬµ÷||homology of CW complex CW¸´ÐÎ||CW complex CW¸´ÐεÄͬÂ×Ⱥ||homotopy group of CW complexes CWÆÊ·Ö||CW decomposition Cn ÀຯÊý||function of class Cn; Óֳơ°n´ÎÁ¬Ðø¿É΢º¯ÊýÀࡱ¡£ Cpͳ¼ÆÁ¿||Cp-statistic C¡£Àà°ëȺ||semi-group of class C¡£ C¡ÞÀຯÊý||function of class C¡Þ; Óֳơ°ÎÞÇî´ÎÁ¬Ðø¿É΢º¯ÊýÀࡱ¡£ C¦Ø ÀຯÊý||function of class C¦Ø; Óֳơ°Êµ½âÎöÀຯÊýÀࡱ¡£ DF¿Õ¼ä||(DF)-space; Ò»ÖÖ¿ÉÊýµÄÄâͰÐͿռ䡣 D×îÓÅÉè¼Æ||D-optimal design E×îÓÅÉè¼Æ||E-optimal design F ·Ö²¼||F-distribution, Fisher distribution F ¼ìÑé||F-test FPE×¼Ôò||FPE criterion, final prediction error criterion F¦Ò¼¯||F¦Ò set G µÈ¼Û̬Éä||G-equivalent morphism G¦Ä¼¯||G¦Ä set G½á¹¹||G-structure G×îÓÅÉè¼Æ||G-optimal design H'¿Õ¼ä||H'-space Homº¯×Ó||Hom functor Hp ¿Õ¼ä||Hp-space; Óֳơ°¹þ´ú¿Õ¼ä¡±¡£ Hp÷±||Hp-martingale H¿Õ¼ä||H-space I½øÍØÆË||I-adic topology K Äâ¹²ÐÎÓ³Éä||K-quasi-conformal mapping KAMÀíÂÛ||Kolmogorov-Arnold-Moser theory KC ·½³Ì||Kolmogorov-Chapman equation; È«³Æ¡°¿Æ¶ûΏêÂÞ·ò£²éÆÕÂü·½³Ì¡±¡£ KdV·½³Ì||KdV equation, Korteweg-de Vries equation L p ¿Õ¼ä||L p-space L ¹À¼Æ||L-estimator LF ¿Õ¼ä||(LF)-space; ¸¥À×Ъ¿Õ¼äÐòÁеÄÑϸñ¹éÄɼ«ÏÞ¡£ LR ·½·¨||LR method LSÁÙ½çµã||LS critical point LSÁÙ½çÖµ||LS critical value M ¹À¼Æ||M-estimator NP ÎÊÌâ||NP problem PI´úÊý||algebra with polynomial identities, PI-algebra PRD ¸ñʽ||Peaceman-Rachford-Douglas scheme; È«³Æ¡°Æ¤Ë¹Âü£Àʲ¸£µÂ£µÀ¸ñÀ˹¸ñʽ¡±¡£ Pº¯Êý||P-function P»ù||P-basis Q ¹ý³Ì||Q-process Q ¾ØÕó||Q-matrix QR ·½·¨||QR method QR ·Ö½â||QR decomposition R ¹À¼Æ||R-estimator R Ä£·¶³ë||category of R-modules R-S Âë||Reed-Solomon code RSAÌåÖÆ||RSA system, Rivest-Shamir-Adelman system SLÎÊÌâ||Sturm-Liouville boundary problem; È«³Æ¡°Ê©Í¼Ä·-Áõά¶û±ßÖµÎÊÌ⡱¡£ S¸ÅÐÎ||S-scheme S̬Éä||S-morphism T0¿Õ¼ä||T0 space T1 ¿Õ¼ä||T1 space T2 ¿Õ¼ä||T2 space T2 ÍØÆË¿Õ¼äµÄ»ù±¾Èº||fundamental group of T2 topological space T2 ÍØÆËȺ||T2 -topological group; Óֳơ°ºÀ˹¶à·òÍØÆËȺ(Hausdorff topological group)¡±¡£ T2 ÍØÆËȺµÄÍêÈ«»¯||completion of T2 -topological group U ¹À¼Æ||U-estimator [°ÍÄúÕ*´úÊýµÄ]*±íʾ||*-representation [of Banach *-algebra ] [°ÍÄúմúÊýµÄ]±íʾ||representation [of Banach algebra] [³É]¶Ô·Ö²¼·½·¨||pairs distribution method [³Ë]ÃÝ·¨||power method [´ú]Âë||code [¶¥]µã¶ÀÁ¢Êý||vertex independent number [¶¥]µã¸²¸Ç||vertex cover [¶¥]µã¸²¸ÇÊý||vertex cover number [¶¥]µãÁ¬Í¨¶È||vertex connectivity [·ÇÏßÐÔ]¸¥À׵»ôÄ·Ëã×Ó||[non-linear] Fredholm operator [·ÇÏßÐÔ]½ôËã×Ó||[non-linear] compact operator [·ÇÏßÐÔ]È«Á¬ÐøËã×Ó||[non-linear] completely continuous operator [¸³·¶»·ÔªµÄ]Æ×||spectrum [of element in normed ring] [¸ß˹-]ÈüµÂ¶ûµü´ú[·¨]||[Gauss-]Seidel iteration [¹Ì]¶¨²½³¤||fixed step size [¹ì]¼£||trail [»ý·Ö±ä»»µÄ]ºË||kernel of integral transform [¼¯]°ë»·||semi-ring of sets [½»»»°ÍÄúմúÊýµÄ]¸ù||radical [of commutative Banach algebra ] [¿É]±ä²½³¤||variable step size [ÁãÔªµÄ]»ù±¾ÁÚÓòϵ||fundamental system of neighborhoods of zero element [Ê©Íß×È]¹ãÒ庯Êý||[Schwartz] generalized function, distribution [Êýѧ]ÆÚÍû||[mathematical] expectation [˳]Ðò¼«ÏÞ||order limit [˳]ÐòÊÕÁ²ÐÔ||order convergence [ͳ¼Æ]¾ö²ßº¯Êý||statistical decision function [ÎÞÇîС]Éú³ÉÔª||infinitesimal generator [Ñù±¾]¹ìµÀ||path, trajectory [ÓÐÏÞ]²î·Ö||difference, finite difference [Õý]·½ÐÎÍø¸ñ||square net, square mesh [×Ô]ÊÊÓ¦»ý·Ö||[self-]adaptive integration [×Ô]ÊÊӦϵͳ||adaptive system d Ⱥ||d-group dÖØÇ¶Èë||d-uple imbedding k·Öͼ||k-nary graph kÖØ»ìºÏÌõ¼þ||k-fold mixing condition l p ¿Õ¼ä||l p-space l ½ø±íʾ||l-adic representation l½øÉÏͬµ÷||l-adic cohomology n ²½¾ö²ß||n-stage decision n ´Î¿Õ¼äÇúÏß||space curve of order n n Á¬Í¨[µÄ]||n-connected n È˳£ºÍ¶Ô²ß||n-person constant-sum game n È˶Բß||n-person game n È˺Ï×÷¶Ô²ß||n-person cooperative game n ÈËÁãºÍ¶Ô²ß||n-person zero-sum game n ÈËÒ»°ãºÍ¶Ô²ß||n-person general sum game n´Î΢·Ö[ÐÎ]ʽ||n-form; ¼ò³Æ¡°nÐÎʽ¡±¡£ nµ¥¿Õ¼ä||n-simple space nÁ¢·½Í¼||n-cube nÔªÔËËã||n-ary operation nÔª×é||n-tuple p ³õµÈȺ||p-elementary group p ¹²éîÔª||p-conjugate element p ½ø±íʾ||p-adic representation p ½øÀîȺ||p-adic Lie group p ¿é||p-block p Ⱥ||p-group p ÕýÔòÔª||p-regular element p½ø L º¯Êý||p-adic L-function p½ø¾ø¶ÔÖµ||p-adic absolute value p½øÄ£ÐÎʽ||p-adic modular form p½øÊý||p-adic number p½øÊýÓò||p-adic number field p½øÐÎʽȺ||p-adic formal group p½øÕûÊý||p-adic integer qÕ¹¿ªÊ½||q-expansion formula r ÖØ´«µÝȺ||r-fold transitive group r½×ƽ¾ùÊÕÁ²||convergence in mean of order r s»¡´«µÝͼ||s-arc transitive graph t ·Ö²¼||t-distribution, student distribution t ¼ìÑé||t-test u ¼ìÑé||u-test ¡°0.618¡±·¨||¡°0.618¡± method; Óֳơ°½üËÆ»Æ½ð·Ö¸î·¨(approximate golden section method)¡±¡£ £Û±í´ï£Ýʽ||expression £Û´úÊý£Ý´Ø||[algebraic] variety £Ûµ¥ÐεģÝÃæ||face of simplex £Ûµ¥ÐεģÝ;̾||proper face of a simplex £Û·Ö£ÝÖ§µã||branching point, ramification point £Û¼¯ºÏ£Ýָʾº¯Êý||indicator [of a set] £ÛÇú£ÝÃæ»ý·Ö||surface integral £ÛÊ®½ø£ÝСÊý||decimal £ÛË«±ß£ÝÀíÏë||[two-sided] ideal £Ûѣݻ·ÅÅÁÐ||circular permutation £ÛÑÇ´¿º¯ÊýµÄ£ÝÌØÕ÷º¯Êý||characteristic function [of meromorphic function] £ÛÔö³¤£Ý¼¶||growth order £ÛÕûº¯ÊýµÄ£Ý¿÷¸ñ||genus [of entire function] £ÛÕûº¯ÊýµÄ£ÝÐÍ||type [of entire function] £Û×ø±ê£Ý¿¨||chart ¦£·Ö²¼||¦£-distribution, gamma-distribution ¦£º¯Êý||gamma-function; Óֳơ°µÚ¶þÀàÅ·À»ý·Ö (Euler integral of the second kind)¡±¡£ ¦¸Îȶ¨ÐÔ||¦¸-stability, omega-stability ¦ÁµÝ¹éÐÔ||¦Á-recursion, alpha-recursion ¦Á¼«ÏÞµã||¦Á-limit point, alpha-limit point; Óֳơ°¸ºÏò¼«Ï޵㡱¡£ ¦Á¼«ÏÞ¼¯ºÏ||¦Á-limit set, alpha-limit set ¦ÁÈÝÁ¿||¦Á-capacity, alpha-capacity; ¹ØÓÚͨÐÅÐŵÀµÄÒ»ÖÖ»ùÓÚ¦ÁìØµÄÈÝÁ¿¡£ ¦ÁÉϵ÷ºÍº¯Êý||¦Á-superharmonic function, alpha-superharmonic function ¦ÁÐÞÏ÷ƽ¾ù||¦Á-trimmed mean, alpha-trimmed mean ¦ÁÓÐÏÞ||¦Á-finite, alpha-finite ¦Â·Ö²¼||¦Â-distribution, beta-distribution ¦Âº¯Êý||¦Â-function, beta-function; Óֳơ°µÚÒ»ÀàÅ·À»ý·Ö (Euler integral of the first kind)¡±¡£ ¦Ä-ŵÒÁÂüÎÊÌâ||¦Ä-Neumann problem, delta-Neumann problem ¦Ä²â¶È||¦Ä-measure, delta-measure ¦ÄÉ¢Éä·½·¨||¦Ä-scattering method, delta-scattering method ¦ÅËã·¨||¦Å-algorithm, epsilon-algorithm ¦Å×îÓŲßÂÔ||¦Å-optimal policy, epsilon-optimal policy ¦ÅìØ||¦Å-entropy, epsilon-entropy ¦Æ·Ö²¼||¦Æ-distribution, zeta-distribution ¦ÇËã·¨||¦Ç-algorithm, eta-algorithm ¦Èº¯Êý||¦È-function, theta-function ¦Ë¿É¶¨Ò庯Êý||¦Ë-definable function, lambda-definable function ¦Ëϵ||¦Ë-system, lambda-system ¦ËÑÝËã||¦Ë-calculus, lambda-calculus ¦ËÒýÀí||¦Ë-lemma, lambda-lemma ¦Ì¼¸ºõ´¦´¦||¦Ì-almost everywhere, mu-almost everywhere ¦ÌËã×Ó||¦Ì-operator, mu-operator ¦ÌÓ³Éä||¦Ì-mapping, mu-mapping ¦Ð¿É½âȺ||¦Ð-solvable group, pi-solvable group ¦Ðϵ||¦Ð-system, pi-system ¦Òº¯Êý||¦Ò-function, sigma-function ¦Ò»·||¦Ò-ring, sigma-ring ¦Ò¾Ö²¿ÓÐÏÞ×å||¦Ò-locally finite family, sigma-locally finite family ¦ÒÀëÉ¢×å||¦Ò-discrete family, sigma-discrete family ¦ÒÍ걸||¦Ò-complete, sigma-complete ¦ÒÓÐÏÞ²â¶È¿Õ¼ä||¦Ò-finite measure space ¦ÒÓò||¦Ò-field, sigma-field; Óֳơ°¦Ò´úÊý(¦Ò-algebra)¡±¡£ ¦ÒÓòÁ÷||filtration; ËæÖ¸±êÔö¼Ó¶øÔö´óµÄ×Ó¦ÒÓò×å¡£ ¦Óǰ¦ÒÓò||¦Ò-field prior to ¦Ó, sigma-field prior to ¦Ó ¦ÕϽµ·¨||¦Õ-descent, phi-descent ¦Ö2 ·Ö²¼||chi-square distribution ¦Ö2 ¼ìÑé||chi-square test ¦Ø¼«ÏÞµã||¦Ø-limit point, omega-limit point; Óֳơ°ÕýÏò¼«Ï޵㡱¡£ ¦Ø¼«ÏÞ¼¯ºÏ||¦Ø-limit set, omega-limit set ¦ØÏàÈÝÐÔ||¦Ø-consistency, omega-consistency; ÔøÓÃÃû¡°¦ØÐµ÷ÐÔ¡±£¬¡°¦ØºÍг¡±¡£ °¢±´¶û±ä»»||Abel transformation °¢±´¶û±éÀú¶¨Àí||Abel ergodic theorem °¢±´¶û´Ø||Abelian variety °¢±´¶û´ØµÄpÖÈ||p-rank of Abelian variety °¢±´¶û´ØµÄ¼«»¯||polarization of an Abelian variety °¢±´¶û·¶³ë||Abelian category °¢±´¶û¸ÅÐÎ||Abelian scheme °¢±´¶ûº¯Êý||Abelian function °¢±´¶ûº¯ÊýÓò||Abelian function field °¢±´¶û»¯º¯×Ó||abelianizing functor °¢±´¶û»ý·Ö||Abelian integral °¢±´¶û»ý·Ö·½³Ì||Abel integral equation °¢±´¶û¾§Ìå||Abelian crystal °¢±´¶ûÀ©ÕÅ||Abelian extension °¢±´¶ûÀî´úÊý||Abelian Lie algebra °¢±´¶ûÇóºÍ£Û·¨£Ý||Abel summation [method] °¢±´¶ûȺ||Abelian group; Óֳơ°½»»»Èº (commutative group)¡±¡£ °¢±´¶ûȺ²ã||sheaf of Abelian groups °¢±´¶ûȺ·¶³ë||category of Abelian groups °¢±´¶û΢·Ö||Abelian differential °¢±´¶ûÎÊÌâ||Abel problem °¢´ïÂíµ¼Êý||Hadamard derivative °¢´ïÂí·¨||Hadamard method °¢´ïÂí¾ØÕó||Hadamard matrix °¢´ïÂíÉè¼Æ||Hadamard block design °¢´ú¶û||ad¨¦le °¢´ú¶û»·||ad¨¦le ring °¢´ú¶ûȺ||ad¨¦le group °¢¶û°ÍÄÚÈû´Ø||Albanese variety °¢»ùÃ׵¹«Àí||Archimedean axiom °¢»ùÃ׵¾ø¶ÔÖµ||Archimedean absolute value °¢»ùÃ×µÂÐòÓò||Archimedean ordered field °¢ÅµË÷·ò΢·ÖͬÅß||Anosov diffeomorphism °¢ÅµË÷·òÏòÁ¿³¡||Anosov vector field °¢Åå¶û¶þ±äÁ¿³¬¼¸ºÎº¯Êý||Appell hypergeometric function of two variables °¢Í¢Lº¯Êý||Artin L-function °¢Í¢¸ùÊý||Artin root number °¢Í¢»·||Artinian ring °¢Í¢Ä£||Artinian module °¢Í¢Ó³Éä||Artin map °£¶ûÀÊ·Ö²¼||Erlang distribution °£¶ûÃ×ÌØ-¸ß˹Çó»ý||Hermite-Gauss quadrature °£¶ûÃ×ÌØ±ä»»||Hermitian transformation °£¶ûÃ×ÌØ²åÖµ||Hermite interpolation °£¶ûÃ×ÌØ¶àÏîʽ||Hermite polynomial °£¶ûÃ×ÌØ¶þ´ÎÐÍ||Hermitian quadratic form °£¶ûÃ×ÌØ·ºº¯||Hermitian functional °£¶ûÃ×ÌØ¾ØÕó||Hermitian matrix °£¶ûÃ×ÌØÇó»ý||Hermite quadrature °£¶ûÃ×ÌØÎ¢·Ö·½³Ì||Hermite differential equation °£¶ûÃ×ÌØÐͺË||Hermitian kernel °£ÀÍÐÉ«Äáɸ·¨||sieve of Eratosthenes °¬´ï¶û||etale °¬´ï¶û¸²µþ||etale covering °¬´ï¶ûÉÏͬµ÷||etale cohomology °¬´ï¶û̬Éä||etale morphism °¬Àï΢·Ö·½³Ì||Airy differential equation °¬É˹̹¶àÏîʽ||Eisenstein polynomial °¬É˹̹¼¶Êý||Eisenstein series °¬Ìؿϡ÷2 ·¨||Aitken ¡÷2 method, Aitken ¡÷2 process °¬ÌؿϲåÖµËã·¨||Aitken interpolation algorithm °®Òò˹̹·½³Ì||Einstein equation °°µã||saddle point; ³£Î¢·Ö·½³Ì×éµÄÒ»ÖÖ¹ÂÁ¢Ææµã¡£ °°µã¶¨Àí||saddle point theorem °°µã¶Ô²ß||saddle point game °°º¯Êý||saddle-function °°º¯ÊýµÄ°¼±Õ°ü||concave closure of saddle function °°º¯ÊýµÄ͹±Õ°ü||convex closure of saddle function °°ÐηֽçÏß»·||saddle separatrix °°ÐÎÁ¬½Ó||saddle connection °´¶ÔƽºâÇø×éÉè¼Æ||pairwise balanced block design °´ÄêÁä¸ü»»²ßÂÔ||age replacement policy °¼£ÛÐÔ£Ý||concavity °¼¶à±ßÐÎ||concave polygon °¼¶àÃæÌå||concave polyhedron °¼¹æ»®||concave programming °¼º¯Êý||concave function °¼Ëã×Ó||concave operator; Ö¸ÔÚ¾ßÕý×¶µÄ°ÍÄúտռäÖС£ °¼Í¹£Û¶þÔª£Ýº¯Êý||concave-convex function °¼Í¹º¯ÊýµÄÉϱհü||superclosure of concave-convex function °¼Í¹º¯ÊýµÄϱհü||lower closure of concave-convex function °Â-¸ß¹«Ê½||Ostrovski-Gauss formula °Â¶÷˹̹-ÎÚÂ×±´¿Ë¹ý³Ì||Ornstein-Uhlenbeck process °Â¶÷˹̹-ÎÚÂ×±´¿ËËã×Ó||Ornstein-Uhlenbeck operator °Â¶÷˹̹-ÎÚÂ×±´¿ËËã×Ó°ëȺ||Ornstein-Uhlenbeck semi-group of operators °Â¶ûÀûÆæ¿Õ¼ä||Orlicz space °Â˹¹ÅµÂΨһÐÔÌõ¼þ||Osgood uniqueness condition °Ë±ßÐÎ||octagon °ËÃæÌå||octahedron °Í¶÷˹¹ãÒ峬¼¸ºÎº¯Êý||Barnes extended hypergeometric function °Í¹þ¶Å¶û½¥½üЧÂÊ||Bahadur asymptotic efficiency °Í¹þ¶Å¶ûЧÂÊ||Bahadur efficiency °ÍÄúÕ*´úÊý||Banach*- algebra; ¶Á×÷¡°°ÍÄúÕÐÇ´úÊý¡±¡£ °ÍÄúմúÊý||Banach algebra °ÍÄúոñ||Banach lattice °ÍÄúտռä||Banach space °ÍÄúÕÁ÷ÐÎ||Banach manifold °ÍË÷µÙ-Ì©ÌØÈº||Barsotti-Tate group °ÍËþÇ¡ÀïÑÇϽç||Bhattacharyya lower bound °×¶û¸ù||Baer radical °×ÔëÉù||white noise °Ù·Ö·¨||percentage °Ù·ÖÂÊ||percent °Ù·ÖÎó²î||percentage error °ÚÏß||cycloid °à||class °éËæ±íʾ||adjoint representation °éËæº¯×Ó||adjoint functors °éËæºË||adjoint kernel °éËæ¾ØÕó||adjoint matrix °éËæÀî´úÊý||adjoint Lie algebra °éËæÃÉÌØ¿¨ÂÞ·½·¨||adjoint Monte Carlo method °éËæÈ¨ÖØ·½·¨||adjoint weight method °éËæËã×Ó||adjoint operator °éËæÍ³¼Æ¹À¼Æ·½·¨||adjoint statistical estimation method °éËæÎ¢·Ö·½³Ì||adjoint differential equation °éËæÎ¢·ÖËã×Ó||adjoint differential operator °éËæÏßÐÔÓ³Éä||adjoint linear map °éËæÐÐÁÐʽ||adjoint determinant °éËæÖ¸Êý±ä»»·½·¨||adjoint exponential transformation method °ê||section °ë±¾Ô»·||semi-primitive ring °ë²»±äÁ¿||semi-invariant, cumulant; ÌØÕ÷º¯Êý¶ÔÊýµÄÃݼ¶ÊýÕ¹¿ªÊ½ÖеÄϵÊý¡£ °ë²ÎÊýÄ£ÐÍ||semi-parameter model °ëµ¥[¸³·¶]»·||semi-simple [normed] ring °ëµ¥´¿¸´ÐÎ||semi-simplicial complex °ëµ¥´¿Ó³Éä||semi-simplicial mapping °ëµ¥´Ø||semi-simple variety °ëµ¥´úÊý||semi-simple algebra °ëµ¥´úÊýȺ||semi-simple algebraic group °ëµ¥·º´úÊý||semi-simple universal algebra °ëµ¥»·||semi-simple ring °ëµ¥Àî´úÊý||semi-simple Lie algebra °ëµ¥Àî´úÊýµÄ¸ùϵ||root system of a semi-simple Lie algebra °ëµ¥Àî´úÊýµÄÉÏͬµ÷||cohomology of semi-simple Lie algebras °ëµ¥ÀîȺ||semi-simple Lie group °ëµ¥Ä£||semi-simple module °ëµ¥Èô¶ûµ±´úÊý||semi-simple Jordan algebra °ëµ¥ÏßÐԱ任||semi-simple linear transformation °ëµ¥Ôª||semi-simple element °ëµ¥ÖÈ||semi-simple rank °ëµü´ú·¨||semi-iterative method °ë¶¨¾ØÕó||semi-definite matrix °ë·¶Êý||semi-norm °ë¸¥À׵»ôÄ·Ëã×Ó||semi-Fredholm operator °ë¸ñ||semi-lattice °ë½Ç¹«Ê½||half angle formula °ë½âÎöÃÉÌØ¿¨ÂÞ·½·¨||semi-analytic Monte Carlo method °ë¾¶||radius °ë¾Ö²¿µ¥Á¬Í¨[µÄ]||semi-locally simply connected °ë¾Ö²¿»·||semi-local ring °ëÀëÉ¢·¨||semi-discrete method °ëÁ¬Ðø[µÄ]||semi-continuous °ëÁ¬ÐøÐÔ||semi-continuity °ëÁ÷||semi-flow °ëÄ£¸ñ||semi-modular lattice °ëÄÚ»ý||semi-inner product; Óֳơ°°ë±êÁ¿»ý (semi-scalar product)¡±¡£ °ëÆ½Ãæ||half plane °ëÇòÃæ||semi-sphere °ëȺ||semi-group °ëȺ»·||semi-group ring °ëȺÈŶ¯||perturbation of semi-group °ëË«ÏßÐÔ·ºº¯||semi-bilinear functional, sesquilinear functional °ëË«ÏßÐÔÐÍ||semi-bilinear form, sesquilinear form °ëË«ÏßÐÔÐ͵Ä×Ôͬ¹¹||automorphism of a sesquilinear form °ëËØ»·||semi-prime ring °ëÍêÂú»·||semi-perfect ring °ëÎȶ¨¼«ÏÞ»·||semi-stable limit-cycle °ëÎÞÏ޹滮||semi-infinite programming °ëÏßÐÔÆ«Î¢·Ö·½³Ì||semi-linear partial differential equation °ëÏßÐÔͬ¹¹||semi-linear isomorphism °ëÏßÐÔÓ³Éä||semi-linear mapping °ëÑù±¾||semi-sample °ëÒþ¸ñʽ||semi-implicit scheme °ëÓò||semi-field °ëÔ²||semi-circle °ëÕûÊýȨģÐÎʽ||modular form of half-integer weight °ëÕý¹æËã×Ó||semi-normal operator °ëÖ±»ý||semi-direct product °ë×¼ËØ»·||semi-primary ring °ë×Ô·´¾Ö²¿Í¹¿Õ¼ä||semi-reflexive locally convex space °ë÷±||semi-martingale °öÏß||conchoid °ûÇ»||cell °ûÇ»±Æ½ü||cellular approximation °ûÇ»¸´ÐÎ||cell complex °ûÇ»¿Õ¼ä||cellular space °ûÇ»ÆÊ·Ö||cell decomposition °ûÇ»ÉÏͬµ÷Ⱥ||cell cohomology group °ûǻʽӳÉä||cellular mapping °ûǻͬµ÷Ⱥ||cellular homology group °ûǻͬÂ×||cellular homotopy °üº¬||inclusion, include °üº¬º¯×Ó||inclusion functor °üºËÍØÆË||hull kernel topology °üÂç´úÊý||enveloping algebra °üÂ繦Чº¯Êý||envelope power function ±¡¼¯||thin set ±£²¢Í¬Ì¬||join-preserving homomorphism ±£²â±ä»»||measure-preserving transformation ±£µ¥µ÷²î·Ö¸ñʽ||monotonicity preserving difference scheme ±£¹Ü·Ñ||holding cost ±£»¤Êýλ||guarding figure, guarding digit ±£»ýº¯×Ó||product-preserving functor ±£ÃÜÁ¿||amount of secrecy ±£ÃÜÌåÖÆ||privacy system ±£ÃÜѧ||cryptology ±£Ãæ»ýÓ³Éä||area-preserving mapping ±£ÊصÄ||conservative ±£ÊØËã×Ó||conservative operator ±£ÊØÎ¢·Ö·½³Ì||conservative differential equation ±£Ðòº¯Êý||order-preserving function ±£ÐòÓ³Éä||order-preserving mapping ±£×¶Ëã×Ó||cone-preserving operator ±¥ºÍÀà||saturation class ±¥ºÍÄ£ÐÍ||saturated model ±¨³êº¯Êý||reward function ±©Â¶µã||exposed point ±©Â¶·½Ïò||exposed direction ±©Â¶Ãæ||exposed face ±©Â¶ÉäÏß||exposed ray ±«¶ûË«µü´ú[·¨]||Bauer bi-iteration ±«Íþ¶û·¨||Powell method ±¬Õ¨Ê±||explosion time ±³°ü¹«Ô¿ÌåÖÆ||knapsack public key system ±´µÙÊý||Betti number ±´¶ûº¯Êý||Baire functions ±´¶û¿Õ¼ä||Baire space ±´¶û˹¿Õ¼ä||Bers space ±´¶û˹Íеü´ú·¨||Bairstow iteration method ±´¶ûÌØÀÃ×·½³Ì||Beltrami equation ±´¿Ë-¿²±´¶û-ºÀ˹¶à·ò¹«Ê½||Baker-Cambell-Hausdorff formula ±´¿Ë¡±ä»»||Backlund transformation ±´Èû¶û²»µÈʽ||Bessel inequality ±´Èû¶û»ý·Ö||Bessel integral ±´Èû¶û΢·Ö·½³Ì||Bessel differential equation ±´Ò¶Ë¹·ÖÀà¹æÔò||Bayes classification rule ±´Ò¶Ë¹·çÏÕ||Bayes risk ±´Ò¶Ë¹¹«Ê½||Bayes formula ±´Ò¶Ë¹¹À¼Æ||Bayes estimate ±´Ò¶Ë¹¾ö²ßº¯Êý||Bayes decision function ±´Ò¶Ë¹Çø¼ä¹À¼Æ||Bayes interval estimate ±´Ò¶Ë¹Í³¼Æ||Bayes statistics ±´Ò¶Ë¹Ðò¹á¾ö²ßº¯Êý||Bayes sequential decision function ±¶½Ç¹«Ê½||double angle formula ±¶Á¢·½£ÛÎÊÌâ£Ý||duplication of a cube ±¶Ê½||multiple ±¶Êý||multiple ±¶Í¼||double graph ±¸Ôñ¼ÙÉè||alternative hypothesis ±»±Æ½üº¯Êý||approximated function ±»³ËÊý||multiplicand ±»³ýÊý||dividend ±»»ýº¯Êý||integrand ±»¼ÓÊý||summand ±»¼õÊý||minuend ±»¿ª·½Êý||radicand ±¾Ôª||urelement ±¾Ô¶àÏîʽ||primitive polynomial ±¾Ô»·||primitive ring ±¾ÔÀíÏë||primitive ideal ±¾ÔÃݵÈÔª||primitive idempotent element ±¾ÔȺ||primitive group ±¾ÔÌØÕ÷£Û±ê£Ý||primitive character ±¾ÔÔª||primitive element ±¾Õ÷¿Õ¼ä||eigenspace ±¾Õ÷ÏòÁ¿||eigenvector ±¾Õ÷ÏòÁ¿Õ¹¿ªÊ½||eigenvector expansion ±¾Õ÷Öµ||eigenvalue ±¾Õ÷ÖµµÄÖ¸±ê||index of eigenvalues ±¾Õ÷ÖµÎÊÌâ||eigenvalue problem ±¾Öʲ»Õñµ´||essentially non-oscillatory, ENO ±¾Öʵ¥Í¬Ì¬||essential monomorphism ±¾ÖʶԲß||essential game; Óֳơ°ÊµÖÊÐԶԲߡ±¡£ ±¾ÖÊÆ×||essential spectrum ±¾ÖÊÆæµã||essential singular point ±¾ÖÊÉÏÈ·½ç||essential supremum, ess.sup ±¾ÖÊÍêÈ«Àà||essentially complete class ±¾ÖÊÑϸñ͹||essentially strictly convex ±¾ÖÊÓнç[µÄ]||essentially bounded ±¾ÖÊ×Ô°éËã×Ó||essentially self-adjoint operator ±ÀÀ£µã||break down point ±Æ½ü||approximation ±Æ½üº¯Êý||approximating function ±Æ½ü½×||degree of approximation ±Æ½üÂÛ||approximation theory ±Æ½üʽ||approximant ±Æ½üÎó²î||approximation error ±Æ½üÕýÔòÓ³Éä||approximating proper mapping ±È||ratio ±È°²»ùºãµÈʽ||Bianchi identities ±È²®°ÍºÕ²ÂÏë||Bieberbach conjecture ±È²ì½Ý-À·òÁ¬¼¾Ò®·ò·½³Ì||Bitsadze-Lavrentiev equation ±È¹À¼Æ||ratio estimate ±È½Ï¶¨Àí||comparison theorem ±ÈÀý-»ý·Ö-΢·Ö¿ØÖÆ||proportional-integral-derivative control; ¼ò³Æ¡°PID¿ØÖÆ (PID control)¡±¡£ ±ÈÀý||proportion ±ÈÀý³£Êý||constant of proportionality ±ÈÀý¿ØÖÆ||proportional control ±ÈÀýÄÚÏî||internal terms of proportion ±ÈÀýÍâÏî||extreme terms of proportion ±ÈÀýÖÐÏî||mean term of proportion ±ÈÂʱéÀú¶¨Àí||ratio-ergodic theorem ±ÈÄ·-ÎÖÃ÷¸ñʽ||Beam-Warming scheme ±ÈÄÚ¹«Ê½||Binet formula ±ÈÌØ||bit; ÐÅÏ¢¶ÈÁ¿µÄµ¥Î»¡£ ±ËµÃÂÞ·ò˹»ùË«ÇúÐÔ||Petrowsky hyperbolicity ±ËµÃËÉÄÚ»ý||Peterson inner product ±ËµÃËÉͼ||Peterson graph ±Ï´ï¸çÀ˹Óò||Pythagorean field ±Õ°ü||closure ±Õ°üÓÐÏÞ||closure finite ±Õ°üÔËËã||closure operation ±Õ²âµØÏß||closed geodesic ±Õ¸²¸Ç||closed covering ±Õ¹«Ê½||closed formula ±Õ¹ìµÀ||closed orbit ±Õ»·¿ØÖÆ||closed-loop control ±Õ»·ÏµÍ³||closed-loop system ±Õ¼¯||closed set ±Õ¼¯»ù||closed set basis ±Õ½þÈë||closed immersion ±ÕÁ´||cycle ±ÕÁ÷ÐÎ||closed manifold ±Õ·||closed path, loop ±Õ·¿Õ¼ä||loop space, closed path space ±ÕÂË×Ó||closed filter ±ÕÇø¼ä||closed interval ±ÕÇúÃæ||closed surface ±ÕÇúÏß||closed curve ±ÕËã×Ó||closed operator ±Õ͹º¯Êý||closed convex function ±ÕͼÏó¶¨Àí||closed graph theorem ±Õ΢·Ö[ÐÎ]ʽ||closed differential ±ÕÐÇÐÎ||closed star ±ÕÐÍ»ý·Ö¹«Ê½||closed integration formula ±ÕÓ³Éä||closed mapping ±ÕÓò||closed domain ±Õ×Ó¸ÅÐÎ||closed subscheme ±Õ×Ó¼¯µÄ³ëÊý||category of a closed subset ±Õ×ÓÀîȺ||closed Lie subgroup ±Õ×ÓÁ÷ÐÎ||closed submanifold ±Õ×ÓȺ||closed subgroup ±ØÈ»Ê¼þ||certain event ±ØÒªÌõ¼þ||necessary condition ±ß||edge, line; side ±ß´«µÝͼ||edge-transitive graph ±ß¶ÀÁ¢Êý||edge independent number ±ß¶Ô³Æ||edge symmetry ±ß¸²¸Ç||edge cover ±ß¸²¸ÇÊý||edge covering number ±ß½ç±íÏÖ||boundary behavior ±ß½çµã||frontier point, boundary point ±ß½ç¶ÔÓ¦||boundary correspondence ±ß½ç¹À¼Æ||boundary estimate ±ß½ç»ý·Ö·¨||boundary integral method ±ß½ç½áµã||boundary node ±ß½ç¿ØÖÆ||boundary control ±ß½çÇúÏß||boundary curve ±ß½çÌõ¼þ×ªÒÆ||transfer of frontier conditions ±ß½çÐÍ»ý·Ö¹«Ê½||integration formula of boundary type ±ß½çÔª||boundary element ±ß½çÔª·¨||boundary element method ±ßÁ¬Í¨¶È||edge-connectivity ±ßÉ«Êý||edge chromatic number ±ßͼ||edge graph ±ßÐľà||apothem ±ßÐÅÏ¢||side information ±ßÔµ||boundary ±ßÔµ·Ö²¼||marginal distribution ±ßÔµ¼¯||border set ±ßÔµÁ´||boundary chain ±ßÔµËÆÈ»º¯Êý||marginal likelihood function ±ßԵ̬ͬ||boundary homomorphism ±ßÔµÔËËã||boundary operation ±ßÖµÌõ¼þ||boundary value condition ±ßÖµÎÊÌâ||boundary value problem ±ß×Óͼ||edge-subgraph ±àÂë[µÄ]Êý¾Ý||coded data ±àÂë||coding ±àÂ붨Àí||coding theorem ±àÂëÀíÂÛ||coding theory ±àÂëÆ÷||coder ±àÂëÔöÒæ||coding gain ±â·å[µÄ]||platykurtic ±ä³¤Âë||variable length code ±ä³ß¶È£ÛËã£Ý·¨||variable metric algorithm ±ä¶ÈÁ¿·¨||variable metric method ±ä·Ö||variation ±ä·Ö²»µÈ·½³Ì||variational inequation ±ä·Ö²»µÈʽ||variational inequality ±ä·Öµ¼Êý||variational derivative ±ä·Ö·¨||calculus of variations; Óֳơ°±ä·Öѧ¡±¡£ ±ä·Ö·½³Ì||variational equation, equation of variation ±ä·Ö·½·¨||variational method ±ä·ÖÎÊÌâ||variational problem ±ä·ÖÔÀí||variational principle ±äº¯Êý||argument function ±ä»»Èº||transformation group ±ä½á¹¹¿ØÖÆ||variable structure control ±ä½á¹¹¿ØÖÆÏµÍ³||variable structure control system ±äÁ¿||variable ±äÁ¿±ä»»||change of variable ±äÁ¿·ÖÀë·½³Ì||equation of separated variables ±äϵÊýÏßÐÔÆ«Î¢·Ö·½³Ì||linear partial differential equation with variable coefficients ±äÐεڶþÀà±´Èû¶ûº¯Êý||modified Bessel function of the second kind ±äÐεڶþÀàÂíµÙ¶òº¯Êý||modified Mathieu function of the second kind ±äÐεÚÈýÀà±´Èû¶ûº¯Êý||modified Bessel function of the third kind ±äÐεÚÈýÀàÂíµÙ¶òº¯Êý||modified Mathieu function of the third kind ±äÐεÚÒ»Àà±´Èû¶ûº¯Êý||modified Bessel function of the first kind ±äÐεÚÒ»ÀàÂíµÙ¶òº¯Êý||modified Mathieu function of the first kind ±äÐÎÂíµÙ¶ò·½³Ì||modified Mathieu equation ±äÐÎÂíµÙ¶òº¯Êý||modified Mathieu function ±äÐÎÅ£¶Ù·¨||modified Newton method ±äÐÎÅ·À·¨||modified Euler method ±äÒìϵÊý||coefficient of variation ±æÊ¶||identification ±èȺ||braid group ±éÀú±ä»»||ergodic transformation ±éÀú¶¨Àí||ergodic theorems ±éÀú¹ý³Ì||ergodic process ±éÀúÀíÂÛ||ergodic theory ±éÀúÁ´||ergodic chain ±éÀúÐÅÔ´||ergodic source ±éÀúÐÔ||ergodicity ±éÀúÐÔ¼ÙÉè||ergodic hypothesis ±êºÅ||label ±êºÅͼ||labeled graph ±ê¼Ü||frame ±ê¼Ü´Ô||frame bundle ±êÁ¿||scalar ±êÁ¿³¡||scalar field ±êÁ¿³Ë·¨||scalar multiplication ±êÁ¿»¯||scalarization ±êÁ¿¾ØÕó||scalar matrix ±êÖµµã¹ý³Ì||marked point process ±ê×¼²î||standard deviation ±ê×¼µ¥ÐÎ||standard simplex ±ê×¼·Ö½â||standard resolution ±ê×¼·Ö½âʽ||standard factorization ±ê×¼¸ß||standard height; Óֳơ°ÄÚÁú-Ì©ÌØ¸ß(Neron-Tate height)¡±¡£ ±ê×¼¹ý³Ì||standard process ±ê×¼ºãµÈʽ||standard identities ±ê×¼Îó²î||standard error ±ê×¼Ôª||standard element ±ê×¼Õý̬·Ö²¼||standard normal distribution ±í[ÁÐ]Öµ||tabular value, entry ±íµÄ¼ÓÃÜ||subtabulation ±íÃæÃܶȷ½·¨||surface density method ±íÃæÔöÖ³Òò×Ó·½·¨||surface multiplication factor method ±íʾµÄµÈ¼Û||equivalence of representations ±íʾµÄ¼¶||degree of a representation ±íʾµÄȨ||weight of representation ±íʾµÄÌØÕ÷£Û±ê£Ý||character of a representation ±íʾµÄÍêÈ«ÐÔ||completeness for representations ±íʾµÄÏÞÖÆ||restriction of representation ±íʾµÄÏàËÆ||similarity of representations ±íʾµÄÕÅÁ¿»ý||tensor product of representations ±íʾµÄÖ±ºÍ||direct sum of representations ±íʾº¯×Ó||representation functor ±íʾ¿Õ¼ä||representation space ±íʾÂÛ||representation theory ±íʾģ||representation module ±í×÷Òµ·¨||Hitchock method ²¡Ì¬||ill-conditioned, ill-conditioning ²¡Ì¬¶àÏîʽ||ill-conditioned polynomial ²¡Ì¬·½³Ì||ill-conditioned equation ²¡Ì¬¾ØÕó||ill-conditioned matrix ²¢||union; join ²¢°ë¸ñ||join semi-lattice ²¢±íʾ||join representation ²¢²»¿ÉÔ¼Ôª||join irreducible element ²¢ÎÞÇî·ÖÅä||join infinite distributive ²£¶÷-Òò·Ñ¶ûµÂ·½³Ì||Born-Infeld equation ²£¶ú×ÈÂü[»ý·Ö΢·Ö]·½³Ì||Boltzmann [integro-differential] equation ²£¶û½ô»¯||Bohr compactification ²¨[¶¯]·½³Ì||wave equation; Óֳơ°´ïÀʱ´¶û·½³Ì (D'Alembert equation)¡±¡£ ²¨ÀûÑǼÆÊý¶¨Àí||Polya enumeration theorem ²¨Ç°¼¯||wave front set ²©¿Ë˹-Ã×ÀÕ³éÑù·½·¨||Box-M¨¹ller sampling technique ²©À×¶û·Ö²ã||Borel hierarchy ²©À×¶û¼¯||Borel set ²©À×¶û¿É²âº¯Êý||Borel measurable function ²©À×¶ûÇóºÍ£Û·¨£Ý||Borel summation [method] ²©À×¶û×ÓȺ||Borel subgroup ²®¶÷ÈüµÂÎÊÌâ||Burnside problem ²®¶÷˹̹¶àÏîʽ||Bernstein polynomial ²®¸ñ·½³Ì||Burger equation ²®¸ñÂü¶ÈÁ¿||Bergman metric ²®¸ñÂü¿Õ¼ä||Bergman space ²®¸ñÂüËã×Ó||Bergman operator ²®¿Ë»ô·ò²åÖµ||Birkhoff interpolation ²®Å¬Àûµü´ú·¨||Bernoulli iteration ²®Å¬Àû¶àÏîʽ||Bernoulli polynomial ²®Å¬Àû·Ö²¼||Bernoulli distribution ²®Å¬Àû·Ö¸î||Bernoulli partition ²®Å¬ÀûÊÔÑé||Bernoulli trials ²®Å¬ÀûÊý||Bernoulli number ²®Å¬ÀûÍÆÒÆ||Bernoulli shift ²®Å¬Àû΢·Ö·½³Ì||Bernoulli differential equation ²´ËÉ·½³Ì||Poisson equation ²´ËÉ·Ö²¼||Poisson distribution ²´Ëɹ«Ê½||Poisson formula ²´Ëɹý³Ì||Poisson process ²´ËɺË||Poisson kernel ²´Ëɽâ||Poisson solution ²´ËÉÀ¨ºÅ||Poisson bracket ²´ËÉÀîȺ||Poisson Lie group ²´ËÉÇóºÍ¹«Ê½||Poisson summation formula ²´ËÉËæ»ú²â¶È||Poisson stochastic measure ²´ËÉÔ˶¯||Poisson motion ²¶´í||error trapping ²¶»ñÍ»·¢Âë||burst trapping code ²¹³¥Æ÷||compensator ²¹¼¯||complementary set ²¹½Ç||supplementary angle ²¹Ä£Êý||complementary modulus ²¹Í¼||complement of a graph ²¹Ôª||complement of an element ²¹×ÓÄ£||complementary submodule ²»±ä¦ÒÓò||invariant ¦Ò-field ²»±ä²â¶È||invariant measure ²»±ä²â¶ÈÎÊÌâ||invariant measure problem ²»±ä¶àÏîʽ||invariant polynomials ²»±ä·Ö²¼×å||invariant family of distributions ²»±ä¹À¼Æ||invariant estimate ²»±ä»·Ãæ||invariant torus ²»±ä¼ìÑé||invariant test ²»±ä¾ö²ßº¯Êý||invariant decision function ²»±äÁ¿||invariant ²»±äÁ÷ÐÎ||invariant manifold ²»±äƽ¾ù||invariant mean ²»±äǶÈë||invariant imbedding ²»±äʽ||invariant ²»±äʽµÄȨ||weight of invariant ²»±äʼþ||invariant event ²»±äËæ»ú±äÁ¿||invariant random variable ²»±äͳ¼ÆÁ¿||invariant statistic ²»±äÒò×Ó||invariant divisor ²»±äÔÀí||invariance principle ²»±äÖÐÐÄÁ÷ÐÎ||invariant central manifold ²»±ä×Ó¿Õ¼ä||invariant subspace ²»±ä×Ó¿Õ¼äÎÊÌâ||invariant subspace problem ²»µÈ·½³Ì||inequation ²»µÈʽ||inequality ²»µÈÊ½Ô¼Êø||inequality constraint ²»¶¨³£||time dependent; Óֳơ°Ê±¼äÏà¹Ø¡±¡£ ²»¶¨³£µü´ú||non-stationary iteration ²»¶¨³£·½·¨||time-dependent method; Óֳơ°Ê±¼äÏà¹Ø·¨¡±¡£ ²»¶¨¶È||uncertainty ²»¶¨¶È¹æ¿Õ¼ä||indefinite inner product space; Óֳơ°²»¶¨ÄÚ»ý¿Õ¼ä¡±¡£ ²»¶¨¶þ´ÎÐÍ||indefinite quadratic form ²»¶¨·½³Ì||indeterminate equation ²»¶¨»ý·Ö||indefinite integral ²»¶¨¾ØÕó||indefinite matrix ²»¶¯µã||fixed point ²»¶¯µã¶¨Àí||fixed point theorem ²»¶¯µãÖ¸Êý||fixed point index ²»·Å»Ø³éÑù||sampling without replacement ²»¾¡¸ù||surd root ²»¿É±È[µÄ]||incomparable ²»¿É±æÔª||indiscernible ²»¿É²â¼¯||non-measurable set ²»¿É´ï»ùÊý||inaccessible cardinal ²»¿É¶¨ÏòÁ÷ÐÎ||non-orientable manifold ²»¿É¶¨ÏòÇúÃæ||non-orientable surface ²»¿É·Ö´ÎÊý||inseparable degree ²»¿É·Ö½â¸ñ||indecomposable lattice ²»¿É·Ö½âÄ£||indecomposable module ²»¿É·Ö½âÄ£±íʾ||indecomposable modular representation ²»¿É·Ö½âÐŵÀ||indecomposable channel ²»¿É·ÖÀ©ÕÅ||inseparable extension ²»¿É·Ö̬Éä||inseparable morphism ²»¿É¹«¶ÈµÄ||incommensurable ²»¿É¹Û²â×Ó¿Õ¼ä||unobservable subspace ²»¿É½âÐÔ||unsolvability ²»¿ÉÄÜʼþ||impossible event ²»¿É΢¹æ»®||non-differentiable programming ²»¿É΢×îÓÅ»¯||non-differentiable optimization ²»¿ÉѹËõµÄ||incompressible ²»¿ÉѹËõÇúÃæ||incompressible surface ²»¿ÉÔ¼ 3-Á÷ÐÎ||irreducible 3-manifold ²»¿ÉÔ¼±íʾ||irreducible representation ²»¿ÉÔ¼±íʾµÄÊæ¶ûÖ¸Êý||Schur index of an irreducible representation ²»¿ÉÔ¼¶àÏîʽ||irreducible polynomial ²»¿ÉÔ¼·½³Ì||irreducible equation ²»¿ÉÔ¼·ÖÊý||irreducible fraction; Óֳơ°¼ò·ÖÊý¡±¡£ ²»¿ÉÔ¼¸ÅÐÎ||irreducible scheme ²»¿ÉÔ¼¼Îµ±¾ØÕó||irreducible Cartan matrix ²»¿ÉÔ¼Á´||irreducible chain ²»¿ÉÔ¼Ä£ÌØÕ÷£Û±ê£Ý||irreducible modular character ²»¿ÉÔ¼ÇúÏß||irreducible curve ²»¿ÉÔ¼ÌØÕ÷£Û±ê£Ý||irreducible character ²»¿ÉÔ¼Ó³Éä||irreducible mapping ²»¿ÉÔ¼Ôª||irreducible element ²»¿ÉÖ¤Ã÷ÐÔ||unprovability ²»Á¬Í¨¼¯||disconnected set ²»Á¬Ðø±ä»»Èº||discontinuous group of transformations ²»Á¬Ðø¿ØÖÆÏµÍ³||discontinuous control system ²»Äܳý¾¡[µÄ]||indivisible ²»Æ½ºâÔËÊäÎÊÌâ||unbalanced transportation problem ²»Æ½ºâÖ¸ÅÉÎÊÌâ||unbalanced assignment problem ²»È·¶¨¾ö²ß||decision under uncertainty ²»È·¶¨ÐÔϵͳ||uncertain system ²»Êʶ¨ÎÊÌâ||ill-posed problem ²»ÍêÈ«¦£º¯Êý||incomplete ¦£-function ²»ÍêÈ«¦Âº¯Êý||incomplete ¦Â-function ²»ÍêÈ«Çø×éÉè¼Æ||incomplete block design ²»ÍêÕûÔ¼Êø||non-holonomic constraint ²»Ïà¹Ø[µÄ]||uncorrelated ²»Ïà¹ØÑù±¾||uncorrelated samples ²»Ïཻ[µÄ]||disjoint ²»ÏàÈÝʼþ||mutually exclusive events, disjoint events ²»×ãµÀ[µÄ]||evanescent ²»×ãµÀ¼¯||evanescent set ²»×ã½üËÆÖµ||lower approximate value; ÔøÓÃÃû¡°Ï½üËÆÖµ¡±¡£ ²¼¶û´úÊý||Boolean algebra ²¼¶û¶àÏîʽ||Boolean polynomial ²¼¶û·½³Ì||Boolean equation ²¼¶û·½·¨||Boolean method ²¼¶û¸ñ||Boolean lattice ²¼¶û¹æ»®||Boolean programming ²¼¶û»·||Boolean ring ²¼¶û»ý||Boolean product ²¼¶û¿Õ¼ä||Boolean space ²¼¶ûÃÝ||Boolean power ²¼ÀÊ©¿Ë³Ë»ý||Blaschke product ²¼ÀÊ-Âó¿ÆÒÁ¸ù||Brown-McCoy radical ²¼ÀÊÆ¬||Brownian sheet ²¼ÀÊÇÅ||Brownian bridge ²¼ÀÊÔ˶¯||Brownian motion ²¼ÀÍÍþ¶û´úÊý||Brauwerian algebra ²¼ÂÀ°¢·Ö½â||Bruhat decomposition ²¼ÂåºÕ³£Êý||Bloch constant ²¼ÂåºÕº¯Êý||Bloch function ²¼ÂåºÕ¿Õ¼ä||Bloch space ²¼ÈĶûȺ||Brauer group ²¼Ë¹Âü·½³Ì||Busemann equation ²¼Î÷ÄÚ˹¿Ë·½³Ì||Boussinesq equation ²½³¤||step size, step length, step width ²½³¤Ö¸±ê||step index ²¿·Ö³Ë»ý||partial product ²¿·ÖµÈ¾àËã×Ó||partially isometric operator ²¿·Ö·Öʽ||partial fraction ²¿·ÖºÍ||partial sum ²¿·Öƽºâ²»ÍêÈ«Çø×éÉè¼Æ||partially balanced incomplete block design; ¼ò³Æ¡°PBIB Éè¼Æ¡±¡£ ²¿·Öʵʩ[·¨]||fractional replication ²¿·ÖÐÅÏ¢||partial information ²¿·ÖÑÇÍÖÔ²||partially hypoelliptic ²¿·ÖÖ÷Ôª||partial pivot ²¿·ÖÖ÷ÔªÏûÔª[·¨]||partial pivoting ²ÂÏë||conjecture ²Î¿¼ÊäÈë||reference input ²ÎÊý||parameter ²ÎÊý´Ø||parameter variety ²ÎÊý¹À¼Æ||parameter estimation ²ÎÊý¹æ»®||parametric programming ²ÎÊý¿Õ¼ä||parameter space ²ÎÊýÄ£ÐÍ||parameter model ²ÎÊýÏßÐԹ滮||parametric linear programming ²ÎÊý×îÓÅ»¯||parameter optimization ²Ð²î||residual ²Ð²îƽ·½ºÍ||residual sum of squares ²Ð²îͼ||residual plot ²ßÂÔ||policy, strategy ²ßÂÔ±äÁ¿||strategic variable ²ßÂÔµü´ú·¨||policy iteration method ²ßÂԸĽø[µü´ú]||policy improvement iteration ²ßÂÔ¾ö²ß||strategied decision ²ßÂÔ¿Õ¼ä||policy space ²ß÷Âå-¸¥À¼¿Ë¶û¼¯ºÏÂÛ||Zermelo-Frankel set theory; ¼ò³Æ¡°Z-F¼¯ºÏÂÛ¡±¡£ ²àÃæ»ý||lateral area ²âµØÁ÷||geodesic flow ²âµØÇúÂÊ||geodesic curvature ²âµØÏß||geodesic ²âµØÏß»·Â·||geodesic loop ²âµØ×ø±ê||geodesic coordinates ²â¶È||measure ²â¶È¾í»ý||convolution of measures ²â¶È¿Õ¼ä||measure space ²â¶ÈÂÛ||measure theory ²â¶ÈÖ§¼¯||support of measure ²âÊÔº¯Êý||trial function ²ã||sheaf; stratum; ½«×ÜÌå·Ö³ÉÈô¸É¸ö»¥²»ÏཻµÄ×Ó×ÜÌ壬ÿ¸ö×Ó×ÜÌå³ÆÎª²ã¡£ ²ãµÄÉÏͬµ÷||cohomology of sheaves ²ã̬Éä||morphism of sheaves ²ãͬ¹¹||isomorphism of sheaves ²åÖµ||interpolation; Óֳơ°Äڲ塱¡£ ²åÖµ±Æ½ü||approximation by interpolation ²åÖµ¶àÏîʽ||interpolation polynomial ²åÖµ·½·¨||interpolation method ²åÖµ¹«Ê½||interpolation formula ²åÖµº¯Êý||interpolating function ²åÖµ½Úµã||interpolation knot, interpolation node; Óֳơ°²åÖµ½áµã¡±¡£ ²åÖµ¿Õ¼ä||interpolation space ²åֵż||interpolation couple ²åÖµÌõ¼þ||interpolation condition ²åÖµÐÔÖÊ||interpolation property ²åÖµÓàÏî||remainder of interpolation ²åÖµÔ¼Êø±Æ½ü||approximation with interpolating constraints ²æÍ¬Ì¬||crossed homomorphism ²î||difference ²î´í±£»¤||error protection ²î´í´«²¥||error propagation ²î´í·½³Ì||error equation ²î´í¼ì²âÂë||error detection code ²î´í¿Õ¼ä||error space ²î´í¿ØÖÆ||error control ²î´íÂÊ||error rate ²î´íÏòÁ¿||error vector ²î´íУÑé||error check ²î´íУÕý||error correction; Óֳơ°¾À´í¡±¡£ ²î´íÐòÁÐ||error sequence ²î´úÊý||difference algebra ²î·Ö±Æ½ü||difference approximation ²î·Ö±í||difference table ²î·Ö·¨||difference method ²î·Ö·½³Ì||difference equation ²î·Ö¸ñʽ||difference scheme ²î·Ö½ÃÕý||difference correction ²î·ÖÃÉÌØ¿¨ÂÞ·½·¨||difference Monte Carlo method ²î·ÖËã×Ó||difference operator ²î·Ö΢·Ö·½³Ì||difference differential equation ²î·ÖÑÝËã||calculus of finite differences; Óֳơ°ÓÐÏÞ²îÑÝË㡱¡£ ²î»ý||different ²î¼¯||difference set ²îÉÌ||difference quotient, difference coefficient ²îÒìÉÏÁ´||difference cochain ²îÒìÏÔÖøÐÔ¼ìÑé||test of the significance of difference ²ú·½·çÏÕ||producer risk ³¡||field ³¡ÂÛ||theory of fields ³¢ÊÔ·¨||trial and error procedure ³£±íʾ||ordinary representation ³£²î·Ö·½³Ì||ordinary difference equation ³£·µÁ´||recurrent chain ³£·µ×´Ì¬||recurrent state ³£·Ö²¼||ordinary distribution ³£ºÍ¶Ô²ß||constant-sum game ³£Á¿Óò||constant field ³£ÇúÂʿռä||space of constant curvature ³£Êý||constant ³£Êý±äÒ×·¨||method of variation of constant ³£Êý²ã||constant sheaf ³£Êýº¯×Ó||constant functor, diagonal functor ³£ÊýÖÈÄ£||module of constant rank ³£Î¢·Ö·½³Ì||ordinary differential equation ³£Î¢·Ö·½³ÌÊýÖµ½â||numerical solution of ordinary differential equations ³£ÏµÊýÏßÐÔÆ«Î¢·Ö·½³Ì||linear partial differential equation with constant coefficients ³£Ïî||constant ³£ÓöÔÊý||common logarithm ³¤³ý·¨||long division ³¤¶È||length ³¤¶Ì·øÔ²ÄÚ°ÚÏß||hypotrochoid ³¤¶Ì·øÔ²Íâ°ÚÏß||epitrochoid ³¤·½Ìå||rectangular parallelopiped ³¤ÕýºÏÉÏͬµ÷£ÛÐò£ÝÁÐ||long exact cohomology sequence ³¤ÕýºÏͬµ÷£ÛÐò£ÝÁÐ||long exact homology sequence ³¤Öá||major axis ³¬µ¥´¿||hypersimple ³¬µ÷ºÍº¯Êý||hyperharmonic function ³¬¶¨×é||overdetermined system ³¬¶É||transgression ³¬¹ãÒ庯Êý||ultradistribution ³¬º¯Êý||hyperfunction ³¬»ý||ultraproduct ³¬¼¸ºÎ·Ö²¼||hypergeometric distribution ³¬¼¸ºÎº¯Êý||hypergeometric function ³¬¼¸ºÎ¼¶Êý||hypergeometric series; Óֳơ°¸ß˹¼¶Êý (Gauss series)¡±¡£ ³¬¼¸ºÎ΢·Ö·½³Ì||hypergeometric differential equation; Óֳơ°¸ß˹΢·Ö·½³Ì (Gauss differential equation)¡±¡£ ³¬¼ÇÒäÌݶȷ¨||supermemory gradient method ³¬¼ÓÃÜ||superencipher ³¬¾ùº¯Êý||superaveraging function ³¬¿É½âȺ||supersolvable group ³¬ÂË×Ó||ultrafilter ³¬ÃÝ||ultrapower ³¬Å×Îï[ÐÍ]·½³Ì||ultraparabolic equation ³¬Æ½ÃæÊø||pencil of hyperplanes ³¬Æ½Ãæ×ø±ê||hyperplane coordinates ³¬Æ½ÐÐÌå||parallelotope ³¬ÆæÍÖÔ²ÇúÏß||supersingular elliptic curve ³¬ÆæÔ¼»¯||supersingular reduction ³¬Ç°»ù±¾½â||advanced fundamental solution ³¬Ç°Î»ÊÆ||advanced potential; Óֳơ°Ç°½øÎ»ÊÆ¡±¡£ ³¬ÇÐÏòÁ¿||hypertangent ³¬Çî¹éÄɶ¨Òå||definition by transfinite induction ³¬Çî¹éÄÉ·¨||transfinite induction ³¬Çî»ùÊý||transfinite cardinal number ³¬ÇîÐòÊý||transfinite ordinal ³¬Çò||hypersphere ³¬Çòº¯Êý||hyperspherical function ³¬Çò΢·Ö·½³Ì||hyperspherical differential equation ³¬ÇúÃæ||hypersurface ³¬ÊÕÁ²||overconvergence; ָijµü´ú·¨»ò±Æ½ü¹ý³ÌÔÚÌØÊⳡºÏÆäÊÕÁ²ËÙÂʳ¬¹ýÕý³£ËÙÂÊ¡£ ³¬Ë«Çú[ÐÍ]·½³Ì||ultrahyperbolic equation ³¬ËɳÚ||overrelaxation ³¬ËãÊõ||hyperarithmetic ³¬Í¼||hypergraph ³¬ÍÖÔ²º¯ÊýÓò||hyperelliptic function field ³¬ÍÖÔ²»ý·Ö||hyperelliptic integral ³¬ÍÖÔ²ÇúÏß||hyperelliptic curve ³¬Îȶ¨ÐÔ||hyperstability ³¬ÏÞÖ±¾¶||transfinite diameter ³¬ÏßÐÔÊÕÁ²||superlinear convergence ³¬ÏßÐÔÊÕÁ²ËÙÂÊ||superlinear convergence rate ³¬ÓнçÐͿռä||ultrabornologic space ³¬ÓÐЧ¹À¼Æ||superefficient estimate ³¬Ô½´ÎÊý||degree of transcendence ³¬Ô½µÄ||transcendental ³¬Ô½·½³Ì||transcendental equation ³¬Ô½»ù||transcendental basis ³¬Ô½À©ÕÅ||transcendental extension ³¬Ô½Êý||transcendental number ³¬Ô½ÊýÂÛ||transcendental number theory ³¬Ô½ÑÇ´¿º¯Êý||transcendental meromorphic function ³¬Ô½Ôª||transcendental element ³¬Ô½Õûº¯Êý||transcendental entire function ³¬Ô¾±ä||hyperjump ³¬×Ô·´°ÍÄúտռä||super234lexive Banach space; edit ³¬×ÜÌå||superpopulation ³Â[Ê¡Éí£ÝÀà||Chern class ³Â£ÛÊ¡Éí£ÝÊý||Chern number ³ÂÌØÕ÷[±ê]||Chern character; È«³Æ¡°³ÂÊ¡ÉíÌØÕ÷±ê¡±¡£ ³ÉÅúµ½´ï||batch arrival; Óֳơ°´óÁ¿µ½´ï(bulk arrival)¡±¡£ ³ÉÅú·þÎñ||batch service; Óֳơ°´óÁ¿·þÎñ (bulk service)¡±¡£ ³ÉÅú¸ü»»²ßÂÔ||block replacement policy ³ÉÅúÅŶÓ||bulk queue ³Ë||multiply ³Ë³éÑù·½·¨||multiplicative sampling technique ³Ë·¨||multiplication ³Ë·¨½»»»ÂÉ||commutative law of multiplication ³Ë·¨½áºÏÂÉ||associative law of multiplication ³Ë·¨Èº||multiplicative group ³Ë·¨ÏûÈ¥ÂÉ||cancellation law for multiplication ³Ë»ýÐÍ»ý·Ö¹«Ê½||integration formula of product form ³Ë»ýÕ¹¿ªÊ½||product expansion ³Ë¼Ó³éÑù·½·¨||multiplicative-additional sampling technique ³ËÊý||multiplicator ³ËÊý´ÊÍ·||prefix multiplier ³ËͬÓà·½·¨||multiplicative congruential method ³ËÐԣ۵ģÝ||multiplicative ³ËÐÔ¶þ´ÎÐÍ||multiplicative quadratic form ³ËÐÔº¯Êý||multiplicative function ³ËÐÔÊýÂÛ||multiplicative number theory ³ËÐÔͬÓà||multiplicative congruence ³ËÐÔÏßÐÔ·ºº¯||multiplicative linear functional ³ËÐÔÐòÁÐ||multiplicative sequence ³ËÐÔÔ¼»¯||multiplicative reduction ³ËÐÔ×Ó¼¯||multiplicative subset ³ÐÔØµ¥ÐÎ||carrier simplex ³ÙÑÓ¸üйý³Ì||delayed renewal process ³ß¶È²ÎÊý||scale parameter ³ß¹æ×÷ͼ·¨||construction with ruler and compasses, geometric construction ³âÐÔ²»¶¯µã||repulsive fix-point ³ä·Ö´óµÄ 3-Á÷ÐÎ||sufficiently large 3-manifold ³ä·ÖÌõ¼þ||sufficient condition ³ä·Öͳ¼ÆÁ¿||sufficient statistic ³äÒªÌõ¼þ||necessary and sufficient condition ³å»÷º¯Êý||bump function ³å¼¤º¯Êý||impulse function; ÔøÓÃÃû¡°Âö³åº¯Êý¡±¡£ ³å¼¤ÏìÓ¦||impulse response; ÔøÓÃÃû¡°Âö³åÏìÓ¦¡±¡£ ³é¼ì||sampling inspection ³é¼ìÌØÐÔÇúÏß||operating characteristic curve ³é½±||lottery ³éÏó£Û»¯£Ý||abstraction ³éÏó´Ø||abstract variety ³éÏóµ¥ÐÎ||abstract simplex ³éÏóµ÷ºÍ·ÖÎö||abstract harmonic analysis ³éÏó·ÇÆæÇúÏß||abstract non-singular curve ³éÏó¸´ÐÎ||abstract complex ³éÏó¸ùϵ||abstract root system ³éÏóÀèÂüÃæ||abstract Riemann surface ³éÏóÂë||abstract code ³éÏóÄ£ÐÍÂÛ||abstract model theory ³éÏóάÄɿռä||abstract Wiener space ³éÑù||sampling ³éÑù±È||sampling fraction ³éÑùµ¥Ôª||sampling unit ³éÑùµ÷²é||sampling survey ³éÑù¿ò||sampling frame ³éÑùÂÛ||sampling theory ³éÑùЧÂÊ||sampling efficiency ³í[ÃÜ]×Ó¼¯||dense subset ³í¸ñ||dense lattice ³íÃÜ||dense ³íÃÜÏßÐԱ任»·||dense ring of linear transformations ³íÔª||dense element ³õ[Öµ]-±ßÖµÎÊÌâ||initial-boundary value problem ³õ²½¼¯£ÛºÏ£Ý||rudimentary set ³õµÈ±ä»»||elementary transformation ³õµÈµÈ¼Û£ÛµÄ£Ý||elementarily equivalent ³õµÈ¶Ô³Æ¶àÏîʽ||elementary symmetric polynomial ³õµÈº¯Êý||elementary function ³õµÈ½»»»Èº||elementary commutative group ³õµÈ¾ØÕó||elementary matrix ³õµÈȺ||elementary group ³õµÈÍØÆË°¢±´¶ûȺ||elementary topological Abelian group ³õµÈÒò×Ó||elementary divisor ³õµÈ×ӽṹ||elementary substructure ³õµÈ×ÓÄ£ÐÍ||elementary submodel ³õ¼ìÑé||original inspection ³õʼ¶Î||initial segment ³õʼ·Ö²¼||initial distribution ³õʼ»ù±¾¿ÉÐнâ||initial basic feasible solution ³õʼÁ÷ÐÎ||initial manifold ³õʼÎó²î||initial error ³õʼÐòÊý||initial ordinal ³õ̬||initial state ³õÓö||debut ³õÖµÌõ¼þ||initial value condition ³õÖµÎÊÌâ||initial value problem ³ö´ÎÊý||outdegree ³öÊ÷||outtree ³öÏÖ||occurrence ³öÏòÁ¿||outgoing vector ³ý||divide ³ý·¨||division ³ý»·||division ring, skew field; ÔøÓÃÃû¡°Ì塱¡£ ³ýÊý||divisor ³ýÊýº¯Êý||divisor function ³ýÊýÎÊÌâ||divisor problem ³ý×Ó||divisor ³ý×ӵĴÎÊý||degree of a divisor ³ý×ÓÀàȺ||divisor class group ³þÁÐ˹»ù·Ö½â||Cholesky decomposition ´¦´¦³íÃÜ[µÄ]||dense everywhere ´«µÝ³éÑù·½·¨||pass sampling technique ´«µÝº¯Êý[¾Ø]Õó||transfer function matrix ´«µÝº¯Êý||transfer function ´«µÝ¼¯||transitive set ´«µÝȺ||transitive group ´«µÝÐÔ||transitivity ´«Ê伫µã||transmission pole ´«ÊäÁãµã||transmission zero ´«ÊäÈÝÁ¿||transmission capacity ´«ÊäËÙÂÊ||transmission rate ´®ÁªÅŶÓ[ϵͳ]||tandem queue [system] ´´Ô켯||creative set ´¹Ïß||perpendicular, perpendicular line ´¹ÐÄ||orthocenter ´¹Ö±[µÄ]||perpendicular ´¹×ã||foot of a perpendicular ´¹×ãÇúÏß||pedal curve ´¿²»¿É·ÖÀ©ÕÅ||pure inseparable extension ´¿²»¿É·Ö̬Éä||purely inseparable morphism ´¿²ßÂÔ||pure strategy ´¿³¬Ô½À©ÕÅ||purely transcendental extension ´¿´âÊýѧ||pure mathematics ´¿Ãð¹ý³Ì||death process ´¿Éú¹ý³Ì||birth process ´¿ÐéÊý||pure imaginary number ´¿Ñ»·Ð¡Êý||pure recurring decimal ´¿ÕûÊý¹æ»®||pure integer programming ´Î||order ´Î±ÕÓ³Éä||demi-closed mapping ´ÎµÝ¹éÐÔ||subrecursiveness ´Î¶Ô½ÇÏß||minor diagonal ´Î¼«´ó||submaximum; Óֳơ°¸±·å¡±¡£ ´Î¼«Ð¡||subminimum ´Î¼ÓÐÔ·ºº¯||subadditive functional ´Î¿É΢ÐÔ||subdifferentiability ´ÎÀíÏë||subideal ´ÎÁ¬ÐøÐÔ||demi-continuity ´ÎÁ¬ÐøÓ³Éä||demi-continuous mapping ´ÎÂí¶û¿É·ò[µÄ]||sub-Markovian ´ÎÄ£º¯Êý||submodular function ´ÎÌØÕ÷[Ïß]||bicharacteristics ´ÎÌØÕ÷´ø||bicharacteristic strip ´ÎÌØÕ÷ÉäÏß||bicharacteristic rays ´ÎÌݶÈ||subgradient ´ÎÌݶȷ¨||subgradient algorithm ´Î͹¶Ô²ß||subconvex game ´ÎÍÖÔ²||subelliptic ´Î΢·Ö||subdifferential ´Î΢·ÖÎȶ¨ÐÔ||subdifferential stability ´Î΢·ÖÓ³Éä||subdifferential mapping ´ÎÏßÐÔ[µÄ]||sublinear ´ÎÐò¹«Àí||axiom of order ´ÎÓÅ||suboptimum ´ÎÓÅ»¯||suboptimization ´ÎÓÅ¿ØÖÆ||suboptimal control ´ÎÕý¹æÁÐ||subnormal series ´ÎÕý¹æËã×Ó||subnormal operator ´ÎÕý¹æ×ÓȺ||subnormal subgroup ´ÎÖ±±íʾ||subdirect representation ´ÎÖ±²»¿ÉÔ¼[µÄ]||subdirectly irreducible ´ÎÖ±ºÍ||subdirect sum ´ÎÖ±»ý||subdirect product ´ÓÇÐ[ƽ]Ãæ||rectifying plane ´ÓÊôͳ¼ÆÁ¿||ancillary statistic, distribution free statistic ´ÓÊôÐÔ||subordination ´ÔµÄ·ÖÁÑÓ³Éä||splitting map of a bundle ´ÔµÄ½ØÃæ||cross section of a bundle ´ÔµÄÉÏͬµ÷||cohomology of bundle ´ÔµÄͬµ÷||homology of bundles ´ÔÓ³Éä||bundle map ´Ö²ÚÄ£¿Õ¼ä||coarse moduli space ´ØµÄº¯ÊýÓò||function field of a variety ´ØµÄÕý¹æ»¯||normalization of a variety ´Ø¶¨ÒåÓò||field of definition for variety ´ØÉÏÓÐÀíº¯Êý||rational function over a variety ´ØÌ¬Éä||morphism of varieties ´ØÍ¬¹¹||isomorphism of varieties ´æ´¢¿Õ¼ä||memory space ´æ´¢ÂÛ||storage theory ´æ´¢ÈÝÁ¿||memory capacity ´æÔÚ[ÐÔ]||existence ´æÔÚÁ¿´Ê||existential quantifier ´ï²¼[΢·Ö]·½³Ì||Darboux [differential] equation ´ï²¼ºÍ||Darboux sum ´ï²¼ÎÊÌâ||Darboux problem ´ï·Ò΢·Ö·½³Ì||Duffing differential equation ´ïÀʱ´¶û¹«Ê½||d'Alembert formula ´ò°Ð·¨||shooting method ´ó·¶Î§±ä·Ö·¨||calculus of variation in the large ´ó»ùÊý||large cardinals ´óħȺ||monster group ´óÆ«²î||large deviation ´óɸ·¨||large sieve ´óÊýÂÉ||law of large numbers ´óϵͳ||large scale system ´óϵͳ×îÓÅ»¯||large scale optimization; Óֳơ°´óÐÍ×îÓÅ»¯¡±¡£ ´óÐͶ¯Ì¬ÏµÍ³||large scale dynamic system ´óÐ͹滮||large scale programming ´óÓÚ||greater than, larger than ´óÔ²||great circle ´÷µÂ½ð¦Æº¯Êý||Dedekind ¦Æ-function ´÷µÂ½ð¦Çº¯Êý||Dedekind ¦Ç-function ´÷µÂ½ðÕû»·||Dedekind domain ´÷»·¿Õ¼ä||ringed space ´ø[µ÷ºÍ]º¯Êý||zonal harmonics ´ø||tape ´ø±ßÁ÷ÐÎ||manifold with boundary ´ø³¥¸¶Ëæ»ú¹æ»®||stochastic programming with recourse ´ø·ÖÊý||mixed fraction ´øºÅ²â¶È||signed measure ´øºÅ²â¶È·¶Êý||norm of signed measure ´øºÅ²â¶È¸º±ä²î||negative variation of signed measure ´øºÅ²â¶ÈÃܶÈ||density of signed measure ´øºÅ²â¶ÈÄÜÁ¿£Û»ý·Ö£Ý||energy of signed integral ´øºÅ²â¶ÈÈ«±ä²î||complete variation of signed measure ´øºÅ²â¶ÈÈô¶ûµ±·Ö½â||Jordan decomposition of signed measure ´øºÅ²â¶ÈÏ໥ÄÜÁ¿£Û»ý·Ö£Ý||mutual energy of signed measure ´øºÅ²â¶ÈÕý±ä²î||positive variation of signed measure ´ø»ùµãµÄ¿Õ¼ä||pointed space ´ø»ý·¶³ë||category with product ´ø»ýºÏ³É·¶³ë||category with product and composition ´ø¿í||band width ´øÉ¾³ýÒëÂë||erasure decoding ´øËã×ÓȺ||group with operators ´øÓà³ý·¨||division with remainder, division algorithm ´ø×´¾ØÕó||band matrix ´ùµ¥´úÊýȺ||almost simple algebraic group ´ù·ÖÁÑÀ©ÕÅ||almost splitting extension ´ù·ÖÁÑÐòÁÐ||almost splitting sequence ´ù¸´½á¹¹||almost complex structure ´ù¸´Á÷ÐÎ||almost complex manifold ´ùƽ̹Á÷ÐÎ||almost flat manifold ´ùÖÜÆÚº¯Êý||almost periodic function; Óֳơ°¼¸ºõÖÜÆÚº¯Êý¡±¡£ ´ùÖÜÆÚ½â||almost periodic solution ´ùÖÜÆÚÔ˶¯||almost periodic motion ´ú»»ÐÔÖÊ||substitution property ´úÂë×é||codes ´úÈë||substitution ´úÈëÏûÔª·¨||elimination by substitution ´úÊý K ÀíÂÛ||algebraic K theory ´úÊý||algebras ´úÊý±Õ°ü||algebraic closure ´úÊý±ÕÁ´||algebraic cycle ´úÊý±ÕÓò||algebraically closed field ´úÊý±ä»»¿Õ¼ä||algebraic transformation space ´úÊý²»±äʽ||algebraic invariant ´úÊý²»±äʽÂÛ||theory of algebraic invariants ´úÊýµÄ||algebraic ´úÊýµÄ±êÁ¿À©ÕÅ||scalar extension of algebras ´úÊýµÄ±íʾ||representation of algebras ´úÊýµÄµ¼×Ó||derivation of an algebra ´úÊýµÄ·ÖÁÑÀ©ÕÅ||split extension of algebras ´úÊýµÄ·ÖÁÑÓò||splitting fields of algebras ´úÊýµÄ¸ù||radical of an algebra ´úÊýµÄºãµÈʽ||identities of algebras ´úÊýµÄÀî´úÊý||algebraic Lie algebra ´úÊýµÄÕÅÁ¿»ý||tensor product of algebras ´úÊýµÄÖÐÐÄ||center of an algebra ´úÊýµÈ¼Û||algebraically equivalence ´úÊý·½³Ì||algebraic equation ´úÊý·½³ÌÂÛ||theory of algebraic equations ´úÊý¸ñ||algebraic lattice ´úÊý¹æ»®||algebraic program ´úÊýº¯ÊýÓò||algebraic function field ´úÊýºÍ||algebraic sum ´úÊý¼¯||algebraic set ´úÊý¼¯µÄÀíÏë||ideal of an algebraic set ´úÊý¼¸ºÎ[ѧ]||algebraic geometry ´úÊý¾«¶È||algebraic accuracy ´úÊýÀ©ÕÅ||algebraic extension ´úÊýÂÛ||theory of algebras ´úÊýÂë||algebraic code ´úÊýÆæµã||algebraic singularity ´úÊýÇúÏß||algebraic curve ´úÊýȺ||algebraic group ´úÊýȺµÄ¸ù£Û»ù£Ý||radical of algebraic group ´úÊýȺµÄÀî´úÊý||Lie algebra of an algebraic group ´úÊýȺµÄÌØÕ÷£Û±ê£Ý||character of algebraic group ´úÊýȺµÄÍâ¶ûȺ||Weyl group of algebraic group ´úÊýȺµÄÓÐÀí±íʾ||rational representation of algebraic group ´úÊýȺµÄÖÈ||rank of algebraic group ´úÊýʽ||algebraic expression ´úÊýÊý||algebraic number ´úÊýÊýÂÛ||algebraic number theory ´úÊýÊýÓò||algebraic number field; ¼ò³Æ¡°ÊýÓò¡±¡£ ´úÊýÌ庯Êý||algebroidal function ´úÊýͬ¹¹||algebra isomorphism ´úÊý̬ͬ||algebra homomorphism ´úÊýÍØÆË[ѧ]||algebraic topology ´úÊý΢·Ö·½³Ì||algebraic differential equation ´úÊýÎÞ¹Ø[µÄ]||algebraically independent ´úÊýϵͳ||algebraic system ´úÊýÏà¹Ø[µÄ]||algebraically dependent ´úÊýѧ||algebra ´úÊýÒëÂë||algebraic decoding ´úÊýÓà×Óʽ||algebraic cofactor ´úÊýÔª||algebraic element ´úÊýÕûÊý||algebraic integer ´úÊýÕûÊý»·||ring of algebraic integers ´úÊý×ÓȺ||algebraic subgroup, k-closed subgroup ´ý¶¨ÏµÊý·¨||method of undetermined coefficient µ¤Æë¸ñ-ÎÖ¶û·ò·¨||Dantzig-Wolfe method µ¥[´¿]ÐÎ||simplex µ¥[×Ö³¤]¾«¶È||single precision µ¥£Û´¿£Ý¼¯||simple set µ¥°¢±´¶û´Ø||simple Abelian variety µ¥°ûËã×Ó||unicellular operator µ¥±äÁ¿ÏµÍ³||single variable system; Óֳơ°µ¥ÊäÈëµ¥Êä³öϵͳ(single-input single-output system, µ¥²½µü´ú||single step iteration µ¥²½·¨||single step method, one-step method µ¥²ÎÊý±ä»»Èº||one parameter group of transformations µ¥²ÎÊý²âµØÏß×å||1-parameter family of geodesics µ¥²ÎÊý³Ë·¨×ÓȺ||one parameter multiplicative subgroup µ¥²ÎÊý×ÓȺ||one parameter subgroup µ¥²à±Æ½ü||one-sided approximation µ¥²à¼ìÑé||one-sided test µ¥²àÇúÃæ||unilateral surface µ¥²àËÑË÷||one-sided search µ¥²ãÎ»ÊÆ||simple layer potential; Óֳơ°µ¥Ò»·Ö²¼Î»ÊÆ¡±¡£ µ¥´¿±Æ½ü||simplicial approximation µ¥´¿¸´ÐÎ||simplicial complex µ¥´¿¸´ÐεÄͬµ÷Ⱥ||homology group of simplicial complex µ¥´¿Á´Ó³Éä||simplicial chain mapping µ¥´¿Ðαí||simplex tabuleau µ¥´¿Ðε÷ÓÅ·¨||simplex evolutionary method µ¥´¿Ðη¨||simplex method, simplex algorithm µ¥´¿Ó³Éä||simplicial mapping, barycentric mapping µ¥´¿ÖØ·Ö||simplicial subdivision µ¥´úÊý||simple algebra µ¥´úÊýµÄ¦Æº¯Êý||¦Æ-function of simple algebra, zeta-function of simple algebra µ¥´úÊýµÄ²î»ý||different of a simple algebra µ¥´úÊýµÄÅбðʽ||discriminant of a simple algebra µ¥´úÊýȺ||simple algebraic group µ¥µã||simple point µ¥µã·Ö²¼||one-point distribution µ¥µ÷²î·Ö¸ñʽ||monotone difference scheme µ¥µ÷º¯Êý||monotone function µ¥µ÷Àà||monotone class µ¥µ÷ÊÕÁ²¶¨Àí||monotone convergence theorem µ¥µ÷ËÆÈ»±È||monotone likelihood ratio µ¥µ÷Ëã×Ó||monotone operator; Óֳơ°µ¥µ÷Ó³Éä(monotone mapping)¡±¡£ µ¥·º´úÊý||simple universal algebra µ¥·å·Ö²¼||unimodal distribution µ¥·åº¯Êý||unimodal function µ¥·åÐÔ||unimodality µ¥¸ñ||simple lattice µ¥¸ù||simple root µ¥¸ùϵ||simple system of roots µ¥»·||simple ring µ¥¼«µã||simple pole; Óֳơ°Ò»½×¼«µã¡±¡£ µ¥¿ªÏÝÃź¯Êý||one-way trap door function µ¥À©ÕÅ||simple extension µ¥Àî´úÊý||simple Lie algebra µ¥ÀîȺ||simple Lie group µ¥Á¬Í¨[µÄ]||simply connected µ¥Á¬Í¨[Çø]Óò||simply connected domain µ¥Á¬Í¨½âÎöȺ||simply connected analytic group µ¥Á¬Í¨ÀèÂü£ÛÇú£ÝÃæ||simply connected Riemann surface µ¥ÁÐÄ£||uniserial module µ¥Áãµã||simple zero; Óֳơ°Ò»½×Áãµã¡±¡£ µ¥Â·ÐŵÀ||one way channel µ¥Ä£||simple module; Óֳơ°²»¿ÉԼģ(irreducible module)¡±¡£ µ¥ÇÐÏß||simple tangent µ¥Èº||simple group µ¥Éä||injection, injective µ¥Éä°ë¾¶||injective radius µ¥ÊÕÁ²ÍØÆË||simple convergence topology µ¥Ì¨·þÎñϵͳ||single-server system µ¥Ì¬Éä||monomorphism µ¥Í¬Ì¬||injective homomorphism µ¥Í¼||simple graph µ¥Î»||unit; Óֳơ°¿ÉÄæÔª(invertible element)¡±¡£ µ¥Î»±íʾ||unit representation µ¥Î»µã||unit point µ¥Î»·Ö½â||partition of unity µ¥Î»¸ù||roots of unity µ¥Î»º¯×Ó||identity functor µ¥Î»½×Ô¾º¯Êý||unit step function µ¥Î»½×Ô¾ÊäÈë||unit step input µ¥Î»½×Ô¾ÏìÓ¦||unit step response µ¥Î»¾ØÕó||identity matrix, unit matrix; Óֳơ°çÛ¾ØÕ󡱡£ µ¥Î»ÀíÏë||unit ideal µ¥Î»Á¬Í¨Çø||identity component µ¥Î»Ëã×Ó||unit operator; ÔøÓÃÃû¡°ºãµÈËã×Ó (identity operator)¡±¡£ µ¥Î»Ì¬Éä||identity morphism µ¥Î»ÌØÕ÷£Û±ê£Ý||unit character µ¥Î»ÏòÁ¿||unit vector µ¥Î»Ôª[ËØ]||identity element, unit element; ¼ò³Æ¡°çÛÔª¡±¡£ µ¥Î»ÔªÈº||identity group µ¥Î»Ô²£ÛÅÌ£Ý||unit disk µ¥Î»ÕÅÁ¿||unit tensor µ¥Ïî±ä»»||monoidal transformation µ¥Ïî±íʾ||monomial representation µ¥Ïî¾ØÕó||monomial matrix µ¥Ïîʽ||monomial µ¥ÏîÑùÌõ||monospline µ¥ÏòÁ¬Í¨[µÄ]||unilaterally connected µ¥ÑÝ||monogenic µ¥Ñݺ¯Êý||monogenic function µ¥Ò¶º¯Êý||univalent function µ¥Ò¶Ë«ÇúÃæ||hyperboloid of one sheet µ¥Ò»Éú³ÉµÄ||monothetic µ¥Ôª¸Õ¶È¾ØÕó||element stiffness matrix µ¥Ö§¸ñʽ||one-leg scheme µ¥Öµ[ÐÔ]||monodromy µ¥Öµ[ÐÔ]¶¨Àí||monodromy theorem µ¥Öµ·ÖÖ§||one-valued branch µ¥Öµº¯Êý||single valued function, uniform function µ¥Öµ»¯||uniformization µ¥Öµ»¯¶¨Àí||uniformization theorem µ¥ÖµÈº||monodromy group µ¥ÖÜÆÚº¯Êý||simply periodic function µ½ô||vague compact µÄ®||indifference; Óֳơ°ÎÞ²î±ð¡±¡£ µÊÕÁ²||vague convergence µÍØÆË||vague topology µ¯ÐÔ±Ú||elastic barrier µ±ÇÒ½öµ±||if and only if, iff µ±ÈãÍß»ý·Ö||Denjoy integral µ±ÈãÍß¼«Ð¡¼¯||Denjoy minimum set µ¶Çз¨||jackknife µ¹²î·Ö||reciprocal difference µ¹²îÉÌ||reciprocal difference quotient µ¹Ò×ÃÉÌØ¿¨ÂÞ·½·¨||reciprocity Monte Carlo method µ¼³ö´úÊý||derived algebra µ¼³öº¯×Ó||derived functor µ¼³öÁÐ||derived series µ¼³öÇø×éÉè¼Æ||derived block design µ¼º¯Êý||derived function µ¼¼¯||derived set µ¼Êý||derivative, differential quotient; Óֳơ°Î¢ÉÌ¡±¡£ µ¼ÌåÎ»ÊÆ||conductor potential µ¼×Ó´úÊý||derivation algebra µ½´ï¼ä¸ô||interarrival time µ½´ïʱ¿Ì||arrival instant µÀ¸ñÀ˹·ºº¯||Douglas functional µÀ·||path µÀ·¿Õ¼ä||path space µÀ·Á¬Í¨£ÛµÄ£Ý||path connected µÂ°Ý½¥½ü±íʾ||asymptotic representation of Debye µÂ°Ý½¥½üÕ¹¿ª||Debye asymptotic expansion µÂ²¼Â³Òòͼ||de Brujin graph µÂ¶÷Ťת||Dehn twist µÂÀÄ·ÉÏͬµ÷Ⱥ||de Rham cohomology group µÂĦ¸ù´úÊý||De Morgan algebra µÂĦ¸ùºãµÈʽ||De Morgan identity µÂÈø¸ñ¶¨Àí||Desargues theorem µÈ±È¼¶Êý||geometric series µÈ±ÈÊýÁÐ||geometric progression; Óֳơ°¼¸ºÎÊýÁС±¡£ µÈ±ßÈý½ÇÐÎ||equilateral triangle µÈ²Î³¬ÇúÃæ||isoparametric hypersurface µÈ²î¼¶Êý||arithmetic series µÈ²îÊýÁÐ||arithmetic progression; Óֳơ°ËãÊõÊýÁС±¡£ µÈ´ýʱ¼ä||waiting time µÈ´ýÖÆÏµÍ³||waiting system; Óֳơ°µÈ´ý·þÎñϵͳ¡±¡£ µÈ¶ÈÁ¬Ðø[µÄ]||equicontinuous µÈ¼Û[ÐÔ]||equivalence µÈ¼Û¹ØÏµ||equivalence relation µÈ¼Û¾ØÕó||equivalent matrices µÈ¼ÛÀà||equivalence class µÈ½Ç¹ìÏß×å||family of isogonal trajectories µÈ¾à||equidistant, isometry µÈ¾àÇúÏß||equidistant curve µÈ¾àËã×Ó||isometric operator, isometric mapping µÈ¾àͬ¹¹||isometry µÈÇãÏß||isoclines µÈʽ||equality µÈÊ½Ô¼Êø||equality constraint µÈÊÆÏß||equipotential line µÈÎÂ×ø±ê||isothermal coordinates µÈÑüÈý½ÇÐÎ||isosceles triangle µÈÑüÌÝÐÎ||isosceles trapezoid µÈÓÚ||equal to µÈÖܲ»µÈʽ||isoperimetric inequality µÈÖÜÎÊÌâ||isoperimetric problem µË¸£µÂ»ý·Ö||Dunford integral µË¿Ïͼ||Dynkin diagram µÍ¸ººÉ·þÎñ||light traffic µÍËɳÚ||underrelaxation; Óֳơ°ÑÇËɳڡ±¡£ µÏ¶ò¶àÄÚ¾§Ìå||Dieudonn¨¦ crystal µÏ¶ò¶àÄÚÐÐÁÐʽ||Dieudonn¨¦ determinant µÏÄáµ¼Êý||Dini derivative µÏÄá¼¶Êý||Dini series µÏÅ˱êÐÎ||Dupin indicatrix µÑ¿¨¶ù»ý||Cartesian product µÑ¿¨¶ù¿Õ¼ä||Cartesian space µÑ¿¨¶ùÂÑÐÎÏß||Cartesian oval µÑ¿¨¶ûͼ||Cartesian diagram µÒÀ¿Ë·½³Ì||Dirac equation µÒÀ¿Ë¹ãÒ庯Êý||Dirac distribution µÒÀû¿ËÀ×L¼¶Êý||Dirichlet L-series µÒÀû¿ËÀ׳˷¨||Dirichlet multiplication µÒÀû¿ËÀ׳éÌëÔÀí||Dirichlet box principle µÒÀû¿ËÀ×·ºº¯||Dirichlet functional µÒÀû¿ËÀ×·Ö²¼||Dirichlet distribution µÒÀû¿ËÀ׺Ë||Dirichlet kernel µÒÀû¿ËÀ×»ý·Ö||Dirichlet integral µÒÀû¿ËÀ×¼¶Êý||Dirichlet series µÒÀû¿ËÀ׿ռä||Dirichlet space µÒÀû¿ËÀ×ÃܶÈ||Dirichlet density, analytic density µÒÀû¿ËÀ×Êý¾Ý||Dirichlet data µÒÀû¿ËÀ×ÌØÕ÷£Û±ê£Ý||Dirichlet character µÒÀû¿ËÀ×ÎÊÌâ||Dirichlet problem; Óֳơ°µÚÒ»±ßÖµÎÊÌâ (first boundary value problem)¡±¡£ µÒÀû¿ËÀ×ÐÍ||Dirichlet form µÒÀû¿ËÀ×ÔÀí||Dirichlet principle µ×º¯×Ó||underlying functor, forgetful functor µ×¼¯||universe µ×½Ç||base angle µ×¿Õ¼ä||base space µ×Ⱥ||underlying group µ×Êý||base number µ×ÍØÆË¿Õ¼ä||underlying topological space µÙË÷-²¨¹þĬ΢·Ö·½³Ì||Tissot-Pohhammer differential equation µÚ n Àà±´¶ûº¯Êý||n-th class of Baire functions µÚ¶þ·¶³ë||second category µÚ¶þ·¶³ë¼¯||set of the second category µÚ¶þ»ù±¾ÐÍ||second fundamental form; Óֳơ°µÚ¶þ»ù±¾ÐÎʽ¡±¡£ µÚ¶þ¿ÉÊý¹«Àí||second axiom of countability µÚ¶þÀà±´Èû¶ûº¯Êý||Bessel function of the second kind; Óֳơ°ÅµÒÁÂüº¯Êý (Neumann function)¡±¡£ µÚ¶þÀ಻Á¬Ðøµã||discontinuity point of the second kind µÚ¶þÀ಻ÍêÈ«ÍÖÔ²»ý·Ö||incomplete elliptic integral of the second kind µÚ¶þÀà´íÎó||error of the second kind µÚ¶þÀàµä·¶×ø±ê||canonical coordinates of the second kind µÚ¶þÀลÀ׵»ôÄ·»ý·Ö·½³Ì||Fredholm integral equation of the second kind µÚ¶þÀ຺¿Ë¶ûº¯Êý||Hankel function of the second kind µÚ¶þÀàÀ÷º¯Êý||Lam¨¦ function of the second kind µÚ¶þÀàÀÕÈõº¯Êý||Legendre function of the second kind µÚ¶þÀàÂíµÙ¶òº¯Êý||Mathieu function of the second kind µÚ¶þÀàÇбÈÑ©·ò¶àÏîʽ||Chebyshev polynomial of the second kind µÚ¶þÀàÍÖÔ²º¯Êý||elliptic function of the second kind µÚ¶þÀàÍÖÔ²»ý·Ö||elliptic integral of the second kind µÚ¶þÀàÍêÈ«ÍÖÔ²»ý·Ö||complete elliptic integral of the second kind µÚ¶þÀàÎÖ¶ûÌ©À»ý·Ö·½³Ì||Volterra integral equation of the second kind µÚ¶þÖÐÖµ¶¨Àí||second mean value theorem µÚÈýÀà±´Èû¶ûº¯Êý||Bessel function of the third kind; Óֳơ°ºº¿Ë¶ûº¯Êý (Hankel function)¡±¡£ µÚÈýÀลÀ׵»ôÄ·»ý·Ö·½³Ì||Fredholm integral equation of the third kind µÚÈýÀàÍÖÔ²º¯Êý||elliptic function of the third kind µÚÈýÀàÍÖÔ²»ý·Ö||elliptic integral of the third kind µÚÈýÀàÎÖ¶ûÌ©À»ý·Ö·½³Ì||Volterra integral equation of the third kind µÚÎ幫Éè||fifth postulate; µÈ¼ÛÓÚÅ·Êϼ¸ºÎÖÐµÄÆ½Ðй«Àí¡£ µÚÒ»³¬ÇîÐòÊý||first transfinite ordinal µÚÒ»·¶³ë||first category µÚÒ»·¶³ë¼¯||set of the first category µÚÒ»»ù±¾ÐÍ||first fundamental form; ÓÖ³Æ ¡°µÚÒ»»ù±¾ÐÎʽ¡±¡£ µÚÒ»¿ÉÊý¹«Àí||first axiom of countability µÚÒ»Àà±´Èû¶ûº¯Êý||Bessel function of the first kind; Óֳơ°±´Èû¶ûº¯Êý (Bessel function)¡±¡£ µÚÒ»À಻Á¬Ðøµã||discontinuity point of the first kind µÚÒ»À಻ÍêÈ«ÍÖÔ²»ý·Ö||incomplete elliptic integral of the first kind µÚÒ»Àà´íÎó||error of the first kind µÚÒ»Ààµä·¶×ø±ê||canonical coordinates of the first kind µÚÒ»ÀลÀ׵»ôÄ·»ý·Ö·½³Ì||Fredholm integral equation of the first kind µÚÒ»À຺¿Ë¶ûº¯Êý||Hankel function of the first kind µÚÒ»ÀàÀ÷º¯Êý||Lam¨¦ function of the first kind µÚÒ»ÀàÀÕÈõº¯Êý||Legendre function of the first kind µÚÒ»ÀàÂíµÙ¶òº¯Êý||Mathieu function of the first kind; Óֳơ°ÍÖÔ²Öùº¯Êý (elliptic cylinder function)¡±¡£ µÚÒ»ÀàÇбÈÑ©·ò¶àÏîʽ||Chebyshev polynomial of the first kind µÚÒ»ÀàÍÖÔ²º¯Êý||elliptic function of the first kind µÚÒ»ÀàÍÖÔ²»ý·Ö||elliptic integral of the first kind µÚÒ»ÀàÍêÈ«ÍÖÔ²»ý·Ö||complete elliptic integral of the first kind µÚÒ»ÀàÎÖ¶ûÌ©À»ý·Ö·½³Ì||Volterra integral equation of the first kind µÚÒ»ÖÐÖµ¶¨Àí||first mean value theorem µÝ¹é±ßͼ||recursive edge graph µÝ¹é¶Ô²ß||recursive game µÝ¹é·ÖÎö||recursive analysis µÝ¹éº¯Êý||recursive function µÝ¹é¼¯||recursive set µÝ¹é½á¹¹||recursive structure µÝ¹é¿É¹«Àí»¯||recursively axiomatizable µÝ¹é¿Éö¾Ù¼¯||recursively enumerable set µÝ¹éÂÛ||recursion theory µÝ¹éËãÊõ||recursive arithmetic µÝ¹éÐÔ||recursiveness µÝ¹éÐòÊý||recursive ordinal µÝ½×¾ö²ß||hierarchical decision µÝ½×¿ØÖÆ||hierarchical control µã||point µã³¡||field of points µãµÄ¾Ö²¿»·||local ring of a point µãµÄÀ¿ª||blowing up at a point µãµÄÁÚÓò»ù||neighborhood basis of a point µãµÄÌØÊ⻯||specialization of a point µã¹À¼Æ||point estimation µã¹ý³Ì||point process µãº¯Êý||point function µã»®·Ö||point partitioning µãÁÐ||range of points µãÆ×||point spectrum µãʽÊÕÁ²ÍØÆË||topology of pointwise convergence µãбʽ||point slope form µãÓÐÏÞ¸²¸Ç||point-finite covering µä·¶²ã||canonical sheaf µä·¶³Ë»ý||canonical product µä·¶³ý×Ó||canonical divisor µä·¶³ý×ÓÀà||canonical divisor class µä·¶´Ô||canonical bundle µä·¶¸³Öµ||canonical valuation µä·¶¾ØÕó||canonical matrix µä·¶Ç¶Èë||canonical imbedding µä·¶Ì¬Éä||canonical morphism µäÐͱäÁ¿||canonical variable µäÐÍ·Ö½â||canonical decomposition µäÐ͸´µ¥Àî´úÊý||classical complex simple Lie algebras µäÐ͹ý³Ì||canonical process µäÐÍȺ||classical group µäÐÍʵµ¥Àî´úÊý||classical real simple Lie algebras µäÐÍÏà¹Ø·ÖÎö||canonical correlation analysis µäÐÍÏà¹ØÏµÊý||canonical correlation coefficient µäÐÍÓò||classical domain µç±¨·½³Ì||telegraph equations µ÷ºÍ²â¶È||harmonic measure µ÷ºÍ·ÖÎö||harmonic analysis µ÷ºÍ¹²éî||harmonic conjugate µ÷ºÍ¹²éîµã||harmonic conjugate points; Óֳơ°µÈ½»±Èµã(equianharmonic points)¡±¡£ µ÷ºÍº¯Êý||harmonic function µ÷ºÍ¼¶Êý||harmonic series µ÷ºÍ½â||harmonic solution µ÷ºÍƽ¾ù||harmonic mean µ÷ºÍÊýÁÐ||harmonic progression µ÷ºÍËã×Ó||harmonic operator µ÷ºÍÓ³Éä||harmonic map µ÷ºÍÓź¯Êý||harmonic majorant function µ÷½ÚÆ÷||regulator µ÷ÓŲÙ×÷||evolutionary operation µ÷ÕûÐͳé¼ì||sampling inspection with adjustment µ÷Õû×Ó||regulator µ÷ÖÆ±àÂëϵͳ||modulation coding system µü´ú²åÖµ·¨||iterated interpolation method µü´ú³éÑù·½·¨||iteration sampling technique µü´ú·¨||iteration method µü´ú¼ÆËã||iterative computations µü´úÍÅͼ||iterated clique graph µü´úÑ»·||iterative loop µþºË||iterated kernel µþ¼ÓÔÀí||superposition principle µþʽ´æ´¢Ëã·¨||stack algorithm; Óֳơ°¶ÑÕ»Ëã·¨¡±¡£ ¶¥µã||vertex ¶¥µã´«µÝͼ||vertex transitive graph ¶¥µã´ÎÊý||degree of a vertex ¶¥µãµÄȨ||weight of a vertex ¶¥µã¶Ô³Æ||vertex symmetry ¶¥µã×Óͼ||vertex subgraph ¶¥½Ç||vertex angle ¶¨³£µü´ú||stationary iteration ¶¨³£ÏµÍ³||time-invariant system ¶¨³£Ïà||stationary phase ¶¨µãÊý||fixed-point number ¶¨µãÔËËã||fixed-point arithmetic ¶¨¶î³éÑù||quota sampling ¶¨¶þ´ÎÐÍ||definite quadratic form ¶¨·ùÇúÃæ||equidistant surface ¶¨»õ||order ¶¨»õ½»¸¶Ê±¼ä||lead time ¶¨»ý·Ö||definite integral ¶¨½×ÎÊÌâ||problem of determining the order ¶¨À«ÇúÏß||curve of constant breadth ¶¨Àí||theorem ¶¨Á¿¹Û²â||quantitative observation ¶¨ÇãÇúÏß||curve of constant inclination ¶¨Ê±¶Ô²ß||game of timing ¶¨Î»ÎÊÌâ||[] problem ¶¨Ïò°ûÇ»||oriented cell ¶¨Ïòµ¥ÐÎ||oriented simplex ¶¨ÏòÁ÷ÐÎ||oriented manifold ¶¨ÏòÄâÕó||oriented matroid ¶¨Ïòͼ||oriented graph ¶¨ÐÔ¹Û²ì||qualitative observation ¶¨ÐÔÀíÂÛ||qualitative theory ¶¨Òå||definition ¶¨Òå¹ØÏµ||defining relations ¶¨ÒåÓò||domain ¶ª·¬Í¼±Æ½ü||Diophantine approximation ¶ª·¬Í¼·½³Ì||Diophantine equation ¶ª·¬Í¼¹ØÏµ||Diophantine relation ¶ª·¬Í¼¼¸ºÎ||Diophantine geometry ¶¯Á¦[ѧ]·½³Ì||equation of dynamics ¶¯Á¦ÏµÍ³||dynamical system ¶¯Á¿Ëã×Ó||momentum operator ¶¯Ì¬²¹³¥Æ÷||dynamic compensator ¶¯Ì¬¹æ»®||dynamic programming ¶¯Ì¬¹æ»®Á÷³Ìͼ||dynamic programming flow chart ¶¯Ì¬¹æ»®Ëã·¨||dynamic programming algorithm ¶¯Ì¬¹æ»®×îÓÅÐÔ·½³Ì||dynamic programming equation of optimality ¶¯Ì¬×îÓÅ»¯||dynamic optimization ¶ºÁôʱ¼ä||sojourn time ¶ÀÁ¢[µÄ]||independent ¶ÀÁ¢[¶¥]µã¼¯||independent set of vertices ¶ÀÁ¢±ß¼¯||independent set of edges ¶ÀÁ¢·½³Ì||independent equation ¶ÀÁ¢¼¯||independent set, stable set ¶ÀÁ¢Æ«¶È||independent departureness ¶ÀÁ¢ÊÔÑé||independent trials ¶ÀÁ¢Í¬·Ö²¼[µÄ]||independent identically distributed, IID ¶ÀÁ¢ÐÅÔ´||independent source ¶ÀÁ¢ÐÔ||independence ¶ÀÁ¢ÐÔ¼ìÑé||test of independence ¶ÀÁ¢ÔöÁ¿¹ý³Ì||process with independent increments, additive process ¶ÄÓë·ÖÁÑ·½·¨||roulette and splitting method ¶Å°¢Ã·¶û·¨||Duhamel method ¶Å²¼£ÂõÒ®·Ö½â||Doob-Meyer decomposition ¶Å¸£ÌØ-¸¥À¼¿Ë¶û¸ñʽ||Dufort-Frankel scheme ¶È||degree; ÔÚͼÁé¹éÔ¼¹ØÏµÏ¼¯ºÏµÄµÈ¼ÛÀà¡£ ¶È¹æº¯Êý||gauge function ¶È¹æº¯ÊýµÄ¼«º¯||polar of a gauge function ¶ÈÁ¿||metric ¶ÈÁ¿¸ñ||metric lattice ¶ÈÁ¿»¯||metrization ¶ÈÁ¿¿ÉµÝÐÔ||metric transitivity ¶ÈÁ¿¿Õ¼ä||metric space; Óֳơ°¾àÀë¿Õ¼ä¡±¡£ ¶ÈÁ¿ÃܶÈ||metric density ¶ÈÁ¿Í¹||metrically convex ¶ÈÁ¿ÏßÐÔ¿Õ¼ä||metric linear space ¶Ëµã¶¨Àí||extremal point theorem ¶Ë·½Ïò||extreme direction ¶Ë½áµã||end node ¶ËÉäÏß||extreme ray ¶ÌÕýºÏ£ÛÐò£ÝÁÐ||short exact sequence ¶ÌÖá||minor axis ¶ÓÁ㤶È||queue length; ¼ò³Æ¡°¶Ó³¤¡±¡£ ¶ÓÁÐÁ¿||queue size ¶Ô±ß||opposite side ¶Ô²ß||game; Óֳơ°²©ÞÄ¡±¡£ ¶Ô²ßµÄ½×¶Î||stage of game ¶Ô²ßµÄÖµ||value of a game ¶Ô²ßÂÛ||game theory; Óֳơ°²©ÞÈÂÛ¡±¡£ ¶Ô²ßÄ£Äâ||gaming ¶Ô²ßÄ£ÐÍ||gaming models ¶Ô²ßÊ÷||game tree ¶Ô²ßÔªËØ||game element ¶Ô³Æ±ä»»||symmetric transformation ¶Ô³Æ²î||symmetric difference ¶Ô³Æ³éÑù·½·¨||symmetry sampling technique ¶Ô³Æ´úÊý||symmetric algebra ¶Ô³Æµã||symmetric point ¶Ô³Æ¶Ô²ß||symmetric game ¶Ô³Æ¶àÏîʽ||symmetric polynomial ¶Ô³Æ¶àÖØÏßÐÔÓ³Éä||symmetric multilinear mapping ¶Ô³Æ·Ö²¼||symmetric distribution ¶Ô³Æ¸ñ||symmetric lattice ¶Ô³ÆºË||symmetric kernel ¶Ô³Æ»¯×Ó||symmetrizer ¶Ô³Æ¾ØÕó||symmetric matrix ¶Ô³ÆÂí¶û¿É·ò¹ý³Ì||symmetric Markov process ¶Ô³ÆÇø×éÉè¼Æ||symmetric block design ¶Ô³ÆÈº||symmetric group ¶Ô³ÆÈºµÄ±íʾ||representation of symmetric group ¶Ô³ÆË«Çú[ÐÍ]×é||symmetric hyperbolic system ¶Ô³ÆË«Çú£ÛÐÍ£ÝËã×Ó||symmetric hyperbolic operator ¶Ô³ÆË«ÏßÐÔÐÍ||symmetric bilinear form ¶Ô³ÆËã×Ó||symmetric operator; Óֳơ°°£¶ûÃ×ÌØËã×Ó(Hermitian operator)¡±¡£ ¶Ô³ÆÍ¼||symmetric graph ¶Ô³ÆÐÐÁÐʽ||symmetric determinant ¶Ô³ÆÐÔ||symmetry ¶Ô³ÆÔÀí||symmetry principle; ½âÎö¿ªÍصÄÒ»ÖÖ·½·¨ ¡£ ¶Ô³ÆÕÅÁ¿||symmetric tensor ¶Ô³ÆÖÐÐÄ||center of symmetry ¶Ô³ÆÖá||axis of symmetry ¶Ô¶¥½Ç||opposite angles, vertical angles ¶Ô·Ö·¨||bisection method, bisection technique ¶Ô·ÖËÑË÷||dichotomous search ¶ÔºÏ||involution ¶ÔºÏ´úÊý||involutory algebra ¶ÔºÏ¶ÔÉä±ä»»||involutive correlation ¶ÔºÏ»·||involutive ring ¶Ô»»||transposition ¶Ô½Ç[Ïß]»¯||diagonalization ¶Ô½Ç»¯·½·¨||diagonalization method ¶Ô½Ç¾ØÕó||diagonal matrix ¶Ô½Ç̬Éä||diagonal morphism ¶Ô½ÇÏß||diagonal ¶Ô½ÇÏß·½·¨||diagonal argument, diagonal method ¶Ô½ÇÓÅÊÆ||diagonal dominance ¶Ô¾¶µã||antipodal point ¶ÔÁ¢Ê¼þ||complementary events ¶Ôż[ÐÔ]Ó³Éä||duality mapping ¶Ôż||dual; ָͬһÊýÓòÉÏÁ½ÏßÐÔ¿Õ¼äX£¬YÉϵÄһ˫ÏßÐÔ·ºº¯¡´X£¬Y¡µ(x¡ÊX£¬y¡ÊY) ¶Ôż£ÛÏßÐÔ£ÝÓ³Éä||dual [linear] mapping ¶Ôż°¢±´¶û´Ø||dual Abelian variety ¶Ôż°ëȺ||dual semi-group ¶Ôż±äÁ¿||dual variable ¶Ôż±äÊý·½·¨||antithetic variates method ¶Ôż±íʾ||dual representation ¶Ôż´Ô||dual bundle ¶Ôż´úÊý||dual algebra ¶Ôżµ¥´¿Ðη¨||dual simplex method ¶ÔżµØÍ¼||dual map ¶Ôż¶¨Àí||duality theorem ¶Ôż¶ÔÏó||dual object ¶Ôż·¶³ë||dual category, cocategory, opposite category ¶Ôż¸ñ||dual lattice ¶Ôż¹æ»®||dual program ¶Ôżº¯×Ó||dual functor ¶Ôż»¯²ã||dualizing sheaf ¶Ôż»ù||dual basis ¶Ôż¼ä϶||duality gap ¶Ôż½â||dual solution ¶Ôż¿Õ¼ä||dual spaces; Óֳơ°¹²éî¿Õ¼ä (conjugate spaces)¡±¡£; dual spaces; Óֳơ°¹²éî¿Õ¼ä (conjugate spaces)¡±¡£ Ö¸¾ßÓжÔż¹ØÏµµÄÁ½ÏßÐÔ¿Õ¼ä ¶ÔżÀíÂÛ||duality theory ¶ÔżÁ´¸´ÐÎ||dual chain complex ¶Ôżģ||dual module ¶ÔżÅŶÓϵͳ||dual queueing system ¶ÔÅ¼Çø×éÉè¼Æ||dual block design ¶ÔżÇúÏß||dual curve ¶ÔżËã×Ó||dual operator ¶Ôżͬ¹¹||dual isomorphism ¶Ôż̬ͬ||dual homomorphism ¶ÔżͬԴ||dual isogeny ¶ÔżͶӰ||dual projection ¶ÔżÏßÐԹ滮||dual linear programming ¶ÔżÏòÁ¿||dual vector ¶ÔżÐÔ||duality ¶ÔżÔÀí||principle of duality; duality principle ¶ÔÅ¼Ô¼Êø||dual constraint ¶Ôż׶||dual cone ¶ÔÉä±ä»»||correlation ¶ÔÊý||logarithm ¶ÔÊýµ¥Î»Ä£ÐÍ||logit model ¶ÔÊýµ¼Êý||logarithmic derivative ¶ÔÊýµÄµ×||base of logarithm ¶ÔÊýµÄÊ×Êý||characteristic of logarithm ¶ÔÊýµÄβÊý||mantissa of logarithm ¶ÔÊý¹«Ô¿ÌåÖÆ||logarithm public key system ¶ÔÊýº¯Êý||logarithmic function ¶ÔÊýºË||logarithmic kernel ¶ÔÊý»ý·Ö||logarithmic integral ¶ÔÊýÈÝÁ¿||logarithmic capacity ¶ÔÊýÎ»ÊÆ||logarithmic potential ¶ÔÊýÕý̬·Ö²¼||logarithmic normal distribution ¶ÔÏó||object ¶ÔÏóµÄ»ý||product of objects ¶ÔÏóµÄÓà»ý||coproduct of objects ¶ÔÓ¦||correspondence ¶ÔÓ¦·ÖÎö||correspondence analysis ¶ÔÕÕ||contrast ¶ÔÕÕ·ÖÎö||contrast analysis ¶Û½Ç||obtuse angle ¶Û½ÇÈý½ÇÐÎ||obtuse triangle ¶à[×Ö³¤]¾«¶È||multiprecision ¶à¦£º¯Êý||polygamma-function ¶à±ßÐÎ||polygon ¶à±äÁ¿ÏµÍ³||multivariable system; Óֳơ°¶àÊäÈë¶àÊä³öϵͳ(multi-input multi-output system, ¶à²½·¨||multistep method ¶à²ÎÊý¹ý³Ì||multi-parametric process ¶à²ã·½·¨||multi-level method ¶à²ã¸ñʽ||multi-level scheme ¶à´Î³é¼ì||multiple sampling inspection ¶à´ú¾Ø¹À¼Æ·½·¨||multigeneration moment estimator method ¶àµãÅÁµÂ±Æ½ü||multipoint Pad¨¦ approximation ¶à·å·Ö²¼||multimodal distribution ¶à¸´±äº¯Êý||function of several complex variables ¶à¼¶³éÑù||multistage sampling ¶à¼¶¿ØÖÆ||multilevel control ¶à¼¶ÏµÍ³||multilevel system ¶à½ÓÈëÐŵÀ||multiple access channel ¶à½×¶Î¶Ô²ß||multistage game ¶à½×¶Î¾ö²ß¹ý³Ì||multistage decision process; Óֳơ°¶à¼¶¾ö²ß¹ý³Ì¡±¡£ ¶àÁ¬Í¨[µÄ]||multiply connected ¶àÁ¬Í¨[Çø]Óò||multiply connected domain ¶à·ÐŵÀ||multi-way channel ¶àÃæ½Ç||polyhedral angle ¶àÃæÌå||polyhedron ¶àÃæÌå¶Ô²ß||polyhedral game ¶àÃæÌåȺ||polyhedron group ¶àÄ¿±ê·ÇÏßÐԹ滮||multiobjective non-linear programming ¶àÄ¿±ê·Öʽ¹æ»®||multiobjective fractional programming ¶àÄ¿±ê¹æ»®||multiple objective programming ¶àÄ¿±ê½»»¥¹æ»®·½·¨||multiobjective interactive programming method ¶àÄ¿±ê¾ö²ß||multiple criteria decision making ¶àÄ¿±ê͹¹æ»®||multiobjective convex programming ¶àÄ¿±êÏßÐԹ滮||multiobjective linear programming ¶àÄ¿±ê×îÓÅ»¯||multiobjective optimization ¶àȺÃÉÌØ¿¨ÂÞ·½·¨||multigroup Monte Carlo method ¶àÈ˶Բß||multi-person games ¶àÊýÂß¼ÒëÂë||majority logic decoding ¶ą̀·þÎñϵͳ||multi-server system ¶àÌåÎÊÌâ||many-body problem ¶àά¸´¿Õ¼ä||complex space of several dimensions ¶àάϵͳ||multidimensional system ¶àÏî·Ö²¼||multinomial distribution ¶àÏîʽ||polynomial ¶àÏîʽ±Æ½ü||polynomial approximation ¶àÏîʽµÄ´ÎÊý||degree of a polynomial ¶àÏîʽµÄÈݶÈ||content of a polynomial ¶àÏîʽ¶Ô²ß||polynomial game ¶àÏîʽ·½³Ì||polynomial equation ¶àÏîʽ»·||polynomial ring ¶àÏîʽ»Ø¹é||polynomial regression ¶àÏîʽ¼ÓËÙ[·¨]||polynomial acceleration ¶àÏîʽ¾ØÕóϵͳ||polynomial matrix system ¶àÏîʽʱ¼äËã·¨||polynomial-time algorithm ¶àÏîʽ٤ÂÞÍßȺ||Galois group of polynomial ¶àÐÅÔ´||multiple source ¶àÒ¶º¯Êý||multivalent function ¶àÒ»¿É¹éÔ¼ÐÔ||many one reducibility ¶àÒÁÁÖÕý¹æÐÎ||Deuring normal form ¶àÓû§ÐŵÀ||multi-user channel ¶àÓû§ÐÅÏ¢ÂÛ||multi-user information theory ¶àÓàÐÅÏ¢||redundant information ¶àÔª[ͳ¼Æ]·ÖÎö||multivariate [statistical] analysis ¶àÔª²åÖµ||multivariate interpolation ¶àÔª³¬¼¸ºÎ·Ö²¼||multivariate hypergeometric distribution ¶àÔª¶àÏîʽ||polynomial in several indeterminates ¶àÔª·½²î·ÖÎö||multivariate analysis of variance ¶àÔªº¯Êý||function of several variables ¶àÔª½âÎöº¯Êý||analytic function of several variables ¶àԪȫ´¿º¯Êý||holomorphic function of several variables ¶àԪʱ¼äÐòÁÐ||multivariate time series ¶àÔªÏßÐÔÄ£ÐÍ||multivariate linear model ¶àÔªÑù±¾||multivariate sample ¶àÔªÕý̬·Ö²¼||multivariate normal distribution ¶àÔª×ÜÌå||multivariate population ¶àÔ²ÅÌ||polydisc ¶àÖµº¯Êý||multiple valued function, multivalued function ¶àÖµÂß¼||multivalue logic, many-valued logic, multiple-value logic ¶àÖ¸±ê||multicriteria ¶àÖ¸±ê¶¯Ì¬¹æ»®||multicriteria dynamic programming ¶àÖ¸±ê¹ý³Ì||multi-indexed process ¶àÖÖÀàν´ÊÑÝËã||many sorted predicate calculus ¶àÖØ±È½Ï||multiple comparison ¶àÖØ³ß¶ÈÎÊÌâ||multiple scale problem ¶àÖØ´Îµ÷ºÍº¯Êý||plurisubharmonic function ¶àÖØ´ò°Ð·¨||multiple shooting method ¶àÖØµ÷ºÍº¯Êý||pluriharmonic function ¶àÖØ¸µÀïÒ¶¼¶Êý||multiple Fourier series ¶àÖØ¹²ÏßÐÔ||multicollinearity ¶àÖØ»ý·Ö||multiple integral ¶àÖØ¼«ÏÞ»·||multiple limit-cycle ¶àÖØ¼¶Êý||multiple series ¶àÖØÃݼ¶Êý||multiple power series ¶àÖØÅŶÓ||multiqueue ¶àÖØÊýÖµ»ý·Ö||multiple numerical integration ¶àÖØÌØÕ÷||multiple characteristics ¶àÖØÍø¸ñ||multi-grid ¶àÖØÍø¸ñ·¨||multi-grid method ¶àÖØÏßÐÔ´úÊý||multilinear algebra ¶àÖØÏßÐÔ·ºº¯||multilinear functional ¶àÖØÏßÐÔËã×Ó||multilinear operator ¶àÖØÏßÐÔÐÍ||multilinear form ¶àÖØÏßÐÔÓ³Éä||multilinear mapping ¶ñÐÔÂë||catastrophic code ¶÷˹¿â¸ñ·¨||Enskog method ¶þ°àÇúÏß||curve of the second class; Óֳơ°ÏßÔ²×¶ÇúÏß(line conic)¡±¡£ ¶þ²¿Í¼||bipartite graph ¶þ´Î±Æ½ü·¨||quadratic approximation method ¶þ´Î±ä»»||quadratic transformation ¶þ´Î²åÖµ||quadratic interpolation ¶þ´Î³¬ÇúÃæ||quadratic hypersurface ¶þ´Î³é¼ì||double sampling inspection ¶þ´Î¶Ôż||bidual, second dual ¶þ´Î¶Ôż¿Õ¼ä||bidual space ¶þ´Î¶ÔżÎÊÌâ||quadratic dual problem ¶þ´Î¹æ»®||quadratic programming ¶þ´Î»¥·´ÂÉ||quadratic reciprocity law ¶þ´Î½»»»×Ó||double commutant ¶þ´Î¿Õ¼ä||quadratic space ¶þ´Î¿Õ¼äµÄ¸ñ||lattice in a quadratic space ¶þ´Î¿Õ¼äµÄ¸ù||radical of a quadratic space ¶þ´ÎÅöײ¸ÅÂÊ·½·¨||quadratic collision probability method ¶þ´ÎÇúÃæ||quadric surface, surface of second order ¶þ´ÎÇúÏß||curve of second order; Óֳơ°Ô²×¶ÇúÏß(point conic)¡±¡£ ¶þ´ÎÊ£Óà||quadratic residue ¶þ´ÎͬÓà·½³Ì||quadratic congruence ¶þ´ÎÐÍ||quadratic form ¶þ´ÎÐ͵ĵȼÛ||equivalence of quadratic forms ¶þ´ÎÐ͵ĹþÈû²»±äÁ¿||Hasse invariant of a quadratic form ¶þ´ÎÐ͵ľØÕó||matrix of quadratic form ¶þ´ÎÐ͵ÄÅбðʽ||discriminant of quadratic form ¶þ´ÎÐ͵ÄÖÈ||rank of quadratic form ¶þ´ÎÒò×Ó·¨||quadratic factoring method ¶þ´ÎÓ³Éä||quadratic mapping ¶þ´ÎÓò||quadratic field ¶þ´ÎÔª||quadratic element ¶þ´ÎÖ¸ÅÉÎÊÌâ||quadratic assignment problem ¶þ¼¶µ¥Ôª||secondary [sampling] unit, second stage unit ¶þ½×±ä·Ö||second variation ¶þ½×³ä·ÖÌõ¼þ||second-order sufficient condition ¶þ½×¹ý³Ì||second order process ¶þ½×¼ÓÍÐ΢·Ö||second Gateaux differential ¶þ½×ƫ΢·Ö·½³Ì||partial differential equation of second order ¶þ½×ËãÊõ||second-order arithmetic ¶þ½×Îȶ¨ÐÔ||stability of degree two ¶þ½×ЧÂÊ||second-order efficiency ¶þ½×Ô¼Êø¹æ¸ñ||second-order constraint qualification; Óֳơ°¶þ´ÎÔ¼ÊøÆ·ÐÔ¡±¡£ ¶þ½ø¶Ô³ÆÐŵÀ||binary symmetric channel ¶þ½ø·Ö¸î||dyadic decomposition ¶þ½øÉ¾³ýÐŵÀ||binary erasure channel ¶þ½øÊýȺ||group of binary numbers ¶þ½øÓò||dyadic field ¶þ½øÖÆ||binary system ¶þÃæÌåȺ||dihedral group ¶þÊ®ÃæÌå||icosahedron ¶þάϵͳ||two dimensional system; ¼ò³Æ¡°2Dϵͳ (2D system)¡±¡£ ¶þÏî·½³Ì||binomial equation ¶þÏî·Ö²¼||binomial distribution ¶þÏîʽ||binomial ¶þÏîʽ¶¨Àí||binomial theorem ¶þÏîʽϵÊý||binomial coefficients ¶þÒò×ÓÊÔÑéÉè¼Æ||two-way layout ¶þÔªº¯×Ó||bifunctor ¶þÔªÈý´ÎÐÍ||binary cubic form ¶þÔªÔËËã||binary operation ¶þֵʱ¼äÐòÁÐ||binary time series ¶þÖØ²åÖµ||double interpolation ¶þÖØ²î·Ö||double difference ¶þÖØµã||double point ¶þÖØ¸´ÐÎ||double complex ¶þÖØ¸ù||double root ¶þÖØ»ý·Ö||double integral ¶þÖØ¼¶Êý||double series ¶þÖØÇÐÏß||double tangent ·¢É¢[ÐÔ]||divergence ·¢Õ¹·½³Ì||evolution equation ·£²ÎÊý||penalty parameter ·£º¯Êý||penalty function; Óֳơ°²¹³¥º¯Êý¡±¡£ ·£º¯Êý·¨||penalty function method ·£ËÆÈ»º¯Êý||penalized likelihood function ·¨±´¶û-¿ËÀ¶÷²»µÈʽ||Faber-Krahn inequality ·¨´Ô||normal bundle ·¨ÀïÐòÁÐ||Farey sequence ·¨Æ½Ãæ||normal plane ·¨ÇúÂÊ||normal curvature ·¨Í¼¼¯||Fatou set ·¨Ïß||normal line, normal ·¨Ïßʽ||normal form ·¨×¶||normal cone ·¨×ø±ê||normal coordinates ·´°£¶ûÃ×ÌØ±ä»»||skew-Hermitian transformation ·´°£¶ûÃ×ÌØ¾ØÕó||skew-Hermitian matrix, anti-Hermitian matrix ·´±È||inverse proportion ·´±äHomº¯×Ó||contravariant Hom functor ·´±ä||contravariant ·´±äº¯×Ó||contravariant functor ·´±äÕÅÁ¿||contravariant tensor ·´±äÖ¸±ê||contravariant index ·´³£¶Ô²ß||improper game ·´³£»ý·Ö||improper integral ·´³£Í¹º¯Êý||improper convex function ·´³£Ðýת||improper rotation ·´³£Õý½»¾ØÕó||improper orthogonal matrix ·´³Æ[µÄ]||anti-symmetric ·´³Æ±ä»»||skew-symmetric transformation ·´³Æ¾ØÕó||skew-symmetric matrix, anti-symmetric matrix; Óֳơ°½»´í¾ØÕó (alternating matrix)¡±¡£ ·´³ÆË«ÏßÐÔÐÍ||skew-symmetric bilinear form ·´³ÆÐͰ¢´ïÂí¾ØÕó||Hadamard matrices of skew type ·´³ÆÐÐÁÐʽ||skew-symmetric determinant ·´´úÊý||opposite algebra ·´¶ÔÊý||anti-logarithm ·´º¯Êý||inverse function ·´½»»»||anti-commutative ·´À¡º¯Êý||feedback function ·´À¡¿ØÖÆ||feedback control ·´À¡¿ØÖÆÆ÷||feedback controller ·´À¡ÐŵÀ||feedback channel ·´À¡ÒÆÎ»¼Ä´æÆ÷||feedback shift register ·´À¡ÒëÂë||feedback decoding ·´À¡ÔöÒæ[¾Ø]Õó||feedback gain matrix ·´À¡ÔöÒæ||feedback gain ·´Àý||counter example ·´ÃÝ·¨||inverse power method ·´Èý½Çº¯Êý||inverse circular function, inverse trigonometric function ·´Éä±Ú||reflecting barrier ·´Í¬¹¹||anti-isomorphism ·´Í¬Ì¬||anti-homomorphism ·´Ïòͼ||converse digraph ·´ÑÝ||inversion ·´Ñݹ«Ê½||inversion formula ·´ÑÝÇòÃæ||sphere of inversion ·´ÑÝÔ²||circle of inversion ·´ÑÝÖÐÐÄ||center of inversion ·´Ó¦À©É¢·½³Ì||reaction-diffusion equation ·´ÕýÏÒ||inverse sine, anti-sine, arc-sine ·´ÕýÏÒ·Ö²¼||arcsine distribution ·´×Ôͬ¹¹||anti-automorphism ·µ»ØµÄ||recurrent ·¶||norm ·¶³ë||category ·¶³ëµÄµÈ¼Û||equivalence of categories ·¶³ëµÄͬ¹¹||isomorphism of categories ·¶³ëÂÛ||category theory ·¶³ëÂß¼||categorical logic ·¶³ëÐÔ||categoricity ·¶µÂ²¨¶û·½³Ì||van der Pol equation ·¶µÂ¿ÆÆÕ·½·¨||Van der Corput method ·¶µÂÃɵÂÐÐÁÐʽ||Vandermonde determinant ·¶Ê£Óà||norm residue ·¶Ê£Óà·ûºÅ||norm residue symbol ·¶Ê½||normal form ·¶Êý||norm ·º°üÂç´úÊý||universal enveloping algebra ·º´úÊý||universal algebra ·º´úÊý´Ø||variety of universal algebras ·º´úÊýµÄͬÓà£Û¹ØÏµ£Ý||congruence on universal algebra ·º´úÊýµÄÐÍ||type of an universal algebra ·º´úÊýÀà||class of universal algebras ·ºµã||generic point ·º¶ÔÏó||universal object ·º·Ö²¼||universal distribution ·º¸²µþȺ||universal covering group ·ºº¯||functional ·ºº¯·ÖÎö||functional analysis ·º¾ØÕó´úÊý||generic matrix algebra ·ºÍ¬Ì¬||generic homomorphism ·ºÐÔÖÊ||universal property ·ºÓ³Éä||universal mapping ·ºÖµÐÍ||universal form ·½²î||variance ·½²î·ÖÁ¿||variance component ·½²î·ÖÁ¿Ä£ÐÍ||variance component model ·½²î·ÖÎö||analysis of variance ·½²î·ÖÎö±í||analysis of variance table ·½²îÆëÐÔ¼ìÑé||homogeneity test for variance ·½³Ì||equation ·½Ïò±È||direction ratio ·½Ïò³¡||direction field; Óֳơ°ÏßËØ³¡ (line element field)¡±¡£ ·½Ïòµ¼Êý||directional derivative ·½ÏòÆ«ÒгéÑù·½·¨||direction bias sampling method ·½Õó||square matrix ·Â½ô¿Õ¼ä||paracompact space ·ÂÉä[´úÊý]´Ø||affine [algebraic] variety ·ÂÉä°ü||affine hull ·ÂÉä±ä»»||affine transformation ·ÂÉä±ä»»Èº||affine transformation group ·ÂÉä³¬Æ½Ãæ||affine hyperplane ·ÂÉä´ØµÄάÊý||dimension of an affine variety ·ÂÉä´úÊýȺ||affine algebraic group ·ÂÉäµÈ¼Û||affine congruence, affine equivalence ·ÂÉä·¨Ïß||affine normal ·ÂÉä¸ÅÐÎ||affine scheme ·ÂÉ亯Êý||affine function ·ÂÉ伯||affine set ·ÂÉ伸ºÎ[ѧ]||affine geometry ·ÂÉä¿Õ¼ä||affine space ·ÂÉäÁªÂç||affine connection ·ÂÉäÆ½Ãæ||affine plane ·ÂÉäÇúÂÊ||affine curvature ·ÂÉäÇúÏß||affine curve ·ÂÉäȺ||affine group ·ÂÉäȺµÄÏßÐÔ»¯||linearization of affine groups ·ÂÉä΢·Ö¼¸ºÎ [ѧ]||affine differential geometry ·ÂÉäÎÞ¹Ø||affinely independent ·ÂÉäÐÔÖÊ||affine property ·ÂÉäÓ³Éä||affine mapping ·ÂÉäÖ±Ïß||affine line ·ÂÉäÖÐÐÄ||center of affinity ·ÂÉä×ø±ê||affine coordinate ·ÂÉä×ø±ê»·||affine coordinate ring ·Â΢·ÖËã×Ó||paradifferential operator ·Å´ó¾ØÕó||amplification matrix ·Å´óÒò×Ó||amplification factor ·Å»Ø³éÑù||sampling with replacement ·Å¿Õ||emptiness ·Å¿í³é¼ì||reduced sampling inspection ·ÆÂ¡Çó»ý||Filon quadrature ·ÆÄù¶ú»ý·Ö||Fresnel integral ·ÆÍ¢·Ö½â||Fitting decomposition ·Ç[ÊÜ]¿Ø½â||non-dominated solution ·Ç°¢±´¶ûµÄÉÏͬµ÷||non-Abelian cohomology ·Ç°¢±´¶ûÀàÓòÂÛ||non-Abelian class field theory ·Ç°¢»ùÃ׵¼¸ºÎ[ѧ]||non-Archimedean geometry ·Ç°¢»ùÃ׵¾ø¶ÔÖµ||non-Archimedean absolute value ·Ç°¢»ùÃ×µÂÐòÓò||non-Archimedean ordered field ·Ç±¾ÔȺ||imprimitive group ·Ç±¾ÖʶԲß||inessential game; Óֳơ°·ÇʵÖÊÐԶԲߡ±¡£ ·Ç±ê×¼·ÖÎö||non-standard analysis ·Ç±ê×¼Á¿´Ê||non-standard quantifier ·Ç±ê׼ģÐÍ||non-standard model ·Ç²ÎÊý»Ø¹é||non-parametric regression ·Ç²ÎÊýͳ¼Æ||non-parametric statistics ·Ç³£·µ×´Ì¬||non-recurrent state, transient state ·ÇµÂÈø¸ñ¼¸ºÎ||non-Desargues geometry ·Ç¶Ô³ÆÐŵÀ||asymmetric channel ·Ç·ÖÆçÀ©ÕÅ||unramified extension ·Ç¸º¾ØÕó||non-negative matrix ·Ç¸ºÌØÕ÷ÐÍ||non-negative characteristic form ·Ç¸ºÍ¹º¯ÊýµÄ¼«º¯||polar of non-negative convex function ·Ç¹â»¬·ÖÎö||non-smooth analysis ·Ç¹â»¬×îÓÅ»¯||non-smooth optimization ·ÇºÏ×÷¶Ô²ß||non-cooperative game ·Ç»ìºÏÀíÏë||unmixed ideal ·Ç¼¾½Ú»¯ÐòÁÐ||deseasonalized series ·Ç¼õ||non-decreasing ·Ç½»»»»·||non-commutative ring ·Ç½»»»¾Ö²¿»¯||non-commutative localization ·Ç½»»»¾Ö²¿»·||non-commutative local ring ·Ç½»»»Èº||non-commutative group ·Ç½»»»Î¨Ò»Òò×Ó·Ö½â||non-commutative unique factorization ·Ç½»»»Õû»·||non-commutative domain ·Ç½»»»Ö÷ÀíÏëÕû»·||non-commutative principal ideal domain ·Ç½áºÏ´úÊý||non-associative algebra ·Ç½áºÏ»·||non-associative ring ·Ç½áºÏ¿É³ý´úÊý||non-associative division algebra ·Ç½âÎö΢·Ö·½³Ì||non-analytic differential equation ·Ç½ô²â¶È||measure of non-compactness ·ÇÀ©ÕÅËã×Ó||non-expansive operator ·ÇÁÓ½â||non-inferior solution ·ÇÁãºÍ¶Ô²ß||non-zero-sum game ·ÇÃÔÏòÏòÁ¿||anisotropic vector ·ÇÃÔÏò×Ó¿Õ¼ä||anisotropic subspace ·ÇÄ£ÄâÃÉÌØ¿¨ÂÞ·½·¨||non-analog Monte Carlo method ·ÇÅ·[¼¸ÀïµÃ£Ý¾àÀë||non-Euclidean distance ·ÇÅ·£Û¼¸ÀïµÃ£Ý½Ç||non-Euclidean angle ·ÇÅ·¼¸ºÎ[ѧ]||non-Euclidean geometry ·ÇÆæ[Òì]µã||non-singular point ·ÇÆæ´Ø||non-singular variety ·ÇÆæÒì±ä»»||non-singular transformation ·ÇÆæÒìË«ÏßÐÔÐÍ||non-singular bilinear form ·ÇÆæÒìÏßÐԱ任||non-singular linear transformation ·ÇÆë´Î±ß½çÌõ¼þ||non-homogeneous boundary condition ·ÇÆë´ÎµÄºá·Ö½â||inhomogeneous bar resolution ·ÇÆë´Î¶àÏîʽ||inhomogeneous polynomial ·ÇÆë´ÎÏßÐÔ·½³Ì×é||system of non-homogeneous linear equations ·ÇÆë´Î×ø±ê||non-homogeneous coordinates ·ÇÆëÐÔ×ÜÌå||heterogeneous populations ·ÇǿռÐÍÓÅÏÈȨ||non-preemptive priority ·ÇÇÐÏò¼«ÏÞ||non-tangential limit ·ÇÈ·¶¨ÐÔͼÁé»ú||non-deterministic Turing machine ·ÇÊ£Óà||non-residue ·ÇÊܿصã||non-dominated point; Óֳơ°·Ç¿Øµã¡±¡£ ·ÇËæ»ú»¯¾ö²ßº¯Êý||non-randomized decision function ·ÇͬÓà||incongruent ·Ç͹¶þ´Î¹æ»®||non-convex quadratic programming ·Ç͹¹æ»®||non-convex programming ·ÇÍË»¯¶þ´ÎÐÍ||non-degenerate quadratic form ·ÇÍË»¯»ù±¾¿ÉÐнâ||non-degenerate basic feasible solution ·ÇÍË»¯¾ØÕó||non-degenerate matrix ·ÇÍË»¯Ë«ÏßÐÔÐÍ||non-degenerate bilinear form ·ÇÎȶ¨Á÷ÐÎ||unstable manifold ·ÇÏßÐÔ[µÄ]||non-linear ·ÇÏßÐÔ±¾Õ÷ÖµÎÊÌâ||non-linear eigenvalue problem ·ÇÏßÐԱƽü||non-linear approximation ·ÇÏßÐÔ±ßÖµÎÊÌâ||non-linear boundary value problem ·ÇÏßÐÔ²»Îȶ¨ÐÔ||non-linear instability ·ÇÏßÐÔµÝ¹é¹ØÏµ||non-linear recurrence ·ÇÏßÐÔ·ºº¯·ÖÎö||non-linear functional analysis ·ÇÏßÐÔ¸´ÔÓ¶È||non-linear complexity ·ÇÏßÐԹ滮||non-linear programming ·ÇÏßÐԻعé||non-linear regression ·ÇÏßÐÔ»ý·Ö·½³Ì||non-linear integral equation ·ÇÏßÐÔÂ˲¨||non-linear filtering ·ÇÏßÐÔÄ£ÐÍ||non-linear model ·ÇÏßÐÔÅ×Îï[ÐÍ]||non-linear parabolic ·ÇÏßÐÔÆ«Î¢·Ö·½³Ì||non-linear partial differential equation ·ÇÏßÐÔË«Çú[ÐÍ]||non-linear hyperbolic ·ÇÏßÐÔͬÓà·½·¨||non-linear congruential method ·ÇÏßÐÔÍÖÔ²[ÐÍ]||non-linear elliptic ·ÇÏßÐÔϵͳ||non-linear system ·ÇÏßÐÔѦ¶¨ÚÌ·½³Ì||non-linear Schrodinger equation ·ÇÏßÐÔÓ³Éä||non-linear mapping; Óֳơ°·ÇÏßÐÔËã×Ó(non-linear operator)¡±¡£ ·ÇÏßÐÔÔ¼Êø||non-linear constraint ·ÇÏßÐÔÕñ¶¯||non-linear oscillation ·ÇÏßÐÔ×ԻعéÄ£ÐÍ||non-linear autoregressive model ·ÇÏßÐÔ×îÓÅ»¯||non-linear optimization ·Çе÷°åÔª||non-conforming plate element ·Çе÷ĤԪ||non-conforming membrane element ·Çе÷ÓÐÏÞÔª||non-conforming finite element ·ÇÐÎʽ¹«Àíѧ||informal axiomatics ·ÇÑ»·Âë||non-cyclic code ·ÇÓε´¼¯||non-wandering set ·ÇÔö||non-increasing ·ÇÔöÖØÅź¯Êý||non-increasing rearrangement function ·ÇÕýÔò±ß½çµã||irregular boundary point ·ÇÕýÔò¼âµã||irregular cusp ·ÇÕýÔò½áµã||irregular node ·ÇÕýÔòÆæµã||irregular singular point ·ÇÕýÔòËØÊý||irregular prime ·ÇÕýÔòÍø¸ñ||irregular net ·Çֱν£ÛµÄ£Ý||impredicative ·Çֱν¼¯ºÏÂÛ||impredicative set theory ·ÇÖÐÐÄF·Ö²¼||non-central F-distribution ·ÇÖÐÐÄt·Ö²¼||non-central t-distribution ·ÇÖÐÐĦÖ2·Ö²¼||non-central chi-square distribution ·ÇÖÐÐIJÎÊý||non-centrality parameter ·ÇÖÐÐÄÍþÉ³ÌØ·Ö²¼||non-central Wishart distribution ·ÇÖ÷ÐÍËã×Ó||operator of non-principal type ·Ç×ÔÖÎ΢·Ö·½³Ì×é||non-autonomous system of differential equations ·ÑÂí´ó¶¨Àí||Fermat last theorem ·ÑÂíÊý||Fermat number ·ÑŵÒëÂëËã·¨||Fano decoding algorithm ·ÑÏ£¶ûÅбðº¯Êý||Fisher discriminant function ·ÑÏ£¶ûÐÅÏ¢º¯Êý||Fisher information function ·ÑÒ®ºË||Fej¨¦r kernel ·ÑҮƽ¾ù||Fej¨¦r mean ·ÑÓ÷ÖÎö||cost analysis ·ÑÓú¯Êý||cost function ·ÑÓýṹ||cost structure ·ÑÓÃϵÊý||cost coefficients ·ÑÓÃÏòÁ¿||cost vector ·Ò˹ÀÕÁ÷ÐÎ||Finsler manifold ·Ö£ÛÊý£ÝÖ¸Êý||fractional exponent ·Ö±È||proportion by subtraction ·Ö²¼²ÎÊýϵͳ||distributed parameter system ·Ö²¼º¯Êý||distribution function ·Ö²¼½â||distribution solution; Óֳơ°¹ãÒ庯Êý½â (generalized function solution)¡±¡£ ·Ö²½·¨||fractional step method ·Ö²¿»ý·Ö·¨||integration by parts ·Ö²ã||hierarchy; ¶ÔÄ³ÌØ¶¨¶ÔÏóÀà°´ÆäÔªËØ¶¨ÒåµÄ¸´ÔÓÐÔ½¨Á¢ÆðÀ´µÄ´øÓаüº¬¹ØÏµµÄ·ÖÀà¡£; stratification; Ö¸¿Õ¼äµÄ·Ö²ã¡£ ·Ö²ã³éÑù||stratified sampling ·Ö²ãµ¥´¿Ðη¨||stratified simplex method ·Ö²ã¶àÄ¿±ê¹æ»®||stratified multiobjective programming ·Ö²æ||forking ·Ö²ðº¯Êý||partition function ·Ö´Î´úÊý||graded algebra ·Ö´Î»·||graded ring ·Ö´ÎÀíÏë||graded ideal ·Ö´ÎÄ£||graded module ·Ö´Î̬ͬ||graded homomorphism ·Ö´Î×ÓÄ£||graded submodule ·Öµã||point of division ·Ö¶Î±Æ½ü||piecewise approximation ·Ö¶Î²åÖµ||piecewise interpolation ·Ö¶Î¶àÏîʽ||piecewise polynomial ·Ö¶ÎÁ¬Ðø[µÄ]||piecewise continuous ·Ö¸îµÄìØ||entropy of the partition ·Ö¸îËÑË÷||sectioning search ·Ö»®¸ñ||partition lattice ·Ö½âȺ||decomposition group ·Ö½âÊý||decomposition numbers ·Ö½âÓò||decomposition field ·Ö½âÔÀí||decomposition principle ·Ö¿é||partitioning ·Ö¿é³Ë·¨||block multiplication ·Ö¿é¶Ô½Ç¾ØÕó||block diagonal matrix ·Ö¿éÊý¾ÝѹËõ||block data compression ·ÖÀà¿Õ¼ä||classifying space ·ÖÀë±äÁ¿·¨||method of separation of variables ·ÖÀë³¬Æ½Ãæ||separating hyperplane ·ÖÀ볬Խ»ù||separating transcendental basis ·ÖÀëµã||separated point ·ÖÀ붨Àí||separating theorem ·ÖÀë¸ÅÐÎ||separated scheme ·ÖÀ빫Àí||separating axiom ·ÖÀ뼯||separated set ·ÖÀë¼ýͼ||separated quiver ·ÖÀë̬Éä||separated morphism ·ÖÀë͹¼¯||separated convex set ·ÖÀëÐÔ||separability ·ÖÀëÐÔ¹«Àí||separation axiom ·ÖÁÑ[·¨]||splitting [method] ·ÖÁÑ[ÔËËã]||splitting ·ÖÁѸñ||splitting lattice ·ÖÁÑÀî´úÊý||split Lie algebra ·ÖÁÑÒò×Ó×é||splitting factor set ·ÖÁÑÔÀí||splitting principle ·Öĸ||denominator ·ÖÅä¸ñ||distributive lattice ·ÖÅäÂÉ||distributive law ·ÖÅäÎÊÌâ||distribution problem; al[] problem ·ÖÅäÔª||distributive element ·ÖÅúÊÔÑé·¨||block search ·ÖƬÏßÐÔÁ÷ÐÎ||piecewise linear manifold ·ÖÆçÀíÂÛ||bifurcation theory; Óֳơ°·Ö²íÀíÂÛ¡±¡£ ·ÖÆçȺ||ramification group ·ÖÆçÓò||ramification field ·ÖÆçÖ¸Êý||ramification index ·ÖÉ¢¿ØÖÆ||decentralized control ·Öʽ¹æ»®||fractional programming ·Öʽ»·||ring of fractions ·ÖʽÀíÏë||fractional ideal ·ÖʽÏßÐԱ任||fractional linear transformation ·ÖʽÓò||quotient field; ÔøÓÃÃû¡°ÉÌÓò¡±¡£ ·ÖÊý||fraction ·ÖÊý´Îµ¼Êý||fractional derivative; Óֳơ°·ÇÕûÊý½×µ¼Êý¡±¡£ ·ÖÊý´Î»ý·Ö||fractional integral; Óֳơ°·ÇÕûÊý´Î»ý·Ö¡±¡£ ·ÖλÊý||quantile ·ÖλÊý¹ý³Ì||quantile process ·ÖÎö£Ûѧ£Ý||analysis ·ÖÎö½â||analytic solution; Óֳơ°½âÎö½â¡±¡£ ·ÖÐηÖÎö||fractals, fractal analysis ·ÖÔ²ZpÀ©ÕÅ||cyclotomic Zp extension ·ÖÔ²µ¥Î»||cyclotomic units ·ÖÔ²¶àÏîʽ||cyclotomic polynomial ·ÖÔ²Êý||cyclotomic number ·ÖÔ²Óò||cyclotomic field ·ÖÖ§||branch ·ÖÖ§¶¨½ç·¨||branch and bound method; Óֳơ°·ÖÖ§Ï޽編¡±¡£ ·ÖÖ§¹ý³Ì||branching process ·ÖÖ§ÀàÐÍÂÛ||ramified theory of types ·Ö×Ó||numerator ·Ö×é±àÂë||block coding ·Ö×鳤¶È||block length ·Ö×éÂë||block code; ÔøÓÃÃû¡°·Ö¿éÂ롱¡£ ·Ö×éÒëÂë||block decoding ·á¸»³ý×Ó||ample divisor ·á¸»¿ÉÄæ²ã||ample invertible sheaf ·á¸»ÍêÈ«ÏßÐÔϵ||ample complete linear system ·â±ÕµÄº¯Êýϵ||closed system of functions ·â±ÕÒýÀí||closing lemma ·å¶È||kurtosis ·çÏÕ||risk ·çÏÕº¯Êý||risk function ·çÏÕ¾ö²ß||decision under risk ·ë¡¤ÅµÒÁÂü-ΏùÊ©ÌØ¶÷½â||von Neumann-Morgenstern solution ·ë¡¤ÅµÒÁÂü´úÊý||von Neumann algebra; Óֳơ°Ëã×Ó»·(operator ring)¡± ¡£ ÔøÓÃÃû¡°W* ´úÊý(W*-algebra)¡±¡£ ·ë¡¤ÅµÒÁÂüÅоÝ||von Neumann criterion ·ë¡¤ÅµÒÁÂüÌõ¼þ||von Neumann condition ·ñ¶¨£Û´Ê£Ý||negation ·ñ¶¨£ÛµÄ£Ý||negative ·ñÃüÌâ||negative proposition ·ø½Ç||argument ·ø½ÇÔÀí||argument principle ·ûºÅ||symbol ·ûºÅ±àÂë||symbolic coding ·ûºÅ²î||signature ·ûºÅ¼ÆËã||symbol computation ·ûºÅ¼ìÑé||sign test ·ûºÅÂë||symbolic code ·ûºÅÌåϵ||symbolism ·ûºÅÓïÑÔ||symbolic language ·ûºÅÖÈ||signed rank ·ûºÅÖȼìÑé||signed rank test ·þÎñʱ¼ä||service time ·þÎñ̨||server ¸¡µãÊý||floating-point number ¸¡µãÔËËã||floating-point arithmetic ¸£¿ÆÊ²ÒýÀí||Farkas lemma ¸¥ÀµÙÄá×ÓȺ||Frattini subgroup ¸¥À¼¿Ë-ÎÖ¶û·ò·¨||Frank-Wolfe method ¸¥À׵»ôÄ· r ´ÎÓà×Óʽ||Fredholm r-th minor ¸¥À׵»ôÄ·³õÓà×Óʽ||Fredholm first minor ¸¥À׵»ôÄ··¨||Fredholm method ¸¥À׵»ôÄ·»ý·Ö·½³Ì||Fredholm integral equation ¸¥À׵»ôÄ·Ëã×Ó||Fredholm operator; Óֳơ°¸¥À׵»ôÄ·Ó³Éä(Fredholm mapping)¡±¡£ ¸¥À׵»ôÄ·ÐÍ»ý·Ö΢·Ö·½³Ì||integro-differential equation of Fredholm type ¸¥À׵»ôÄ·ÐÐÁÐʽ||Fredholm determinant ¸¥À׵»ôÄ·ÔñÒ»¶¨Àí||Fredholm alternative theorem ¸¥À×Ъµ¼Êý||Fr¨¦chet derivative ¸¥À×Ъ¸ñ||Fr¨¦chet lattice ¸¥À×Ъ¿É΢Ëã×Ó||Frechet differentiable operator ¸¥À×Ъ¿Õ¼ä||Fr¨¦chet space; ¼ò³Æ¡°F ¿Õ¼ä((F)-space)¡±¡£ ¸¥Àï´Ä¡¤Ô¼º²Ìõ¼þ||Fritz¡¤John conditions ¸¥ÀïµÂÀïϣ˹²»µÈʽ||Friedrichs inequality ¸¥ÂÞ±´ÄáÎÚ˹»¥·´¹«Ê½||Frobenius reciprocity formula ¸¥ÂÞ±´ÄáÎÚ˹»·||Frobenius ring ¸¥ÂÞ±´ÄáÎÚ˹Ⱥ||Frobenius group ¸¥ÂÞ±´ÄáÎÚ˹̬Éä||Frobenius morphism ¸¥ÂÞ±´ÄáÎÚ˹×Ôͬ¹¹||Frobenius automorphism ¸¥Âå¿¶¨Àí||Floquet theorem ¸¨Öú±äÁ¿||auxiliary variable ¸©½Ç||angle of depression ¸±µü´ú||secondary iteration ¸±·¨Ïß||binormal ¸²µþ±ä»»||cover transformation ¸²µþ¿Õ¼ä||covering space ¸²µþȺ||covering group ¸²µþͬÂ×||covering homotopy ¸²µþ̬ͬ||covering homomorphism ¸²µþÓ³Éä||covering map ¸²¸Ç||cover, covering ¸²¸ÇµÄ½×||order of a covering ¸²¸ÇµÄÉñ¾||nerve of a covering ¸²¸ÇÃæ||covering surface ¸²¸ÇάÊý||covering dimension ¸²¸ÇÒýÀí||covering lemma ¸³·¶[ÏßÐÔ]¿Õ¼ä||normed linear spaces; Óֳơ°¸³·¶ÏòÁ¿¿Õ¼ä(normed vector spaces)¡±¡£ ¸³·¶´úÊý||normed algebra ¸³·¶»·||normed ring; ¾ßÓе¥Î»ÔªµÄ½»»»°ÍÄúմúÊý¡£ ¸³Öµ||valuation; ¶Ô¹«Ê½µÄÕæ¼ÙÐÔ½âÊÍ¡£; valuation ¸³ÖµµÄ½×||rank of a valuation ¸³ÖµµÄÀ©ÕÅ||extension of a valuation; Óֳơ°¸³ÖµµÄ¿ªÍØ¡±¡£ ¸³ÖµµÈ¼Û||equivalence of valuations ¸³Öµ»·||valuation ring ¸³ÖµÂÛ||valuation theory ¸´±äº¯Êý||function of complex variable ¸´±äÊý||complex variable ¸´±íʾ||complex representation ¸´²â¶È||complex measure ¸´³Ë||complex multiplication ¸´µ¥Á¬Í¨½âÎöÀîȺ||complex simply connected analytic Lie group ¸´·ÖÎö||complex analysis ¸´¸ù||complex root ¸´¹²éîµÄ||complex conjugate ¸´ºÏ||composition ¸´ºÏ²´Ëɹý³Ì||compound Poisson process ¸´ºÏ³éÑù·½·¨||composition sampling technique ¸´ºÏ´úÊý||composition algebra ¸´ºÏº¯Êý||composite function, compound function ¸´ºÏ¼ÙÉè||composite hypothesis ¸´ºÏ¾ØÕó||compound matrix ¸´ºÏȺ||composite group ¸´ºÏÉè¼Æ||composite design ¸´ºÏÌÝÐι«Ê½||compound trapezoidal formula ¸´ºÏÐÁÆÕɹ«Ê½||compound Simpson formula, composite Simpson formula ¸´ºÏÐη¨||complex method ¸´ºÏÓ³Éä||composite mapping ¸´ºÏÖе㹫ʽ||compound midpoint formula ¸´»¯||complexification ¸´»ý·Ö||complex integral ¸´½á¹¹||complex structure ¸´½âÎö±íʾ||complex analytic representation ¸´½âÎö¶¯Á¦ÏµÍ³||complex analytic dynamics; Óֳơ°¸´½âÎö¶¯Á¦Ñ§¡±¡£ ¸´ÀîȺ||complex Lie group ¸´Á÷ÐÎ||complex manifold ¸´Æ½Ãæ||complex plane ¸´ÉäÓ°¿Õ¼ä||complex projective space ¸´Êý||complex number ¸´ÊýµÄÈý½ÇÐÎʽ||trigonometrical form of complex number ¸´ÊýÓò||complex number field ¸´Ëæ»ú±äÁ¿||complex random variable ¸´Î»ÊÆ||complex potential ¸´ÏßÐÔ¿Õ¼ä||complex linear space ¸´Ïà¹Ø||multiple correlation ¸´Ïà¹ØÏµÊý||multiple correlation coefficient ¸´ÐÎ||complex ¸´Ò»°ãÏßÐÔȺ||complex general linear group ¸´Õñµ´||complex oscillation ¸´Õý½»Èº||complex orthogonal group ¸µÀïÒ¶-±´Èû¶û±ä»»||Fourier-Bessel transform ¸µÀïÒ¶-±´Èû¶û¼¶Êý||Fourier-Bessel series ¸µÀïÒ¶-ÀÆÕÀ˹±ä»»||Fourier-Laplace transform ¸µÀïÒ¶-˹µÙ¶ûÇÐ˹±ä»»||Fourier-Stieltjes transform ¸µÀïÒ¶±ä»»||Fourier transform ¸µÀïÒ¶·´Ñݹ«Ê½||Fourier inversion formula ¸µÀïÒ¶·ÖÎö||Fourier analysis ¸µÀïÒ¶»ý·Ö||Fourier integral ¸µÀïÒ¶»ý·ÖËã×Ó||Fourier integral operator ¸µÀïÒ¶¼¶Êý||Fourier series ¸µÀïÒ¶Äæ±ä»»||inverse Fourier transform ¸µÀïҶϵÊý||Fourier coefficient ¸µÀïÒ¶ÓàÏұ任||Fourier cosine transform ¸µÀïÒ¶ÕýÏұ任||Fourier sine transform ¸º°ë¶¨¶þ´ÎÐÍ||negative semi-definite quadratic form ¸º±ä²î||negative variation ¸º³¬¼¸ºÎ·Ö²¼||negative hypergeometric distribution ¸º¶¨¶þ´ÎÐÍ||negative definite quadratic form ¸º¶¨¾ØÕó||negative definite matrix ¸º¶àÏî·Ö²¼||negative multinomial distribution ¸º¶þÏî·Ö²¼||negative binomial distribution ¸º·¶Êý||negative norm ¸ººÅ||negative sign ¸ºÆ«²î||negative deviation ¸ºÊý||negative number ¸ºÎȶ¨¾ØÕó||negative stable matrix ¸ºÔª£ÛËØ£Ý||negative element ¸ºÕûÊý||negative integer ¸»¿Ë˹Ⱥ||Fuchsian group ¸»¿Ë˹ÐÍ·½³Ì||equation of Fuchs type ¸ÅÀ¨¹«Àí||comprehension axiom ¸ÅÂÊ[×ø±ê]Ö½||probability paper ¸ÅÂÊ||probability ¸ÅÂʲâ¶È||probability measure ¸ÅÂʲâ¶È½üÁÚÐÔ||contiguity of probability measures ¸ÅÂʲâ¶ÈÆæÒìÐÔ||singularity of probability measures ¸ÅÂʳéÑù||probability sampling ¸ÅÂʵ¥Î»Ä£ÐÍ||probit model ¸ÅÂʶÈÁ¿¿Õ¼ä||probabilistic metric space ¸ÅÂÊ·Ö²¼||probability distribution ¸ÅÂʺ¯Êý||probability function ¸ÅÂʾàÀë||probability metrics ¸ÅÂʿռä||probability space ¸ÅÂÊÂÛ||probability theory ¸ÅÂÊÂß¼||probability logic ¸ÅÂÊĸº¯Êý||probability generating function ¸ÅÂÊÎ»ÊÆÀíÂÛ||probabilistic potential theory ¸ÅÂÊÒëÂë||probabilistic decoding ¸ÅÐÎ||scheme ¸ÅÐεÄÕ³ºÏ||gluing of schemes ¸ÅÐÎÉϵÄÉäÓ°¿Õ¼ä||projective space over a scheme ¸ÅÐÎ̬Éä||morphism of schemes ¸ÅÐÎͬ¹¹||isomorphism of schemes ¸Ç¶û·¶µÂ-ÁÐά̹»ý·Ö·½³Ì||Gelfand-Levitan integral equation ¸Ç¶û·¶µÂ±íʾ||Gelfand representation ¸Ç¸ù±«¶û¶àÏîʽ||Gegenbauer polynomial; Óֳơ°³¬Çò¶àÏîʽ (hyperspherical polynomial)¡±¡£ ¸ÉÈÅ||interfere ¸ÉÈŽâñî||disturbance decoupling ¸ÉÈÅÊäÈë||disturbance input ¸Õ¶È¾ØÕó||stiffness matrix ¸ÕÐÔ||rigidity ¸ÕÐÔ×é||stiff system ¸ß[¶È]||height ¸ß¸ººÉ·þÎñ||heavy traffic ¸ß½×²î·Ö||difference of higher order, higher difference ¸ß½×µ¼Êý||derivative of higher order ¸ß½×µÈ²îÊýÁÐ||arithmetic progression of higher order ¸ß½×Âß¼||high order logic ¸ß½×Æ«µ¼Êý||partial derivative of higher order ¸ß½×ƫ΢·Ö·½³Ì||partial differential equation of higher order ¸ß½×Ææµã||singular point of higher order ¸ß½×΢·Ö||differential of higher order ¸ß½×΢·Ö·½³Ì||differential equation of higher order ¸ß½×ÏßÐÔË«Çú£ÛÐͣݷ½³Ì||linear hyperbolic equation of higher order ¸ß½×ÏßÐÔÍÖÔ²£ÛÐͣݷ½³Ì||linear elliptic equation of higher order ¸ß˹-Èô¶ûµ±ÏûÔª·¨||Gauss-Jordan elimination ¸ß˹-ÑſɱȺãµÈʽ||Gauss-Jacobi identity ¸ß˹±ä·ÖÎÊÌâ||Gauss variational problem ¸ß˹²â¶È||Gauss measure ¸ß˹²åÖµ¹«Ê½||Gauss interpolation formula ¸ß˹¹ý³Ì||Gauss process ¸ß˹ºÍ||Gauss sum ¸ß˹»ý·Ö[·¨]||Gauss integration ¸ß˹ÇúÂÊ||Gaussian curvature ¸ß˹ÏûÔª·¨||Gauss elimination ¸ß˹ÐŵÀ||Gaussian channel ¸ß˹ÐÅÔ´||Gaussian source ¸ß˹ÐÍÇó»ý||Gaussian type quadrature ¸ß˹ӳÉä||Gauss mapping ¸ßÏß||altitude ¸çµÂ°ÍºÕÎÊÌâ||Goldbach problem ¸çµÂ¶ûÅäÊý·¨||Godel numbering ¸êµ¤¶¨Àí||Gordan theorem ¸ê¶Åŵ·ò·¨||Godunov method ¸ê¶û¶¡²»µÈʽ||Garding inequality ¸ê¶û¶¡Ë«ÇúÐÔÌõ¼þ||Garding hyperbolicity condition ¸êÀ³Âë||Golay code ¸êÅÁÂë||Goppa code ¸î²¹Êõ||surgery ¸î²¹×è°||surgery obstruction ¸îµã||cut point; cut point; Ö¸²âµØÉäÏßÉϵĸîµã¡£ ¸îµãͼ||cut point graph ¸î¼£||cut locus ¸î¼¯||cutset ¸îÆ½Ãæ·¨||cutting plane method ¸îÏß·¨||secant method ¸îÔ²ÇúÏß||quadratrix ¸ñ||lattice ¸ñµÄÀà||class of a lattice ¸ñµÄÐýÁ¿ÖÖ||spinor genus of a lattice ¸ñµÄÖÖ||genus of a lattice ¸ñµÈʽ||lattice equality ¸ñµÈʽÀà||equational class of lattices ¸ñµã·Ö²¼||lattice distribution ¸ñ¶àÏîʽ||lattice polynomial ¸ñÀÄ·-Ê©ÃÜÌØÕý½»»¯·½·¨||Gram-Schmidt orthogonalization process ¸ñÀÄ·ÐÐÁÐʽ||Gram determinant ¸ñÀ˹Âü´Ø||Grassmanian variety ¸ñÀÊÎÖ¶û²»µÈʽ||Gronwall inequality ¸ñÀíÏë||ideal of a lattice ¸ñÁÖ£Û»ý·Ö£Ý¹«Ê½||Green [integral] formula ¸ñÁÖ¹«Ê½||Green formula ¸ñÁÖº¯Êý||Green function ¸ñÁÖº¯ÊýÃÉÌØ¿¨ÂÞ·½·¨||Green function Monte Carlo method ¸ñÁÖÈÝÁ¿||Green capacity ¸ñÁÖÎ»ÊÆ||Green potential ¸ñÂË×Ó||filter of a lattice; Óֳơ°¶ÔżÀíÏë(dual ideal)¡±¡£ ¸ñÂÛ||lattice theory ¸ñÂÞëøµÏ¿ËȺ||Grothendieck group ¸ñȺ||lattice group ¸ñͬ¹¹||lattice isomorphism ¸ñ̬ͬ||lattice homomorphism ¸ñÐòÏßÐÔ¿Õ¼ä||lattice-ordered linear space; Óֳơ°ÏòÁ¿¸ñ(vector lattice)¡±¡£ ¸ñ×ÓÂë||trellis code; Óֳơ°ÀéÂ롱¡£ ¸ñ×Óͼ||trellis diagram; Óֳơ°Àéͼ¡±¡£ ¸öÌå||individual ¸öÌå±äÔª||individual variable ¸öÌå±éÀú¶¨Àí||individual ergodic theorem; Óֳơ°Öðµã±éÀú¶¨Àí(pointwise ergodic theorem)¡±¡£ ¸ù||root ¸ù£Û»ù£Ý||radical ¸ùµÄÖØÊý||multiplicity of root ¸ùºÅ||radical sign ¸ù»·||radical ring ¸ùƽ·½·¨||root-squaring method ¸ùʽ||radical ¸ùʽÀ©ÕÅ||radical extension ¸ùÌí¼Ó||adjunction of roots ¸ùÖ¸Êý||radical exponent ¸ù×Ó¿Õ¼ä||root subspace ¸ü±È||proportion by alternation ¸ü»»²ßÂÔ||replacement strategy ¸ü»»ÀíÂÛ||replacement theory ¸üÁÐÎÊÌâ||derangement problem ¸üж¨Àí||renewal theorem ¸üз½³Ì||renewal equation ¸üйý³Ì||renewal process ¸üк¯Êý||renewal function ¸üÐÂÂÛ||renewal theory ¸üÐÂÃܶÈ||renewal density ¹¦ÂÊÃÜ¶ÈÆ×||power density spectrum ¹¦ÂÊÆ×||power spectrum ¹¦ÂÊÆ×ÃܶÈ||power spectrum density ¹¦Ð§º¯Êý||power function; ¼ìÑ麯ÊýµÄÆÚÍû¡£ ¹©Ñ¡·½°¸||alternatives ¹«±¶Êý||common multiple ¹«±È||common ratio ¹«²î||common difference ¹«·Öĸ||common denominator ¹«¹²ÐŵÀ||common channel ¹«¹²Òò×Ó||common factor ¹«¿ªÃÜÔ¿||public key ¹«ÀíA||axiom A ¹«Àí||axiom; Óֳơ°¹«Éè(postulate)¡±¡£ ¹«Àí·½·¨||axiomatic method ¹«Àí»¯¼¯ºÏÂÛ||axiomatic set theory ¹«Àí»¯ÀíÂÛ||axiomatic theory ¹«Àíѧ||axiomatics ¹«Ê½||formula ¹«ÐÅÏ¢||common information; Óֳơ°¹²ÐÅÏ¢¡±¡£ ¹«ÒòÊý||common divisor ¹«Ô¿ÌåÖÆ||public key system ¹ÐÎ||segment of a circle ¹±Ï×ÃÉÌØ¿¨ÂÞ·½·¨||contribution Monte Carlo method ¹²±ä||covariant ¹²±äµ¼Êý||covariant derivative ¹²±äº¯×Ó||covariant functor ¹²±ä΢·Ö||covariant differential ¹²±äÕÅÁ¿||covariant tensor ¹²±äÖ¸±ê||covariant index ¹²µã||concurrent ¹²ºÏ»ý||amalgamated product ¹²½¹[µÄ]||confocal ¹²Ãæ[µÄ]||coplanar ¹²Æ×||co-spectrum ¹²Î²±£»ýº¯×Ó||cofinal product-preserving functor ¹²Î²ÐÔ||cofinality ¹²Î²×Ó¼¯||cofinal subset ¹²Ïß||collinear ¹²Ðβ»±äÁ¿||conformal invariant ¹²ÐεÄ||conformal ¹²Ðμ¸ºÎ||conformal geometry ¹²Ðοռä||conformal space ¹²ÐÎÓ³Éä||conformal mapping; ÔøÓÃÃû¡°±£ÐÎÓ³É䡱£¬¡°¹²ÐÎÓ³ÕÕ¡±¡£ ¹²Óò±ä»»·½·¨||corregion transformation method ¹²ÕñÏÖÏó||resonance phenomenon ¹²éî||conjugate ¹²éî°¼º¯Êý||conjugate concave function ¹²éî±íʾ||conjugate representation ¹²éî²´ËɺË||conjugate Poisson kernel ¹²éî´úÊýÊý||conjugate algebraic numbers ¹²éîµã||conjugate point ¹²éîµ÷ºÍº¯Êý||conjugate harmonic function ¹²éî·½Ïò·¨||conjugate direction method ¹²éÊý||conjugate complex number ¹²éÀïÒ¶»ý·Ö||conjugate Fourier integral ¹²éî¸ù||conjugate roots ¹²éî¹ì¼£||conjugate locus ¹²éÊý||conjugate function ¹²éî¼¶Êý||conjugate series ¹²éî½¹µã||conjugate foci ¹²éî¾ØÕó||conjugate matrix ¹²éîË«ÇúÃæ||conjugate hyperboloids ¹²éîË«ÇúÏß||conjugate hyperbolas ¹²éîË«ÖØº¯Êý||conjugate bifunction ¹²éîÌݶȷ¨||conjugate gradient method ¹²éî͹º¯Êý||conjugate convex function ¹²éî΢·ÖËã×Ó||conjugate differential operator ¹²éîÏÈÑé·Ö²¼×å||family of conjugate prior distributions ¹²éîÓò||conjugate field ¹²éîÔª||conjugate elements ¹²éîÔ²×¶ÇúÏß||conjugate conics ¹²éîÖ±¾¶||conjugate diameters ¹²éîÖ±Ïß||conjugate lines ¹²éîÖá||conjugate axis ¹²éî×ÓȺ||conjugate subgroups ¹´¹É¶¨Àí||Pythagoras theorem; ÔøÓÃÃû¡°É̸߶¨Àí¡±,Óֳơ°±Ï´ï¸çÀ˹¶¨Àí¡±¡£ ¹¹ÐÎ||configuration ¹¹ÔìÂÛÕß||constructivist ¹¹ÔìÐÔ||constructivity ¹¹ÔìÐÔ¶¨Òå||constructive definition ¹¹ÔìÐòÊý||constructive ordinals ¹À¼Æ[Á¿]||estimate, estimator ¹À¼ÆµÄЧÂÊ||efficiency of an estimate ¹À¼ÆÆ÷||estimator ¹Â[Á¢]µã||isolated point ¹Â[Á¢]×Ó||soliton ¹Â£ÛÁ¢£ÝÔª||isol ¹Â²¨||solitary wave ¹ÂÁ¢Ææµã||isolated singular point, isolated singularity ¹ÂÁ¢ËØÀíÏë||isolated prime ideal ¹ÂÁ¢ÏµÍ³||isolated system ¹ÂÁ¢×Óϵͳ||isolated subsystem ¹Åµä¸ÅÂÊ||classical probability ¹Ç¼Ü||skeleton ¹ÊÕÏÂÊ||failure rate; Óֳơ°Ê§Ð§ÂÊ¡±¡£ ¹ÊÕÏģʽºÍЧӦ·ÖÎö||failure mode and effect analysis, FMEA ¹ÊÕÏÆµ¶È||failure frequency ¹ÊÕÏÊ÷·ÖÎö||fault tree analysis ¹Ë¿Í||customer; Óֳơ°·þÎñ¶ÔÏ󡱡£ ¹Ì¶¨Ä£||fixed mode ¹Ì¶¨Ææµã||fixed singular point ¹Ì¶¨Ð§Ó¦Ä£ÐÍ||fixed effect model ¹Ì¶¨ÖÕµã±ä·ÖÎÊÌâ||fixed end point variational problem ¹ÌÓÐÎó²î||inherent error ¹Õµã||inflection point ¹ÖÇòÃæ||exotic sphere ¹Ø¼ü·Ïß½ø¶È±í||critical path scheduling ¹ØÁª¹«Àí||incidence axioms, axiom of connection ¹ØÁª¾ØÕó||incidence matrices ¹ØÁªÊý||incidence number ¹ØÁªÏµÍ³||interconnected system ¹ØÁªÔ¤¹À·¨||interaction prediction approach ¹ØÏµ||relation ¹Û²âÆ÷||observer ¹Û²âÎó²î||observational error ¹Û²âÖµ||observed value ¹Ü×´ÁÚÓò||tubular neighborhood ¹ßÐÔÂÉ||law of inertia ¹ßÐÔȺ||inertia group ¹ßÐÔÓò||inertia field ¹ßÐÔÖ¸Êý||index of inertia ¹â»¬´Ø||smooth variety ¹â»¬¸ÅÐÎ||smooth scheme ¹â»¬º¯Êý||smooth function ¹â»¬»¯Ëã×Ó||mollifier ¹â»¬Á÷ÐÎ||smooth manifold ¹â»¬Ì¬Éä||smooth morphism ¹â×ÓÐŵÀ||photon channel ¹ã²¥ÐŵÀ||broadcast channel ¹ãȺ||groupoid ¹ãÒå m άµ¥´¿ÐÎ||generalized m-dimensional simplex ¹ãÒ屴Ҷ˹¹À¼Æ||generalized Bayes estimate ¹ãÒ屴Ҷ˹¾ö²ßº¯Êý||generalized Bayes decision function ¹ãÒå±¾Õ÷¿Õ¼ä||generalized eigenspace ¹ãÒå±¾Õ÷Öµ||generalized eigenvalue ¹ãÒ岩¶ûÔúÎÊÌâ||generalized Bolza problem ¹ãÒ岮ŬÀûÍÆÒÆ||generalized Bernoulli shift ¹ãÒå²´Ëɹý³Ì||generalized Poisson process ¹ãÒå²¼¶û´úÊý||generalized Boolean algebra ¹ãÒå²¼¶û¸ñ||generalized Boolean lattice ¹ãÒåµ¼Êý||generalized derivative ¹ãÒåµÈÖÜÎÊÌâ||generalized isoperimetric problem ¹ãÒåµÒÀû¿ËÀ×ÎÊÌâ||generalized Dirichlet problem ¹ãÒå¶à°ûÌå||generalized polytope ¹ãÒå¶àÏîʽ±Æ½ü||generalized polynomial approximation ¹ãÒå¶àÔ²ÅÌ||generalized polydisc ¹ãÒå·½Ïòµ¼Êý||generalized directional derivative ¹ãÒ帵ÀïÒ¶»ý·Ö||generalized Fourier integral ¹ãÒ帵ÀïÒ¶Õ¹¿ª||generalized Fourier expansion ¹ãÒå¸ñÁÖ¹«Ê½||generalized Green formula ¹ãÒå¹ý³Ì||generalized process, random distribution ¹ãÒ庯Êý||generalized function ¹ãÒ庯Êý¾Ö²¿»¯||localization of distribution ¹ãÒ庯Êý¾í»ý||convolution of distributions ¹ãÒ庯Êý¿Õ¼ä||space of generalized function ¹ãÒ庯ÊýÖ§¼¯||support of distribution ¹ãÒ庯ÊýÖ±»ý||direct product of distributions ¹ãÒå»Ý¸ü˹ÔÀí||Huyghens principle in wider sense ¹ãÒ弫ÏÞ||generalized limit ¹ãÒ弸ºÎ¹æ»®||generalized geometric programming ¹ãÒå½â||generalized solution ¹ãÒå½âÎöº¯Êý||generalized analytic function ¹ãÒå¾Ö²¿¼«Öµ||generalized local extremum ¹ãÒ徨ÕóÅÁµÂ±Æ½ü||generalized matrix Pad¨¦ approximation ¹ãÒå¾í»ý||generalized convolution ¹ãÒåÀ¸Ç¶û¶àÏîʽ||generalized Laguerre polynomial ¹ãÒåÀ¸ñÀÊÈÕ³Ë×Ó||generalized Lagrange multiplier ¹ãÒåÀ÷·½³Ì||generalized Lam¨¦ equation ¹ãÒåÀíÏëÀàȺ||generalized ideal class group ¹ãÒåÁ¬ÐøÍ³¼ÙÉè||generalized continuum hypothesis ¹ãÒåÂíµÙ¶òº¯Êý||broad sense Mathieu function ¹ãÒåÃݼ¶Êý½â||solution of generalized power series ¹ãÒåÃÝÁãÔª||generalized nilpotent element ¹ãÒåÄâÕó||greedoid ¹ãÒåÄæ¾ØÕó||generalized inverse matrix ¹ãÒåÅÁµÂ±Æ½ü||generalized Pad¨¦ approximation ¹ãÒåÈý½Ç¶àÏîʽ||generalized trigonometric polynomial ¹ãÒåÈý½Ç¼¶Êý||generalized trigonometric series ¹ãÒåÊ©ÀÕÃ×Ï£¼¶Êý||generalized series of Schlomilch ¹ãÒåËÄÔªÊý»·||generalized quaternion ring ¹ãÒåËÄÔªÊýȺ||generalized quaternion group ¹ãÒåÌØÕ÷£Û±ê£Ý||generalized character, virtual character ¹ãÒåÌݶÈ||generalized gradient ¹ãÒå͹¹æ»®||generalized convex program ¹ãÒåÍøÂç||generalized network ¹ãÒåÏÈÑé·Ö²¼||generalized prior distribution ¹ãÒåÏßÐÔÄ£ÐÍ||generalized linear model ¹ãÒåÏßÐÔϵͳ||generalized linear system ¹ãÒåÐÅÏ¢||generalized information ¹ãÒåÑſɱȾØÕó||generalized Jacobian ¹ãÒåÓÐÀí±Æ½ü||generalized rational approximation ¹ãÒåÔ¼»¯Ìݶȷ¨||generalized reduced gradient method, GRG; ÔøÓÃÃû¡°¹ãÒå¼ÈÔ¼Ìݶȷ¨¡±¡£ ¹æ±Ü¶Ô²ß||evasion game ¹æ·¶Èº||gauge group ¹æ·¶Õý½»º¯Êýϵ||system of orthonormal functions ¹æ·¶Õý½»»ù||orthonormal basis; Óֳơ°çÛÕý»ù¡±¡£ ¹æ·¶Õý½»Ïµ||orthonormal system ¹éÄɶ¨Òå||definition by induction ¹éÄɼ«ÏÞ||inductive limit; Óֳơ°Õý[Ïò]¼«ÏÞ (direct limit)¡±¡£ ¹éÄÉÂß¼||inductive logic ¹éÄÉÐò¼¯||inductive ordered set ¹éÄÉÖ¤Ã÷||proof by induction ¹éÔ¼||reduction ¹ìµÀ||orbit ¹ìµÀ·Ö½â¹«Ê½||orbit decomposition formula ¹ìµÀÎȶ¨ÐÔ||orbital stability ¹ì¼£||locus ¹ìÐÎ||orbifold ¹öÏß||rolling curve ¹ú¼ÊÊýѧÁªºÏ»á||International Mathematical Union, IMU ¹ý³ÌµÄµÈ¼ÛÐÎ||version of process ¹ý³ÌµÄʵÏÖ||realization of process ¹ý³ÌµÄͶӰ||projection of process ¹ý³ÌµÄÐÞÕý||modification of process ¹ý¶ÈÊÕÁ²||overconvergence ¹ý¶ÉÌõ¼þ||transition condition ¹ý¶ÉÔ˶¯||transient motion ¹ý·Öº¯Êý||excessive function ¹ýÊ£½üËÆÖµ||upper approximate value; ÔøÓÃÃû¡°ÉϽüËÆÖµ¡±¡£ ¹þ´ú-ÀîÌØ¶ûÎéµÂ·½·¨||Hardy-Littlewood method ¹þ´ú-ÀîÌØ¶ûÎéµÂ¼«´óº¯Êý||Hardy-Littlewood maximal function ¹þ¶û²â¶È||Haar measure ¹þ¶ûÌõ¼þ||Haar condition ¹þÃܶÙ-ÑſɱÈ-±´¶ûÂü·½³Ì||Hamilton-Jacobi-Bellman equation ¹þÃܶÙ-Ñſɱȷ½³Ì||Hamilton-Jocobi equation ¹þÃܶٵ䷶·½³Ì||Hamilton canonical equations ¹þÃܶٷ½³Ì||Hamilton equation ¹þÃܶÙȦ||Hamiltonian cycle ¹þÃܶÙͼ||Hamiltonian graph ¹þÃܶÙ΢·Öϵͳ||Hamiltonian differential system ¹þÃܶÙÔÀí||Hamilton principle ¹þĬ¶û»ù||Hamel basis ¹þĬ˹̹»ý·Ö·½³Ì||Hammerstein integral equation ¹þĬ˹̹Ëã×Ó||Hammerstein operator ¹þÄɿ˲»µÈʽ||Harnack inequality ¹þÈû-ãɿɷò˹»ùÔÀí||Hasse-Minkowski principle ¹þÈû²»±äÁ¿||Hasse invariant º£Âü·¨||Hyman method º£É²®¸ñȺ||Hessenberg group º£É²®¾ØÕó||Heissenberg matrix º£Í¢´úÊý||Heyting algebra º¥Ä·»ô×È·½³Ì||Helmholz equation º¬Îó²î±äÁ¿Ä£ÐÍ||errors-in-variables model º¯Êý||function º¯Êý±Æ½üÂÛ||approximation theory of functions º¯Êý´úÊý||function algebra; Óֳơ°Ò»Ö´úÊý(uniform algebra)¡±¡£ º¯ÊýµÄ³ý×Ó||divisor of a function º¯ÊýµÄ¼¶ÊýÕ¹¿ª||expansion of a function in series º¯Êýµü´ú·¨||function iteration method º¯Êý·½³Ì||functional equation º¯Êý·½³Ì·¨||function equation approach º¯Êý·ûºÅ||function symbol º¯Êý¹¹ÔìÂÛ||constructive theory of functions º¯Êý¿Õ¼ä||function space º¯ÊýÆ½ÒÆ||translation of functions º¯ÊýÎÞ¹Ø||functionally independent º¯ÊýÏà¹Ø||functionally dependent º¯ÊýÏî¼¶Êý||series of functions º¯×ÓExt||functor Ext º¯×ÓTor||functor Tor º¯×Ó||functor º¯×ӵķºÔª||universal element of a functor º¯×ӵĸ´ºÏ||composite of functors º¯×Ó·¶³ë||category of functors ºº¿Ë¶û±ä»»||Hankel transform ºº¿Ë¶û½¥½üÕ¹¿ª||Hankel asymptotic expansion ºº¿Ë¶ûËã×Ó||Hankel operator ººÃ÷½ç||Hamming bound ººÃ÷¾àÀë||Hamming distance, Hamming metric ººÃ÷Âë||Hamming code º½°àÎÊÌâ||problem of routing aircraft ºÀ˹¶à·ò²â¶È||Hausdorff measure ºÀ˹¶à·òάÊý||Hausdorff dimension ºÀ˹»ô¶ûµÂ±ä»»||Householder transformation ºÀ˹»ô¶ûµÂ·¨||Householder method ºÀ˹»ô¶ûµÂ¾ØÕó||Householder matrix ºÃÔ¼»¯||good reduction ºÄÉ¢²¿·Ö||dissipative part ºÄÉ¢Ëã×Ó||dissipative operator ºÄɢ̬||dissipative state ºÄɢ΢·Ö·½³Ì||dissipative differential equation ºË¹ãÒ庯Êý||kernel distribution ºËº¯Êý||kernel function ºËÐ͹À¼Æ||kernel type estimator ºËÐͿռä||nuclear space ºËÐÍËã×Ó||nuclear operator ºÍ||sum ºÍÀÖȺ||holonomy group ºÍУÑé||sum check ºÏ±È||proportion by addition ºÏ³ÉÁÐ||composition series ºÏ³ÉËã×Ó||composite operator ºÏ³ÉÒò×Ó||composition factor ºÏ³ÉÒò×ÓÁÐ||composition factor series ºÏ³å||syzygy ºÏÈ¡£Û´Ê£Ý||conjunction; Óֳơ°Âß¼»ý£¨logical product£©¡±¡£ ºÏÈ¡·¶Ê½||conjunctive normal form ºÏÈ¡Ïî||conjunct ºÏʽ£ÛµÄ£Ý||well-formed ºÏʽ¹«Ê½||well-formed formula ºÏÊý||composite number ºÏ×÷¶Ô²ß||cooperative game ºÕ¶ûµÂ²»µÈʽ||Holder inequality ºÕ¶ûµÂÇóºÍ£Û·¨£Ý||Holder summation [method] ºÕ¶ûµÂÌõ¼þ||Holder condition ºÕ¶ûά´Ä¹«Ê½||Hurwitz formula ºÕ¸ê·ÖÁÑ||Heegard splitting ºÕ¸ñÄÚ¶ûµã||Heegner point ºÕ¿Ë»·||Hecke ring ºÕ¿ËËã×Ó||Hecke operator ºÕ¿ËÌØÕ÷£Û±ê£Ý||Hecke character, Grossencharakter(µÂ) ºÕάÈüµÂº¯Êý||Heaviside function; Óֳơ°µ¥Î»º¯Êý(unit function)¡±¡£ ºÚÈû¾ØÕó||Hessian matrix ºÚÈûÐÐÁÐʽ||Hessian determinant ºàÌØ¹ý³Ì||Hunt process ºàÌØºË||Hunt kernel ºàÔó¶û¸³Öµ||Hensel valuation ºàÔó¶û¸³ÖµÓò||Hensel valuation field ºàÔó¶û»·||Henselian ring ºá[×ø±ê]Öá||axis of abscissas ºá½Ø||transversal ºá½ØÉè¼Æ||transversal design ºá½ØÏµ||transversal system ºá½ØÏཻ||transverse intersection ºá½ØÐÔ||transversality ºá½ØÐÔÌõ¼þ||condition of transversality ºá×ø±ê||abscissa ºãµÈ£Ûʽ£Ý||identity ºãµÈ´ú»»||identical substitution ºãʱÐŵÀ||time-invariant channel ºãͬӳÉä||identity mapping ºìºÚ»®·Ö||red/black partitioning ºóµ½ÏÈ·þÎñ||last-come first-served, LCFS ºó¼Ì||successor ºó¼Ìº¯Êý||successor function ºóÏî||consequent ºóÏòÅ×Îï£ÛÐͣݷ½³Ì||backward parabolic equation ºóÏòËÑË÷||sweep backward ºóÑé·Ö²¼||posterior distribution ºóÑé·çÏÕ[º¯Êý]||posterior risk [function] ºóÑé¸ÅÂÊ||posterior probability »¡||arc; Óֳơ°ÓÐÏò±ß(directed edge)¡±¡£; arc »¡¶È[·¨]||radian measure »¡¶È||radian »¡Á¬Í¨[µÄ]||arcwise connected »¡ÏßËÑË÷·¨||arc search method »¥²¹¼¸ºÎ¹æ»®||complementary geometric programming »¥²¹Ëɳڶ¨Àí||theorem of complementary slackness »¥²¹Í¹¹æ»®||complementary convex program »¥²¹ÐÔÎÊÌâ||complementarity problem »¥³âÎöÈ¡||exclusive disjunction »¥·´·½³Ì||reciprocal equation »¥·´ÂÉ||reciprocity law »¥¼¤µã¹ý³Ì||mutually exciting point process »¥Æ×||cross spectrum »¥ÈÅÐŵÀ||interference channel »¥ËØ||coprime, relatively prime »¥Ïà¹Øº¯Êý||cross correlation function »¥ÐÅÏ¢||mutual information »¥ìØ||cross entropy »ª-άŵ¸ñÀ¶à·ò·½·¨||Hua-Vinogradov method »ª£Íõ·½·¨||Hua-Wang method; Óֳơ°Êµ·ÖÔ²Óò·¨(method of real cyclotomic field)¡±¡£ »ªÁÖÎÊÌâ||Waring problem »¬¶¯Æ½¾ùÄ£ÐÍ||moving-average model, MA model »·¨¼¸ºÎ [ѧ]||descriptive geometry »®·Ö||partition »¯Ô²Îª·½[ÎÊÌâ]||quadrature of a circle »³ÌغڵÂȺ||Whitehead group »µÔ¼»¯||bad reduction »·||ring »·±ú||handle »·²ã||sheaf of rings »·µÄµ¼×Ó||derivation of a ring »·µÄ¶ÔºÏ||involution of a ring »·µÄ¸ñÂÞëøµÏ¿ËȺ||Grothendieck group of a ring »·µÄ»³ÌغڵÂȺ||Whitehead group of a ring »·µÄ¼«´óÆ×||maximal spectrum of a ring »·µÄÆ×||spectrum of a ring »·µÄÉÌïÏàËÆ||Morita similar of rings »·µÄʩ̹±´¸ñȺ||Steinberg group of a ring »·µÄÒèÁã¸ù||nilradical of a ring »·µÄÕûÌåάÊý||global dimension of rings »·µÄÖ±ºÍ||direct sum of rings »·µÄÖ±»ý||direct product of rings »·µÄÖÐÐÄ||center of a ring »··¶³ë||category of rings »·¼®Ä£µÄÀ©ÕÅ||extension of ring by module »·Á÷£ÛÁ¿£Ý||circulation »·ÂÛ||ring theory »·Ãæ||torus, anchor ring »·ÃæÈº||torus group »·ÈÆÊý||linking number »·ÉϾØÕóȺ||matrix group over rings »·Í¬¹¹||ring isomorphism »·Í¬Ì¬||ring homomorphism »·ÐÎÇøÓò||annular region »ºÔöC¡ÞÀຯÊý||slowly increasing C¡Þ function »ºÔö¹ãÒ庯Êý||slowly increasing distribution »»Î»×Ó||commutator »»Î»×ÓȺ||commutator subgroup; Óֳơ°µ¼Èº(derived group)¡±¡£ »»Ôª»ý·Ö·¨||integration by substitution »Ã·½||magic square »Æ½ð·Ö¸îËÑË÷||golden section search »Ø±Ü¶Ô²ß||eluding game »Ø´ú||back substitution »Ø¸´µã||recurrent point »Ø¸´Ô˶¯||recurrent motion »Ø¹é·ÖÎö||regression analysis »Ø¹é¹À¼Æ||regression estimate »Ø¹éº¯Êý||regression function »Ø¹éÉè¼Æ||regression design »Ø¹éϵÊý||regression coefficient »Ø¹éÕï¶Ï||regression diagnostics »ØÂ·||circuit »ØÊÕ·½Ïò||direction of recession »ØÊÕ×¶||recession cone »Ý¸ü˹ÔÀí||Huyghens principle »ÝÌØ¿Ëº¯Êý||Whittaker function »ÝÌØ¿Ë΢·Ö·½³Ì||Whittaker differential equation »ã||sink »ãµã||sink »ãºÏÐͳ¬¼¸ºÎ·½³Ì||confluent hypergeometric equation »ãºÏÐͳ¬¼¸ºÎº¯Êý||hypergeometric function of confluent type »ãºÏÐͺ¯Êý||function of confluent type »ãºÏÐÍ΢·Ö·½³Ì||differential equation of confluent type »ìºÏ±ß½çÌõ¼þ||mixed boundary condition »ìºÏ±ß½çÎÊÌâ||mixed boundary problem; Óֳơ°µÚÈý±ßÖµÎÊÌâ (third boundary value problem)¡±¡£ »ìºÏ²ßÂÔ||mixed strategy »ìºÏ³Í·£·¨||mixed penalty method »ìºÏ·Ö²¼||mixing distribution »ìºÏ¾Ø||mixed moment »ìºÏÀíÏë||mixed ideal »ìºÏÌõ¼þ||mixing condition »ìºÏÌõ¼þ·Ö²¼||mixed conditional distribution »ìºÏͬÓà·½·¨||mixed congruential method »ìºÏÍâ´úÊý||mixed exterior algebra »ìºÏÏßÐÔÄ£ÐÍ||mixed linear model »ìºÏÐͱ߽çÌõ¼þ||boundary condition of mixed type »ìºÏÐÍ·½³Ì||equation of mixed type »ìºÏÓÐÏÞÔª·¨||mixed finite element method »ìºÏÕÅÁ¿||mixed tensor »ìºÏÕÅÁ¿´úÊý||mixed tensor algebra »ìºÏÕûÊý¹æ»®||mixed integer programming »ìºÏÖÆÏµÍ³||mixed system »ìºÏ×Öĸ±í||mixed alphabet »ìÁÏÉè¼Æ||mixture design »ìÏýÎó²î||aliasing error »ìÑ»·Ð¡Êý||mixed recurring decimal »ìÔÓ[·¨]||confounding »ìãç||chaos »ìãç·Ö½â||chaos decomposition »î¶¯±ê¼Ü||moving frame »î¶¯·ÖÎö||activity analysis »î¶¯ÈýÃæÐÎ||moving trihedral »ñʤÁªÃË||winning coalition; Óֳơ°Ó®ÁªÃË¡±¡£ »ô¶û×ÓȺ||Hall subgroup »ôºÕÏ£¶ûµÂÉÏͬµ÷Ⱥ||Hochschild cohomology group »ôÄ·¸ñÂ×ΨһÐÔ¶¨Àí||Holmgren uniqueness theorem »ôÆÕ·ò²»±äÁ¿||Hopf invariant »ôÆÕ·ò´Ô||Hopf bundle »ôÆÕ·ò´úÊý||Hopf algebra »ôÆÕ·òÓ³Éä||Hopf mapping »ôÆæÐ±ÂÊ||Hodge slope »ôÆæÕÛÏß||Hodge polygon »ôÌØÁÖT2ͳ¼ÆÁ¿||Hotelling T2-statistic »ù[±¾]±äÁ¿||basic variable »ù±¾£ÛÇø£ÝÓò||fundamental region »ù±¾²»±äʽ||basic invariant »ù±¾µ¥Î»Ïµ||system of fundamental units »ù±¾µã||fundamental point »ù±¾¶Ô³Æ¶àÏîʽ||fundamental symmetric polynomial »ù±¾º¯Êý||fundamental function »ù±¾º¯ÊýÖ§¼¯||support of fundamental function »ù±¾½â||fundamental solution »ù±¾½â×é||fundamental system of solutions; Ö¸³£Î¢·Ö·½³Ì×éµÄ½â¡£ »ù±¾¿ÉÐнâ||basic feasible solution »ù±¾¿Õ¼ä||fundamental space »ù±¾ÁÚÓòϵ||fundamental system of neighborhoods »ù±¾Çø||fundamental domain »ù±¾Èº||fundamental group »ù±¾Ê¼þ||elementary event »ù±¾Ê¼þ¿Õ¼ä||space of elementary events »ù±¾Í¬µ÷Àà||fundamental homology class »ù±¾ÔËËã||fundamental operations »ù±¾ÕÅÁ¿||fundamental tensor »ù±¾Ö§ÅäȨ||fundamental dominant weight »ù±¾ÖÜÆÚ||fundamental period »ù±¾ÖÜÆÚÆ½ÐÐËıßÐÎ||fundamental period parallelogram »ù±ä»»||change of bases »ùµã||base point »ù¶û»ô·ò·¨||Kirchhoff method »ù¶û»ô·ò¹«Ê½||Kirchhoff formula »ù¸¥¹ý³Ì||Kiefer process »ùÊý||cardinal number »ùÓò||ground field »ú»á¶Ô²ß||game of chance »ú»áÔ¼Êø||chance constraint »ú»áÔ¼Êø¹æ»®||chance constrained programming »úÆ÷Îó²î||machine error »úеÇó»ý||mechanical quadrature »úеÇóÌå»ý||mechanical cubature »ý||product »ý²â¶È||product measure »ý²â¶È¿Õ¼ä||product measure space »ý´Ô||product bundle »ý´Ø||product variety »ý¶¨Ïò||product orientation »ý·¶³ë||product category »ý·Ö||integral »ý·Ö±ä»»||integral transform »ý·Ö³£Êý||constant of integration, integral constant »ý·Ö³éÑù·½·¨||integration sampling technique »ý·Ö·¨||integration »ý·Ö·½³Ì||integral equation »ý·Ö·½³ÌºË||kernel of an integral equation »ý·Ö¼¸ºÎ[ѧ£Ý||integral geometry »ý·Ö¿ØÖÆ||integral control »ý·ÖÁ÷ÐÎ||integral manifold »ý·Ö·¾¶||path of integration »ý·ÖÇúÃæ||integral surface »ý·ÖÇúÏß||integral curve »ý·ÖÉÏÏÞ||upper limit of integral »ý·ÖËã×Ó||integral operator »ý·Ö΢·Ö·½³Ì||integro-differential equation »ý·ÖÏÂÏÞ||lower limit of integral »ý·Öѧ||integral calculus »ý·ÖÒò×Ó||integrating factor »ý·ÖÓò||domain of integration »ý·ÖÖ±ºÍ||integral direct sum; Óֳơ°Ö±»ý·Ö(direct integral)¡±¡£ »ý¸´ÐÎ||product complex »ýºÍʽ||permanent »ý¼«Ô¼Êø||active constraint »ý¼¯||product set »ý¿É²â¼¯||product measurable set »ý¿É²â¿Õ¼ä||product measurable space »ý¿Õ¼ä||product space »ýÍØÆË||product topology ¼£||trace, spur; trace of von Neumann algebra; Ö¸·ë¡¤ÅµÒÁÂü´úÊýµÄ¼£¡£ ¼£·¶Êý||trace norm ¼£¿Õ¼ä||trace space ¼£ÀíÏë||trace ideal ¼£ÐÎʽ||trace form ¼£×å||trace class; Óֳơ°ºË×å(nuclear class)¡±¡£ ¼¤²¨¼ä¶Ï||shock discontinuity ¼¤²¨Ìõ¼þ||shock condition ¼ª²¼Ë¹Ì¬||Gibbs state ¼ª²¼Ë¹ÏÖÏó||Gibbs phenomenon ¼ª¶û·¨||Gear method ¼ªÎÄ˹·¨||Givens method ¼«£Ûµã£Ý||pole ¼«²î||range; Ñù±¾ÖÐ×î´óÖµÓë×îСֵ֮²î¡£ ¼«³¬ÇúÃæ||polar hypersurface ¼«³ý×Ó||polar divisor ¼«´ó±éÀú¶¨Àí||maximal-ergodic theorem ¼«´ó²»µÈʽ||maximal inequality ¼«´ó´úÊý||maximum algebra ¼«´óµ¥µ÷Ëã×Ó||maximal monotone operator; Óֳơ°¼«´óµ¥µ÷Ó³Éä(maximal monotone mapping)¡±¡£ ¼«´óµã||maximum point ¼«´ó¶ÀÁ¢¼¯||maximal independent set ¼«´ó¶Ô³ÆËã×Ó||maximal symmetric operator ¼«´ó·º´úÊý||maximal universal algebra ¼«´ó·çÏÕÄ£ÐÍ||maximum risk pattern ¼«´ó»¯||maximization ¼«´ó»¯¼«Ð¡·¨||maximin method ¼«´ó»¯Ä£ÐÍ||maximization model ¼«´ó»¯ÐòÁÐ||maximizing sequence ¼«´ó»·Ãæ||maximal torus ¼«´ó¼¯||maximal set ¼«´óÀíÏë||maximal ideal ¼«´óÂË×Ó||maximal filter ¼«´óÌõ¼þ||maximum condition ¼«´óÐòÄ£||maximal order ¼«´óÓÒÀíÏë||maximal right ideal ¼«´óÔª||maximal element ¼«´óÕý¹æËã×Ó||maximal normal operator ¼«´óÖµ||maximum ¼«´ó×ÓȺ||maximal subgroup ¼«´ó×óÀíÏë||maximal left ideal ¼«µã||pole; Ò»ÖÖ¹ÂÁ¢Ææµã¡£ ¼«µãµÄ½×||order of pole; Óֳơ°¼«µãµÄÖØÊý (multiplicity of pole)¡±¡£ ¼«µãÅäÖÃ||pole assignment, pole placement ¼«¶Ë²»Á¬Í¨¿Õ¼ä||extremely disconnected space ¼«·á¸»²ã||very ample sheaf ¼«·á¸»´Ô||very ample bundle ¼«»¯µÄ°¢±´¶û´Ø||polarized Abelian variety ¼«¼¯||polar set, ¦Á-polar set; polar ¼«Àà||polar class ¼«Ãæ||polar plane ¼«Ê½·Ö½â||polar decomposition ¼«ÏÞ||limit ¼«ÏÞ²ßÂÔ||limiting strategy ¼«ÏÞµã||limiting point; Ö¸ÐòÁеļ«Ï޵㠡£ ¼«ÏÞ¶¨Àí||limit theorem ¼«ÏÞº¯Êý||limiting function, limit function ¼«ÏÞ»·||limit-cycle; Óֳơ°¼«ÏÞȦ¡±¡£ ¼«ÏÞÐòÊý||limit ordinal number ¼«ÏÞ÷±||martingale in limit ¼«Ïß||polar line ¼«Ð¡±éÀú||minimally ergodic ¼«Ð¡µã||minimum point ¼«Ð¡¶È||minimal degree ¼«Ð¡¶Ô||minimal pair ¼«Ð¡¶àÏîʽ||minimal polynomial ¼«Ð¡»¯||minimization ¼«Ð¡»¯·½·¨||minimization method ¼«Ð¡»¯¼«´ó||minimax ¼«Ð¡»¯¼«´ó±Æ½ü||minimax approximation ¼«Ð¡»¯¼«´ó¹À¼Æ||minimax estimate ¼«Ð¡»¯¼«´ó½â||minimax solution ¼«Ð¡»¯¼«´ó¾ö²ßº¯Êý||minimax decision function ¼«Ð¡»¯¼«´óÐò¹á¾ö²ßº¯Êý||minimax sequential decision function ¼«Ð¡»¯¼«´óÔÀí||minimax principle ¼«Ð¡»¯Ä£ÐÍ||minimization model ¼«Ð¡¼«´ó²ßÂÔ||minimax strategy ¼«Ð¡¼«´ó¶¨Àí||minimax theorem ¼«Ð¡½â||minimum solution ¼«Ð¡ÀíÏë||minimal ideal ¼«Ð¡Ä£ÐÍ||minimal model ¼«Ð¡ÇúÃæ||minimal surface ¼«Ð¡ÇúÃæ·½³Ì||minimal surface equation ¼«Ð¡Ê±¼äÎÊÌâ||problem of minimum time ¼«Ð¡Ìõ¼þ||minimum condition ¼«Ð¡ÏòÁ¿||minimal vectors ¼«Ð¡ÓÒÀíÏë||minimal right ideal ¼«Ð¡Ôª||minimal element ¼«Ð¡Öµ||minimum ¼«Ð¡×ÓÁ÷ÐÎ||minimal submanifold ¼«Ð¡×óÀíÏë||minimal left ideal ¼«Öµ||extremum ¼«Öµ³¡||extremal field ¼«Öµ³¤¶È||extremal length ¼«Öµµã||extreme point ¼«Öµ·Ö²¼||extreme-value distribution ¼«ÖµÇúÏß||extremal curve ¼«ÖµÔÀí||extremum principle ¼«×ø±ê||polar coordinates ¼¯£ÛºÏ£Ý||set ¼¯µÄ±ß½ç||boundary of a set ¼¯µÄºË||nucleus of a set ¼¯·¶³ë||category of sets ¼¯º¯Êý||set function ¼¯ºÏ¶È¹æ||gauge of set ¼¯ºÏÂÛ||set theory ¼¯½á·¨||aggregation method ¼¯ÍÅÃÉÌØ¿¨ÂÞ·½·¨||cluster Monte Carlo method ¼¯Ñ¹ËõÓ³Éä||set contraction mapping ¼¯Öµ[µÄ]||set-valued ¼¯Öµº¯ÊýÓ³Éä||set-valued function mapping, multivalued function mapping ¼¯ÖµÔöÉúËã×Ó||set-valued accretive operator, multivalued accretive operator ¼¯Ö¸±ê¹ý³Ì||set-indexed process ¼¯Öк¯Êý||concentration function ¼¯ÖпØÖÆ||centralized control ¼¯×ܲÎÊýϵͳ||lumped parameter system; Óֳơ°¼¯ÖвÎÊýϵͳ¡±¡£ ¼°Ê±µ¥´¿¼¯||promptly simple set ¼±¼õC¡ÞÀຯÊý||rapidly decreasing C¡Þ function ¼±¼õ¹ãÒ庯Êý||rapidly decreasing distribution ¼¶Êý||series ¼¶ÊýµÄºÍ||sum of series ¼¶Êý½â||series solution ¼¶ÊýÇóºÍ||summation of series ¼¸ºÎ[ѧ]||geometry ¼¸ºÎ²â¶ÈÂÛ||geometric measure theory ¼¸ºÎµ¥´¿¸´ÐÎ||geometric simplicial complex ¼¸ºÎµ¥ÐÎ||geometric simplex ¼¸ºÎ·Ö²¼||geometric distribution ¼¸ºÎ¸ÅÂÊ||geometric probability ¼¸ºÎ¸ñ||geometric lattice ¼¸ºÎ¹æ»®||geometric programming ¼¸ºÎ¿÷¸ñ||geometric genus ¼¸ºÎÂë||geometric code ¼¸ºÎƽ¾ù||geometric mean ¼¸ºÎʵÏÖ||geometric realization ¼¸ºÎÔ¼»¯µÄ||geometrically reduced ¼¸ºÎÔ¼Êø||geometrical constraint ¼¸ºÎÕûµÄ||geometrically integral ¼¸ºÎÕýÔòµÄ||geometrically regular ¼¸ºÎÖØÊý||geometric multiplicity ¼¸ºõ±ØÈ»||almost sure, almost certain ¼¸ºõ±ØÈ»ÊÕÁ²||almost sure convergence ¼¸ºõ´¦´¦||almost everywhere, a.e ¼¸ºõ´¦´¦ÊÕÁ²||convergence almost everywhere ¼¸ºõÒ»ÖÂÊÕÁ²||almost uniform convergence ¼¹Ïß||line of regression ¼¾½ÚÐÔÄ£ÐÍ||seasonal model ¼Æ»®ÆÀÉó·¨||program evaluation and review technique, PERT ¼ÆÁ¿³é¼ì||sampling inspection by variables ¼ÆÊý³é¼ì||sampling inspection by attributes ¼ÆÊý¹ý³Ì||counting process ¼ÆÊýº¯Êý||counting function ¼ÆÊýͳ¼ÆÁ¿||counting statistic ¼ÆÊýÎÊÌâ||enumeration problem ¼ÆËã[µÄ]²»Îȶ¨ÐÔ||computational instability ¼ÆËã||computation ¼ÆËãµÄ·Ö²¼||computational distribution ¼ÆËã·½·¨||computing method ¼ÆË㸴ÔÓÐÔ||computational complexity ¼ÆËãЧÂÊ||computational efficiency ¼ÇÒäÌݶȷ¨||memory gradient method ¼ÈԼʣÓàϵ||reduced system of residues ¼Îµ±-»ùÁéÐÍ||Cartan-Killing form ¼Îµ±²»±äÁ¿||Cartan invariants ¼Îµ±¾ØÕó||Cartan matrix ¼Îµ±×Ó´úÊý||Cartan subalgebra ¼Ð½Ç||included angle ¼Ó||plus ¼Ó±ß¾ØÕó||bordered matrix ¼Ó³éÑù·½·¨||additional sampling technique ¼Ó·¨||addition ¼Ó·¨½»»»ÂÉ||commutative law of addition ¼Ó·¨½áºÏÂÉ||associative law of addition ¼Ó·¨ÏûÈ¥ÂÉ||cancellation law for addition ¼Ó¼õÏûÔª·¨||elimination by addition and subtraction ¼ÓÃÜ||encipher ¼ÓÇ¿Á¬ÐøÐÔ||intensified continuity; Óֳơ°ÈõÇ¿Á¬ÐøÐÔ¡±¡£ ¼ÓȨ±Æ½ü||weighted approximation ¼ÓȨ²»µÈʽ||weighted inequality ¼ÓȨ²Ð²î||weighted residual ¼ÓȨ·½·¨||weight method ¼ÓȨ¼«Ð¡»¯¼«´óËã·¨||weighted minimax algorithm; Óֳơ°ÀͲªËã·¨(Loeb algorithm)¡±¡£ ¼ÓȨÎó²î||weighted error ¼ÓȨÓàÁ¿·¨||weighted residual method ¼ÓȨ×îС¶þ³Ë·¨||method of weighted least squares ¼ÓÊý||addend ¼ÓËÙ||speedup ¼ÓËÙ¹ý¶È||overacceleration ¼ÓͬÓà·½·¨||additional congruential method ¼ÓÍе¼Êý||Gateaux derivative ¼ÓÍпÉ΢Ëã×Ó||Gateaux differentiable operator ¼ÓÏ¸Íø¸ñ||refined net, refined mesh ¼ÓÐԣ۵ģÝ||additive ¼ÓÐÔ·¶³ë||additive category ¼ÓÐÔº¯×Ó||additive functor ¼ÓÐÔ¼¯º¯Êý||additive set function ¼ÓÐÔÊýÂÛ||additive number theory; Óֳơ°¶ÑÀÝÊýÂÛ¡±¡£ ¼ÓÐÔÔ¼»¯||additive reduction ¼ÓÑϳé¼ì||tightened sampling inspection ¼ÙÉè||hypothesis ¼ÙÉè¼ìÑé||hypothesis testing ¼ÙÖµ||falsity ¼ÛÖµÂÛ||value theory ¼âµã||cusp ¼âµãÐÎʽ||cusp form ¼â·å[µÄ]||leptokurtic ¼ä¶Ï·Ö½â||discontinuity decomposition ¼ä¶Ï½â||discontinuous solution ¼ä϶||gap ¼ì²â¸ÅÂÊ||detection probability; Óֳơ°Õ |