Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Kendall's Tau Test

Kendall's Tau Test

Kendall's tau test, also known as the Kendall rank coefficient test, is a nonparametric method for assessing association between two variables. This test is particularly useful for identifying significant correlations when the distributions of the sample and population are unknown. Developed in 1938 by the British statistician Sir Maurice George Kendall, the tau coefficient (denoted as τ) serves as a rank correlation coefficient, with values ranging from -1 to +1.
A τ value of +1 indicates that...

Survival Tree

Survival Tree

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 survival tree begins...

Optimization Problems

Optimization Problems

Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...

Ranks

Ranks

Unlike parametric methods, nonparametric statistics are ideal for nominal and ordinal data, requiring fewer assumptions about the population's nature or distribution. This makes nonparametric methods easier to apply and interpret, as they do not depend on parameters like mean or standard deviation. One common approach in nonparametric analysis is to sort data according to a specific criterion. For instance, we might arrange weather data from hottest to coldest days in a month or rank cities...

Sieve Analysis and Grading Curves

Sieve Analysis and Grading Curves

Sieve analysis is a method used to determine the particle size distribution of aggregate materials. This process involves the following steps:

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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

You might also read

Related Articles

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

Sort by

Same author

Allele-specific real-time PCR testing for minor HIV-1 drug resistance mutations: assay preparation and application to reveal dynamic of mutations in vivo.

Chinese medical journal·2011

Same author

Phase synchronization of foot dynamics in quiet standing.

Neuroscience letters·2011

Same author

Multiphase-computed tomography-based target volume definition in conventional fractionated radiotherapy of lung tumors: dosimetric and reliable comparison with the technique using addition of generic margins.

Tumori·2011

Same author

The effect of intracellular amino acids on GSH production by high-cell-density cultivation of Saccharomyces cerevisiae.

Applied biochemistry and biotechnology·2011

Same author

Nitrogen-doped graphene/ZnSe nanocomposites: hydrothermal synthesis and their enhanced electrochemical and photocatalytic activities.

ACS nano·2011

Same author

Dissection of genetic pathways in C. elegans.

Methods in cell biology·2011

Search research articles

Related Experiment Video

Updated: May 7, 2026

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'

Published on: February 10, 2017

Knee point search using cascading top-k sorting with minimized time complexity.

Zheng Wang¹, Shian-Shyong Tseng

¹Computer Network Information Center, Chinese Academy of Sciences, Beijing 100190, China ; China Organizational Name Administration Center, Beijing 100028, China.

Thescientificworldjournal

|September 27, 2013

Summary

This study introduces an efficient algorithm for finding the largest knee point in data, crucial for anomaly detection systems. The method minimizes time complexity using cascading top-k sorting when the knee point

Related Experiment Videos

Last Updated: May 7, 2026

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'

Published on: February 10, 2017

Area of Science:

Computer Science
Data Analysis

Background:

Anomaly detection and various applications require identifying the largest knee point in unsorted data.
Existing methods may face challenges with efficiency and time complexity for this task.

Purpose of the Study:

To propose an efficient knee point search algorithm with minimized time complexity.
To leverage cascading top-k sorting for improved performance when a priori probability distribution is known.

Main Methods:

Development of a top-k sort algorithm based on a quicksort variation.
Decomposition of the knee point search into sequential steps.
Optimization of the selection number k by minimizing the maximum expected time cost at each step.
Iterative updating of posterior probability distributions and parameters.

Main Results:

The proposed algorithm achieves minimized time complexity for largest knee point detection.
Demonstrated efficiency through an application in detecting DNS DoS flooding attacks.

Conclusions:

The novel algorithm offers an efficient solution for identifying the largest knee point.
The method shows practical applicability in real-world scenarios like network security.