摘要
逆P-集合(inverse packet sets)是由内逆P-集合X珡F(internal inverse packet setX珡F)与外逆P-集合X珡F珚(oute rinverse packet setX珡F珚)构成的集合对;或者(X珡F,X珡F珚)是逆P-集合。逆P-集合是把动态特性引入到有限普通集合X内(Cantor set X),改进有限普通集合X得到的。逆P-集合具有与P-集合相反的动态特性。利用逆P-集合给出逆P-信息的概念、逆P-信息嵌入隐藏与嵌入-隐藏定理、逆P-信息的隐藏还原属性特征、逆P-信息嵌入隐藏的逆P-推理分离-发现。利用这些结果,给出逆P-信息嵌入隐藏的逆P-推理分离-发现的应用。
Inverse P-sets is a set pair which is composed of internal inverse P-set XF (internal inverse packet set XF) and outer inverse P-set XF (outer inverse packet set XF ), denoted by (XF, XF ). It is gotten by introducing dynamic characteristics into finite general set X, which has the opposite characteristic to P-sets(packet sets). Based on inverse P- sets, the paper presented the concepts of inverse P-information and its embedding-camouflage, discussed camouflage-re- storing attribute characteristic about inverse P-information, obtained the embedding-camouflage theorems. And the theo- retical results were applied to separate and discover embedded and camouflaged inverse P-information by using inverse P-reasoning.
出处
《计算机科学》
CSCD
北大核心
2013年第8期200-203,232,共5页
Computer Science
基金
山东省自然科学基金(ZR2010AL019)
山东省高校科技计划(J12LN92)
山东省科技发展计划(2011GGA14074)资助
关键词
逆P-集合
逆P-信息
逆P-推理
推理分离-发现
应用
Inverse P-sets, Inverse P-information, Inverse P-reasoning, Separation-discovery, Applications