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

109
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...
109
Distributed Loads: Problem Solving01:21

Distributed Loads: Problem Solving

769
Beams are structural elements commonly employed in engineering applications requiring different load-carrying capacities. The first step in analyzing a beam under a distributed load is to simplify the problem by dividing the load into smaller regions, which allows one to consider each region separately and calculate the magnitude of the equivalent resultant load acting on each portion of the beam. The magnitude of the equivalent resultant load for each region can be determined by calculating...
769
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

776
This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
776
Extraction: Partition and Distribution Coefficients01:14

Extraction: Partition and Distribution Coefficients

3.4K
The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an...
3.4K
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

312
The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
312
Comparing the Survival Analysis of Two or More Groups01:20

Comparing the Survival Analysis of Two or More Groups

321
Survival analysis is a cornerstone of medical research, used to evaluate the time until an event of interest occurs, such as death, disease recurrence, or recovery. Unlike standard statistical methods, survival analysis is particularly adept at handling censored data—instances where the event has not occurred for some participants by the end of the study or remains unobserved. To address these unique challenges, specialized techniques like the Kaplan-Meier estimator, log-rank test, and...
321

You might also read

Related Articles

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

Sort by
Same author

Impact of "four-step" death education on life quality and negative emotions in advanced esophageal cancer patients and families.

World journal of gastrointestinal surgery·2026
Same author

Tensor-Based Ant Colony Optimization for Set Meal Design in Online-to-Offline Restaurants.

IEEE transactions on cybernetics·2026
Same author

Association between coronary heart disease and risk of advanced liver fibrosis: results of the 2017-2018 national health and nutrition examination survey.

European journal of gastroenterology & hepatology·2025
Same author

Rapid and equipment-free identification of papaya mealybug Paracoccus marginatus based on RPA-CRISPR/Cas12a.

Pest management science·2024
Same author

Bioinformatics and experimental validation were combined to explore lactylation-related biomarkers in HBV-associated acute liver failure.

Journal of gastroenterology and hepatology·2024
Same author

Functional response and predation rate of Cryptolaemus montrouzieri (Coleoptera: Coccinellidae) to Paracoccus marginatus (Hemiptera: Pseudococcidae) at different temperatures.

Journal of economic entomology·2024

Related Experiment Video

Updated: Sep 29, 2025

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

7.1K

Dual Differential Grouping: A More General Decomposition Method for Large-Scale Optimization.

Jian-Yu Li, Zhi-Hui Zhan, Kay Chen Tan

    IEEE Transactions on Cybernetics
    |March 25, 2022
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces Dual Differential Grouping (DDG), a novel method to enhance cooperative coevolution (CC) algorithms for large-scale optimization problems (LSOPs). DDG effectively decomposes both additively and multiplicatively separable functions, expanding CC

    More Related Videos

    Using Cholesky Decomposition to Explore Individual Differences in Longitudinal Relations between Reading Skills
    06:52

    Using Cholesky Decomposition to Explore Individual Differences in Longitudinal Relations between Reading Skills

    Published on: September 17, 2019

    6.4K
    Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
    07:35

    Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

    Published on: October 11, 2018

    7.7K

    Related Experiment Videos

    Last Updated: Sep 29, 2025

    Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
    12:27

    Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

    Published on: February 15, 2017

    7.1K
    Using Cholesky Decomposition to Explore Individual Differences in Longitudinal Relations between Reading Skills
    06:52

    Using Cholesky Decomposition to Explore Individual Differences in Longitudinal Relations between Reading Skills

    Published on: September 17, 2019

    6.4K
    Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
    07:35

    Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

    Published on: October 11, 2018

    7.7K

    Area of Science:

    • Optimization Algorithms
    • Artificial Intelligence
    • Machine Learning

    Background:

    • Cooperative coevolution (CC) algorithms are effective for large-scale optimization problems (LSOPs).
    • Existing decomposition methods, like differential grouping (DG), primarily handle additively separable functions, limiting CC's applicability to non-additively separable problems.
    • This limitation creates a bottleneck for CC in solving diverse LSOPs.

    Purpose of the Study:

    • To develop a decomposition method capable of handling more types of separable functions, specifically multiplicatively separable functions.
    • To improve the general problem-solving ability of CC algorithms on LSOPs by expanding their decomposition capabilities.
    • To propose a novel method, dual DG (DDG), for enhanced LSOP decomposition and optimization.

    Main Methods:

    • Definition and mathematical analysis of multiplicatively separable functions and their relationship to additively separable functions.
    • Development of the dual DG (DDG) method, utilizing two types of differences to detect both additive and multiplicative separability.
    • Analysis of DDG's time complexity and integration into a CC algorithm framework for LSOPs.

    Main Results:

    • The proposed DDG method successfully decomposes both additively and multiplicatively separable functions, significantly broadening the scope of CC applications.
    • Experimental validation on 30 LSOPs from the IEEE CEC competition and a neural network parameter optimization case study demonstrates DDG's superiority over existing methods.
    • DDG-based CC algorithms show improved performance compared to state-of-the-art and champion algorithms.

    Conclusions:

    • DDG offers a significant advancement in variable decomposition for CC algorithms, enabling them to tackle a wider range of LSOPs.
    • The ability to decompose multiplicatively separable functions overcomes a key limitation of previous methods, enhancing CC's general problem-solving capabilities.
    • DDG represents a promising direction for future research in optimization and its applications, particularly in complex machine learning tasks.