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

Observational Learning01:12

Observational Learning

Albert Bandura's observational learning, also known as imitation or modeling, occurs when a person observes and imitates another's behavior. It is a quicker process than operant conditioning. A well-known example is the Bobo doll study, where children who saw an adult acting aggressively towards the doll were more likely to act aggressively when left alone, compared to those who observed a nonaggressive adult. Many psychologists view observational learning as a form of latent learning because...
Network Function of a Circuit01:25

Network Function of a Circuit

Frequency response analysis in electrical circuits provides vital insights into a circuit's behavior as the frequency of the input signal changes. The transfer function, a mathematical tool, is instrumental in understanding this behavior. It defines the relationship between phasor output and input and comes in four types: voltage gain, current gain, transfer impedance, and transfer admittance. The critical components of the transfer function are the poles and zeros.
Relation between Mathematical Equations and Block Diagrams01:20

Relation between Mathematical Equations and Block Diagrams

In a spring-mass-damper system, the second-order differential equation describes the dynamic behavior of the system. When transformed into the Laplace domain under zero initial conditions, this equation can be effectively analyzed and manipulated. The transformation into the Laplace domain converts differential equations into algebraic equations, simplifying the process of isolating the output.
Block Diagram Reduction01:22

Block Diagram Reduction

The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Sequence Networks of Rotating Machines01:24

Sequence Networks of Rotating Machines

A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
Simplified Synchronous Machine Model01:30

Simplified Synchronous Machine Model

The Synchronous Machine Model is a fundamental tool in analyzing and ensuring the transient stability of power systems. This model simplifies the representation of a synchronous machine under balanced three-phase positive-sequence conditions, assuming constant excitation and ignoring losses and saturation. The model is pivotal for understanding the behavior of synchronous generators connected to a power grid, particularly during transient events.
In this model, each generator is connected to a...

You might also read

Related Articles

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

Sort by
Same author

Hidden Order of Boolean Networks.

IEEE transactions on neural networks and learning systems·2022
Same author

Efficient Algorithm for Approximating Nash Equilibrium of Distributed Aggregative Games.

IEEE transactions on cybernetics·2022
Same author

Optimization via game theoretic control.

National science review·2021
Same author

Doped metasurfaces: Etched structure-free flims based on regular spatially doped semiconductor and compatible with general optical ones.

iScience·2021
Same author

Self-Triggered Scheduling for Boolean Control Networks.

IEEE transactions on cybernetics·2021
Same author

Model-Free Reinforcement Learning by Embedding an Auxiliary System for Optimal Control of Nonlinear Systems.

IEEE transactions on neural networks and learning systems·2020
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 4, 2026

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

Model construction of Boolean network via observed data.

Daizhan Cheng1, Hongsheng Qi, Zhiqiang Li

  • 1Key Laboratory of Systems and Control, Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences, Beijing 100190, China. dcheng@iss.ac.cn

IEEE Transactions on Neural Networks
|February 24, 2011
PubMed
Summary
This summary is machine-generated.

This study introduces novel methods for constructing Boolean dynamic models from experimental data, crucial for understanding biological processes like cancer cell diffusion. The techniques simplify model building and reduce data requirements, even with noisy datasets.

More Related Videos

Constructing and Visualizing Models using Mime-based Machine-learning Framework
06:19

Constructing and Visualizing Models using Mime-based Machine-learning Framework

Published on: July 22, 2025

Related Experiment Videos

Last Updated: Jun 4, 2026

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

Constructing and Visualizing Models using Mime-based Machine-learning Framework
06:19

Constructing and Visualizing Models using Mime-based Machine-learning Framework

Published on: July 22, 2025

Area of Science:

  • Computational Biology
  • Systems Biology
  • Network Science

Background:

  • Boolean dynamic processes model complex biological systems, such as gene regulatory networks and cell differentiation.
  • Accurate modeling of these networks is essential for understanding disease mechanisms, including cancer cell diffusion.
  • Existing methods for constructing Boolean network models can be data-intensive and computationally complex.

Purpose of the Study:

  • To propose novel methods for constructing dynamic models of Boolean networks from experimental data.
  • To develop techniques that reduce the amount of data required for accurate model identification.
  • To address the challenge of data errors in Boolean network modeling.

Main Methods:

  • Construction of the algebraic form of Boolean networks, followed by conversion to logical dynamics.
  • Development of a general construction technique for Boolean network models.
  • Introduction of the least in-degree model to significantly reduce data requirements when the network graph is known.
  • Investigation of uniform networks where data requirements are independent of network size.

Main Results:

  • The proposed methods enable the construction of dynamic models for Boolean networks from observed datasets.
  • The least in-degree model drastically reduces the necessary data size for known network graphs.
  • For uniform networks, the number of data points needed for identification is independent of the network's size.
  • Principles for handling erroneous data in Boolean network modeling are presented.

Conclusions:

  • The developed methods offer efficient and data-saving approaches for Boolean network modeling.
  • These techniques are applicable to various biological systems, including cancer cell diffusion processes.
  • The findings provide a robust framework for analyzing complex biological dynamics even with imperfect data.