Using dual function one direction S-rough sets,this article gives the i-law,the F-law,law distance and the concept of system law collided by the (?)-law.The characteristics presented by the system law collided by the (?)-law,the recognition of these characteristics and recognition criterion are also proposed.The dual function one direction S-rough sets is one of the basic forms of function S-rough sets.Its basic theory and application in the study of system law collision are reviewed.
Using function one direction S-rough sets (function one direction singular rough sets), f-law and F-law and the concept of law distance and the concept of system law collided by F-law are given. Using these concepts, state characteristic presented by system law collided by F-law and recognition of these states characteristic and recognition criterion and applications are given. Function one direction S-rough sets is one of basic forms of function S-rough sets (function singular rough sets). Function one direction S-rough sets is importance theory and is a method in studying system law collision.
Based on the definition of class shortest path in weighted rough graph,class shortest path algorithm in weighted rough graph is presented,which extends classical shortest path algorithm.The application in relationship mining shows effectiveness of it.
In view of certain defects of common rough communication, using the S-rough sets, this article presents a S-rough communication model. The S-rough communication model is the extension of the common rough communication model. S-rough communication has two kinds of forms: one-direction S-rough communication and two-direction S-rough communication. The mathematical structure and characteristics of the one-direction S-rough communication and the two-direction S-rough communication, the relationship theorem between the one-direction S-rough communication and the two-direction S-rough communication are also presented. The S-rough communication is a dynamic communication method, and it is a novel research direction in rough sets field.
Function one direction S-rough sets have dynamic characteristics and law characteristics.By using the function one direction S-rough sets,this article presents the concepts of the f-hiding law,F-hiding law,f-hiding law dependence and F-hiding law dependence.Based on the concepts above,this article proposes the hiding-dependence theorem of f-hiding laws,the hiding-dependence theorem of F-hiding laws,the hiding-dependence separation theorem,the hiding dependence-discovery principle of unknown laws.Finally,the application of the hiding dependence of hiding laws in the discovery of system laws is given.
Function S-rough 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 - 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 - 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.
SHI KaiQuan1,2 & ZHAO JianLi3 1 School of Mathematics and Computer Sciences, Longyan University, Longyan 364000, China
If a system is not disturbed (or invaded) by some law, there is no doubt that each system will move according to the expected law and keep stable. Although such a fact often appears, some unknown law breaks into the system and leads it into turbulence. Using function one direction S-rough sets, this article gives the concept of the F-generation law in the system, the generation model of the F-generation law and the recognition method of the system law. Function one direction singular rough sets is a new theory and method in recognizing the disturbance law existing in the system and recognizing the system law.
Function S-rough sets (function singular rough sets) is defined on α -function equivalence class [u]. Function S-rough sets is the extension form of S-rough sets. By using the function S-rough sets, this paper gives rough law generation model of α -function equivalence class, discussion on law mining and law discovery in systems, and application of law mining and law discovery in communication system. Function S-rough sets is a new theory and method in law mining research.
