计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (18): 32-35.

• 研究、探讨 • 上一篇    下一篇

P-集合与信息F-伪装-辩识

刘保仓1,刘若慧2,史开泉1   

  1. 1.黄淮学院 数学科学系,河南 驻马店 463000
    2.黄淮学院 计算机科学系,河南 驻马店 463000
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-06-21 发布日期:2011-06-21

P-sets and F-information camouflage-identification

LIU Baocang1,LIU Ruohui2,SHI Kaiquan1   

  1. 1.Department of Mathematics Science,Huanghuai University,Zhumadian,Henan 463000,China
    2.Department of Computer Science,Huanghuai University,Zhumadian,Henan 463000,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-06-21 Published:2011-06-21

摘要: P-集合(packet sets)是一个集合对,它由内P-集合(internal packet sets)与外P-集合(outer packet sets)共同构成。P-集合具有动态性,利用内P-集合,给出F-信息伪装与F-信息伪装生成概念;提出F-信息伪装度量定理与信息伪装被恢复-还原定理;给出辨识准则与方法。利用这些结果,给出F-信息伪装被恢复-还原的应用。P-集合是研究动态信息系统的一个新理论和新方法。

关键词: P-集合, F-信息伪装, F-信息伪装度量, F-恢复-还原定理, 辨识准则

Abstract: P-sets which is composed of internal P-sets and outer P-sets,is a set pair and has dynamic characteristic.Based on internal P-sets,this paper gives the concept such as F-information camouflage,F-information camouflage generation,and then F-information camouflage metric theorem,F-information camouflage recovery-restore theorem are proposed.The identification criterion and method are given.By those results,the application of F-information camouflage and F-recovery-restore theorem are presented.P-sets is a new theory and method in research of dynamic information systems.

Key words: P-sets, F-information camouflage, F-information camouflage metric, F-recovery-restore theorem, identification criterion