欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
在最大运算量为2^n的LexiT序和LexiS序的基础上，提出了新的LexiTN序和LexiSN序，这两种序保持了LexiT序和LexiS序的所有性质，且它们的最大运算量为2n-1．另外，基于广义平均算子与有序加权平均算子，提出了最大运算量为n的LexiH序与LexiF序，研究了其性质．将[0，1]^[n]上的LexiR序推广到[0，1]n上，讨论了其性质．
英文摘要：
Based on LexiT ordering and LexiS ordering, whose maximum calculations are 2^n , LexiTN ordering and LexiSN ordering are proposed in this paper, which preserve all the properties of LexiT ordering and LexiS ordering and whose maximum calculations are 2n - 1 . Based on two averaging aggregation operators, the generalized averaging operator and ordered weighted averaging operator, LexiH ordering and LexiF ordering are presented and their properties are studied. LexiR ordering on [0,1 ]^[ n] is generalized to [0,1]^n and their properties are discussed
同期刊论文项目
同项目期刊论文
位置：