J4 ›› 2013, Vol. 48 ›› Issue (10): 29-34.

• Articles • Previous Articles     Next Articles

P-sets and the dominant-recessive characteristics of internal P-information

ZHANG Huan-li1,2, FAN Cheng-xian3, SHI Kai-quan1*   

  1. 1. School of Mathematics, Shandong University, Jinan 250100, Shandong, China;
    2. Department of Information Engineering, Zhumadian Vocational Technology College 463000, Zhumadian Henan, China;
    3. The School of Electrical Engineering of Shandong University, Jinan 250061,Shandong, China
  • Received:2012-12-24 Published:2013-10-14

Abstract:

P-sets(packet sets) is proposed by embedding the dynamic characteristic into the finite cantor set X and improving it. P-sets is a set-pair composed of internal P-set X(internal packet set X) and outer P-set XF(outer packet set XF), or (X, XF) is P-sets. Using the structure of P-sets and the concept intersection of dominant gene and recessive gene, the dominant and recessive concepts, the dominant and recessive characteristics and measurement, the dominant and recessive theorems, the attribute characteristic generated by the dominant and recessive of internal P-information are given. The dominant and recessive is one of the important characteristics of P-sets.

Key words: P-sets; internal P-information; dominant and recessive characteristics; dominant and recessive theorems; attribute relation

CLC Number: 

  • O144
[1] XU Feng-sheng, YU Xiu-qing. Discovery and application of function P-reasoning
under the information law state
[J]. J4, 2013, 48(12): 100-103.
[2] ZHANG Huan-li1,2, LI Yu-ying3*, SHI Kai-quan1. Internal P(ρ,σ)-set′s random characteristic-application [J]. J4, 2013, 48(10): 23-28.
[3] WU Song-li1,2, FAN Cheng-xian3. Outer P-reasoning information recovery and its attribute hiding characteristic [J]. J4, 2013, 48(10): 35-40.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!