查询词典 k

If for any uv∈E, C_u≠C_v, then we callσis a k-adjacent vertex distinguishing incidence coloring of G andχ_=min{k| there exists a k- adjacent vertex distinguishing incidence coloring of G} is the adjacent vertex distinguishing incidence chromatic number of G.

若对任意uv∈E满足C_u≠C_v，则称σ为G的k-邻点可区别关联着色，并称X_=min{k|存在G的k-邻点可区别关联着色}为G的邻点可区别关联色数。

We explain the basic conception of the Lie group, Lie algebra and Riemannian manifolds in detail, deeply analyze and research the Special Euclidean Group SE(3) and se(3) in the Lie group, Lie algebra. Establish the relation between the adjoint transformation Adg and the operatorφ(k + 1,k) under a particular condition , substitute the operatorφ(k + 1,k)with spatial adjoint operator Ad kk ?

在多体系统动力学理论体系中，详细阐述了Lie群、Lie代数和Riemannian几何的基本概念，对Lie群、Lie代数中的特殊Euclidean群SE(3)和se(3)作深入分析与研究，建立Lie括号下的伴随变换Adg在特定条件下与空间算子代数理论中的空间变换算子φ(k + 1，k)之间的相互关系，并将空间伴随算子Ad kk ？

Specify what status the spatial operator algebra locates at in many methods of multibody systems dynamics formulations and what the relations are between the spatial operator algebra and other dynamics formulations.We explain the basic conception of the Lie group, Lie algebra and Riemannian manifolds in detail, deeply analyze and research the Special Euclidean Group SE(3) and se(3) in the Lie group, Lie algebra. Establish the relation between the adjoint transformation Adg and the operatorφ(k + 1,k) under a particular condition, substitute the operatorφ(k + 1,k)with spatial adjoint operator Ad kk ?

在多体系统动力学理论体系中，详细阐述了Lie群、Lie代数和Riemannian几何的基本概念，对Lie群、Lie代数中的特殊Euclidean群SE(3)和se(3)作深入分析与研究，建立Lie括号下的伴随变换Adg在特定条件下与空间算子代数理论中的空间变换算子φ(k + 1，k)之间的相互关系，并将空间伴随算子Ad kk ？

Let K be the 3 cyclotomic field, Esubscript D(superscript λ: y^2=x^3-2^4 3^3 D(superscript λ) be an elliptic curve defined over K, where D∈K is a square-free algebraic integer and λ∈Z.

设K为三次分圆域，E下标 D(上标λ：y^2=x^3-2^4 3^3 D为定义在K上的椭圆曲线，其中D为K中无平方因子的代数整数，λ∈Z。

Note: Ktotal output = Total Kof basic soil - Total Kin 2000; Kbalance =Annal input K - Average annal output K; Same as follow.

注： 表中钾的总支出量=基础土样全K量- 2002 年全K量；平衡状况=每年投入K量-平均年支出K量；下同。

The Apriori is an algorithm about the generation of association rule. Enlightened by the generation of candidate k-itemsets, k subsets of one item will be first find out, and then connected to get subsets of two items, and finally get the subsets of k-1 items. The algorithm can be used to find out the proper subset and to generate the protasis and apodosis of the association rule.

在关联规则--Apriori算法方面，主要是受Apriori算法中生成候选k项集方法的启发，提出首先找出k个只含1项的子集，然后将它们连接生成含2项的子集，直到最后连接成k-1项的子集为止的寻找真子集并生成关联规则前件、后件的算法。

So a lot of stationmaster make a station also is cautious, for instance: HTtp://www.02me.com/ also some viewpoints are to say Baidu K station is artificial interpose, do not do contest price to open an account in Baidu they are met K your website, to such hearsay, cannot without foundation concludes among them authenticity, or in the clerk mouth that this word first time appears in company of a SEO, what do because of those SEO company full-time is Google rank is optimized, rank them to Baidu and cannot master, because this goes so bespatter Baidu is additional perhaps purposeful, everything is there is good reason for it, normally the circumstance falls, baidu also won't of for no reason at all give website K search result, be engaged in experience of SEO actual combat through 3 years, the website is accomplished let Baidu ban, very difficult really, look in me actually, a few the factor that Baidu seals a station is only just, should master only, had avoided these detail, make Baidu long collect, the rank is a very easy thing, searching engine is mechanization, without cerebrum, without thinking, and the person is to cerebrum has thinking, as long as root beat one's brains, agree to fumble, the algorithm of engine is such nevertheless also.

所以很多站长作站也是小心翼翼的，比如：http：//www.02me.com/也有的观点是说百度K站是人工干预，不在百度做竞价开户他们就会K你的网站，对于这样的传言，不能凭空断定其中的真实性，或者这句话第一次出现在一个SEO公司的业务员嘴里，因为那些SEO公司专职做的是Google排名优化，对于百度排名他们并不能掌握，因此这样去诋毁百度或者是另有目的，凡事都是事出有因，通常情况下，百度也不会无缘无故的将网站K出搜索结果，通过3年从事SEO实战经验，网站做到让百度封杀，真的很难，其实在我看来，百度封站的因素仅仅几点而已，只要掌握、避过这些细节，让百度长时间收录，排名都是一件很容易的事，搜索引擎是机械化的，没有大脑、没有思维，而人是有大脑有思维的，只要根动脑、肯摸索，引擎的算法也不过如此。

In this paper we study the method of interpolation by radial basis functions in H~k(k ≥ 1) and give some error estimates. By means of such interpolation with a special kind of radial basis function, we construct a basis in H~k(k ≥ 1). Combined with the Galerkin method, this theory can be applied to solve boundary value problems for elliptic partial differential equations (such as the third boundary value problem for Poisson equation and the corresponding problem for the biharmonic equation), and some numerical experiments are also given.

本文从求解偏微分方程的角度出发，在被逼近函数u属于一般的Sobolev空间H~k(k≥1)的情形，引入了一种径向基函数插值方法，并建立了相应的误差估计；再利用这种插值性质，从一类特殊径向基函数出发构造Sobolev空间的一组基，针对Poisson方程第三类边值问题和重调和方程类似边值问题，为用无网格算法求解偏微分方程边值问题建立了相应的理论，并通过算例来验证了这一算法。

The research of K〓 and K〓 groups in algebraic K-theory is closely related to the study of classical groups.

代数K-理论中K〓和K〓群的研究同典型群的研究密切相关。

Maximum likelihood detector is the optimal detector and has the best performance. The challenge of MLD is the high computational complexity. K-Best decoding algorithm has been proposed to reduce the computational complexity. K-Best decoder algorithm computes Partial Euclidean Distance and only keeps the best K nodes that have the smallest accumulated PEDs. After completing breadth-first tree search, we will have K leaves with the smallest PEDs.

最大相似度侦测法是公认最佳化的演算法，有著最好的侦测效能，但运算复杂度将会随著调变群集和传送天线数目大小而呈指数型增加。K-Best球型解码演算法因而被提出来，得到近似最大相似度侦测法的结果，解决最大相似度侦测法运算复杂度过高的问题。K-Best球型解码演算法在计算完部份欧几里德距离后，需要取最小K个值做为候选点，再往下层去找候选点。

Do not gum up the work by telling mother what we are going to do .

别告诉母亲我们要干的事，那会把事情搞糟的。

In recent years, application of the partial prestressed concrete beam s is developed.

近年来，随着部分预应力砼梁应用的推广，发现我国规范所采用的名义拉应力法的计算结果不稳定。