期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
S-rough sets and the discovery of F-hiding knowledge 被引量:2
1
作者 Hao Xiumei Fu Haiyan Shi Kaiquan 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2008年第6期1171-1177,共7页
Singular rough sets (S-rough sets) have three classes of forms: one-directional S-rough sets, dual of onedirectional S-rough sets, and two-directional S-rough sets. Dynamic, hereditary, mnemonic, and hiding propert... Singular rough sets (S-rough sets) have three classes of forms: one-directional S-rough sets, dual of onedirectional S-rough sets, and two-directional S-rough sets. Dynamic, hereditary, mnemonic, and hiding properties are the basic characteristics of S-rough sets. By using the S-rough sets, the concepts of f-hiding knowledge, F-hiding knowledge, hiding degree, and hiding dependence degree are given. Then, both the hiding theorem and the hiding dependence theorem of hiding knowledge are proposed. Finally, an application of hiding knowledge is discussed. 展开更多
关键词 one-direction S-rough sets f-hiding knowledge hiding degree hiding dependence degree hiding theorem hiding dependence theorem application
下载PDF
Degree dependence entropy descriptor for complex networks
2
作者 Xiang-Li Xu Xiao-Feng Hu Xiao-Yuan He 《Advances in Manufacturing》 SCIE CAS 2013年第3期284-287,共4页
In order to supply better accordance for mod eling and simulation of complex networks, a new degree dependence entropy (DDE) descriptor is proposed to describe the degree dependence relationship and corre sponding c... In order to supply better accordance for mod eling and simulation of complex networks, a new degree dependence entropy (DDE) descriptor is proposed to describe the degree dependence relationship and corre sponding characteristic in this paper. First of all, degrees of vertices and the shortest path lengths between all pairs of ,ertices are computed. Then the degree dependence matrices under different shortest path lengths are con structed. At last the DDEs are extracted from the degree dependence matrices. Simulation results show that the DDE descriptor can reflect the complexity of degree dependence relationship in complex networks; high DDE indicates complex degree dependence relationship; low DDE indicates the opposite one. The DDE can be seen as a quantitative statistical characteristic, which is meaningful for networked modeling and simulation. 展开更多
关键词 degree dependence matrix degreedependence entropy (DDE) - Entropy Complex networks
原文传递
Linear dependence of the degree of aggregation on the solvent aggregating power (SAgP)
3
作者 JIANG Xi-Kui JI Guo-Zhen LUO Guang-Lin 《Chinese Journal of Chemistry》 SCIE CAS CSCD 1991年第5期453-457,共0页
With k_8/k_(16), the ratio of the hydrolytic rate-constants of p-nitrophenyl octanoate (C8) to hexadecanoate (C16), as the indicator of the degree of aggregation, the linear dependence of the deg- ree of aggregation o... With k_8/k_(16), the ratio of the hydrolytic rate-constants of p-nitrophenyl octanoate (C8) to hexadecanoate (C16), as the indicator of the degree of aggregation, the linear dependence of the deg- ree of aggregation on solvent aggregating power (SAgP) has been established in five aquiorgano sol- vents, each within a certain range of volume fraction ( values) of the organic cosolvent. The mea- ning of this linearity has been discussed. 展开更多
关键词 SAgP Linear dependence of the degree of aggregation on the solvent aggregating power
全文增补中
上一页 1 下一页 到第
使用帮助 返回顶部