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

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Introduction to Learning01:18

Introduction to Learning

Learning is the process of acquiring knowledge or skills through practice or experience, leading to long-lasting behavioral changes. This acquisition occurs through interaction with the environment and requires practice or experience. For instance, mastering a skill such as surfing requires considerable practice and experience, highlighting the essential role of repeated interactions with the environment in learning.
In contrast to learned behaviors, unlearned behaviors such as crying, sexual...
Associative Learning01:27

Associative Learning

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...
lncRNA - Long Non-coding RNAs02:39

lncRNA - Long Non-coding RNAs

In humans, more than 80% of the genome gets transcribed. However, only around 2% of the genome codes for proteins. The remaining part produces non-coding RNAs which includes ribosomal RNAs, transfer RNAs, telomerase RNAs, and regulatory RNAs, among other types. A large number of regulatory non-coding RNAs have been classified into two groups depending upon their length – small non-coding RNAs, such as microRNA, which are less than 200 nucleotides in length, and long non-coding RNA (lncRNA)...
Multi-input and Multi-variable systems01:22

Multi-input and Multi-variable systems

Cruise control systems in cars are designed as multi-input systems to maintain a driver's desired speed while compensating for external disturbances such as changes in terrain. The block diagram for a cruise control system typically includes two main inputs: the desired speed set by the driver and any external disturbances, such as the incline of the road. By adjusting the engine throttle, the system maintains the vehicle's speed as close to the desired value as possible.
In the absence of...
Linear Approximations01:23

Linear Approximations

For a differentiable function of two variables, linear approximation estimates values near a known point by replacing the curved surface with its tangent plane. Consider the function\begin{equation*}f(x,y)=x^2+3y^2\end{equation*}near the point (2, 1). The exact value at this point is f(2, 1) = 22 + 3(1)2 = 4 + 3 = 7.The linear approximation of f(x, y)) near (a, b) is\begin{equation*}L(x,y)=f(a,b)+f_x(a,b)(x-a)+f_y(a,b)(y-b)\end{equation*}First, compute the partial derivatives: fx(x, y) = 2x and...

You might also read

Related Articles

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

Sort by
Same author

Laplacian spectrum constrains collective performance enhancement.

Physical review. E·2026
Same author

Coexistence of many positive invariant sets in several classes of dynamical systems.

Chaos (Woodbury, N.Y.)·2026
Same author

Fuzzy reinforcement learning synchronization of stochastic dynamic networks: An adaptive event-triggered strategy.

Neural networks : the official journal of the International Neural Network Society·2026
Same author

Bipartite Containment of Second-Order Multiagent Systems With Compound Noise Under Fixed or Markovian Switching Signed Topology.

IEEE transactions on cybernetics·2026
Same author

Engaging the public with antimicrobial resistance through social media videos-a content analysis study.

Frontiers in public health·2026
Same author

The Impact on Audience Engagement of Coordinating a Public Health Campaign on Antimicrobial Resistance Through a Network of Health Content Creators: Longitudinal Observational Study.

JMIR public health and surveillance·2026
Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013
Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011
Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011
Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011
Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011
Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011
See all related articles

Related Experiment Video

Updated: Jun 21, 2026

A Virtual Machine Platform for Non-Computer Professionals for Using Deep Learning to Classify Biological Sequences of Metagenomic Data
09:34

A Virtual Machine Platform for Non-Computer Professionals for Using Deep Learning to Classify Biological Sequences of Metagenomic Data

Published on: September 25, 2021

Universal perceptron and DNA-like learning algorithm for binary neural networks: non-LSBF implementation.

Fangyue Chen1, Guanrong Chen, Qinbin He

  • 1School of Science, Hangzhou Dianzi University, Zhejiang 310018, China. fychen@hdu.edu.cn

IEEE Transactions on Neural Networks
|July 11, 2009
PubMed
Summary
This summary is machine-generated.

A new DNA-like learning and decomposing algorithm (DNA-like LDA) effectively implements complex, linearly nonseparable Boolean functions (non-LSBF). This method decomposes non-LSBF into simpler functions for multilayer perceptron (MLP) implementation.

Related Experiment Videos

Last Updated: Jun 21, 2026

A Virtual Machine Platform for Non-Computer Professionals for Using Deep Learning to Classify Biological Sequences of Metagenomic Data
09:34

A Virtual Machine Platform for Non-Computer Professionals for Using Deep Learning to Classify Biological Sequences of Metagenomic Data

Published on: September 25, 2021

Area of Science:

  • Computer Science
  • Boolean Algebra
  • Machine Learning

Background:

  • Implementing linearly nonseparable Boolean functions (non-LSBF) is challenging due to their high complexity.
  • The proportion of non-LSBF increases exponentially with the number of input variables.
  • Existing methods struggle with the computational demands of non-LSBF.

Purpose of the Study:

  • To propose an effective algorithm for implementing non-LSBF.
  • To address the complexity and computational challenges associated with non-LSBF.
  • To demonstrate the algorithm's capability in function approximation and Boolean function mapping.

Main Methods:

  • Introduction of the DNA-like learning and decomposing algorithm (DNA-like LDA).
  • Training a DNA-like offset sequence for function decomposition.
  • Decomposing non-LSBF into logic XOR operations of linearly separable Boolean functions (LSBF).
  • Determining weight-threshold values for a multilayer perceptron (MLP) to perform decomposition and mapping.

Main Results:

  • The DNA-like LDA successfully decomposes non-LSBF into a sequence of LSBF.
  • The MLP, guided by the algorithm, effectively performs both LSBF decomposition and hidden-to-output neuron mapping.
  • Validation through approximation of a circular region and the n-bit parity Boolean function (PBF) confirms algorithm efficacy.

Conclusions:

  • The proposed DNA-like LDA offers an effective solution for implementing complex non-LSBF.
  • This approach simplifies the implementation of non-LSBF by leveraging LSBF and MLP.
  • The algorithm shows promise for applications requiring the processing of complex Boolean functions.