DocumentCode
536208
Title
Decomposition and reduction of packet set
Author
Zhang, Ling ; Chen, Baohui
Author_Institution
Sch. of Math. & Comput. Sci., Longyan Univ., Longyan, China
Volume
2
fYear
2010
fDate
29-31 Oct. 2010
Firstpage
303
Lastpage
306
Abstract
Packet set is a set pair which is composed of the internal and outer packet set together. In this paper using the concepts and structures of packet set, we give several new concepts, such as decomposition class, reduction class, decomposition base, reduction base and so on. We further put forward decomposition and reduction theorem, the maximal and minimal attribute set principles. Decomposition and reduction of packet set are the theoretical base in the research of reasoning in dynamic system.
Keywords
set theory; decomposition base; decomposition class; decomposition theorem; maximal attribute set principle; minimal attribute set principle; packet set decomposition; packet set reduction; reduction base; reduction class; reduction theorem; Copper; Iron; decomposition class; decomposition theorem; packet set; reduction class; reduction theorem;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Computing and Intelligent Systems (ICIS), 2010 IEEE International Conference on
Conference_Location
Xiamen
Print_ISBN
978-1-4244-6582-8
Type
conf
DOI
10.1109/ICICISYS.2010.5658371
Filename
5658371
Link To Document