闭模糊拟阵模糊圈的极值问题

本文主要方法是通过基本序列、导出拟阵序列和模糊集分解定理,将模糊圈的研究转化为对圈子集套和数组的研究。在闭模糊拟阵中,我们得出三个结论:以同一集合为支撑集的模糊圈的最大模糊圈总是存在;以同一子集串为圈子集套的模糊圈的最大模糊圈不一定存在。但是,找到了存在最大模糊圈的充要条件;以同一集合为支撑集的模糊圈的最小模糊圈,以同一子集串为圈子集套的模糊圈的最小模糊圈都是不存在的。但它们的最小模糊势是存在的,而且找出了计算最小模糊势的公式。我们构造了两个算法:一是构造支撑集最大模糊圈算法。通过这个算法可构造出支撑集最大模糊圈,同时计算出其最大模糊势;二是判断和构造圈子集套最大模糊圈算法。通过这个算法首先判断最大模糊圈是否存在,如果存在就可以找出圈子集套最大模糊圈同时计算出最大模糊势。     

Fuzzy cardinals based on the generalized equality of fuzzy subsets

The purpose of this paper is to present a new concept of the cardinality of finite fuzzy subsets which is based on the notion of the generalized equality. The proposed idea will be compared with several approaches which were earlier offered in ‘fuzzy’ literature. Using the new definition of the fuzzy cardinality we next introduce a notion of fuzzy semicardinals, i.e. we construct fuzzy natural numbers defining degrees to which a finite fuzzy subset has, respectively, at most/least and less than/more than k elements. Various properties of different fuzzy cardinals and semicardinals, as well as some interdependences between them, are also given.     

Transitivity-preserving fuzzification schemes for cardinality-based similarity measures

A family of fuzzification schemes is proposed that can be used to transform cardinality-based similarity measures for ordinary sets into similarity measures for fuzzy sets in a finite universe. The family is based on rules for fuzzy set cardinality and for the standard operations on fuzzy sets. In particular, the fuzzy set intersections are pointwisely generated by Frank t-norms. The fuzzification schemes are applied to a variety of previously studied rational cardinality-based similarity measures for ordinary sets and it is demonstrated that transitivity is preserved in the fuzzification process.     

Twofold fuzzy sets and rough sets—Some issues in knowledge representation

This paper deals with the representation of sets where the membership of some elements may be ill-known rather than just a matter of degree as in a fuzzy set. The notion of a twofold fuzzy set is introduced when the relevant information for determining the membership status is incomplete. A twofold fuzzy set is made of a nested pair of fuzzy sets: the one which gathers the elements which more or less necessarily belong and the one which gathers the elements which more or less possibly belong. Twofold fuzzy sets are compared from a frontal and from a semantical point of view with other proposals and particularly with the notion of a rough set recently introduced by Pawlak. Set operations of twofold fuzzy sets are discussed and the cardinality of a twofold fuzzy set is defined. Twofold fuzzy relations are also introduced. Finally, various applications of twofold fuzzy sets in knowledge representation are briefly discussed.     

Cardinality of fuzzy sets via bags

We discuss the concept of a bag. We then investigate the use of these structures for the representation of cardinality of a fuzzy set.     

Fuzzy cardinality based evaluation of quantified sentences

Quantified statements are used in the resolution of a great variety of problems. Several methods have been proposed to evaluate statements of types I and II. The objective of this paper is to study these methods, by comparing and generalizing them. In order to do so, we propose a set of properties that must be fulfilled by any method of evaluation of quantified statements, we discuss some existing methods from this point of view and we describe a general approach for the evaluation of quantified statements based on the fuzzy cardinality and fuzzy relative cardinality of fuzzy sets. In addition, we discuss some concrete methods derived from the mentioned approach. These new methods fulfill all the properties proposed and, in some cases, they provide an interpretation or generalization of existing methods.     

Axiomatic systems for rough sets and fuzzy rough sets

Rough set theory is an important tool for approximate reasoning about data. Axiomatic systems of rough sets are significant for using rough set theory in logical reasoning systems. In this paper, outer product method are used in rough set study for the first time. By this approach, we propose a unified lower approximation axiomatic system for Pawlak’s rough sets and fuzzy rough sets. As the dual of axiomatic systems for lower approximation, a unified upper approximation axiomatic characterization of rough sets and fuzzy rough sets without any restriction on the cardinality of universe is also given. These rough set axiomatic systems will help to understand the structural feature of various approximate operators.     

模糊Fourier变换算法

本文把普通集合中的离散Fourier变换推广到模糊集合。借助于区间数、模糊数的运算规则及有关性质,给出了模糊离散Fourier变换(FDFT)的定义及算法,而且也讨论了模糊离散Fourier变换中的对应关系以及变换性质的几个定理。     

On Weierstrass semigroups and sets: a review with new results

In this work we present a survey of the main results in the theory of Weierstrass semigroups at several points, with special attention to the determination of bounds for the cardinality of its set of gaps. We also review results on applications to the theory of error correcting codes. We then recall a generalization of the concept of Weierstrass semigroup, which is the Weierstrass set associated to a linear system and several points. We finish by presenting new results on this Weierstrass set, including some on the cardinality of its set of gaps.      

模糊集的基数与连续统假设

本文在模糊映射的基础上给出了模糊集基数的定义，它把普通集的基数作为特款；不但得到有关基数的大部分结论，而且有其自身的特殊性质；特别，对于连续统假设这一世界难题可能有新的启示．     

Prototypical knowledge for interpreting fuzzy concepts and quantifiers

The ability to understand truly natural language expressions which involve fuzzy concepts and quantifiers (like many, few, most, etc.) presents many problems, some of which are worth mentioning: cardinality of a fuzzy set, extensions of the classical syllogisms to fuzzy syllogisms, dispositions, etc. Apart from these problems, which have been discussed in the literature, the main difficulty in evaluating such expressions is the strong interaction between the definition of the fuzzy concept and the domain knowledge.In this paper we will try to make such a claim apparent and describe some initial solutions, which provide an intelligent system with the capability of representing and understanding fuzzy concepts and quantifiers by taking into account domain knowledge.     

A multi-objective genetic algorithm for cardinality constrained fuzzy portfolio selection

This paper presents a new procedure that extends genetic algorithms from their traditional domain of optimization to fuzzy ranking strategy for selecting efficient portfolios of restricted cardinality. The uncertainty of the returns on a given portfolio is modeled using fuzzy quantities and a downside risk function is used to describe the investor's aversion to risk. The fitness functions are based both on the value and the ambiguity of the trapezoidal fuzzy number which represents the uncertainty on the return. The soft-computing approach allows us to consider uncertainty and vagueness in databases and also to incorporate subjective characteristics into the portfolio selection problem. We use a data set from the Spanish stock market to illustrate the performance of our approach to the portfolio selection problem.     

Characterizations of Postman Sets

Using results by McKee and Woodall on binary matroids, we prove that the set of postman sets has odd cardinality, generalizing a result by Toida on the cardinality of cycles in Eulerian graphs. We study the relationship between T-joins and blocks of the underlying graph, obtaining a decom- position of postman sets in terms of blocks. We conclude by giving several characterizations of T-joins which are postman sets and commenting on practical issues.     

Characterizations of postman sets

Using results by McKee and Woodall on binary matroids, we show that the set of postman sets has odd cardinality, generalizing a result by Toida on the cardinality of cycles in Eulerian graphs. We study the relationship between T-joins and blocks of the underlying graph, obtaining a decomposition of postman sets in terms of blocks. We conclude by giving several characterizations of T-joins which are postman sets.     

Total restrained bondage in graphs

A subset S of vertices of a graph G with no isolated vertex is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex in V (G) S is also adjacent to a vertex in V (G) S. The total restrained domination number of G is the minimum cardinality of a total restrained dominating set of G. In this paper we initiate the study of total restrained bondage in graphs. The total restrained bondage number in a graph G with no isolated vertex, is the minimum cardinality of a subset of edges E such that G E has no isolated vertex and the total restrained domination number of G E is greater than the total restrained domination number of G. We obtain several properties, exact values and bounds for the total restrained bondage number of a graph.     

Elections generate all binary relations on infinite sets

Every binary relation on an infinite set can be represented by an election in which each voter’s preferences are quasi-transitive and complete (except possibly not reflexive) and in which the electorate has smaller cardinality than or the same cardinality as the set of alternatives, depending on the cardinality of that set.     

Fuzzy turnover rate chance constraints portfolio model

One concern of many investors is to own the assets which can be liquidated easily. Thus, in this paper, we incorporate portfolio liquidity in our proposed model. Liquidity is measured by an index called turnover rate. Since the return of an asset is uncertain, we present it as a trapezoidal fuzzy number and its turnover rate is measured by fuzzy credibility theory. The desired portfolio turnover rate is controlled through a fuzzy chance constraint. Furthermore, to manage the portfolios with asymmetric investment return, other than mean and variance, we also utilize the third central moment, the skewness of portfolio return. In fact, we propose a fuzzy portfolio mean–variance–skewness model with cardinality constraint which combines assets limitations with liquidity requirement. To solve the model, we also develop a hybrid algorithm which is the combination of cardinality constraint, genetic algorithm, and fuzzy simulation, called FCTPM.     

Fuzzy幂群的基数及表示

研究Fuzzy幂群^[2]中元素的基数,证明这种Fuzzy幂群并非Zadeh意义的Fuzzy子群,而且可以用一分明群表示,给出有限群上Fuzzy幂群的正则表示,并讨论Fuzzy幂群的同态性质。     

Finding an inner estimation of the solution set of a fuzzy linear system

In this paper, we consider the problem of finding an inner estimation of the solution set of a fuzzy linear system with a real-valued coefficient matrix and a fuzzy-valued right-hand side vector. The proposed idea is based on the utilization of interval Gaussian elimination procedure to produce an inner estimation of the solutions set. To this end, firstly we apply interval Gaussian elimination procedure to obtain the solution set of a fuzzy linear system and secondly, by limiting it via solving a crisp linear system, we find an inner estimation of the solutions set, such that it satisfies the related fuzzy linear system. Finally, several numerical examples are given to show the efficiency and ability of our method.     

Li and Yorke chaos with respect to the cardinality of the scrambled sets

In the present paper we study Li and Yorke chaos on several spaces in connection with the cardinality of its scrambled sets. We prove that there is a map on a Cantor set and a map on a two-dimensional arcwise connected continuum (with empty interior) such that each scrambled set contains exactly two points.