Function S-rbugh sets are defined by R-function equivalence class,which have dynamic characteristic.Function S-rough sets have dynamic characteristic,law characteristic and law-hiding characteristic.Function S-rough s...Function S-rbugh sets are defined by R-function equivalence class,which have dynamic characteristic.Function S-rough sets have dynamic characteristic,law characteristic and law-hiding characteristic.Function S-rough sets can generate f-hiding law and f-hiding law.By engrafting,crossing,and penetrating between the information security theory and function S-rough sets,the security hiding and the authentication of f-hiding law and f-hiding law are given respectively in this paper.The fusion and share between function S-rough sets and information security theory is a new research direction of the application of information law in information system.展开更多
基金the National Natural Science Foundation of China(Grant No.10771073)the Natural Science Foundation of Shandong Province(Grant No.Y2004A04)
文摘Function S-rbugh sets are defined by R-function equivalence class,which have dynamic characteristic.Function S-rough sets have dynamic characteristic,law characteristic and law-hiding characteristic.Function S-rough sets can generate f-hiding law and f-hiding law.By engrafting,crossing,and penetrating between the information security theory and function S-rough sets,the security hiding and the authentication of f-hiding law and f-hiding law are given respectively in this paper.The fusion and share between function S-rough sets and information security theory is a new research direction of the application of information law in information system.