Function S-Rough sets and its applications

Based on S-rough sets（singular rough sets）, this paper presents function S-rough sets （function singular rough sets）and its mathematical structures and features. Function S-rough sets has two forms： function one direction S-rough sets （function one direction singular rough sets） and function two direction S-rough sets （function two direction singular rough sets）. This paper advances the relationship theorem of function S-rough sets and S-rough sets. Function S-rough sets is the general form of S-rough sets, and S-rough sets is the special ease of function S-rough sets. In this paper, applications of function S-rough sets in rough law mining-discovery of system are given. Function S-rough sets is a new research direction of rough sets and rough system.

Function S-rough sets and mining-discovery of rough law in systems

Function S-rough sets （function singular rough sets） is defined on a -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 a-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.

Function S-rough sets and two law forecast

Function S-rough sets has the properties of dynamics, heredity, and memory. Function S-rough sets is penetrated and crossed with the issue of economic law forecast, then a new forecast model based on function S-rough sets namely the two law forecast model is proposed, which includes upper law forecast model and lower law forecast model; and its＇ implement algorithm is given. Finally, the validity of the model is demonstrated by the forecast for region economic development of Hainan Province.

Function S-rough sets and law identification

By introducing element equivalence class that proposes dynamic characteristic into Pawlak Z rough sets theory, the first author of this paper improved Pawlak Z rough sets and put forward S-rough sets （singular rough sets）. S-rough sets are defined by element equivalence class that proposes dynamic characteristic. S-rough sets have dynamic characteristic. By introducing the function equivalence class （law equivalence class） that proposes dynamic characteristic into S-rough sets, the first author improved S-rough sets and put forward function S-rough sets （function singular rough sets）. Function S-rough sets have dynamic characteristic and law characteristic, and a function is a law. By using function S-rough sets, this paper presents law identification, law identification theorem, and law identification criterion and applications. Function S-rough sets are a new research direction of rough sets theory, and it is also a new tool to the research of system law identification.

Function S-rough sets and security-authentication of hiding law

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.

S-Rough communication and its characteristics

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.

S-rough Laws and Its Dependent Separation by F-Interference

By employing function S-rough sets,the concepts of f-interference generation and separation of law,and the F-interference generation and separation of S-rough laws were proposed. Base on the concepts above,the F-interference relation theorems,the F-interference discernibility theorem,the dependent separation theorem by interfereence,and the dependent separation principle by interference were presented; finally the application was given. By employing F-interference dependence and separation of S-rough laws,the changes of characteristic of dynamic systemic regularities could be recognized.

F-rough law and the discovery of rough law

By using function one direction S-rough sets （function one direction singular rough sets）, this article presents the concepts of F-law, F-rough law, and the relation metric of rough law; by using these concepts, this article puts forward the theorem of F-law relation metric, two orders theorem of F-rough law relation metric, the attribute theorem of F-rough law band, the extremum theorem of F-rough law relation metric, the discovery principle of F-rough law and the application of F-rough law.

F-interference law generation and its feature recognition

By using two-directional S-rough sets, the concepts of （f, f）-interference generation and （f, f）- interference law generation of knowledge, F-interference generation and F-interference law generation of two-directional S-rough sets are proposed. Based on the concepts above, the relation theoreras between F-interference loss and F-interference degree, the relation theorems between F-interference loss law and F-interference degree law, the dis- cernibility theorems between F-interference and F-interference law are presented. At last, the recognition criterion of F-interference law and its application are given.

F-Law collision and system state recognition

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.

F-generation law and recognition of system law

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.

Hiding dependence-discovery of F-hiding laws and system laws

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 hidingdependence 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.

Rough law generation and its separation-recognition

By using function S-rough sets（function singular rough sets）, this paper gives rough law generation and the theorem of rough law generation.Based on these results above, the paper proposes rough law separation, the theorem of rough law separation, the compound generation theorem of rough law bands, and the principle of rough law bands.In the end, an application of rough law separation in recognizing the risk law of profit is presented.

Rough law energy and measurement of ■-decomposition rough law

By employing function one-direction S-rough sets and rough law generation method based on function S-rough sets, ^-f-decomposition law and ^-F-decomposition rough law are proposed, and the measurement of rough law variation in the process of rough law ^-F-decomposition is researched. The concepts of law energy and attdbute ^-f-interference degree are presented, which make the variation of rough law become measurable. ^-f-decomposition law energy characteristic theorem, ^-f- decomposition law energy inequality theorem, ^-F-decomposition rough law energy characteristic theorem, and ^-f-decomposition law energy mean value theorem are presented.

■-law collision and system state recognition

Using dual function one direction S-rough sets, this article gives the f-law, the F-law, law distance and the concept of system law collided by the F-law. The characteristics presented by the system law collided by the F-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.