基于单调包含度的模糊决策信息系统的知识约简

知识约简是机器学习,模式识别,信号处理等领域的主要问题之一。本文介绍了基于单调包含度的模糊决策信息系统的知识约简。证明了模糊决策信息系统的约简即是其对应信息系统的约简,从而为该种模糊决策信息系统的知识约简提供了简单直接的方法。     

连续论域上Fuzzy集的信息熵

在文献[1]的基础上,把模糊熵从离散论域推广到连续论域,给出连续论域上Fuzzy集的偏熵、关联熵等概念。对其主要性质进行讨论,取得了一些令人满意的结果。拓宽信息熵的研究领域,对不确定复杂系统的信息处理、知识学习、归纳学习、模糊信息学的进一步研究打下一定基础。     

(∈,∈∨ q(λ,μ))-凸模糊集

给出(∈,∈∨q(λ,μ))-凸模糊集的定义,讨论它们的一些基本性质。     

基于优势关系下不协调目标信息系统的分布约简

在基于优势关系下的不协调目标信息系统中引入了分布约简和最大分布约简的概念,并讨论了二者之间的关系,而且得到了分布和最大分布约简的判定定理以及辨识矩阵,建立了不协调目标信息系统的分布和最大分布约简的具体方法,同时通过实例验证了该方法的有效性,从而进一步丰富了粗糙集理论。     

基于Type-2型模糊集的动态生态位模型

复杂生态系统中,由于生物进化的高度非线性,使生物更容易适应环境的变化,生物与环境的交流要求用动态的观点来描述生态位及其相关概念。本文利用T ype-2型模糊集合的“宽带”效应,给出了具有动态特性的生态位模型,并相应的给出宽度和重叠的计算公式。应用于植物的生态位宽度和重叠的计算,与已有公式结果的比较,本文提出的模型可以全面的给出了物种在每个资源状态下的情形,同时反应了物种与环境之间的互动交流。为生物系统的应用研究和理论研究提出统一的数学模型。     

Fixed Point Theorems on a Non-convex Set

ＦｉｘｅｄＰｏｉｎｔＴｈｅｏｒｅｍｓｏｎａＮｏｎ－ｃｏｎｖｅｘＳｅｔ￥ＺｈａｏＸｉａｏｑｕａｎ（赵晓全）ａｎｄＳｕｎＸｕｅｓｉ（孙学思）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃａ，ＨａｒｂｉｎＩｎｓｔｉｔｕｔｅｏｆＥｌｅｃｔｒｉｃａｌＴｅｃｈｎ...     

One dimensional metrical geometry

One dimensional metrical geometry may be developed in either an affine or projective setting over a general field using only algebraic ideas and quadratic forms. Some basic results of universal geometry are already present in this situation, such as the Triple quad formula, the Triple spread formula and the Spread polynomials, which are universal analogs of the Chebyshev polynomials of the first kind. Chromogeometry appears here, and the related metrical and algebraic properties of the projective line are brought to the fore.      

Combining grey relation and TOPSIS concepts for selecting an expatriate host country

As international corporate activities increase, their staffing involves more strategic concerns. However, foreign assignments have many differences, and dissatisfaction with the host country is a known cause of expatriate failure. From the point of view of an expatriate candidate, the decision of whether to take an expatriate assignment can be regarded as a FMCDM (fuzzy multiple criteria decision making) problem. This paper describes a fuzzy AHP (fuzzy analytic hierarchy process) to determine the weighting of subjective judgments. Using the Sugeno integral for λ-fuzzy measure, and using the nonadditive fuzzy integral technique to evaluate the synthetic utility values of the alternatives and the fuzzy weights, then the best host country alternative can be derived with the grey relation model. The authors further combine the grey relation model based on the concepts of TOPSIS (technique for order preference by similarity to ideal solution) to evaluate and select the best alternative. A real case of expatriate assignment decision-making was used to demonstrate that the grey relation model combined with the ideas of TOPSIS results in a satisfactory and effective evaluation.     

Approximation of the Quadratic Set Covering problem

We study in this article the polynomial approximation properties of the Quadratic Set Covering problem. This problem, which arises in many applications, is a natural generalization of the usual Set Covering problem. We show that this problem is very hard to approximate in the general case, and even in classical subcases (when the size of each set or when the frequency of each element is bounded by a constant). Then we focus on the convex case and give both positive and negative approximation results. Finally, we tackle the unweighted version of this problem.     

Clutter nonidealness

Several key results for set packing problems do not seem to be easily or even possibly transferable to set covering problems, although the symmetry between them. The goal of this paper is to introduce a nonidealness index by transferring the ideas used for the imperfection index defined by Gerke and McDiarmid [Graph imperfection, J. Combin. Theory Ser. B 83 (2001) 58-78]. We found a relationship between the two indices and the strength of facets defined in [M. Goemans, Worst-case comparison of valid inequalities for the TSP, mathematical programming, in: Fifth Integer Programming and Combinatorial Optimization Conference, Lecture Notes in Computer Science, vol. 1084, Vancouver, Canada, 1996, pp. 415-429; M. Goemans, L.A. Hall, The strongest facets of the acyclic subgraph polytope are unknown, in: Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 1084, Springer, Berlin, 1996, pp. 415-429]. We prove that a clutter is as nonideal as its blocker and find some other properties that could be transferred from the imperfection index to the nonidealness index. Finally, we analyze the behavior of the nonidealness index under some clutter operations.