accessible set

accessible set的基本解释

-

可达集

与accessible set相关的网络例句 [注：此内容来源于网络，仅供参考]

In rough sets based on accessible relation, we merge rough set theory and accessible relation into one model. Compared with classical rough set models(including Pawlak rough set model and various precise rough set model), the new model is more general.

基于可达关系的粗糙集模型是将可达关系应用于粗糙集理论中，这种模型比传统的粗糙集模型(Pawlak模型和可变精度粗糙集模型)更一般，将粗糙集理论推广到一般的方法论。

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上的闭包系统的全体。

A set is "less than" another set if and only if the first set is a proper subset of the second set, and a set is "greater than" another set if and only if the first set is a proper superset of the second set.

只有当第一个集合是第二个集合的严格子集时，我们才称第一个集合"小于"第二个集合，同理，只有当第一个集合是第二个集合的严格超集时，我们才称第一个集合"大于"第二个集合。

与accessible set相关的网络解释 [注：此内容来源于网络，仅供参考]

accessible set：可达集

accessible point 可达点 | accessible set 可达集 | accessible vertex 可达顶点