989 resultados para Associative Memory
Resumo:
Traditional approaches to joint control required accurate modelling of the system dynamic of the plant in question. Fuzzy Associative Memory (FAM) control schemes allow adequate control without a model of the system to be controlled. This paper presents a FAM based joint controller implemented on a humanoid robot. An empirically tuned PI velocity control loop is augmented with this feed forward FAM, with considerable reduction in joint position error achieved online and with minimal additional computational overhead.
Resumo:
A number of neural network models, in which fixed-point and limit-cycle attractors of the underlying dynamics are used to store and associatively recall information, are described. In the first class of models, a hierarchical structure is used to store an exponentially large number of strongly correlated memories. The second class of models uses limit cycles to store and retrieve individual memories. A neurobiologically plausible network that generates low-amplitude periodic variations of activity, similar to the oscillations observed in electroencephalographic recordings, is also described. Results obtained from analytic and numerical studies of the properties of these networks are discussed.
Resumo:
The problem of spurious patterns in neural associative memory models is discussed, Some suggestions to solve this problem from the literature are reviewed and their inadequacies are pointed out, A solution based on the notion of neural self-interaction with a suitably chosen magnitude is presented for the Hebb learning rule. For an optimal learning rule based on linear programming, asymmetric dilution of synaptic connections is presented as another solution to the problem of spurious patterns, With varying percentages of asymmetric dilution it is demonstrated numerically that this optimal learning rule leads to near total suppression of spurious patterns. For practical usage of neural associative memory networks a combination of the two solutions with the optimal learning rule is recommended to be the best proposition.
Resumo:
Neural network models of associative memory exhibit a large number of spurious attractors of the network dynamics which are not correlated with any memory state. These spurious attractors, analogous to "glassy" local minima of the energy or free energy of a system of particles, degrade the performance of the network by trapping trajectories starting from states that are not close to one of the memory states. Different methods for reducing the adverse effects of spurious attractors are examined with emphasis on the role of synaptic asymmetry. (C) 2002 Elsevier Science B.V. All rights reserved.
Resumo:
It has long been recognised that statistical dependencies in neuronal activity need to be taken into account when decoding stimuli encoded in a neural population. Less studied, though equally pernicious, is the need to take account of dependencies between synaptic weights when decoding patterns previously encoded in an auto-associative memory. We show that activity-dependent learning generically produces such correlations, and failing to take them into account in the dynamics of memory retrieval leads to catastrophically poor recall. We derive optimal network dynamics for recall in the face of synaptic correlations caused by a range of synaptic plasticity rules. These dynamics involve well-studied circuit motifs, such as forms of feedback inhibition and experimentally observed dendritic nonlinearities. We therefore show how addressing the problem of synaptic correlations leads to a novel functional account of key biophysical features of the neural substrate.
Resumo:
A time-varying controllable fault-tolerant field associative memory model and the realization algorithms are proposed. On the one hand, this model simulates the time-dependent changeability character of the fault-tolerant field of human brain's associative memory. On the other hand, fault-tolerant fields of the memory samples of the model can be controlled, and we can design proper fault-tolerant fields for memory samples at different time according to the essentiality of memory samples. Moreover, the model has realized the nonlinear association of infinite value pattern from n dimension space to m dimension space. And the fault-tolerant fields of the memory samples are full of the whole real space R-n. The simulation shows that the model has the above characters and the speed of associative memory about the model is faster.
Resumo:
A design algorithm of an associative memory neural network is proposed. The benefit of this design algorithm is to make the designed associative memory model can implement the hoped situation. On the one hand, the designed model has realized the nonlinear association of infinite value pattern from n dimension space to m dimension space. The result has improved the ones of some old associative memory neural network. On the other hand, the memory samples are in the centers of the fault-tolerant. In average significance the radius of the memory sample fault-tolerant field is maximum.
Resumo:
In this paper, we study the periodic oscillatory behavior of a class of bidirectional associative memory (BAM) networks with finite distributed delays. A set of criteria are proposed for determining global exponential periodicity of the proposed BAM networks, which assume neither differentiability nor monotonicity of the activation function of each neuron. In addition, our criteria are easily checkable. (c) 2005 Elsevier Inc. All rights reserved.
Resumo:
The use of n-tuple or weightless neural networks as pattern recognition devices has been well documented. They have a significant advantages over more common networks paradigms, such as the multilayer perceptron in that they can be easily implemented in digital hardware using standard random access memories. To date, n-tuple networks have predominantly been used as fast pattern classification devices. The paper describes how n-tuple techniques can be used in the hardware implementation of a general auto-associative network.
Resumo:
Older adults often experience associative memory impairments but can sometimes remember important information. The current experiments investigate potential age-related similarities and differences associate memory for gains and losses. Younger and older participants were presented with faces and associated dollar amounts, which indicated how much money the person “owed” the participant, and were later given a cued recall test for the dollar amount. Experiment 1 examined face-dollar amount pairs while Experiment 2 included negative dollar amounts to examine both gains and losses. While younger adults recalled more information relative to older adults, both groups were more accurate in recalling the correct value associated with high value faces compared to lower value faces and remembered gist-information about the values. However, negative values (losses) did not have a strong impact on recall among older adults versus younger adults, illustrating important associative memory differences between younger and older adults.
Resumo:
People with grapheme-colour synaesthesia have been shown to have enhanced memory on a range of tasks using both stimuli that induce synaesthesia (e.g. words) and, more surprisingly, stimuli that do not (e.g. certain abstract visual stimuli). This study examines the latter by using multi-featured stimuli consisting of shape, colour and location conjunctions (e.g. shape A + colour A + location A; shape B + colour B + location B) presented in a recognition memory paradigm. This enables distractor items to be created in which one of these features is ‘unbound’ with respect to the others (e.g. shape A + colour B + location A; shape A + colour A + location C). Synaesthetes had higher recognition rates suggesting an enhanced ability to bind certain visual features together into memory. Importantly, synaesthetes’ false alarm rates were lower only when colour was the unbound feature, not shape or location. We suggest that synaesthetes are “colour experts” and that enhanced perception can lead to enhanced memory in very specific ways; but, not for instance, an enhanced ability to form associations per se. The results support contemporary models that propose a continuum between perception and memory.
Resumo:
Tobacco use is prevalent in adolescents, and understanding factors that contribute to its uptake and early development remains a critical public health priority. Implicit drug-related memory associations (DMAs) are predictive of drug use in older samples, but such models have little application to adolescent tobacco use. Moreover, extant research on memory associations yields little information on contextual factors that may be instrumental in the development of DMAs. The present study examined (a) the degree to which tobacco-related memory associations (TMAs) were associated with concurrent tobacco use and (b) the extent to which TMAs mediated the association of peer and self-use. A sample of 210 Australian high school students was recruited. Participants completed TMA tasks and behavioral checklists designed to obscure the tobacco-related focus of the study. Results showed that TMAs were associated with peer use, and TMAs predicted self-use. We found no evidence that TMAs mediated the association of peer and self-use. Future research might examine the emotive valence of implicit nodes and drinking behavior. The results have implications for testing the efficacy of consciousness-raising interventions for adolescents at risk of tobacco experimentation or regular use.
Resumo:
An associative memory with parallel architecture is presented. The neurons are modelled by perceptrons having only binary, rather than continuous valued input. To store m elements each having n features, m neurons each with n connections are needed. The n features are coded as an n-bit binary vector. The weights of the n connections that store the n features of an element has only two values -1 and 1 corresponding to the absence or presence of a feature. This makes the learning very simple and straightforward. For an input corrupted by binary noise, the associative memory indicates the element that is closest (in terms of Hamming distance) to the noisy input. In the case where the noisy input is equidistant from two or more stored vectors, the associative memory indicates two or more elements simultaneously. From some simple experiments performed on the human memory and also on the associative memory, it can be concluded that the associative memory presented in this paper is in some respect more akin to a human memory than a Hopfield model.