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

Randomized Experiments01:13

Randomized Experiments

8.7K
The randomization process involves assigning study participants randomly to experimental or control groups based on their probability of being equally assigned. Randomization is meant to eliminate selection bias and balance known and unknown confounding factors so that the control group is similar to the treatment group as much as possible. A computer program and a random number generator can be used to assign participants to groups in a way that minimizes bias.
Simple randomization
Simple...
8.7K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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

Distributed Loads: Problem Solving

1.0K
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...
1.0K
Masking and Demasking Agents01:19

Masking and Demasking Agents

3.3K
EDTA titrations may necessitate masking and demasking agents to temporarily protect a particular metal ion in a mixture from the EDTA reaction. These agents facilitate the sequential analysis of the metal ions by forming stable complexes with some—but not all—metal ions during certain steps.
There are many masking agents, such as cyanide, fluoride, triethanolamine, thiourea, and 2,3-bis(sulfanyl)propan-1-ol (formerly 2,3-dimercapto-1-propanol), with the masking agent chosen based on...
3.3K
Model Approaches for Pharmacokinetic Data: Distributed Parameter Models01:06

Model Approaches for Pharmacokinetic Data: Distributed Parameter Models

205
Pharmacokinetic models are mathematical constructs that represent and predict the time course of drug concentrations in the body, providing meaningful pharmacokinetic parameters. These models are categorized into compartment, physiological, and distributed parameter models.
The distributed parameter models are specifically designed to account for variations and differences in some drug classes. This model is particularly useful for assessing regional concentrations of anticancer or...
205
Maxwell-Boltzmann Distribution: Problem Solving01:20

Maxwell-Boltzmann Distribution: Problem Solving

2.8K
Individual molecules in a gas move in random directions, but a gas containing numerous molecules has a predictable distribution of molecular speeds, which is known as the Maxwell-Boltzmann distribution, f(v).
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
2.8K

You might also read

Related Articles

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

Sort by
Same author

Trend-Conditioned Residual Learning for Early Fault Warning in Nonstationary Multi-Sensor Oil Monitoring.

Sensors (Basel, Switzerland)·2026
Same author

Molecular Glues Recruiting RNF213 As an E3 Ligase for Targeted Protein Degradation: A Minimal Dibromoacetamide Warhead As a Recruitment Ligand.

Journal of the American Chemical Society·2026
Same author

Solving the Hubbard model with neural quantum states.

Nature communications·2026
Same author

Pyroptosis-immunity-microbiome axis in acute upper gastrointestinal bleeding: mechanisms, risk prediction, and individualized strategies.

Frontiers in medicine·2026
Same author

The Analgesic Efficacy and Safety of Intramuscular Hydromorphone Versus Butorphanol for Acute Pain in the Emergency Department: A Randomized Trial.

Pain research & management·2026
Same author

Theaflavin-3,3'-digallate improves porcine oocyte maturation and independently enhances embryo development in vitro via modulating redox homeostasis and lipid-associated metabolism.

Reproductive biology·2026
Same journal

Relaxed Stability Conditions for Model Predictive Control of Hybrid Dynamical Systems Using Hybrid Recurrent Neural Networks.

IEEE transactions on cybernetics·2026
Same journal

An Evolutionary Algorithm Assisted by an Ensemble of Pareto-Optimal Surrogate Models.

IEEE transactions on cybernetics·2026
Same journal

A Quantum Self-Attention Neural Network Model on Quantum Circuits.

IEEE transactions on cybernetics·2026
Same journal

Semi-Explicit Solution of Some Discrete-Time Higher-Order-Cost Mean-Field-Type Control.

IEEE transactions on cybernetics·2026
Same journal

A Novel One-Step Small Object Detector for Autonomous Aerial Vehicles.

IEEE transactions on cybernetics·2026
Same journal

Online Data-Driven-Based Optimal Output Tracking Control Without Initial Stabilizing Policy.

IEEE transactions on cybernetics·2026
See all related articles

Related Experiment Video

Updated: Dec 26, 2025

Deep Neural Networks for Image-Based Dietary Assessment
13:19

Deep Neural Networks for Image-Based Dietary Assessment

Published on: March 13, 2021

9.8K

Privacy Masking Stochastic Subgradient-Push Algorithm for Distributed Online Optimization.

Qingguo Lu, Xiaofeng Liao, Tao Xiang

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

    This study introduces a new algorithm for distributed online optimization on complex networks, ensuring data privacy. The method balances privacy with accurate optimization results, even with communication delays.

    Related Experiment Videos

    Last Updated: Dec 26, 2025

    Deep Neural Networks for Image-Based Dietary Assessment
    13:19

    Deep Neural Networks for Image-Based Dietary Assessment

    Published on: March 13, 2021

    9.8K

    Area of Science:

    • Distributed Systems
    • Optimization Theory
    • Network Science

    Background:

    • Distributed online optimization is crucial for multi-unit systems.
    • Existing methods often neglect data privacy concerns.
    • Complex network structures pose significant challenges.

    Purpose of the Study:

    • To develop a privacy-preserving distributed online optimization algorithm.
    • To address optimization on time-varying, unbalanced, directed networks.
    • To ensure local cost function privacy while minimizing a global cost function.

    Main Methods:

    • Proposed a differentially private-distributed stochastic subgradient-push (DP-DSSP) algorithm.
    • Incorporated differential privacy to mask local cost functions.
    • Analyzed algorithm performance under network constraints and communication delays.

    Main Results:

    • DP-DSSP effectively masks differential privacy.
    • The algorithm achieves sublinear regrets, indicating efficient optimization.
    • A trade-off between privacy levels and accuracy was identified.
    • The method handles communication delays in networks.

    Conclusions:

    • DP-DSSP is a practical solution for private distributed online optimization.
    • The algorithm is effective on complex, dynamic network topologies.
    • Simulation results validate the algorithm's performance and theoretical findings.