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

Synthesis and Decomposition Reactions02:17

Synthesis and Decomposition Reactions

38.2K
Synthesis and decomposition are two types of redox reactions. Synthesis means to make something, whereas decomposition means to break something. The reactions are accompanied by chemical and energy changes. 
38.2K
Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

407
The sign test for matched pairs offers a robust method for comparing two paired samples, often for the effects of an intervention in one of them. This method is very useful in situations where the underlying distribution of the data is unknown. The test compares two related samples—often pre- and post-treatment measurements on the same subjects—to determine if there are significant differences in their median values.
To conduct the sign test, we first calculate the differences in...
407
pH Scale02:41

pH Scale

79.7K
Hydronium and hydroxide ions are present both in pure water and in all aqueous solutions, and their concentrations are inversely proportional as determined by the ion product of water (Kw). The concentrations of these ions in a solution are often critical determinants of the solution’s properties and the chemical behaviors of its other solutes. Two different solutions can differ in their hydronium or hydroxide ion concentrations by a million, billion, or even trillion times. A common means of...
79.7K
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

492
The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...
492
Mixing Concrete01:30

Mixing Concrete

382
Concrete mixing ensures a homogenous blend where aggregates are well-coated with cement paste. Concrete mixing is typically done using two main types of mixers: batch and continuous. Batch mixers handle one batch at a time, thoroughly combining materials before discharging and receiving the next batch. In contrast, continuous mixers receive a steady flow of ingredients, mixing them consistently and discharging without interruption. Within batch mixers, tilting drum mixers mix with internal...
382
Mixing Time01:19

Mixing Time

481
The concept of mixing time is significant in producing a uniform concrete mix with the required strength. The mixing period starts once all components are in the mixer. Initially, the mixer is charged with 10% of the water, followed by the consistent addition of solids and then 80% of the water. The remaining water is added later, within the first quarter of the mixing period. The minimum mixing time varies according to the mixer's capacity; for example, mixers with up to 1 cubic yard...
481

You might also read

Related Articles

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

Sort by
Same author

A highly sensitive and specific electrochemical sensing method for robust detection of Escherichia coli lac Z gene sequence.

Biosensors & bioelectronics·2015
Same author

Stereoselective intermolecular nitroaminoxylation of terminal aromatic alkynes: trapping alkenyl radicals by TEMPO.

Organic letters·2014
Same author

Correlation between red blood cell transfusion volume and mortality in patients with massive blood transfusion: A large multicenter retrospective study.

Experimental and therapeutic medicine·2014
Same author

[Sampling survey of schistosomiasis prevention knowledge among middle school students in endemic areas of Hubei Province].

Zhongguo xue xi chong bing fang zhi za zhi = Chinese journal of schistosomiasis control·2014
Same author

Synthesis of ultrahighly electron-deficient pyrrolo[3,4-d]pyridazine-5,7-dione by inverse electron demand Diels-Alder reaction and its application as electrochromic materials.

Organic letters·2014
Same author

Quantitative proteomics analysis by iTRAQ in human nuclear cataracts of different ages and normal lens nuclei.

Proteomics. Clinical applications·2014

Related Experiment Video

Updated: Jan 31, 2026

Constructing and Visualizing Models using Mime-based Machine-learning Framework
06:19

Constructing and Visualizing Models using Mime-based Machine-learning Framework

Published on: July 22, 2025

2.5K

A CUR Decomposition-Based Mix-Order Framework for Large-Scale Hypergraph Matching.

Qixuan Zheng, Ming Zhang, Hong Yan

    IEEE Transactions on Pattern Analysis and Machine Intelligence
    |January 29, 2026
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a new framework for hypergraph matching using CUR decomposition to create sparser, more reliable compatibility tensors. This method significantly improves computational efficiency and accuracy in large-scale matching problems.

    More Related Videos

    Engineering Adherent Bacteria by Creating a Single Synthetic Curli Operon
    15:28

    Engineering Adherent Bacteria by Creating a Single Synthetic Curli Operon

    Published on: November 16, 2012

    15.0K
    Culture and Assay of Large-Scale Mixed-Stage Caenorhabditis elegans Populations
    08:51

    Culture and Assay of Large-Scale Mixed-Stage Caenorhabditis elegans Populations

    Published on: May 5, 2021

    5.6K

    Related Experiment Videos

    Last Updated: Jan 31, 2026

    Constructing and Visualizing Models using Mime-based Machine-learning Framework
    06:19

    Constructing and Visualizing Models using Mime-based Machine-learning Framework

    Published on: July 22, 2025

    2.5K
    Engineering Adherent Bacteria by Creating a Single Synthetic Curli Operon
    15:28

    Engineering Adherent Bacteria by Creating a Single Synthetic Curli Operon

    Published on: November 16, 2012

    15.0K
    Culture and Assay of Large-Scale Mixed-Stage Caenorhabditis elegans Populations
    08:51

    Culture and Assay of Large-Scale Mixed-Stage Caenorhabditis elegans Populations

    Published on: May 5, 2021

    5.6K

    Area of Science:

    • Computer Vision
    • Machine Learning
    • Graph Theory

    Background:

    • Hypergraph matching is computationally expensive due to exponentially increasing costs.
    • Existing methods like Kd-tree-based approximate nearest neighbor (ANN) require high density for accuracy and struggle with large-scale problems.

    Purpose of the Study:

    • To develop an efficient cascaded second and third-order framework for hypergraph matching.
    • To introduce a novel CUR decomposition-based method for generating sparse compatibility tensors.
    • To propose a new metric, the reliability rate, for quantifying tensor reliability.

    Main Methods:

    • A cascaded framework combining second and third-order matching.
    • CUR decomposition for efficient sparse compatibility tensor generation.
    • Probability Relaxation Labeling (PRL) for hypergraph matching utilizing prior knowledge.

    Main Results:

    • The proposed method generates compatibility tensors over ten times sparser than existing approaches.
    • The generated tensors demonstrate higher reliability, leading to improved matching performance.
    • Experimental results on large-scale datasets validate the framework's superiority over current methods.

    Conclusions:

    • The CUR decomposition-based tensor generation significantly enhances hypergraph matching efficiency and reliability.
    • This method offers a substantial reduction in computational cost and memory footprint.
    • The proposed framework is integrable with existing hypergraph matching algorithms, boosting their performance.