摘要
内P-集合是P-集合理论的部分,它是一种研究动态信息的新的数学方法。在内P-集合理论基础上,提出Fˉ-信息伪装粒度定理、n阶Fˉ-伪装信息关系定理、Fˉ-伪装信息生成定理、信息轻伪装定理、伪装信息恢复定理、内-距离定义、伪装粒度定义等基本概念,在此数学理论基础上构建的新的伪装算法,相比同类算法在时效和空间方面更显优势。通过简单的应用实例,进一步直观地诠释提出理论的应用方法。
Internal P-set, a new mathematic method of studying dynamic information, is a part of P-set theory. Based on the internal P-set theory, such conceptions have been put forward as principles of Fˉ-information camouflage granulation degree, Fˉ-information camouflage relationship, Fˉ-information camouflage generation, light camouflage and camouflaged information recovery and definitions of internal-distance definition and camouflage granulation degree. On the base of mathematic theory, a new camouflage algorithm is given in the paper, which is better than the same kind of algorithm. Their applications have been illustrated through the simple examples in application.
出处
《计算机工程与应用》
CSCD
北大核心
2016年第9期28-32,共5页
Computer Engineering and Applications
基金
2014年度广西高校科学研究项目(No.ZD2014129)
关键词
内P-集合
Fˉ-信息伪装
内-距离
信息恢复
internal P-set
Fˉ-information camouflage
internal-distance
information recovery
