New operations over hesitant fuzzy sets

Hesitant fuzzy sets are considered to be the way to characterize vague phenomenon. Their study has opened a new area of research and applications. Set operations on them lead to a number of properties of these sets which are not evident in classical (crisp) sets make the area mathematically also very productive. Since these sets are defined in terms of functions and set of functions, which is not the case when the sets are crisp, it is possible to define several set operations. Such a study enriches the use of these sets. In this paper, four new operations are envisaged, defined and taken up to study a score of new identities on hesitant fuzzy sets.     

On a Family of Covering Extended Building Sets

Recently Davis and Jedwab introduced the notion of covering extended building sets to construct abelian difference sets. In this paper we consider a family of covering extended building sets similar to the ones corresponding to Hadamard difference sets and Spence difference sets and derive some numerical restrictions on the parameters.     

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.     

Linking systems of difference sets

A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are to determine which groups contain a linking system of difference sets, and how large such a system can be. All previous constructive results for linking systems of difference sets are restricted to 2‐groups. We use an elementary projection argument to show that neither the McFarland/Dillon nor the Spence construction of difference sets can give rise to a linking system of difference sets in non‐2‐groups. We make a connection to Kerdock and bent sets, which provides large linking systems of difference sets in elementary abelian 2‐groups. We give a new construction for linking systems of difference sets in 2‐groups, taking advantage of a previously unrecognized connection with group difference matrices. This construction simplifies and extends prior results, producing larger linking systems than before in certain 2‐groups, new linking systems in other 2‐groups for which no system was previously known, and the first known examples in nonabelian groups.     

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.     

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.     

Global asymptotic stability analysis by the localization method of invariant compact sets

We study the asymptotic stability and the global asymptotic stability of equilibria of autonomous systems of differential equations. We prove necessary and sufficient conditions for the global asymptotic stability of an equilibrium in terms of invariant compact sets and positively invariant sets. To verify these conditions, we use some results of the localization method for invariant compact sets of autonomous systems. These results are related to finding sets that contain all invariant compact sets of the system (localizing sets) and to the behavior of trajectories of the system with respect to localizing sets. We consider an example of a system whose equilibrium belongs to the critical case.     

co-radiant集的等价表示及其在向量优化问题中的应用

作为特殊的抽象凸(凹)集,radiant集和co-radiant集在抽象凸分析和多目标优化问题理论中发挥着重要作用。首先建立radiant集co-radiant集的等价刻画,从而推导出它们的重要性质。然后,将重要性质应用到向量优化问题近似解的刻画中,得到关于近似解集的等价刻画。     

模糊粗糙集的表示及应用

一个模糊粗糙集是一对模糊集,它可以用一簇经典粗糙集表示出来.本文研究了模糊粗糙集的表示问题,利用模糊集的分解定理证明了一个模糊粗糙集可以用一簇粗糙模糊集表示出来,利用这个结果可以证明模糊粗糙集的一些重要性质.     

An algorithm for decomposing a polynomial system into normal ascending sets

We present an algorithm to decompose a polynomial system into a finite set of normal ascending sets such that the set of the zeros of the polynomial system is the union of the sets of the regular zeros of the normal ascending sets.If the polynomial system is zero dimensional,the set of the zeros of the polynomials is the union of the sets of the zeros of the normal ascending sets.     

Measurability and the abstract Baire property

Within an abstract theory of point sets the author has successfully unified a substantial number of the analogous theorems concerning Lebesgue measure and Baire category. It has been shown that the Lebesgue measurable sets coincide with the sets having the abstract Baire property with respect to the family of all closed sets of positive Lebesgue measure and the question was raised in [2] whether the sets measurable with respect to certain Hausdorff measures were the same as the sets having the abstract Baire property with respect to the family of all closed sets of positive Hausdorff measure. In this article we establish a general theorem which, under the assumption of the continuum hypothesis, gives an affirmative answer to this question.     

Function S-rough Sets and Their Law Characteristic

Function S-rough sets(Function Singular rough sets) are defined by R-function equivalence class which has dynamic characteristic, and a function is s law, function S-rough sets have law characteristic. Function S-rough sets has these forms: function one direction S-rough sets, function two direction S-rough sets and dual of function one direction S-rough sets. This paper presents the law characteristic of function one direction S-rough sets and puts forward the theorems of law-chain-attribute and law-belt. Function S-rough sets is s new research direction of the rough sets theory.     

A family of skew Hadamard difference sets

In 1933 a family of skew Hadamard difference sets was described by Paley using matrix language and was called the Paley-Hadamard difference sets in the literature. During the last 70 years, no new skew Hadamard difference sets were found. It was conjectured that there are no further examples of skew Hadamard difference sets. This conjecture was proved to be true for the cyclic case in 1954, and further progress in favor of this conjecture was made in the past 50 years. However, the conjecture remains open until today. In this paper, we present a family of new perfect nonlinear (also called planar) functions, and construct a family of skew Hadamard difference sets using these perfect nonlinear functions. We show that some of the skew Hadamard difference sets presented in this paper are inequivalent to the Paley-Hadamard difference sets. These new examples of skew Hadamard difference sets discovered 70 years after the Paley construction disprove the longstanding conjecture on skew Hadamard difference sets. The class of new perfect nonlinear functions has applications in cryptography, coding theory, and combinatorics.     

属性模糊集的分解特征

在模糊集理论研究的基础上,结合粗糙集的属性集、元素迁移的相关知识,提出属性模糊集的概念,利用给出属性模糊集的有关知识,结合模糊集与粗糙集合的有关理论,得到了属性模糊集的一系列重要定理,为模糊集合理论的进一步研究奠定了理论基础.     

Operation properties and -equalities of complex fuzzy sets

A complex fuzzy set is a fuzzy set whose membership function takes values in the unit circle in the complex plane. This paper investigates various operation properties and proposes a distance measure for complex fuzzy sets. The distance of two complex fuzzy sets measures the difference between the grades of two complex fuzzy sets as well as that between the phases of the two complex fuzzy sets. This distance measure is then used to define δ-equalities of complex fuzzy sets which coincide with those of fuzzy sets already defined in the literature if complex fuzzy sets reduce to real-valued fuzzy sets. Two complex fuzzy sets are said to be δ-equal if the distance between them is less than 1-δ. This paper shows how various operations between complex fuzzy sets affect given δ-equalities of complex fuzzy sets. An example application of signal detection demonstrates the utility of the concept of δ-equalities of complex fuzzy sets in practice.     

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.     

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.     

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

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

Definable Sets in Generic Structures and their Cardinalities

Analyzing diagrams forming generative classes, we describe definable sets and their links in generic structures as well as cardinality bounds for these definable sets, finite or infinite. Introducing basic characteristics for definable sets in generic structures, we compare them each others and with cardinalities of these sets.We introduce calculi for (type-)definable sets allowing to compare their cardinalities. In terms of these calculi, Trichotomy Theorem for possibilities comparing cardinalities of definable sets is proved. Using these calculi, we characterize the possibility to construct a generic structure of a given generative class.     

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.