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

Rationalizing Substitutions01:29

Rationalizing Substitutions

86
Integrals involving non-rational functions are often difficult to evaluate using standard techniques, especially when radicals appear in the integrand. Rationalizing substitution provides a systematic method for simplifying such integrals by converting them into rational forms that are easier to handle.Consider a rod whose linear mass density depends on a constant linear density, a characteristic length, and the distance from the left end of the rod. Determining the total mass requires...
86
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

4.2K
Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
4.2K
Methods of Medium Optimization01:28

Methods of Medium Optimization

15
Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...
15
Lattice Centering and Coordination Number02:33

Lattice Centering and Coordination Number

14.8K
The structure of a crystalline solid, whether a metal or not, is best described by considering its simplest repeating unit, which is referred to as its unit cell. The unit cell consists of lattice points that represent the locations of atoms or ions. The entire structure then consists of this unit cell repeating in three dimensions. The three different types of unit cells present in the cubic lattice are illustrated in Figure 1.
Types of Unit Cells
Imagine taking a large number of identical...
14.8K
[3,3] Sigmatropic Rearrangement of 1,5-Dienes: Cope Rearrangement01:21

[3,3] Sigmatropic Rearrangement of 1,5-Dienes: Cope Rearrangement

3.6K
The Cope rearrangement is classified as a [3,3] sigmatropic shift in 1,5-dienes, leading to a more stable, isomeric 1,5-diene. The reaction involves a concerted movement of six electrons, four from two π bonds and two from a σ bond, via an energetically favorable chair-like transition state.
3.6K
Simpson's Rule II01:28

Simpson's Rule II

152
In warehouse roofing applications, corrugated or curved metal sheets are commonly used to improve structural strength, water drainage, and ventilation efficiency. To accurately estimate material requirements and optimize design parameters, engineers must determine the curved surface area of these sheets. Because the sheet profiles often repeat smoothly along their length, they can be effectively approximated by parabolic curves, enabling the use of numerical integration techniques for area...
152

You might also read

Related Articles

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

Sort by
Same author

A Combinatorial Approach to Synthetic Data Generation for Machine Learning.

SN computer science·2026
Same author

Input Space Coverage Matters.

Computer·2025
Same author

Combinatorial Test Generation for Multiple Input Models with Shared Parameters.

IEEE transactions on pattern analysis and machine intelligence·2024
Same author

A Trusted Federated System to Share Granular Data Among Disparate Database Resources.

Computer·2024
Same author

Estimating <i>t</i>-way Fault Profile Evolution During Testing.

Proceedings : Annual International Computer Software and Applications Conference. COMPSAC·2024
Same author

Optimal phylogenetic reconstruction of insertion and deletion events.

Bioinformatics (Oxford, England)·2024
Same journal

Precise Numerical Differentiation of Thermodynamic Functions with Multicomplex Variables.

Journal of research of the National Institute of Standards and Technology·2024
Same journal

Characterization of 3-Dimensional Printing and Casting Materials for use in Computed Tomography and X-ray Imaging Phantoms.

Journal of research of the National Institute of Standards and Technology·2024
Same journal

On The Quotient of a Centralized and a Non-centralized Complex Gaussian Random Variable.

Journal of research of the National Institute of Standards and Technology·2024
Same journal

Fast Methods for Finding Multiple Effective Influencers in Real Networks.

Journal of research of the National Institute of Standards and Technology·2024
Same journal

Disinfection of Respirators with Ultraviolet Radiation.

Journal of research of the National Institute of Standards and Technology·2024
Same journal

DNA Origami Design: A How-To Tutorial.

Journal of research of the National Institute of Standards and Technology·2024
See all related articles

Related Experiment Video

Updated: Mar 22, 2026

New Variations for Strategy Set-shifting in the Rat
09:45

New Variations for Strategy Set-shifting in the Rat

Published on: January 23, 2017

8.7K

Refining the In-Parameter-Order Strategy for Constructing Covering Arrays.

Michael Forbes1, Jim Lawrence1, Yu Lei2

  • 1National Institute of Standards and Technology, Gaithersburg, MD 20899.

Journal of Research of the National Institute of Standards and Technology
|April 21, 2016
PubMed
Summary
This summary is machine-generated.

This study introduces improved methods for constructing covering arrays, significantly reducing testing runtime and array size. The new algorithm enhances efficiency for software and hardware blackbox testing.

Keywords:
blackbox testingcovering arrayspairwise and higher strength testing

More Related Videos

Flow-pattern Guided Fabrication of High-density Barcode Antibody Microarray
09:05

Flow-pattern Guided Fabrication of High-density Barcode Antibody Microarray

Published on: January 6, 2016

22.2K
Author Spotlight: Accelerating Discovery in Microporous Material Chemistry
07:20

Author Spotlight: Accelerating Discovery in Microporous Material Chemistry

Published on: October 6, 2023

4.6K

Related Experiment Videos

Last Updated: Mar 22, 2026

New Variations for Strategy Set-shifting in the Rat
09:45

New Variations for Strategy Set-shifting in the Rat

Published on: January 23, 2017

8.7K
Flow-pattern Guided Fabrication of High-density Barcode Antibody Microarray
09:05

Flow-pattern Guided Fabrication of High-density Barcode Antibody Microarray

Published on: January 6, 2016

22.2K
Author Spotlight: Accelerating Discovery in Microporous Material Chemistry
07:20

Author Spotlight: Accelerating Discovery in Microporous Material Chemistry

Published on: October 6, 2023

4.6K

Area of Science:

  • Computer Science
  • Software Engineering
  • Information Technology

Background:

  • Covering arrays are essential for representing large input spaces in blackbox testing.
  • Existing methods like In-Parameter-Order have limitations in efficiency.

Purpose of the Study:

  • To propose refined strategies for constructing homogeneous-alphabet covering arrays.
  • To improve the efficiency and reduce the size of covering arrays.

Main Methods:

  • Refinement of the In-Parameter-Order strategy for covering array construction.
  • Development of a new algorithm for generating covering arrays.

Main Results:

  • Runtime reductions exceeding 5x, with some cases up to 280x.
  • Achieved approximately 5% smaller covering arrays.
  • Constructed numerous literature-record smallest covering arrays.
  • A heuristic variant offers faster execution with comparable array sizes.

Conclusions:

  • The proposed refinements significantly enhance the efficiency of covering array generation.
  • The new algorithm produces smaller and more efficiently generated covering arrays.
  • This advancement benefits software and hardware blackbox testing.