Rough set based rule induction from two decision tables

We study rule induction from two decision tables as a basis of rough set analysis of more than one decision tables. We regard the rule induction process as enumerating minimal conditions satisfied with positive examples but unsatisfied with negative examples and/or with negative decision rules. From this point of view, we show that seven kinds of rule induction are conceivable for a single decision table. We point out that the set of all decision rules from two decision tables can be split in two levels: a first level decision rule is positively supported by a decision table and does not have any conflict with the other decision table and a second level decision rule is positively supported by both decision tables. To each level, we propose rule induction methods based on decision matrices. Through the discussions, we demonstrate that many kinds of rule induction are conceivable.     

Moments of an exponential functional of random walks and permutations with given descent sets

The exponential functional of simple, symmetric random walks with negative drift is an infinite polynomial Y = 1 + ξ₁ + ξ₁ξ₂ + ξ₁ξ₂ξ₃ + ⋯ of independent and identically distributed non-negative random variables. It has moments that are rational functions of the variables μ _k = E(ξ ^k ) < 1 with universal coefficients. It turns out that such a coefficient is equal to the number of permutations with descent set defined by the multiindex of the coefficient. A recursion enumerates all numbers of permutations with given descent sets in the form of a Pascal-type triangle. This revised version was published online in August 2006 with corrections to the Cover Date.     

无限差集类及其应用

若S为Z+的一无限子集,称S-S={n-m|n,m∈S,n>m}为一无限差集.本文研究Z+的子集族F生成的无限差集类(?)F-△={S-S|S∈F)及其对偶族K(?)F-△的性质,并讨论它们在动力系统研究中的应用.     

Separating the solution sets of analytical and polynomial systems

A linear inequality system with infinitely many constraints is polynomial (analytical) if its index set is a compact interval of the real line and all its coefficients are polynomial (analytical, respectively) functions of the index on this interval. This paper provides an example of analytical system whose solution set cannot be the solution set of any polynomial system. Research supported by DGES of Spain and FEDER of UE, Grant BFM2002-04114-C02-01. Research supported by CONACyT of Mexico, Grant 130036. Research partially supported by CONACyT of Mexico, Grant 44003.     

有关拓扑学与覆盖粗糙集的一些结论

引入了拓扑覆盖的概念,并结合最小描述元对有限论域上的拓扑覆盖加于研究,得出了拓扑覆盖的最简覆盖和基与最小描述元之间的关系.介绍了在基于有限论域U上的覆盖,构造U上的一个拓扑的方法.并且在最小描述元的基础上将划分下的粗糙隶属函数推广至一般覆盖下的粗糙隶属函数,而后介绍了其相关运用.     

LK property for σ-ideals

An ideal J of subsets of a Polish space X has (LK) property whenever for every sequence (An) of analytic sets in X, if lim supn∈HAn∉J for each infinite H then _?n∈G∉J for some infinite G. In this note we present a new class of σ-ideals with (LK) property.     

广义凸函数的特征性质

提出广义凸集、广义凸函数、中间点广义凸函数、端点广义凸函数四个定义,通过定义条件P1,研究条件P1所蕴含的等式关系,进而得到一个基础性定理一稠密性定理和一个相对条件较弱的推论,最后将结果应用于若干不同类型的广义凸函数类,尤其是s-凸函数、几何凸函数、rp-凸函数,得到它们所共有的一个特征性质,即满足稠密性定理．     

Frattini子群循环的有限$p$-群中的非交换集和极大Abel子群

设G是一个群,X是G的一个子集,若对于任意x,y∈X且x≠y,都有xy≠yx,则称X是G的一个非交换集.进一步,如果对于G中的任意其它非交换子集Y,都有|X|≥|Y|,那么称X是G的一个极大非交换集.文中确定了Frattini子群循环的有限p-群中极大非交换集和极大Abel子群的势.     

基于群体一致性的犹豫模糊多属性决策方法

犹豫模糊集允许一个元素属于一个集合的隶属度可以是多个不同的值,是表达决策者之间偏好不一致性的有力工具。针对决策者评价偏差不宜过大的问题,提出了一种基于群体一致性的犹豫模糊多属性决策方法。首先, 我们定义了犹豫模糊元的犹豫度函数,进而定义了犹豫模糊元的一致性指数;在此基础上,构建了基于群体一致性指数最大化的权重优化模型,通过求解优化模型可以得到属性的权重向量。然后,运用灰色关联分析法实现对方案的排序和择优。最后,通过实例分析说明了该方法的可行性和有效性。