Granular Computing on partitions(RST),coverings(GrCC) and neighborhood systems(LNS) are examined: (1) The order of generality is RST, GrCC, and then LNS. (2) The quotient structure: In RST, it is called quotient set. ...Granular Computing on partitions(RST),coverings(GrCC) and neighborhood systems(LNS) are examined: (1) The order of generality is RST, GrCC, and then LNS. (2) The quotient structure: In RST, it is called quotient set. In GrCC, it is a simplical complex, called the nerve of the covering in combinatorial topology. For LNS, the structure has no known description. (3) The approximation space of RST is a topological space generated by a partition, called a clopen space. For LNS, it is a generalized/pretopological space which is more general than topological space. For GrCC,there are two possibilities. One is a special case of LNS,which is the topological space generated by the covering. There is another topological space, the topology generated by the finite intersections of the members of a covering The first one treats covering as a base, the second one as a subbase. (4) Knowledge representations in RST are symbol-valued systems. In GrCC, they are expression-valued systems. In LNS, they are multivalued system; reported in 1998 . (5) RST and GRCC representation theories are complete in the sense that granular models can be recaptured fully from the knowledge representations.展开更多
2020年,Wu等(IEEE Transactions on Information Theory,2020,66(6):3657-3663.)运用简单复合体,在环F_(2)+u F_(2)(u^(2)=0)上构造了2类少重量二元码.基于此工作,利用简单复合体,在有限域F_(2)上构造2类新的最优少重量二元码,并利用初...2020年,Wu等(IEEE Transactions on Information Theory,2020,66(6):3657-3663.)运用简单复合体,在环F_(2)+u F_(2)(u^(2)=0)上构造了2类少重量二元码.基于此工作,利用简单复合体,在有限域F_(2)上构造2类新的最优少重量二元码,并利用初等的方法和技巧,得到这2类码的重量分布,并证明它们的参数都满足Griesmer界;最后给出2个具体例子.展开更多
文摘Granular Computing on partitions(RST),coverings(GrCC) and neighborhood systems(LNS) are examined: (1) The order of generality is RST, GrCC, and then LNS. (2) The quotient structure: In RST, it is called quotient set. In GrCC, it is a simplical complex, called the nerve of the covering in combinatorial topology. For LNS, the structure has no known description. (3) The approximation space of RST is a topological space generated by a partition, called a clopen space. For LNS, it is a generalized/pretopological space which is more general than topological space. For GrCC,there are two possibilities. One is a special case of LNS,which is the topological space generated by the covering. There is another topological space, the topology generated by the finite intersections of the members of a covering The first one treats covering as a base, the second one as a subbase. (4) Knowledge representations in RST are symbol-valued systems. In GrCC, they are expression-valued systems. In LNS, they are multivalued system; reported in 1998 . (5) RST and GRCC representation theories are complete in the sense that granular models can be recaptured fully from the knowledge representations.
文摘2020年,Wu等(IEEE Transactions on Information Theory,2020,66(6):3657-3663.)运用简单复合体,在环F_(2)+u F_(2)(u^(2)=0)上构造了2类少重量二元码.基于此工作,利用简单复合体,在有限域F_(2)上构造2类新的最优少重量二元码,并利用初等的方法和技巧,得到这2类码的重量分布,并证明它们的参数都满足Griesmer界;最后给出2个具体例子.
