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.

f-heredity knowledge and f-heredity mining

Using S-rough sets, this paper gives the concepts off-heredity knowledge and its heredity coefficient, and f-variation coefficient of knowledge; presents the theorem of f-attribute dependence of variation coefficient and the relation theorem of heredity-variation. The attribute dependence of f-variation coefficient and the relation of heredity-variation are important characteristics of S-rough sets. From such discussion, this paper puts forward the heredity mining off-knowledge and the algorithm of heredity mining, also gives its relative application.

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.

Security transmission and recognition of F-knowledge

The concept of F-knowledge is presented by employing S-rough sets. By engrafting and penetrating between the F-knowledge generated by S-rough sets and the RSA algorithm, the security transmission and recognition of multi-agent F-knowledge are proposed, which includes the security transmission of multi-agent F-knowledge with positive direction secret key and the security transmission of multi-agent F-knowledge with reverse direction secret key. Finally, the recognition criterion and the applications of F-knowledge are presented. The security of F-knowledge is a new application research direction of S-rough sets in information systems.

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.

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.

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.

S-rough sets and the discovery of F-hiding knowledge

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.

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.

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

基于载波技术的直流系统母联开关自检方法

当双电源直流系统在两个电源电压接近且负荷均分时,通过电压、电流参数无法判断系统是否并联。传统检测方法是小幅提高一个电源电压,通过检测另一电源电压是否跟随升高来判断,但操作步骤相对繁琐。为此,在研究直流系统基础上引入载波通信机制,在母联开关内两侧静触头上分别安装高频信号发生和高频信号接收装置。在开关导通情况下,信号会从开关一侧传输到另一侧;在开关未导通情况下,信号传输不到对侧。通过MATLAB建模仿真,验证了该检测方法和检测装置的逻辑性和可行性。

Rough similarity degree and rough close degree in rough fuzzy sets and the applications

Based on rough similarity degree of rough sets and close degree of fuzzy sets, the definitions of rough similarity degree and rough close degree of rough fuzzy sets are given, which can be used to measure the similar degree between two rough fuzzy sets. The properties and theorems are listed. Using the two new measures, the method of clustering in the rough fuzzy system can be obtained. After clustering, the new fuzzy sample can be recognized by the principle of maximal similarity degree.

New judging model of fuzzy cluster optimal dividing based on rough sets theory

To investigate the judging problem of optimal dividing matrix among several fuzzy dividing matrices in fuzzy dividing space, correspondingly, which is determined by the various choices of cluster samples in the totality sample space, two algorithms are proposed on the basis of the data analysis method in rough sets theory： information system discrete algorithm （algorithm 1） and samples representatives judging algorithm （algorithm 2）. On the principle of the farthest distance, algorithm 1 transforms continuous data into discrete form which could be transacted by rough sets theory. Taking the approximate precision as a criterion, algorithm 2 chooses the sample space with a good representative. Hence, the clustering sample set in inducing and computing optimal dividing matrix can be achieved. Several theorems are proposed to provide strict theoretic foundations for the execution of the algorithm model. An applied example based on the new algorithm model is given, whose result verifies the feasibility of this new algorithm model.

Static rough similarity degree and its applications

The definition of rough similarity degree is given based on the axiomatic similarity degree, and the properties of rough similarity degree are listed. Using the properties of rough similarity degree, the method of clustering in rough systems can be obtained. After clustering, a new sample can be recognized by the principle of maximal rough similarity degree.

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.