模糊推理三I算法的连续性和逼近性

三I算法是一种新的模糊推理方法,可以作为传统的模糊推理方法的修改和补充.系统地研究了三I支持度算法和反向三I支持度算法的连续性问题,并指出了基于一些常用的蕴涵算子的三I算法具有逼近性.此结果对构建模糊控制系统和模糊专家系统时选用三I推理算法具有一定的指导作用.     

基于直觉模糊熵的多目标决策

讨论了基于直觉模糊集的多准则决策,提出了一种新的决策方法：基于直觉模糊熵的多目标决策。给出不同的直觉模糊熵用于多目标决策,并给出了基于直觉模糊熵的多目标决策具体算法。通过具体实例,说明运用不同的直觉模糊熵得出的结果基本是一致的,这说明了决策具体算法的合理性,从而说明基于直觉模糊熵的多目标决策是可行的。     

基于图片特征空间的信息压缩研究

提出了一种基于2DPCA和PCA的信息压缩方法,从而实现两种特征提取方法的优势互补.仿真实验结果表明,该方法不仅提取和保留了有效信息,减少了信息的存储空间,又极大地减小了计算量,有很好的特征提取性能.     

两类广义粗糙集模型

粗糙集理论和应用研究中的一个重要方向是推广经典的粗糙集理论和模型,使得这种理论和方法能够被应用于更一般的情形.本文讨论两类广义粗糙集模型的关系,一类是基于论域覆盖的广义粗糙集模型,另一类是基于论域上一般二元关系的广义粗糙集模型.基于两类模型的比较,提出一种具有对偶性的修正覆盖粗糙集模型,研究这种模型的性质,给出这种模型的代数刻画.     

The completeness and applications of the formal system B

Since the formal deductive system (?) was built up in 1997, it has played important roles in the theoretical and applied research of fuzzy logic and fuzzy reasoning. But, up to now, the completeness problem of the system (?) is still an open problem. In this paper, the properties and structure of R0 algebras are further studied, and it is shown that every tautology on the R0 interval [0,1] is also a tautology on any R0 algebra. Furthermore, based on the particular structure of (?) -Lindenbaum algebra, the completeness and strong completeness of the system (?) are proved. Some applications of the system (?) in fuzzy reasoning are also discussed, and the obtained results and examples show that the system (?) is suprior to some other important fuzzy logic systems.     

FH-OWA算子及其在模糊多属性决策中的应用

现实中,绝大多数的决策是模糊决策,而决策结果很大程度上取决于聚合算子的选取。为了使信息聚合更加科学合理,研究了H-OWA算子（Heronian ordered weighted averaging operator）。鉴于H-OWA算子的优点和局限性,提出了基于三角模糊数的FH-OWA算子（fuzzy Heronian ordered weighted averaging operator）,并研究了其幂等性、单调性、有界性及交替性。最后,将FH-OWA算子应用于模糊多属性决策中,并与原文献进行了比较和分析,结果表明FH-OWA算子在信息聚合时侧重所有决策者意见的“一致性”,而不是个别专家的权威性。     

A semantically complete extension sequence of the system (?)

In this paper, the method of well-combined semantics and syntax proposed by Pavelka is applied to the research of the prepositional calculus formal system (?)*. The partial constant values are taken as formulas, formulas are fuzzified in two manners of semantics and syntax, and inferring processes are fuzzified. A sequence of new extensions {(?)_n~*} of the system ? is proposed, and the completeness of (?)_n~* is proved.     

A semantically complete extension sequence of the system L

In this paper, the method of well-combined semantics and syntax proposed by Pavelka is applied to the research of the propositional calculus formal system L*. The partial constant values are taken as formulas, formulas are fuzzified in two manners of semantics and syntax, and inferring processes are fuzzified. A sequence of new extensions {Ln*} of the system L* is proposed, and the completeness of Ln* is proved.     

Kleene逻辑函数的特征与极小化

本文进一步研究了Kleene逻辑函数,得到了这类函数的特征性质,解决了这类函数的极小化问题。由于这类函数与正则三值逻辑函数的特殊关系,从而也解决了正则三值逻辑函数的极小化问题。