Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Block Diagram Reduction

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...

Signal Flow Graphs

Signal Flow Graphs

Signal-flow graphs offer a streamlined and intuitive approach to representing control systems, providing an alternative to traditional block diagrams. These graphs use branches to symbolize systems and nodes to represent signals, effectively illustrating the relationships and interactions within the system.
In a signal-flow graph, branches denote the system's transfer functions, while nodes represent the signals. The direction of signal flow is indicated by arrows, with the corresponding...

SFG Algebra

SFG Algebra

In Signal Flow Graph (SFG) algebra, the value a node represents is determined by the sum of all signals entering that node. This summed value is then transmitted through every branch leaving the node, making the SFG a powerful tool for visualizing and analyzing control systems.
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...

Sequence Networks of Rotating Machines

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...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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...

Trial and Error and Algorithm

Trial and Error and Algorithm

A problem-solving strategy is a plan of action used to find a solution. Different strategies have distinct action plans. Trial and error involves trying different solutions until one works. For instance, to fix a broken printer, you might check ink levels, ensure the paper tray isn't jammed, and verify the printer's connection to your laptop. This method can be time-consuming but is commonly used. Thomas Edison, for example, used trial and error to find a suitable filament for the light bulb,...

You might also read

Related Articles

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

Sort by

Same author

Self-organisation in Kohonen's SOM.

Neural networks : the official journal of the International Neural Network Society·1996

See all related articles

Search research articles

Related Experiment Video

Updated: Jul 8, 2026

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

Analysing a Self-organising Algorithm.

John A. Flanagan¹

¹Swiss Federal Institute of Technology, Switzerland

Neural Networks : the Official Journal of the International Neural Network Society

|July 1, 1997

Summary

This study presents a generalized self-organizing algorithm and analyzes its convergence using ordinary differential equation (ODE) methods. The findings reveal conditions favoring organized configurations in neuron weights, crucial for artificial intelligence development.

Area of Science:

Computational Neuroscience
Machine Learning
Artificial Intelligence

Background:

Self-organizing algorithms are fundamental to unsupervised learning.
Previous algorithms, like Cottrell and Fort's, have limitations in generalization.
Understanding neuron weight dynamics is key to algorithm performance.

Purpose of the Study:

To generalize a self-organizing algorithm.
To analyze the algorithm's convergence properties.
To identify conditions promoting organized neuron weight configurations.

Main Methods:

Generalization of Cottrell and Fort's self-organizing algorithm.
Analysis using the ordinary differential equation (ODE) method from stochastic approximation theory.

More Related Videos

Morphology-Based Distinction Between Healthy and Pathological Cells Utilizing Fourier Transforms and Self-Organizing Maps

Morphology-Based Distinction Between Healthy and Pathological Cells Utilizing Fourier Transforms and Self-Organizing Maps

Published on: October 28, 2018

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

Related Experiment Videos

Last Updated: Jul 8, 2026

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

Morphology-Based Distinction Between Healthy and Pathological Cells Utilizing Fourier Transforms and Self-Organizing Maps

Morphology-Based Distinction Between Healthy and Pathological Cells Utilizing Fourier Transforms and Self-Organizing Maps

Published on: October 28, 2018

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

Derivation of linear equations for stationary states of neuron weights.

Main Results:

The stationary state of neuron weights must satisfy a set of linear equations.
Conditions for the existence and uniqueness of a single stationary point were analyzed.
Factors influencing the convergence of neuron weights towards an organized state were identified.

Conclusions:

The generalized algorithm offers improved analytical tractability.
The ODE method provides a robust framework for analyzing self-organizing algorithms.
Understanding the conditions for convergence is vital for designing effective AI systems.