您的位置: 专家智库 > >

国家自然科学基金(Y2004A04)

作品数:8 被引量:102H指数:4
发文基金:国家自然科学基金福建省自然科学基金更多>>
相关领域:自动化与计算机技术电子电信自然科学总论政治法律更多>>

文献类型

  • 8篇中文期刊文章

领域

  • 5篇自动化与计算...
  • 2篇电子电信
  • 2篇自然科学总论
  • 1篇政治法律

主题

  • 5篇LAW
  • 3篇RECOGN...
  • 3篇F
  • 2篇THEORE...
  • 2篇APPLIC...
  • 2篇APPLIC...
  • 2篇CHARAC...
  • 2篇DISCOV...
  • 2篇COLLIS...
  • 1篇ONE
  • 1篇RELATI...
  • 1篇ROUGH_...
  • 1篇SECURI...
  • 1篇STRUCT...
  • 1篇SYSTEM
  • 1篇CHARAC...
  • 1篇CLASS
  • 1篇DEPEND...
  • 1篇GENERA...
  • 1篇ITS

传媒

  • 7篇Journa...
  • 1篇Scienc...

年份

  • 1篇2009
  • 2篇2008
  • 4篇2007
  • 1篇2006
8 条 记 录,以下是 1-8
排序方式:
■-law collision and system state recognition被引量:1
2007年
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.
Shi KaiquanChen Hui
关键词:COLLISION
F-Law collision and system state recognition被引量:4
2007年
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.
Shi KaiquanXu Xiaojing
关键词:COLLISION
Application of rough graph in relationship mining被引量:2
2008年
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.
He Tong Xue Peijun Shi Kaiquan
S-Rough communication and its characteristics被引量:3
2007年
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.
Hu HaiqingWang YanShi Kaiquan
Hiding dependence-discovery of F-hiding laws and system laws被引量:2
2009年
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.
Zhou HouyongHuang ShunliangShi Kaiquan
Function S-rough sets and security-authentication of hiding law被引量:72
2008年
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.
SHI KaiQuan1,2 & ZHAO JianLi3 1 School of Mathematics and Computer Sciences, Longyan University, Longyan 364000, China
F-generation law and recognition of system law被引量:4
2007年
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.
Shi KaiquanYao Bingxue
关键词:APPLICATION
Function S-rough sets and mining-discovery of rough law in systems被引量:27
2006年
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.
Shi KaiquanXia Jiarong
共1页<1>
聚类工具0