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

Survival Tree01:19

Survival Tree

183
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...
183
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

126
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...
126
Construction of Root Locus01:15

Construction of Root Locus

201
The construction of a root locus involves several key steps to analyze and visualize the behavior of a system's poles with varying gain. The number of branches in the root locus equals the number of closed-loop poles and is symmetrical about the real axis.
For positive gain values, the root locus exists on the real axis to the left of an odd number of finite open-loop poles or zeros. The root locus starts at the open-loop poles and traces the paths of the closed-loop poles as the gain...
201
Root-Locus Method01:19

Root-Locus Method

234
A cruise control system in a car is designed to maintain a specified speed automatically by adjusting the gas pedal. The system continuously measures the vehicle's speed and makes fine adjustments to the pedal to achieve this goal. The root locus method is particularly useful for understanding how the cruise control system's behavior changes under varying conditions, such as when the car goes uphill, downhill, or faces strong wind resistance.
This system can be represented by a block...
234
Plotting and Calibrating the Root Locus01:19

Plotting and Calibrating the Root Locus

207
Root loci often diverge as system poles shift from the real axis to the complex plane. Key points in this transition are the breakaway and break-in points, indicating where the root locus leaves and reenters the real axis. The branches of the root locus form an angle of 180/n degrees with the real axis, where n is the number of branches at a breakaway or break-in point.
The maximum gain occurs at the breakaway points between open-loop poles on the real axis, while the minimum gain is...
207
Phylogenetic Trees03:21

Phylogenetic Trees

48.2K
Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.
48.2K

You might also read

Related Articles

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

Sort by
Same author

A "Uniformity Principle" for Evacuation Route Allocation.

Journal of research of the National Bureau of Standards (1977)·2021
Same journal

A Graph Coloring Algorithm for Large Scheduling Problems.

Journal of research of the National Bureau of Standards (1977)·2021
Same journal

Generators for Discrete Polynomial L<sub>1</sub> Approximation Problems.

Journal of research of the National Bureau of Standards (1977)·2021
Same journal

Room Temperature Poling of Poly(Vinylidene Fluoride) with Deposited Metal Electrodes.

Journal of research of the National Bureau of Standards (1977)·2021
Same journal

Molecular Dynamics Study of Liquid Rubidium and the Lennard-Jones Fluid.

Journal of research of the National Bureau of Standards (1977)·2021
Same journal

Isoionic Isotope Exchange with Hydroxylapatite and the Dilution Effect.

Journal of research of the National Bureau of Standards (1977)·2021
Same journal

Observations of Surface Changes in Platinum Crucibles.

Journal of research of the National Bureau of Standards (1977)·2021
See all related articles

Related Experiment Video

Updated: Oct 19, 2025

Development of an Individual-Tree Basal Area Increment Model using a Linear Mixed-Effects Approach
04:35

Development of an Individual-Tree Basal Area Increment Model using a Linear Mixed-Effects Approach

Published on: July 3, 2020

3.5K

A Note on a Nonlinear Minimax Location Problem in Tree Networks.

Richard L Francis

    Journal of Research of the National Bureau of Standards (1977)
    |September 27, 2021
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a nonlinear minimax tree network location problem. It provides conditions for optimality, methods for computing the optimal value, and constructing the unique optimal location.

    Keywords:
    Facility locationlocation theoryminimaxnetworks

    More Related Videos

    Modeling the Functional Network for Spatial Navigation in the Human Brain
    05:55

    Modeling the Functional Network for Spatial Navigation in the Human Brain

    Published on: October 13, 2023

    1.2K
    A Practical Guide to Phylogenetics for Nonexperts
    12:00

    A Practical Guide to Phylogenetics for Nonexperts

    Published on: February 5, 2014

    35.6K

    Related Experiment Videos

    Last Updated: Oct 19, 2025

    Development of an Individual-Tree Basal Area Increment Model using a Linear Mixed-Effects Approach
    04:35

    Development of an Individual-Tree Basal Area Increment Model using a Linear Mixed-Effects Approach

    Published on: July 3, 2020

    3.5K
    Modeling the Functional Network for Spatial Navigation in the Human Brain
    05:55

    Modeling the Functional Network for Spatial Navigation in the Human Brain

    Published on: October 13, 2023

    1.2K
    A Practical Guide to Phylogenetics for Nonexperts
    12:00

    A Practical Guide to Phylogenetics for Nonexperts

    Published on: February 5, 2014

    35.6K

    Area of Science:

    • Operations Research
    • Network Optimization
    • Computational Geometry

    Background:

    • The minimax tree network location problem is a fundamental problem in facility location.
    • Existing models often assume linear objective functions, which may not capture real-world complexities.
    • Nonlinear objective functions introduce significant analytical and computational challenges.

    Purpose of the Study:

    • To analyze a nonlinear version of the minimax tree network location problem.
    • To derive necessary and sufficient conditions for optimal solutions.
    • To develop methods for computing the optimal objective function value and constructing the unique optimal location.

    Main Methods:

    • Mathematical derivation and analysis of the nonlinear minimax objective function.
    • Development of algorithms for identifying optimal network locations.
    • Proof of optimality conditions and uniqueness of the solution.

    Main Results:

    • Established necessary and sufficient conditions for optimality in the nonlinear minimax tree network location problem.
    • Presented a method for calculating the exact optimal objective function value.
    • Provided a constructive approach to determine the unique optimal network location.

    Conclusions:

    • The presented framework offers a robust solution for nonlinear network location problems.
    • The derived conditions and methods enhance the practical applicability of minimax location models.
    • This research contributes to the theoretical understanding and computational efficiency of network optimization problems.