摘要
P-集合(packet sets)是由内P-集合(internal packet sets)与外P-集合(outer packet sets)构成的集合对,或者(X-F,XF)是P-集合。P-集合具有动态特性。P-集合的动态特性来自对集合X的属性集合α给予属性补充与给予属性删除。利用P-集合的结构与动态特性-、F-记忆信息生成概念,给出了-F-记忆信息的度量与-F-记忆信息的-F-记忆圆概念,提出了-F-记忆信息存在性定理-、F-记忆信息恢复定理与-F-记忆信息特性定理。利用这些结果,给出了-F-记忆信息的应用。P-集合是研究动态信息系统的一个新的数学模型与数学方法。
Packet sets are set pair combined with internal packet sets and outer packet sets or（X^F,X^F）,which possess dynamic characteristic because of attributive deleting and adding of the attributes set α of cantor set X.By using the structure and dynamic characteristic of packet sets,the concept of-memory information genaration,-memory information measurement and-memory circle were given,the-memory information existing theorem,the-memory information recovery theorem and the-memory information characteristic theorem were proposed.By using the results,the application of-memory information was given.Packet sets is a new mathematical model and mathematical method.
出处
《计算机科学》
CSCD
北大核心
2011年第2期246-249,266,共5页
Computer Science
基金
山东省自然科学基金项目(Y2007H02)
河南省科技发展计划资助项目(102102210425)
河南省自然科学基金项目(092300410217)资助
关键词
P-集合
-F-记忆信息
记忆度量
记忆特征性定理
辨识准则
应用
Packet sets
-memory information
Memory measurement
Memory characteristic theorem
Identification criterion
Application
