Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

State Space Representation01:27

State Space Representation

335
The frequency-domain technique, commonly used in analyzing and designing feedback control systems, is effective for linear, time-invariant systems. However, it falls short when dealing with nonlinear, time-varying, and multiple-input multiple-output systems. The time-domain or state-space approach addresses these limitations by utilizing state variables to construct simultaneous, first-order differential equations, known as state equations, for an nth-order system.
Consider an RLC circuit, a...
335
Ligand Binding and Linkage00:49

Ligand Binding and Linkage

5.1K
Allosteric proteins have more than one ligand binding site; the binding of a ligand to any of these sites influences the binding of ligands to the other sites. When a protein is allosteric, its binding sites are called coupled or linked.  In the case of enzymes, the site that binds to the substrate is known as the active site and the other site is known as the regulatory site. When a ligand binds to the regulatory site, this leads to conformational changes in the protein that can influence...
5.1K
Probability Distributions01:32

Probability Distributions

9.9K
 The probability of a random variable x  is the likelihood of its occurrence. A probability distribution represents the probabilities of a random variable using a formula, graph, or table. There are two types of probability distribution– discrete probability distribution and continuous probability distribution.
A discrete probability distribution is a probability distribution of discrete random variables. It can be categorized into binomial probability distribution and Poisson...
9.9K
Conserved Binding Sites01:49

Conserved Binding Sites

1.8K
1.8K
Associative Learning01:27

Associative Learning

694
Associative learning is a fundamental concept in behavioral psychology, wherein a connection is established between two stimuli or events, leading to a learned response. This process is critical in understanding how behaviors are acquired and modified. Conditioning, the mechanism through which associations are formed, can be divided into two main types: classical conditioning and operant conditioning, each elucidating different aspects of associative learning.
Classical conditioning, also known...
694
MO Theory and Covalent Bonding02:40

MO Theory and Covalent Bonding

12.5K
The molecular orbital theory describes the distribution of electrons in molecules in a manner similar to the distribution of electrons in atomic orbitals. The region of space in which a valence electron in a molecule is likely to be found is called a molecular orbital. Mathematically, the linear combination of atomic orbitals (LCAO) generates molecular orbitals. Combinations of in-phase atomic orbital wave functions result in regions with a high probability of electron density, while...
12.5K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Parallax error indicates simple cue-anchoring in the head-direction system.

bioRxiv : the preprint server for biology·2026
Same author

Multiclass Linear Perceptrons With Multiplicative Margins.

Neural computation·2026
Same author

Deciphering hippocampal place codes in weak theta rhythms.

Nature communications·2026
Same author

Binding in hippocampal-entorhinal circuits enables compositionality in cognitive maps.

Advances in neural information processing systems·2025
Same author

The neurobench framework for benchmarking neuromorphic computing algorithms and systems.

Nature communications·2025
Same author

Principled neuromorphic reservoir computing.

Nature communications·2025
Same journal

Hidden Data Recovery and Forecasting via Next-Generation Reservoir Computing With Multiscale Delay Selection.

IEEE transactions on neural networks and learning systems·2026
Same journal

CAFF-CIL: Causality-Aware Freedom Forgetting Approach for Class-Incremental Learning.

IEEE transactions on neural networks and learning systems·2026
Same journal

Harmonic Autoencoding Framework for Multiple Tasks in Magnetic Particle Imaging Reconstruction.

IEEE transactions on neural networks and learning systems·2026
Same journal

A Survey on Human-Centric Voice-Face Multimodal Learning.

IEEE transactions on neural networks and learning systems·2026
Same journal

Vision-Assisted Foundation Model for Solving Multitask Vehicle Routing Problems.

IEEE transactions on neural networks and learning systems·2026
Same journal

FP3O: Enabling Proximal Policy Optimization in Multiagent Cooperation With Parameter-Sharing Versatility.

IEEE transactions on neural networks and learning systems·2026
See all related articles

Related Experiment Video

Updated: Oct 21, 2025

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

7.4K

Variable Binding for Sparse Distributed Representations: Theory and Applications.

Edward Paxon Frady, Denis Kleyko, Friedrich T Sommer

    IEEE Transactions on Neural Networks and Learning Systems
    |September 3, 2021
    PubMed
    Summary
    This summary is machine-generated.

    This study shows how to implement variable binding in neural networks using sparse distributed representations. Block-local circular convolution binding is an efficient, dimensionality-preserving method for symbolic reasoning.

    More Related Videos

    Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks
    11:18

    Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

    Published on: March 2, 2015

    10.5K
    Decoding Natural Behavior from Neuroethological Embedding
    08:00

    Decoding Natural Behavior from Neuroethological Embedding

    Published on: October 3, 2025

    103

    Related Experiment Videos

    Last Updated: Oct 21, 2025

    Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
    07:08

    Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

    Published on: July 14, 2015

    7.4K
    Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks
    11:18

    Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

    Published on: March 2, 2015

    10.5K
    Decoding Natural Behavior from Neuroethological Embedding
    08:00

    Decoding Natural Behavior from Neuroethological Embedding

    Published on: October 3, 2025

    103

    Area of Science:

    • Cognitive Science
    • Neuroscience
    • Artificial Intelligence

    Background:

    • Variable binding is crucial for cognition but challenging to implement in connectionist models.
    • Classical vector symbolic architectures (VSAs) use dense vectors, unlike the brain's sparse representations.
    • Bridging the gap between dense VSAs and sparse neural encoding is a key research problem.

    Purpose of the Study:

    • To explore dimensionality-preserving variable binding methods for sparse distributed representations in VSAs.
    • To investigate the mathematical equivalence between VSA binding and tensor product binding for sparse vectors.
    • To evaluate novel binding methods for their efficiency and performance in symbolic reasoning tasks.

    Main Methods:

    • Mathematical equivalence established between VSA binding and tensor product binding using compressed sensing.
    • Developed and analyzed two dimensionality-preserving binding methods: random projections and block-local circular convolution for sparse vectors.
    • Experimental validation using VSA with sparse block-codes and block-local circular convolution.

    Main Results:

    • Block-local circular convolution binding demonstrated ideal properties for sparse vectors.
    • Random projection binding was functional but lossy.
    • VSAs utilizing block-local circular convolution and sparse block-codes achieved performance comparable to classical VSAs.

    Conclusions:

    • Sparse distributed representations are viable for implementing efficient variable binding in connectionist models.
    • Block-local circular convolution offers a promising, dimensionality-preserving approach for VSA binding.
    • The findings have implications for both artificial neural networks and understanding neural computation.