The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Kami mencadangkan memori bersekutu baharu yang dinamakan Memori Bersekutu Berbilang Pemenang (MWAM) dan mengkaji sifat perkaitan dwiarahnya dalam kertas kerja ini. MWAM yang dicadangkan mempunyai dua proses untuk penyimpanan pasangan corak: proses penyimpanan dan proses ingat semula. Untuk proses penyimpanan, MWAM yang dicadangkan boleh mewakili separuh daripada pasangan corak dalam lapisan perwakilan teragih dan boleh menyimpan surat-menyurat corak dan perwakilannya menggunakan pemberat ke atas. Di samping itu, MWAM boleh menyimpan surat-menyurat perwakilan yang diedarkan dan separuh lagi pasangan corak dalam pemberat menurun. Untuk proses penarikan balik, MWAM boleh memanggil semula maklumat secara dua arah: separuh daripada pasangan corak yang disimpan boleh dipanggil semula dengan menerima separuh lagi dalam lapisan input-output untuk sebarang pasangan corak yang disimpan.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Jiongtao HUANG, Masafumi HAGIWARA, "A Multi-Winner Associative Memory" in IEICE TRANSACTIONS on Information,
vol. E82-D, no. 7, pp. 1117-1125, July 1999, doi: .
Abstract: We propose a new associative memory named Multi-Winner Associative Memory (MWAM) and study its bidirectional association properties in this paper. The proposed MWAM has two processes for pattern pairs storage: storage process and recall process. For the storage process, the proposed MWAM can represent a half of pattern pair in the distributed representation layer and can store the correspondence of pattern and its representation using the upward weights. In addition, the MWAM can store the correspondence of the distributed representation and the other half of pattern pair in the downward weights. For the recall process, the MWAM can recall information bidirectionally: a half of the stored pattern pair can be recalled by receiving the other half in the input-output layer for any stored pattern pairs.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_7_1117/_p
Salinan
@ARTICLE{e82-d_7_1117,
author={Jiongtao HUANG, Masafumi HAGIWARA, },
journal={IEICE TRANSACTIONS on Information},
title={A Multi-Winner Associative Memory},
year={1999},
volume={E82-D},
number={7},
pages={1117-1125},
abstract={We propose a new associative memory named Multi-Winner Associative Memory (MWAM) and study its bidirectional association properties in this paper. The proposed MWAM has two processes for pattern pairs storage: storage process and recall process. For the storage process, the proposed MWAM can represent a half of pattern pair in the distributed representation layer and can store the correspondence of pattern and its representation using the upward weights. In addition, the MWAM can store the correspondence of the distributed representation and the other half of pattern pair in the downward weights. For the recall process, the MWAM can recall information bidirectionally: a half of the stored pattern pair can be recalled by receiving the other half in the input-output layer for any stored pattern pairs.},
keywords={},
doi={},
ISSN={},
month={July},}
Salinan
TY - JOUR
TI - A Multi-Winner Associative Memory
T2 - IEICE TRANSACTIONS on Information
SP - 1117
EP - 1125
AU - Jiongtao HUANG
AU - Masafumi HAGIWARA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 1999
AB - We propose a new associative memory named Multi-Winner Associative Memory (MWAM) and study its bidirectional association properties in this paper. The proposed MWAM has two processes for pattern pairs storage: storage process and recall process. For the storage process, the proposed MWAM can represent a half of pattern pair in the distributed representation layer and can store the correspondence of pattern and its representation using the upward weights. In addition, the MWAM can store the correspondence of the distributed representation and the other half of pattern pair in the downward weights. For the recall process, the MWAM can recall information bidirectionally: a half of the stored pattern pair can be recalled by receiving the other half in the input-output layer for any stored pattern pairs.
ER -