集合关系

It's the accumulated process of many subdominant options,which is formed by the standard of market mechanism conflicting with the subdominant opt...

中国金融业通过次优选择战略的集合来演绎市场关系，提高了改革的效率，达到了改革的最优。

Actually, how to integrate the interrelation of the sets into symbolic logic is extremelly fantastic and worthy of further research.

如何将集合论中的集合间关系与数理逻辑结合起来，这是一个值得研究也很有趣的问题。

This article expounds the basic notion of rough sets theory,and uses the principle of partial knowledge dependence of this theory.

简述了粗糙集合理论的基本概念，并运用这一理论中的部分依赖性原理，计算了胃病病例辩证分型对不同症状的依赖度，分析了症状与辩证分型之间的关系。

We have just defined four important sets in terms of the transitive closure of four very simple relations.

我们根据四个非常简单的关系的传递闭包，恰好完成了四个重要的集合。

The algorithm due to Warshall is a very simple and effective too1, which computes the transitive closure of a binary relation on finite set as we1l as the reach ability matrix of a simple digraph.

WARSHALL算法是一个非常简单而有效的工具，它可以计算有穷集合上的二元关系的传递闭包和简单方向图的可到达矩阵。

Based on model TGSC, the multi—layer temporal set covering diagnosis model MTGSC which describes multi—layer transitive relation of causation between disorders and manifestations.

第二章中，通过引入时态一致集合覆盖的概念，提出一个基于时态推理与覆盖技术的时态覆盖集诊断模型TGSC，TGSC利用模糊集描述有关征兆、故障及相互间的时态约束关系，采用基于假设图搜索的诊断问题求解方法。

Chapter II of the Seventh String Quartet in general on the background, with pitch-class set theory analysis of three replacement sound relationship between the unified group of pitch throughout the whole idea of music, as well as the theme of fragment replacement pitch twelve-tone theme with a free form.

第二章大致阐述第七弦乐四重奏创作背景，用音级集合理论分析出三音组音高置换关系统一贯穿全曲的思路，以及主题片段音高置换与自由十二音主题形态。

Coordinate sequence method is made up of the instruct information of polygon boundary x, y coordinate. It is the easiest polygon vector encoding method. The file structure of this method is easy, but because of the polygon boundary has stored two times, it will produce data redundancy, moreover, short of neighbor threshold information; Tree index encoding method make all the boundary points digitizing, store the coordinate sequence, connect the point index to boundary line, and then connect the line index to other polygons, so as to the tree index structure has came into being. It eliminates neighbor polygons boundary data redundancy problems; Topology structure encoding method is a method which by setting up a complete topology relationship structure, resolve the neighbor threshold and island information process problem. However, it makes arithmetic more complicated and makes database bigger.

坐标序列法是由多边形边界的x，y坐标对集合及说明信息组成，是最简单的一种多边形矢量编码法，文件结构简单，但多边形边界被存储两次产生数据冗余，而且缺少邻域信息；树状索引编码法是将所有边界点进行数字化，顺序存储坐标对，由点索引与边界线号相联系，以线索引与各多边形相联系，形成树状索引结构，消除了相邻多边形边界数据冗余问题；拓扑结构编码法是通过建立一个完整的拓扑关系结构，彻底解决邻域和岛状信息处理问题的方法，但增加了算法的复杂性和数据库的大小。

Symmetry, transitivity, equivalence relations; sets Venn diagrams, complements, Cartesian

对称性，及物性，等价关系；集合(Venn图，补全，笛卡儿积，幂集)；分类原理；基数和可数性

For an abitrary set X, appropriate order relations on WCL (the set of all weak closure operators), WIN (the set of all weak interior operators), WOU (the set of all weak exterior operators), WB (the set of all weak boundary operators), WD (the set of all weak derived operators), WD*(the set of all weak difference derived operators), WR (the set of all weak remote neighborhood system operators) and WN (the set of all weak neighborhood system operators) can be defined respectively, which make WCL, WIN, WOU, WB, WD, WD*, WR and WN to be complete lattices that are ismorphic to CS(X,CS is the set of all closure systems on X.

证明了可以在WCL(X上的弱闭包算子的全体)、 WIN(X上的弱内部算子的全体)、 WOU (X上的弱外部算子的全体)、 WB (X上的弱边界算子的全体)、WD、 WD*(X上的弱差导算子的全体)、 WR(X上的弱远域系算子的全体)和WN(X上的弱邻域系算子的全体)上定义适当的序关系，使它们成为与CS(X，〖JX-*5[JX*5]同构的完备格其中CS(X是给定集合X上的闭包系统的全体。

Lugalbanda was a god and shepherd king of Uruk where he was worshipped for over a thousand years.

Lugalbanda 是神和被崇拜了一千年多 Uruk古埃及喜克索王朝国王。

I am coming just now,' and went on perfuming himself with Hunut, then he came and sat.

我来只是现在，'歼灭战perfuming自己与胡努特，那麼，他来到和SAT 。