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

P-sets and F-information camouflage-identification

作　　者：刘保仓[1] 刘若慧[2] 史开泉[1] 

机构地区：[1]黄淮学院数学科学系,河南驻马店463000 [2]黄淮学院计算机科学系,河南驻马店463000

出　　处：《计算机工程与应用》2011年第18期32-35,共4页Computer Engineering and Applications

基　　金：河南省基础与前沿技术研究重点资助项目(No.092300410146);河南省教育厅自然科学研究基金(No.2008C120002)

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

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

分 类 号：O144[理学—数学]