联想存储器中的应用.PDFVIP

1995年7月 重庆大学学报 (自然科学版) Vo1．18．N 4 第l8卷第4期 Journal of Chong qjng unjvergr【y(Natural Sciencg Editmn) Ju1．1995 弓一 超立方体的3一独立集及其在神经 联想存储器中的应用 丁p；33 3-Independent Sets of Hypercubes and Appu cations in Neural Associative Memories …岬 ppu 堑堕坚 —衄 垃 Yang Xiaofan He Zhongshi (重庆大学计算机研究所，重庆大学系统工程及应用数学系，重庆，630044) 陈 廷槐 Chen Tinghuai (重庆大学计算机研究所，重庆，630044) 摘 要 用， ( )表示 一立方体口-的3一独立数。提出了构造 。．的3_独立集的一个算 法，证明了2-C~．3 ≤，3(霄)≤[2．／(霄+1)]．这些结果被应用于神经联想存储器曲设计． 关键词 里笙苎鲎-连丝堕堑；壁望壹熊墨，塑皇查签；。-—ii~—llt 3_ 中国图书资料分类法分类号 0157．51 TP333 ABSTRACT Let I3(霄)denote the 3-independence number of~-olbe。．．An algorithm is presented for finding a 3-independent set of。-，and 2．一【 。卜 ≤，a(4)≤[2．／(翻+1)]is shown． 171ese re~ul= 时e applied to the desiBn of neural assoc~tive memories． KEYWORDS gra 一廿le0船廿cal algorithmI l ur|J networkI associa~ve memory ／ hypercub~l 3-independent setl 3-independence number 0 引 言 A 3-independent set of a aph is a set of vertices such r．hat the length of a shortest pa血 between any two of them is戤 least 3．A maximum 3-independent set of a graph 远 a 3一 independent set such r．hat every 3-independent set of the graph has at most l l re．ices．凡(口) de,notes the cardinalicy of a max~um 3-independent set of a graph口·called the 3-independence number of ． n-cube，口．，is a graph whose vertices call be labeled with all 0-1 sequences of length n so r．hat two vertices are adjaceat iff their labels have a Hamming distance l(the Hamming distance between +收文日期 1994—94-23 This work wD@supported by thc Doctor—Station Foundation of Chine~ National Educational C