完备集

Unlike the canonical extension,the number of algebraic completion of a poset may be more.

一个偏序集的代数完备可能有多个，可是，当偏序集是并半格时，代数完备在序同构意义下却是唯一的。

The application of rough set theory in incomplete information systems is one of the key problems to study rough set theory in practice. However, it is difficult for classical rough set theory to deal with those incomplete information systems.

粗糙集理论在不完备信息系统中的应用，是将粗糙集理论进一步推向实用的关键之一，而经典的粗糙集理论对不完备信息系统的处理显得束手无策。

In this paper,based on fundamental topology theories,the concept ofcomplete set is proposed and the closed ball model is constructed.

本文以拓扑学为基础，提出了完备集的概念，建立了拓扑关系的闭球模型。

In this paper, based on fundamental topology theories, the concept of complete set is proposed and the closed ball model is constructed.

基于闭球模型可以直接推导出拓扑关系的完备集和概念邻域以及复合表。

It is easy to getcom Dlete set and concept neighborhood,and possible to derive composition table for topological relations based on closed ball model.

基于闭球模型可以直接推导出拓扑关系的完备集和概念邻域以及复合表。

Finally, in Chapter 4, we generalize the kq representation to 2N dimension. Based on Blocking theorem, the complete set of projectors on noncommutative Orbifold T〓/G are given.

第四章，我们建立了2N维空间的kq表象，证明了分块定理并由此构造出非对易可积Orbifold T〓/G上的投影算子完备集。

Finally, in Chapter 4, we generalize the kq representation to 2N dimension. Based on Blocking theorem, the complete set of projectors on noncommutative Orb-ifold T2N/G are given.

第四章，我们建立了2N维空间的kq表象，证明了分块定理并由此构造出非对易可积Orbifold T~(2N)／G上的投影算子完备集。

Classic rough set theory based on equivalence relation takes complete system as object of study , and divides the region into some non-intersect equivalence class; But, in the real life, because of the errors in data measuring, understanding of data, or the restriction in data collection , it can make the decision-making system incomplete, that is, value of attribution of some objects is unknown, which restrains development of the theory to practical direction.

经典粗糙集理论以完备系统为研究对象，以等价关系为基础，通过等价关系将论域划分为互不相交的等价类；然而，在现实生活中，由于数据测量的误差，对数据理解或获取的限制等原因，使得在知识获取时往往面临的是不完备系统，即可能存在部分对象的一些属性值未知的情况，这就极大地限制了粗糙集理论向实用化方向发展。

The first part includes five sections as follows:§1 Origin and development of the four color problem;§2 Plane graphs and maps;§3 Planarity testing of graphs;§4 Maximal planar graphs;§5 Duality.

他们的基本方法是在所有平面图的可约构形中找出一个不可免的完备集。占旧计算时间12u多个小时。这样的工作量是

We discuss the general from of IBM2 hamitltonian. We give the complete set of Casimir operators ?

3、(6)极限。我们在第四章中讨论了IBM2的哈密顿量的一般形式，给出了IBM2的Casimir算子的完备集。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。