J4 ›› 2012, Vol. 47 ›› Issue (8): 92-97.

• Articles • Previous Articles     Next Articles

Dynamic data distance and geometric identification-recovery

LIN Hong-kang1,2, LI Yu-ying1,2, XIONG Guo-min3   

  1. 1. Department of Computer and Information Engineering, Ningde Normal University, Ningde 352100, Fujian, China;
    2. School of Mathematics, Shandong University, Jinan 250100, Shandong, China;
    3. Department of Mathematics and Computer Science, Anshun University, Anshun 561000, Guizhou, China
  • Received:2011-09-16 Online:2012-08-20 Published:2012-12-24

Abstract:

The concepts of deviation degree for dynamic data and dynamic data distance are proposed by using P-sets. The deviation degree of dynamic data includes internaldeviation degree of dynamic data and outer-deviation of degree dynamic data. The dynamic data distance includes internal-dynamic data distance and outer-dynamic data distance. Using the deviation degree of dynamic data and the dynamic data distance, the theorems of identification and recovery for dynamic data are got. Also, the geometric identification criterion and the application for the identification and recovery of identification and recovery are presented. Because of the dynamic data distance, the identification and recovery for dynamic data in information system can be visualized. The dynamic data distance is a geometric tool to research data change for information system.

Key words: P-sets; deviation degree; dynamic data distance; identification-recovery

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!