粒计算一种覆盖模型.pdfVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.21, No.11, November 2010, pp.2782−2789 doi: 10.3724/SP.J.1001.2010.03663 Tel/Fax: +86-10 © by Institute of Software , the Chinese Academy of Sciences . All rights reserved. ∗ 粒计算的一种覆盖模型 1+ 2,3 折延宏 , 王国俊 1(西安石油大学 理学院,陕西 西安 710065) 2( 陕西师范大学 数学与信息科学学院,陕西 西安 710062) 3(上海市高可信计算重点实验室,上海 200062) Covering Model of Granular Computing SHE Yan-Hong1+, WANG Guo-Jun2,3 1(College of Science, Xi’an Shiyou University, Xi’an 710065, China) 2(College of Mathematics and Information Science, Shaanxi Normal University, Xi’an 710062, China) 3(Shanghai Key Laboratory of Trustworthy Computing, Shanghai 200062, China) + Corresponding author: E-mail: yanhongshe@ She YH, Wang GJ. Covering model of granular computing. Journal of Software, 2010,21(11):2782−2789. /1000-9825/3663.htm Abstract : To investigate the basic problems of granular computing, such as granulation, computing with granulars and so on, in a more general setting, a covering model of granular computing is introduced in this paper by relaxing the three conditions of equivalence relations, which generalizes the existing models. Under this model, Zoom-in and Zoom-out operators are defined, respectively. Different combinations of Zoom-in and Zoom-out operators form different rough approximations of the universe of discourse and granulated universe of discourse. This paper studies their propertis and establishes their relationship with topological space and Galois connection. Key words: granular computing; covering; Zoom-in; Zoom-out; Galois connection; topological space 摘 要: 为了在一种更为广泛的背景之下研究粒计算的基本问题(诸如粒化、粒的计算及粒空间之间信息粒转化 等),在放弃等价关系的 3