DocumentCode
2910818
Title
On grey-degree of bounded grey number
Author
Han, Jin-fang ; An, Cun-ran
fYear
2007
fDate
18-20 Nov. 2007
Firstpage
32
Lastpage
35
Abstract
In this paper, the problem of grey-degree for discrete and continuous bounded grey numbers and grey matrix is discussed in terms of the potency theory. Firstly, the idea of even and uneven discrete grey number are presented, then, applying the pre-treatment method of translation compression, that the uniform form of grey-degree for two class of grey numbers and grey matrix is given according to the size of whitened value´s value field, and the reasonableness is expounded by propose two theories. This form can reflects completely and objectively the grey degree of bounded grey number. Besides, the meaning of central whitened matrix is illustrated with a concrete example.
Keywords
grey systems; matrix algebra; number theory; central whitened matrix; continuous bounded grey number; discrete bounded grey number; grey degree; grey matrix; potency theory; translation compression; Concrete; Helium; Intelligent systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Grey Systems and Intelligent Services, 2007. GSIS 2007. IEEE International Conference on
Conference_Location
Nanjing
Print_ISBN
978-1-4244-1294-5
Electronic_ISBN
978-1-4244-1294-5
Type
conf
DOI
10.1109/GSIS.2007.4443232
Filename
4443232
Link To Document