Jove
Visualize
Contact Us

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

98
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...
98
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

115
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
115
Statically Indeterminate Problem Solving01:16

Statically Indeterminate Problem Solving

475
Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...
475
Theorems of Pappus and Guldinus: Problem Solving01:12

Theorems of Pappus and Guldinus: Problem Solving

783
Pappus and Guldinus's theorems are powerful mathematical principles that are used for finding the surface area and volume of composite shapes. For example, consider a cylindrical storage tank with a conical top. Finding the surface area or volume can be challenging for such complex shapes. These theorems are particularly useful in calculating the volume and surface area of such systems. Here, the cylindrical storage tank with a conical top can be broken down into two simple shapes: a...
783
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

659
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...
659
Estimation of the Physical Quantities01:05

Estimation of the Physical Quantities

4.8K
On many occasions, physicists, other scientists, and engineers need to make estimates of a particular quantity. These are sometimes referred to as guesstimates, order-of-magnitude approximations, back-of-the-envelope calculations, or Fermi calculations. The physicist Enrico Fermi was famous for his ability to estimate various kinds of data with surprising precision. Estimating does not mean guessing a number or a formula at random. Instead, estimation means using prior experience and sound...
4.8K

You might also read

Related Articles

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

Sort by
Same journal

RETRACTION: Real-Time Modulation of Physical Training Intensity Based on Wavelet Recursive Fuzzy Neural Networks.

Computational intelligence and neuroscience·2026
Same journal

RETRACTION: Multidimensional Heterogeneous Network Link Adaptation Based on Mobile Environment.

Computational intelligence and neuroscience·2026
Same journal

RETRACTION: Framework to Segment and Evaluate Multiple Sclerosis Lesion in MRI Slices Using VGG-UNet.

Computational intelligence and neuroscience·2026
Same journal

RETRACTION: Facial Emotion Recognition Using a Novel Fusion of Convolutional Neural Network and Local Binary Pattern in Crime Investigation.

Computational intelligence and neuroscience·2026
Same journal

RETRACTION: Automatic Intelligent System Using Medical of Things for Multiple Sclerosis Detection.

Computational intelligence and neuroscience·2026
Same journal

RETRACTION: Intangible Cultural Heritage Reproduction and Revitalization: Value Feedback, Practice, and Exploration Based on the IPA Model.

Computational intelligence and neuroscience·2026
See all related articles
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 Experiment Video

Updated: Aug 23, 2025

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
10:58

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Published on: July 25, 2013

17.1K

Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem.

Zhengyuan Wang1, Hui Zhang1, Yali Li1

  • 1Xi'an Research Institute of Hi-Tech, Xi'an, Shaanxi 710025, China.

Computational Intelligence and Neuroscience
|November 1, 2022
PubMed
Summary
This summary is machine-generated.

This study introduces a fast polynomial time approximate solution (FPTAS) for the NP-hard 0-1 Knapsack problem (KP). FPTAS provides a valid and efficient method for finding accurate approximate solutions to the KP.

More Related Videos

Author Spotlight: Optimization of Airflow Velocities in Battery Cooling Systems for Enhanced Thermal Performance and Reduced Energy Consumption
10:36

Author Spotlight: Optimization of Airflow Velocities in Battery Cooling Systems for Enhanced Thermal Performance and Reduced Energy Consumption

Published on: November 3, 2023

1.7K
Errors as a Means of Reducing Impulsive Food Choice
07:07

Errors as a Means of Reducing Impulsive Food Choice

Published on: June 5, 2016

8.7K

Related Experiment Videos

Last Updated: Aug 23, 2025

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
10:58

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Published on: July 25, 2013

17.1K
Author Spotlight: Optimization of Airflow Velocities in Battery Cooling Systems for Enhanced Thermal Performance and Reduced Energy Consumption
10:36

Author Spotlight: Optimization of Airflow Velocities in Battery Cooling Systems for Enhanced Thermal Performance and Reduced Energy Consumption

Published on: November 3, 2023

1.7K
Errors as a Means of Reducing Impulsive Food Choice
07:07

Errors as a Means of Reducing Impulsive Food Choice

Published on: June 5, 2016

8.7K

Area of Science:

  • Computer Science
  • Operations Research
  • Algorithm Analysis

Background:

  • The 0-1 Knapsack Problem (KP) is a well-known NP-hard combinatorial optimization problem.
  • Exact solutions for KP are computationally infeasible for large instances, necessitating approximate solutions.
  • Approximate solutions are crucial for practical applications requiring timely results.

Purpose of the Study:

  • To propose a novel Fast Polynomial Time Approximate Solution (FPTAS) for the 0-1 Knapsack Problem.
  • To demonstrate the validity and efficiency of the proposed FPTAS algorithm.
  • To investigate the performance of FPTAS in finding high-accuracy solutions rapidly.

Main Methods:

  • The proposed FPTAS is based on a local search algorithm.
  • It identifies approximate solutions within the neighborhood of the upper bound solution for the exact k-item knapsack problem (E-kKP).
  • The critical item 's' is used to define the search neighborhood.

Main Results:

  • FPTAS demonstrates high accuracy in practice.
  • The algorithm achieves high speed in solving the Knapsack Problem.
  • Computational experiments validate the effectiveness of the FPTAS algorithm.

Conclusions:

  • The developed FPTAS is a valid and efficient approach for solving the 0-1 Knapsack Problem.
  • FPTAS offers a practical method for obtaining accurate approximate solutions to NP-hard KP instances.
  • The algorithm's speed and accuracy make it suitable for real-world applications.