• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

[相位振荡器三层网络中的聚类联想记忆形成]

[Cluster associative memory formation in a three-layer network of phase oscillators].

作者信息

Simonov A Iu, Pimashkin A S, Kazantsev V B

出版信息

Biofizika. 2010 Mar-Apr;55(2):317-25.

PMID:20429288
Abstract

A three-layer network model of oscillatory associative mermory is proposed. The network is capable to store binary images that can be retrieved if an appropriate stimulus has been applied. Binary images are encoded in the form of the spatial distribution of oscillatory phase clusters in-phase (+1) and anti-phase relative to the base periodic signal. The information is loaded into the network using a set of interlayer connection weights. A condition for error-free pattern retrieval has been obtained, which imposes a certain limitation on the maximal number of patterns to be stored in the memory (storage capacity). It has been shown that the capacity can be significantly increased by the generation of optimal pattern alphabet (basic pattern set). The number of stored patterns can reach values of the network size (the number of oscillators in the layer), which is significantly higher than the capacity of traditional oscillatory memory models. The dynamical and information characteristics of the retrieval process based on the optimal alphabet including the estimations of attraction basins and the admissible input pattern discrepancy for error-free retrieval have been investigated.

摘要

提出了一种振荡联想记忆的三层网络模型。该网络能够存储二进制图像,若施加适当刺激,这些图像便可被检索出来。二进制图像以相对于基本周期信号同相(+1)和反相的振荡相位簇的空间分布形式进行编码。信息通过一组层间连接权重加载到网络中。已获得无差错模式检索的条件,这对存储在存储器中的最大模式数量(存储容量)施加了一定限制。研究表明,通过生成最优模式字母表(基本模式集),容量可显著增加。存储模式的数量可达到网络规模的值(层中振荡器的数量),这明显高于传统振荡记忆模型的容量。已研究了基于最优字母表的检索过程的动态和信息特征,包括吸引盆的估计以及无差错检索的可允许输入模式差异。

相似文献

1
[Cluster associative memory formation in a three-layer network of phase oscillators].[相位振荡器三层网络中的聚类联想记忆形成]
Biofizika. 2010 Mar-Apr;55(2):317-25.
2
Pattern retrieval in a three-layer oscillatory network with a context dependent synaptic connectivity.具有上下文相关突触连接的三层振荡网络中的模式检索。
Neural Netw. 2012 Sep;33:67-75. doi: 10.1016/j.neunet.2012.04.008. Epub 2012 Apr 21.
3
Forced phase-locked states and information retrieval in a two-layer network of oscillatory neurons with directional connectivity.具有定向连接性的振荡神经元双层网络中的强迫锁相状态与信息检索
Phys Rev E Stat Nonlin Soft Matter Phys. 2007 Sep;76(3 Pt 1):031912. doi: 10.1103/PhysRevE.76.031912. Epub 2007 Sep 12.
4
Memory capacity for sequences in a recurrent network with biological constraints.具有生物限制的循环网络中序列的记忆容量。
Neural Comput. 2006 Apr;18(4):904-41. doi: 10.1162/089976606775774714.
5
Capacity of oscillatory associative-memory networks with error-free retrieval.具有无差错检索功能的振荡联想记忆网络的容量
Phys Rev Lett. 2004 Mar 12;92(10):108101. doi: 10.1103/PhysRevLett.92.108101. Epub 2004 Mar 10.
6
Dynamics of the CA3 pyramidal neuron autoassociative memory network in the hippocampus.海马体中CA3锥体神经元自联想记忆网络的动力学
Philos Trans R Soc Lond B Biol Sci. 1994 Jan 29;343(1304):167-87. doi: 10.1098/rstb.1994.0019.
7
A neural network model of semantic memory linking feature-based object representation and words.一种将基于特征的对象表示与单词相联系的语义记忆神经网络模型。
Biosystems. 2009 Jun;96(3):195-205. doi: 10.1016/j.biosystems.2009.01.006. Epub 2009 Feb 11.
8
Inferring connectivity of interacting phase oscillators.推断相互作用的相位振荡器的连通性。
Chaos. 2008 Dec;18(4):043101. doi: 10.1063/1.2988279.
9
Network capacity analysis for latent attractor computation.用于潜在吸引子计算的网络容量分析。
Network. 2003 May;14(2):273-302.
10
Oscillatory network with self-organized dynamical connections for synchronization-based image segmentation.具有自组织动态连接的振荡网络用于基于同步的图像分割
Biosystems. 2004 Aug-Oct;76(1-3):43-53. doi: 10.1016/j.biosystems.2004.05.005.