检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]德州学院数学系,德州253023 [2]山东大学数学与系统科学学院,济南250100
出 处:《计算机科学》2013年第8期200-203,232,共5页Computer Science
基 金:山东省自然科学基金(ZR2010AL019);山东省高校科技计划(J12LN92);山东省科技发展计划(2011GGA14074)资助
摘 要:逆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.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.27