J4 ›› 2013, Vol. 48 ›› Issue (10): 41-46.

• Articles • Previous Articles     Next Articles

Dependence-reduction and application of outward-recursion data

LI Yu-ying1,2, ZHANG Zhi-ling1, LIN Hong-kang1,2, RUAN Qun-sheng1, ZHANG Shi-liang1   

  1. 1. Department of Computer, Ningde Normal University, Ningde 352100, Fujian, China;
    2. School of Mathematics, Shandong University, Jinan 250100, Shandong, China
  • Received:2013-01-30 Published:2013-10-14

Abstract:

By using the structure and dynamic characteristic of outer P-set based on a class of data which has a characteristic of recurrence amplification, the concept of outward-recursion data is proposed. Also, the paper gives the structure, the generation principle and the criterion as well as the interrelated theorems of dependence and reduction for the outward recursion data. Finally, the application of the outward-recursion information is presented.

Key words: P-sets; outward-recursion information; base information; dependence; reduction

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] ZHANG Huan-li1,2, FAN Cheng-xian3, SHI Kai-quan1*. P-sets and the dominant-recessive characteristics of internal P-information [J]. J4, 2013, 48(10): 29-34.
[4] 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!