Note on “The induced continuous ordered weighted geometric operators and their application in group decision making”

In this short communication, we will show that the condition of the theorem does not hold in general cases in a recent paper “The induced continuous ordered weighted geometric operators and their application in group decision making” [Computers & Industrial Engineering 56 (2009) 1545–1552] by Wu et al., and also illustrate an example to show that we cannot construct a consistent interval multiplicative preference relation according to the condition of theorem in general case. Furthermore, we present a more reasonable condition to satisfy Theorem 1 so that we can construct a consistent interval multiplicative preference relation.     

基于倒排索引的密文数据库检索方法研究

针对实际密文数据库的应用,在全文检索倒排索引技术的基础上,设计了一种通过密文倒排索引文件对其进行快速检索的方法。密文索引文件中主要包含有索引项、相对应的记录主键等信息。检索时,通过用检索词匹配索引文件中的索引项,找到对应的记录主键集合,再根据记录主键集合查询密文数据库,获取相应的密文数据,进行解密即可获取明文数据信息。整个检索过程中不对数据库进行解密,从而实现了在不解密的情况下对密文数据库的快速检索。     

基于特征值分解的图像边界与空间关系描述

针对图像识别、检索、配准中的特征提取与特征描述问题,利用加权图的邻接矩阵特征值分解方法,构造具有平移、缩放、旋转不变性的图像边界形状和空间关系描述子。理论分析与仿真实验结果表明,该算法在缩放和旋转条件下具有较强的鲁棒性和较好的类别可分离性,相比传统算法可以更好地进行图像描述,且计算量有所减小。     

On group decision making with four formats of incomplete preference relations

In this paper, a new approach is proposed to solve group decision making (GDM) problems where the preference information on alternatives provided by decision makers (DMs) is represented in four formats of incomplete preference relations, i.e., incomplete multiplicative preference relations, incomplete fuzzy preference relations, incomplete additive linguistic preference relations, incomplete multiplicative linguistic preference relations. In order to make the collective opinion close each decision maker’s opinion as near as possible, an optimization model is constructed to integrate the four different formats of incomplete preference relations and to compute the collective ranking values of the alternatives. The ranking of alternatives or selection of the most desirable alternative(s) is directly obtained from the derived collective ranking values. A numerical example is also used to illustrate the applicability of the proposed approach.     

概念空间中上下位关系的意义识别研究

针对上下位关系在分类层级结构建立阶段遇到的多义性问题,给出一种概念空间中上下位关系意义识别的方法.单个概念的意义识别问题被转换为概念空间中上下位关系的意义识别.首先利用并列语境解决语境稀疏问题,获取上下位关系意义的语境.然后利用<同义词词林>对每个语境进行词义修正,以三种特征计算特征词权重,构建"关系一词'的高维向量空间,然后通过潜在语义分析降维,获取上下位关系意义的潜在语义,最后组平均聚类后得到关系的意义划分.在实验中,给出了聚类阈值自动调整函数,分析了词林和潜在语义分析的作用,实验结果证实了方法的有效性.     

Intuitionistic fuzzy transformation semigroups

The idea of (faithful) intuitionistic fuzzy transformation semigroup, intuitionistic admissible relation, and intuitionistic (strong) homomorphism are introduced and their basic properties are examined.     

Uniqueness of the Perfect Fusion Grid on ℤ d

Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In a graph, merging two regions, separated by a set of vertices, is not straightforward. The perfect fusion graphs defined in J. Cousty et al. (J. Math. Imaging Vis. 30:(1):87–104, 2008) verify all the basic properties required by region merging algorithms as used in image segmentation. Unfortunately, the graphs which are the most frequently used in image analysis (namely, those induced by the direct and the indirect adjacency relations) are not perfect fusion graphs. The perfect fusion grid, introduced in the above mentioned reference, is an adjacency relation on ℤ ^d which can be used in image analysis, which indeed induces perfect fusion graphs and which is “between” the graphs induced by the direct and the indirect adjacencies. One of the main results of this paper is that the perfect fusion grid is the only such graph whatever the dimension d.

基于改进灰色理论的威胁指标权重技术

针对各种网络指标之间的相互影响,同时考虑主客观2个方面的因素,提出用灰色理论中的灰关联度和传统层次分析法相结合的算法进行网络威胁指标权重的确定。实验证明,该方法数学理论严谨,具有良好的实用价值,使网络威胁评估方法在可信度方面有一定的 提高。     

不完备信息系统中对象的相似性刻画

信息系统知识约简与知识发现是粗糙集理论的重要研究方向。通过对不完备信息系统中对象的相似性刻画方式以及相应的粗糙集模型进行对比分析,基于限制容差关系提出了一种新的限制相似关系,建立了基于限制相似关系的粗糙集模型,讨论了模型的基本性质及其与已有模型之间的关系。     

On the finite and general implication problems of independence atoms and keys

We investigate implication problems for keys and independence atoms in relational databases. For keys and unary independence atoms we show that finite implication is not finitely axiomatizable, and establish a finite axiomatization for general implication. The same axiomatization is also sound and complete for finite and general implication of unary keys and independence atoms, which coincide. We show that the general implication of keys and unary independence atoms and of unary keys and general independence atoms is decidable in polynomial time. For these two classes we also show how to construct Armstrong relations. Finally, we establish tractable conditions that are sufficient for certain classes of keys and independence atoms not to interact.