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

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...
Neural Circuits01:25

Neural Circuits

Neural circuits and neuronal pools are two of the main structures found in the nervous system. Neural circuits are networks of neurons that work together to carry out a specific task or process. They consist of interconnected neurons and glial cells, which provide structural and metabolic support.
Neuronal pools are collections of nerve cells with similar functions and interact through chemical and electrical signals. These pools include both interneurons (the central neural circuit nodes that...
Per-Unit Sequence Models01:26

Per-Unit Sequence Models

An ideal Y-Y transformer, grounded through neutral impedances, displays per-unit sequence networks akin to those of a single-phase ideal transformer when subjected to balanced positive- or negative-sequence currents. These currents do not produce neutral currents, and their associated voltage drops.
Zero-sequence currents, which are identical in magnitude and phase, generate a neutral current, resulting in voltage drops across the neutral impedance and the low-voltage winding. If the...
The Delta-to-Y Circuit01:16

The Delta-to-Y Circuit

In the delta-wye circuit, the source is delta-connected, while the load is in a wye configuration. This means that the phase voltage of the delta-connected source is equal to the line voltage of the wye-connected load. The connection between two-line currents originates from the delta-connected source. The phase difference in the balanced system allows for calculating one line current given the other, utilizing the positive sequence of phases. In the delta-wye system, the phase currents in the...
Rectangular and Triangular Pulse Function01:19

Rectangular and Triangular Pulse Function

The unit rectangular pulse function is mathematically represented by a rectangular function centered at the origin with a height of one unit. This function is defined by two parameters: T, which specifies the center location of the pulse along the time axis, and τ, which determines the pulse duration.
For example, consider a rectangular pulse with a 5V amplitude, a 3-second duration, and centered at t=2 seconds. This pulse can be expressed using the rectangular function, written as,
Radical Chain-Growth Polymerization: Chain Branching01:17

Radical Chain-Growth Polymerization: Chain Branching

The skeletal structure of polymers synthesized via radical polymerization is always branched. For example, the polymerization of ethylene by radical polymerization results in a low-density grade of polyethylene with a heavily branched skeletal structure. Here, the radical site abstracts hydrogen from the growing chain, and the radical site shifts from the end (a primary carbon center) to anywhere within the growing chain (a secondary carbon center). Consequently, the part of the chain from the...

You might also read

Related Articles

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

Sort by
Same author

On energy complexity of fully-connected layers.

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

Energy Complexity of Convolutional Neural Networks.

Neural computation·2024
Same author

Analog neuron hierarchy.

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

Subrecursive neural networks.

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

Energy complexity of recurrent neural networks.

Neural computation·2014
Same author

On the nonlearnability of a single spiking neuron.

Neural computation·2005
Same journal

A Model-Free Reinforcement Learning Implementation of Decision Making Under Uncertainty by Sequential Sampling.

Neural computation·2026
Same journal

DROP: Distributional and Regular Optimism and Pessimism for Reinforcement Learning.

Neural computation·2026
Same journal

Hierarchical Active Inference Using Successor Representations.

Neural computation·2026
Same journal

W-Kernel and Its Principal Space for Frequentist Evaluation of Bayesian Estimators.

Neural computation·2026
Same journal

A Hidden Markov Model-Inspired Sequence Classification Method for Hyperdimensional Computing.

Neural computation·2026
Same journal

Sparse Graphical Modeling for Electrophysiological Phase-Based Connectivity Using Circular Statistics.

Neural computation·2026
See all related articles

Related Experiment Video

Updated: Jun 23, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

Sequential triangle strip generator based on Hopfield networks.

Jirí Síma1, Radim Lnĕnicka

  • 1Institute of Computer Science, Academy of Sciences of the Czech Republic, P.O. Box 5, 18207 Prague 8, Czech Republic. sima@cs.cas.cz

Neural Computation
|May 12, 2009
PubMed
Summary
This summary is machine-generated.

Generating minimal sequential triangle strips (tristrips) for 3D models is optimized using Hopfield networks and simulated annealing. The HTGEN program provides semi-optimal solutions efficiently, outperforming conventional methods.

More Related Videos

Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles
10:23

Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles

Published on: May 8, 2015

Stripe Assay to Study the Attractive or Repulsive Activity of a Protein Substrate Using Dissociated Hippocampal Neurons
08:11

Stripe Assay to Study the Attractive or Repulsive Activity of a Protein Substrate Using Dissociated Hippocampal Neurons

Published on: June 19, 2016

Related Experiment Videos

Last Updated: Jun 23, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles
10:23

Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles

Published on: May 8, 2015

Stripe Assay to Study the Attractive or Repulsive Activity of a Protein Substrate Using Dissociated Hippocampal Neurons
08:11

Stripe Assay to Study the Attractive or Repulsive Activity of a Protein Substrate Using Dissociated Hippocampal Neurons

Published on: June 19, 2016

Area of Science:

  • Computer Graphics
  • Computational Geometry
  • Artificial Intelligence

Background:

  • Generating efficient triangle representations for 3D models is crucial for computer graphics applications.
  • The problem of minimizing sequential triangle strips (tristrips) is a complex combinatorial optimization challenge.

Purpose of the Study:

  • To develop a novel method for generating the minimum number of sequential triangle strips for triangulated surface models.
  • To leverage neural network approaches, specifically Hopfield nets, to solve this optimization problem.

Main Methods:

  • The combinatorial optimization problem was reformulated as a minimum energy problem solvable by Hopfield networks.
  • A Hopfield network powered by simulated annealing (Boltzmann machine) was implemented in the HTGEN program.
  • The performance of HTGEN was compared against a conventional stripification program, FTSG.

Main Results:

  • HTGEN demonstrated superior performance in generating semi-optimal stripifications compared to the FTSG program.
  • Despite the theoretical increase in simulated annealing time near the global optimum, HTGEN showed empirical linear time complexity for fixed parameters.
  • HTGEN successfully processed large models with hundreds of thousands of triangles within reasonable timeframes.

Conclusions:

  • The Hopfield network approach, implemented in HTGEN, offers an effective method for computing semi-optimal triangle stripifications.
  • HTGEN provides a practical and efficient solution for optimizing triangle strip generation in computer graphics, even for large-scale models.