๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An application of covering approximation spaces on network security

โœ Scribed by Xun Ge

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
335 KB
Volume
60
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis

Based on the Pawlak rough set theory, this paper investigates separations in covering approximation spaces, give some characterizations of these separations and some relations among these separations. As an application of these results, investigations on network security are converted into investigations on separations in covering approximation spaces by taking covering approximation spaces as mathematical models of networks. Results of this paper give further applications of the Pawlak rough set theory in pattern recognition and artificial intelligence, which makes it possible to research network security by logical methods and mathematical methods in computer science. This contributes to giving risk assessments of securities and to raise grades of securities for networks.

๐Ÿ“œ SIMILAR VOLUMES

An application of neural networks on cha
An application of neural networks on channel routing problem
โœ Pao-Hsu Shih; Wu-Shung Feng ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 572 KB

Shih, P.-H. and W.-S. Feng, An application of neural networks on channel routing problem, Parallel Computing 17 (1991) 229-240 The channel routing problem is to make interconnections among terminals located on opposite sides of a rectangular channel. This problem has been proven to be NP-complete.