 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   度集合 的翻译结果: 查询用时：0.447秒 在分类学科中查询 所有学科 数学 更多类别查询 历史查询  度集合  “度集合”译为未确定词的双语例句
 Paperintroduced fuzzy set and membership function of fuzzing mathematics to fuzzilycharacterize the slope of the cardiograms, so that the membership grade set and thecharacters of the cardiograms can be acquired. 本文引入了模糊数学中模糊集合及隶属函数的概念,将心电波形的斜率进行模糊特征化,得到每个心电波形的隶属度集合,从而提取心电波形的特征。 短句来源 Symbolic Dempster-Shafer (D-S for short) theory is presented to handling imprecise and uncertain reasoning. The numerical set of belief degrees [0,1] in classical D-S theory is replaced by a totally ordered scale of symbolic values. After the qualitative mass function and qualitative belief function are defined by qualitative operators, the fundamental relation between them is discussed. 采用一个全序的符号值集合来代替数值信任度集合[0,1],提出定性Dempster-Shafer理论来处理既有不确定性又有不精确性的推理问题·首先,定义了适合对不确定性进行定性表达和推理的定性mass函数、定性信任函数等概念,并且研究了这些概念之间的基本关系; 短句来源 相似匹配句对
 K-n-Degrees K-n-度 短句来源 The set 集合(英文) 短句来源 Ring of Set Liu wenqi (Kunming University of science & Technology,Kunming,650093) 集合环 短句来源 The prestressing degree is an important concept in P.P. 预应力度是P. P. 短句来源 Analysis Method of High-Order Collective-Flow Correlations Based on the Concept of Correlative Degree 基于关联度的高阶集合流关联分析方法 短句来源 查询“度集合”译词为用户自定义的双语例句

我想查看译文中含有：的双语例句  degree set
 It is shown that for all integers r >amp;gt; 0 and s ?0 and a convex set S with min(S) = r and max(S) = r+s, there exists a connected degree-continuous graph G with the degree set S and diameter 2s+2. The minimum order of a degree-continuous graph with a prescribed degree set is studied. We give a necessary and sufficient condition for the existence of a tree of order n with a given degree set. The set D of distinct signed degrees of the vertices in a signed graph G is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the signed degree set of some connected signed graph and determine the smallest possible order for such a signed graph. 更多 Let be the partially ordered set of all Turing degrees. A function j: D - D is said to be progressing if a ≤f(a) for all a ∈ D. For such a function f,we call a and b in D j-incomparable if a ≮ f(b) and b ≮ f(a), and f-comparable otherwise. The central result of the paper is that in ZFC the continuum Hypothesis 1 = 20 holds if and only if there exists a progressing function f: D → D such that any pair a and b in D is f-comparable. 令Ｄ为所有Ｔｕｒｉｎｇ度的集合，≤为Ｄ上的图林化归关系．一函数ｆ：Ｄ→Ｄ称为前进函数如果对任何ａ∈Ｄ，ａ≤ｆ（ａ）。对于一个前进函数ｆ，我们说Ｄ中的两个度ａ，ｂ是ｆ－不可比较的，如果ａ≮ｆ（ｂ）且ｂ ≮ｆ（ａ），否则是ｆ－可比较的．本文的一个主要结果是：在ＺＦＣ中连续统假设成立当且仅当存在一个前进函数ｆ：Ｄ→Ｄ使得Ｄ中任何两个度都是ｆ－可比较的. In this paper,the photographs of standard spray rinsing fabric are processed by using fuzzy cluster image segmention althorim which based on two-dimension gray histogram.First,get the membership function level of image pixeles,then segment the image by them,thus the binary procession is finished.Then calculate the percentages of spray rinsing area to fabric.Diffrent grade has diffrent percentages,thus,calculate the level of "closeness" of test sample and the stardard samples by Oujimide distance,then the grade... In this paper,the photographs of standard spray rinsing fabric are processed by using fuzzy cluster image segmention althorim which based on two-dimension gray histogram.First,get the membership function level of image pixeles,then segment the image by them,thus the binary procession is finished.Then calculate the percentages of spray rinsing area to fabric.Diffrent grade has diffrent percentages,thus,calculate the level of "closeness" of test sample and the stardard samples by Oujimide distance,then the grade of fabric's spray rinsing can be got. 本文应用基于二维直方图的图象分割模糊聚类方法对标准织物淋水试验等级的图象进行分割处理，即利用模糊Ｃ—均值（ＦＣＭ）聚类算法得到图象像素点的隶属度集合，并由各像素点的隶属度实现图像分割，完成图像的二值化。然后计算二值化后的图象上黑区域（物体）面积百分率，此值即为织物上的沾水面积百分率。实际评定织物淋水等级时，采用欧氏距离计算实验样品与标准样品淋水面积的贴近度来确定其淋水等级。 The vertex with maximum degree and its incidence edges in the graph G are deleted The remaning subgraphs follow in the same way until the last subgraph empty If degrees of the deleted vertexes x\-1,x\-2,…,x\-l are P\-1,P\-2,…,P\-l in order The series P\-1,P\-2,…,P\-l is called the degree series of the graph G The set consists of the degrees of other ends of the incidance edges of x\-i(1≤i≤l) in graph G,is called the incidence degree set of x\-i The complexity of graph isomorphism test is proved to be... The vertex with maximum degree and its incidence edges in the graph G are deleted The remaning subgraphs follow in the same way until the last subgraph empty If degrees of the deleted vertexes x\-1,x\-2,…,x\-l are P\-1,P\-2,…,P\-l in order The series P\-1,P\-2,…,P\-l is called the degree series of the graph G The set consists of the degrees of other ends of the incidance edges of x\-i(1≤i≤l) in graph G,is called the incidence degree set of x\-i The complexity of graph isomorphism test is proved to be polynomial by calculating and comparing the degree series,the degrees of the deleted vertexes and their incidence degree set 在图 G =(V,E)中 ,删除其度数最大的顶点及其关联的边 ,在余下的子图中 ,如法炮制 ,直至余下的子图为零图 .设所删除的这些顶点 x1 ,x2 ,… ,xi 的度数依次为 P1 ,P2 ,… ,Pl,称序列 P1 ,P2 ,… ,Pl 为图 G的度序列 ;xi(1≤ i≤ l)关联的边的另一端点在 G中的度数的集合称为顶点 xi 关联的度集合 .通过计算、比较两图的度序列、被删除的顶点的度数以及它们关联的度集合 ,证明两图同构问题的复杂度是多项式的 << 更多相关文摘 相关查询

 CNKI小工具 在英文学术搜索中查有关度集合的内容 在知识搜索中查有关度集合的内容 在数字搜索中查有关度集合的内容 在概念知识元中查有关度集合的内容 在学术趋势中查有关度集合的内容

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索 2008 CNKI－中国知网 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社