In order to avoid the discretization in the classical rough set theory, a generlization rough set theory is proposed. At first, the degree of general importance of an attribute and attribute subsets are presented. The...In order to avoid the discretization in the classical rough set theory, a generlization rough set theory is proposed. At first, the degree of general importance of an attribute and attribute subsets are presented. Then, depending on the degree of general importance of attribute, the space distance can be measured with weighted method. At last, a generalization rough set theory based on the general near neighborhood relation is proposed. The proposed theory partitions the universe into the tolerant modules, and forms lower approximation and upper approximation of the set under general near neighborhood relationship, which avoids the discretization in Pawlak's rough set theory.展开更多
The bounds of the general M and J sets were analytically offered. Some of, the bounds were optimal in certain meaning. It not only solved the primary problem of the construction of fractal sets by escape time algorith...The bounds of the general M and J sets were analytically offered. Some of, the bounds were optimal in certain meaning. It not only solved the primary problem of the construction of fractal sets by escape time algorithm, and followed from the conclusion, but also offered two estimations of some special Julia set's Hausdorff's dimension by approximate linearization method.展开更多
The paper generalizes the classical Caristi＇s fixed point theorem. As an application. the classical Ekeland variational principle is generalized. In addition, it is proved that the generalized Caristi＇s fixed point ...The paper generalizes the classical Caristi＇s fixed point theorem. As an application. the classical Ekeland variational principle is generalized. In addition, it is proved that the generalized Caristi＇s fixed point theorem is equivalent to the generalized Ekeland variational principle.展开更多
基金Natural Science Foundation of Jiangsu Province of China ( No.BK2006176)High-Tech Key Laboratory of Jiangsu,China (No.BM2007201)
文摘In order to avoid the discretization in the classical rough set theory, a generlization rough set theory is proposed. At first, the degree of general importance of an attribute and attribute subsets are presented. Then, depending on the degree of general importance of attribute, the space distance can be measured with weighted method. At last, a generalization rough set theory based on the general near neighborhood relation is proposed. The proposed theory partitions the universe into the tolerant modules, and forms lower approximation and upper approximation of the set under general near neighborhood relationship, which avoids the discretization in Pawlak's rough set theory.
文摘The bounds of the general M and J sets were analytically offered. Some of, the bounds were optimal in certain meaning. It not only solved the primary problem of the construction of fractal sets by escape time algorithm, and followed from the conclusion, but also offered two estimations of some special Julia set's Hausdorff's dimension by approximate linearization method.
基金Tianyuan Young Mathematics of China under Grant (10526025)Science Foundation of Nanjing Normal University under Grant(2002SXXXGQ2B20)
文摘The paper generalizes the classical Caristi＇s fixed point theorem. As an application. the classical Ekeland variational principle is generalized. In addition, it is proved that the generalized Caristi＇s fixed point theorem is equivalent to the generalized Ekeland variational principle.
