P-集合与(F)-记忆信息特性-应用

摘要

Packet sets are set pair combined with internal packet sets and outer packet sets or (XF , XF) , which possess dynamic characteristic because of attributive deleting and adding of the attributes set a of cantor set X. By using the structure and dynamic characteristic of packet sets, the concept of (F)-memory information genaration, (F)-memory information measurement and F-memory circle were given, the (F)-memory information existing theorem, the (F)-memory information recovery theorem and the (F)-memory information characteristic theorem were proposed. By using the results, the application of F-memory information was given. Packet sets is a new mathematical model and mathematical method.%P-集合(packet sets)是由内P-集合(internal packet sets)与外P-集合(outer packet sets)构成的集合对,或者(X(F),X(F))是P-集合.P-集合具有动态特性.P-集合的动态特性来自对集合X的属性集合α给予属性补充与给予属性删除.利用P-集合的结构与动态特性、(F)-记忆信息生成概念,给出了(F)-记忆信息的度量与-记忆信息的(F)-记忆圆概念,提出了(F)-记忆信息存在性定理、(F)-记忆信息恢复定理与(F)-记忆信息特性定理.利用这些结果,给出了(F)-记忆信息的应用.P-集合是研究动态信息系统的一个新的数学模型与数学方法.