A Superstring Galaxy Associative Memory Model with Expecting Fault-Tolerant Fields

Author

Yu, Xiao ; Yang, Guowei ; Liu, Derong

Author_Institution

Coll. of Autom. Eng., Qingdao Univ., Qingdao, China

Volume

2

fYear

2009

fDate

Nov. 30 2009-Dec. 1 2009

Firstpage

13

Lastpage

16

Abstract

The synthesis problems of associative memory models are not better solved until now. Learning from the idea of superstring theory, a design method of superstring galaxy associative memory model with expecting fault-tolerant field is proposed by making the sphere mapping and giving the algorithm of galaxy covering. The method better solves a difficult synthesis problem of associative memory models. The superstring galaxy associative memory model designed by the method can have expecting fault-tolerant fields of the samples.

Keywords

content-addressable storage; fault tolerance; expecting fault-tolerant fields; galaxy covering; sphere mapping; superstring galaxy associative memory model; Associative memory; Automation; Design methodology; Educational institutions; Electronic mail; Fault tolerance; History; Knowledge acquisition; Knowledge engineering; Network synthesis; associative memory; fault-tolerant field; galaxy covering; neural network; superstring theory;

fLanguage

English

Publisher

ieee

Conference_Titel

Knowledge Acquisition and Modeling, 2009. KAM '09. Second International Symposium on

Conference_Location

Wuhan

Print_ISBN

978-0-7695-3888-4

Type

conf

DOI

10.1109/KAM.2009.48

Filename

5362338