模糊相似关系传递核获取算法

针对模糊相似关系传递核的获取问题进行研究.首先给出模糊相似关系传递核的一些基本性质.之后,利用这些性质构造了三个算法来获取可能为传递核的模糊等价关系.最后,通过实验比较并分析这三种算法在获取传递核时的能力.     

模糊关系矩阵传递闭包的Warshall算法

通过对照关系的传递闭包和模糊关系的传递闭包，把求关系矩阵的传递闭包的算法完整地推广到模糊关系矩阵上。     

模糊关系传递性有关指标之间的关系

研究模糊关系与传递性有关的指标,这些指标包括T-传递指标、S-负传递指标、T-S-半传递指标、T-S-Ferrers关系指标等,详细讨论了它们之间的关系,从而推广了Fodor和王有关传递性性质之间的相关结果.     

直觉模糊关系的截集性质

定义了直觉模糊关系的截集以及并给出了它们的基本性质,同时分别讨论了自反、对称、传递直觉模糊关系与经典二元关系之间的等价刻画;其次,提出直觉模糊关系的定义域与值域的概念;最后,分析了直觉模糊关系合成的截集性质.     

求模糊关系传递闭包的一种算法

根据模糊关系的传递性的特征,文章提出了利用相应的模糊矩阵求有限论域上模糊关系的传递闭包的一种计算方法,该算法可以加快获得传递闭包的速度。通过实例说明了该算法是简便、实用的。     

一种求模糊矩阵传递闭包的基于幂序列单增矩阵构造的新算法

引入幂序列单增模糊矩阵的概念并讨论它的性质, 给出一种基于幂序列单增模糊矩阵构造的求模糊关系矩阵传递闭包的新算法; 并通过与现有的两种传递闭包求解算法的比较分析, 借助实例说明了算法的有效性和简洁性.     

模糊选择函数的拟传递合理性指标

介绍了模糊关系的拟传递指标和模糊选择函数的拟传递合理性指标.并在取小t-模下,讨论了拟传递指标与非循环指标之间的关系及拟传递合理性指标与模糊δ条件指标之间的关系.     

完全分配格上的伪补及其应用

定义完全分配格上的伪补 ,讨论伪补的性质 ,给出模糊矩阵有广义逆及模糊关系方程有解的充分必要条件。     

一类基于有界算子合成的模糊关系方程

讨论模糊关系的有界和 -有界积合成的基本性质。对于论域 U上的一个自反和有界传递的模糊关系 R,证明它是一个预序关系。得到关于有界算子的模糊线性方程有解的充要条件及解的递归结构。在此基础上给出有限论域上的模糊关系方程 A·X=B的求解方法     

模糊软逆半群

本文将软集理论运用到逆半群上的模糊同余关系和模糊逆子半群上,引入了逆半群上模糊软逆半群和正规模糊软逆半群的概念,并研究了其性质。建立了逆半群上的模糊软同余和正规模糊软逆半群之间的联系。最后,通过模糊软集上的θ-水平截集对模糊软同余、模糊软逆半群和正规模糊软逆半群进行等价刻画。     

多值近似空间的上、下近似诱导的拓扑结构

引入了论域U上的自反模糊关系R的传递化表示Rs的概念,利用Rs给出了R和Rs诱导的模糊拓扑的一组共同的基,从而证明了二者诱导的拓扑是相同的,研究了诱导拓扑的度量化问题及其可数性.     

Normalizing rank aggregation method for priority of a fuzzy preference relation and its effectiveness

The aim of this paper is to show that the normalizing rank aggregation method can not only be used to derive the priority vector for a multiplicative preference relation, but also for the additive transitive fuzzy preference relation. To do so, a simple functional equation between fuzzy preference’s element and priority weight is derived firstly, then, based on the equation, three methods are proposed to prove that the normalizing rank aggregation method is simple and effective for deriving the priority vector. Finally, a numerical example is used to illustrate the proposed methods.     

k-强传递阵

给出k-强传递阵的几个性质，讨论k-强传递阵与强传递阵的关系，并且指出强传递与准传递是等价的。     

模糊粗糙近似算子的拓扑性质

考虑论域上一二元关系所决定的模糊粗糙近似算子的拓扑性质,证明了任一自反二元关系可以决定一模糊拓扑.并且,当二元关系自反对称时,该模糊拓扑中的元是开集当且仅当它是闭集;当二元关系自反传递时,该模糊拓扑的闭包与内部算子恰为模糊粗糙上、下近似算子.     

利用关系矩阵求传递闭包的一种方法

介绍了一种利用关系矩阵求有限集合上二元关系的传递闭包的方法 ,该方法简便、实用 .还可用此方法计算有向图的可达性矩阵 .     

Consistency analysis of triangular fuzzy reciprocal preference relations

In order to simulate the uncertainty associated with impression or vagueness, a decision maker may give her/his judgments by means of triangular fuzzy reciprocal preference relations in the process of decision making. The study of their consistency becomes a very important aspect to avoid a misleading solution. Based on the reciprocity property, this paper proposes a new definition of consistent triangular fuzzy reciprocal preference relations. The new definition is different from that reduced by consistent fuzzy reciprocal preference relations proposed by Buckley (1985). The properties of consistent triangular fuzzy reciprocal preference relations in the light of the new definition are studied in detail. In addition, the shortcomings of the proof procedure of the proposition given by Wang and Chen (2008) are pointed out. And the proposition is reproved by using the new definition of consistent triangular fuzzy reciprocal preference relations. Finally, using the (n − 1) restricted comparison ratios, a method for obtaining consistent triangular fuzzy reciprocal preference relations is proposed, and an algorithm is shown to make a consistent decision ranking. Numerical results are further calculated to illustrate the new definition and the obtained algorithm.     

A new binary relation to compare viability of winning coalitions and its interrelationships to desirability relation and blockability relation

This paper aims to propose a new type of binary relations, called the viability relation, defined on the set of all coalitions in a simple game for a comparison of coalition influence, and to investigate its properties, especially its interrelationships to the desirability relation and the blockability relation. The viability relation is defined to compare coalitions based on their robustness over deviation of their members for complementing the inability of the desirability relation and the blockability relation to make a distinguishable comparison among winning coalitions. It is verified in this paper that the viability relation on a simple game is always transitive and is complete if and only if the simple game is S-unanimous for a coalition S. Examples show that there are no general inclusion relations among the desirability relation, the blockability relation and the viability relation. It is also verified that the viability relation and the blockability relation are complementary to each other. Specifically, the blockability relation between two coalitions is equivalent to the inversed viability relation between the complements of the two coalitions.     

Transitive Limit Closures of Convex Dynamical Systems

Convex dynamical systems are iterated set-valued maps with convex graphs. The closed union of all finite powers of a given convex relation will be called its limit closure. We address the question of transitivity of limit closures and establish a sufficient condition for such transitivity (limit transitivity). We also present examples showing that the limit closure of a general compact convex system is not necessarily transitive. limit closure can be intransitive as well. It is also shown that the restriction of a linear single-valued map to a convex set containing an open neighborhood of the origin is always limit transitive.