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

Extraction: Partition and Distribution Coefficients01:14

Extraction: Partition and Distribution Coefficients

2.6K
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...
2.6K
Cluster Sampling Method01:20

Cluster Sampling Method

12.0K
Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
12.0K
Survival Tree01:19

Survival Tree

125
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
125
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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

611
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...
611
Randomized Experiments01:13

Randomized Experiments

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

You might also read

Related Articles

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

Sort by
Same author

On the implementation of maximum entropy sampling with unequal probabilities and without replacement.

MethodsX·2026
Same author

On the implementation of stratified two-stage simple random sampling without replacement, with possible collapsed strata.

MethodsX·2024
Same author

On evaluating the efficiency of the delta-lognormal mean estimator and predictor.

MethodsX·2022
Same author

On the non-recursive implementation of multistage sampling without replacement.

MethodsX·2021
Same author

Attenuating the nonresponse bias in hunting bag surveys: The multiphase sampling strategy.

PloS one·2019
Same author

Accounting for sampling error when inferring population synchrony from time-series data: a Bayesian state-space modelling approach with applications.

PloS one·2014

Related Experiment Video

Updated: Aug 1, 2025

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

On univariate optimal partitioning by complete enumeration.

Philippe Aubry1

  • 1OFB - Office français de la biodiversité - Direction surveillance, évaluation, données - Unité données et appui méthodologique, Saint Benoist, BP 20, F-78612 Le Perray-en-Yvelines, France.

Methodsx
|April 24, 2023
PubMed
Summary

This study presents a complete enumeration algorithm for univariate partitioning problems, efficiently generating all contiguous partitions. This method provides an exact solution for specific cases, filling a gap in computational problem-solving literature.

Keywords:
Contiguous partitionsData structures for set partitionsNested loops simulationPartition optimizationSet partitions enumerationUnivariate optimal partitioning by iteratively generating contiguous partitions

More Related Videos

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.0K
A Real-world What-Where-When Memory Test
09:13

A Real-world What-Where-When Memory Test

Published on: May 16, 2017

11.4K

Related Experiment Videos

Last Updated: Aug 1, 2025

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.6K
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.0K
A Real-world What-Where-When Memory Test
09:13

A Real-world What-Where-When Memory Test

Published on: May 16, 2017

11.4K

Area of Science:

  • Computational Mathematics
  • Operations Research
  • Algorithm Design

Background:

  • Global optimization for partitioning problems is often intractable due to combinatorial complexity.
  • Univariate partitioning, where elements are ordered, offers a more manageable problem space compared to multivariate cases.

Purpose of the Study:

  • To develop and present an algorithm for finding globally optimal solutions in univariate partitioning problems.
  • To address the computational challenges of partitioning by focusing on the univariate case.
  • To provide a tool for researchers and engineers dealing with specific univariate partitioning tasks.

Main Methods:

  • Utilizing complete enumeration to guarantee globally optimal solutions for univariate partitioning.
  • Developing an iterative algorithm simulating nested loops to generate all contiguous partitions for a variable number of classes.
  • Comparing exact problem sizes and approximate time complexities between multivariate and univariate partitioning.

Main Results:

  • The proposed algorithm efficiently generates all possible contiguous partitions for univariate datasets.
  • Demonstrated feasibility of complete enumeration for specific univariate partitioning scenarios.
  • Established a clear comparison of computational complexities for univariate versus multivariate partitioning.

Conclusions:

  • The developed algorithm provides an exact and efficient method for solving specific univariate partitioning problems.
  • This work bridges a gap in the literature by offering a practical tool for unusual univariate partitioning tasks.
  • The approach is versatile, applicable with any objective function or set of constraints for contiguous partitions.