Interval-valued level cut sets of fuzzy set

The connections between Zadeh fuzzy set and three-valued fuzzy set are established in this paper. The concepts of interval-valued level cut sets on Zadeh fuzzy set are presented and new decomposition theorems and representation theorems of Zadeh fuzzy set are established based on new cut sets. Firstly, four interval-valued level cut sets on Zadeh fuzzy set are defined as three-valued fuzzy sets and it is shown that the interval-valued level cut sets of Zadeh fuzzy set are generalizations of normal cut sets on Zadeh fuzzy set, and have the same properties as those of normal cut sets of Zadeh fuzzy set. Secondly, the new decomposition theorems are established based on these new cut sets. It is pointed out that each kind of interval-valued level cut sets corresponds to two decomposition theorems. Thus eight decomposition theorems are obtained. Finally, the definitions of three-valued inverse order nested sets and three-valued order nested sets are presented with eight representation theorems based on new nested sets.     

On the structures and dimensions of Moran sets

The Moran sets and the Moran class are defined by geometric fashion that distinguishes the classical self_similar sets from the following points:(i) The placements of the basic sets at each step of the constructions can be arbitrary.(ii) The contraction ratios may be different at each step.(iii) The lower limit of the contraction ratios permits zero.The properties of the Moran sets and Moran class are studied, and the Hausdorff, packing and upper Box_counting dimensions of the Moran sets are determined by net measure techniques. It is shown that some important properties of the self_similar sets no longer hold for Moran sets.     

On Julia sets concerning phase transitions

The sets of the points corresponding to the phase transitions of the Potts model on the diamond hierarchical lattice for antiferromagnetic coupling are studied. These sets are the Julia sets of a family of rational mappings. It is shown that they may be disconnected sets. Furthermore, the topological structures of these sets are described completely.     

模糊参数软区间集及其应用

将模糊参数软集与区间集相结合,定义了模糊参数软区间集的概念,研究了模糊参数软区间集的运算及其性质.然后,给出模糊参数软区间集在决策中的应用,说明了方法的可行性.推广了软区间集的相关研究结果.     

Chaotic sets of continuous and discontinuous maps

This paper discusses Li-Yorke chaotic sets of continuous and discontinuous maps with particular emphasis to shift and subshift maps. Scrambled sets and maximal scrambled sets are introduced to characterize Li-Yorke chaotic sets. The orbit invariant for a scrambled set is discussed. Some properties about maximality, equivalence and uniqueness of maximal scrambled sets are also discussed. It is shown that for shift maps the set of all scrambled pairs has full measure and chaotic sets of some discontinuous maps, such as the Gauss map, interval exchange transformations, and a class of planar piecewise isometries, are studied. Finally, some open problems on scrambled sets are listed and remarked.     

(∈,∈∨q)-n维凸模糊集

利用n维模糊集截集理论和模糊点与n维模糊集的邻属关系,并利用n+1-值Lukasiewicz蕴涵,首先给出(α,β)-n维凸模糊集的定义,然后对(∈,∈)-n维凸模糊集和(∈,∈∨q)-n维凸模糊集这两种非常有意义的n维凸模糊集进行了讨论,最后得到了一些有意义的结果。这将为n维凸模糊分析理论研究打下基础。     

关于粗糙集和灰色系统之间某些关系的探讨

首先介绍粗糙集与灰色系统两种理论,并对二者进行比较。接着介绍普通粗糙集、P-粗糙集以及灰色集的定义,并就灰色集、模糊集和经典集合三者进行对比分析。我们提出了点灰度和集灰度两种灰度概念用于描述灰色系统的信息不确定性。通过P粗糙集导出相应的灰色集,并研究相关的灰度、粗糙度与边界域的性质和关系。分析表明使用导出的灰色集对系统的信息不确定性的估计与相应的粗糙集是一致的,因此两种理论在描述和处理不确定性信息系统方面的一定的相关性,将两种理论相结合来处理某些不确定性信息系统可能更为有效。     

Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets

Covering rough sets generalize traditional rough sets by considering coverings of the universe instead of partitions, and neighborhood-covering rough sets have been demonstrated to be a reasonable selection for attribute reduction with covering rough sets. In this paper, numerical algorithms of attribute reduction with neighborhood-covering rough sets are developed by using evidence theory. We firstly employ belief and plausibility functions to measure lower and upper approximations in neighborhood-covering rough sets, and then, the attribute reductions of covering information systems and decision systems are characterized by these respective functions. The concepts of the significance and the relative significance of coverings are also developed to design algorithms for finding reducts. Based on these discussions, connections between neighborhood-covering rough sets and evidence theory are set up to establish a basic framework of numerical characterizations of attribute reduction with these sets.     

A Characterization of Model Multi-colour Sets

Model sets are always Meyer sets, but not vice versa. This article is about characterizing model sets (general and regular) amongst the Meyer sets in terms of two associated dynamical systems. These two dynamical systems describe two very different topologies on point sets, one local and one global. In model sets these two are strongly interconnected and this connection is essentially definitive. The paper is set in the context of multi-colour sets, that is to say, point sets in which points come in a finite number of colours, that are loosely coupled together by finite local complexity. Communicated by Jean Bellissard submitted 8/10/04, accepted 15/02/05     

函数S-粗集对偶与F-粗边际规律

函数单向S粗集对偶(dual offunction one direction singular rough sets)是函数S粗集的基本形式之一,函数单向S-粗集对偶具有动态特性与规律(函数)特性.函数S粗集(function singular rough sets)是把函数概念引入到S粗集内(singular rough sets)改进S粗集得到的把导数概念与函数单向S粗集对偶交叉、渗透给出粗边际规律F-粗边际规律概念;给出粗边际规律F-粗边际规律特征;给出F-粗边际规律与粗边际规律的关系;给出F-粗边际规律在经济信息系统中的应用     

Similarity,inclusion and entropy measures between type-2 fuzzy sets based on the Sugeno integral

Similarity measures of type-2 fuzzy sets are used to indicate the similarity degree between type-2 fuzzy sets. Inclusion measures for type-2 fuzzy sets are the degrees to which a type-2 fuzzy set is a subset of another type-2 fuzzy set. The entropy of type-2 fuzzy sets is the measure of fuzziness between type-2 fuzzy sets. Although several similarity, inclusion and entropy measures for type-2 fuzzy sets have been proposed in the literatures, no one has considered the use of the Sugeno integral to define those for type-2 fuzzy sets. In this paper, new similarity, inclusion and entropy measure formulas between type-2 fuzzy sets based on the Sugeno integral are proposed. Several examples are used to present the calculation and to compare these proposed measures with several existing methods for type-2 fuzzy sets. Numerical results show that the proposed measures are more reasonable than existing measures. On the other hand, measuring the similarity between type-2 fuzzy sets is important in clustering for type-2 fuzzy data. We finally use the proposed similarity measure with a robust clustering method for clustering the patterns of type-2 fuzzy sets.     

覆盖空间及粗糙集与拓扑的统一

引入覆盖空间,定义了其邻域、内部、闭包、测度等概念,研究了它们的性质.得出了粗糙集近似空间和拓扑空间都是具体覆盖空间的重要结论,从而用覆盖空间统一了粗糙集和拓扑.利用覆盖空间,得到了粗糙集和拓扑中更深刻的性质,从算子论和集合论的角度丰富和深化了粗糙集与拓扑的内容.     

An Interactive Approach for Project Selection

This paper describes an interactive method for presenting a sequence of feasible sets of indivisible projects to a decision-maker. For each set as a whole, the decision-maker evaluates its utilities with respect to each of several attributes; the utilities are then combined to give a single utility for the set.A sequence of zero-one programmes is used to ensure that the only sets presented are those which are feasible and which are not contained in larger feasible sets. The sets are presented in descending order of size, and the presentation can be terminated by the decision-maker or by supplementary rules.The method for presenting sets can be used in other contexts in which complete enumeration of possible sets would otherwise be required.     

Isomorphism groups in Clifford algebras

A set of anticommuting multivectors in Clifford algebras can be taken as orthonormal basis set. The Clifford algebra generated by this basis is isomorphic to the original algebra. The non linear transformations between orthonormal basis sets form a group. In the four dimensionnal case six sets of five anticommuting multivectors are found. These sets yield 30 matrices defining basis sets. These matrices are representatives of left cosets, members of these cosets are related by permutation of rows. From the equivalence of all basis sets of multivectors it can be concluded that there is no canonical set of basis vectors in Clifford algebras.     

L—Fuzzy集分解定理

随着隶属函数真值域的拓广,原来关于Zadch-Fuzzy集的分解定理II和III对于L－Fuzzy集不再成立,尽管已有一些它们的关于L＿Fuzzy集的改进形式,但因条件较强,失去了原来的许多优越性,本文从格论入手,首先引入格中元素的强上集和L－Fuzzy集准截集的两个新概念,并讨论了它们的部分性质,进而借助它们给出了L－Fuzzy集分解定理的两个新形式。     

广义差集与几乎完美序列

提出了广义差集的概念,并且给出了广义差集的一些初等性质.从应用的角度讲,广义差集就是使得其±1特征序列的自相关函数是(最多)三值的一种组合结构.因此,广义差集不仅仅是在概念(理论)上的推广,它还具有深层次的应用背景.事实上,给出了一些广义差集,它不是可分差集,也不是相对差集.同时也给出了一类广义差集存在的一些必要条件,使得这些广义差集对应的±1特征序列成为几乎完美序列.并举例说明本文中的方法是有效的.     

Continuous ε-selection and monotone path-connected sets

Mathematical Notes - The sets with continuous selection from near-best approximations and the monotone path-connected sets are studied; several examples of such sets are also considered.     

Ω-Invariance in control systems with bounded controls

The concepts of weakly Ω-invariant sets and strictly weakly Ω-invariant sets in control systems with bounded controls are defined and analyzed. Computable conditions for weak Ω-invariance are derived, and the question of existence of rest points and stationary points in weakly Ω-invariant sets is considered. For linear dynamics, properties of weakly Ω-invariant sets are studied, and questions of constrained reachability are investigated.     

Vague集的表现定理

在Fuzzy集理论和现有Vague集理论的基础上,引入二元集合套的概念,讨论它的代数性质。在此基础上,结合Vague集的分解定理,建立Vague集的表现定理,同时得到一系列相关结果,进一步揭示Vague集与经典集合之间的联系。     

Reduction about approximation spaces of covering generalized rough sets

The introduction of covering generalized rough sets has made a substantial contribution to the traditional theory of rough sets. The notion of attribute reduction can be regarded as one of the strongest and most significant results in rough sets. However, the efforts made on attribute reduction of covering generalized rough sets are far from sufficient. In this work, covering reduction is examined and discussed. We initially construct a new reduction theory by redefining the approximation spaces and the reducts of covering generalized rough sets. This theory is applicable to all types of covering generalized rough sets, and generalizes some existing reduction theories. Moreover, the currently insufficient reducts of covering generalized rough sets are improved by the new reduction. We then investigate in detail the procedures to get reducts of a covering. The reduction of a covering also provides a technique for data reduction in data mining.