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

Parallel-axis Theorem

Parallel-axis Theorem

The parallel-axis theorem provides a convenient and quick method of finding the moment of inertia of an object about an axis parallel to the axis passing through its center of mass. Consider a thin rod as an example. There is a striking similarity between the process of finding the moment of inertia of a thin rod about an axis through its middle, where the center of mass lies, and about an axis through its end using the conventional method. In the conventional method, the concept of linear mass...

Graphical Representation of Inequalities

Graphical Representation of Inequalities

The graph of the equation where y equals x squared forms a curve known as a parabola. This curve acts as a boundary in the coordinate plane, dividing it into distinct regions based on the relative position of points.When the equality sign in the equation is replaced with an inequality—such as greater than, less than, greater than or equal to, or less than or equal to—the graphical representation changes from a single curve into a broader shaded area that signifies the set of all points...

Theorems of Pappus and Guldinus: Problem Solving

Theorems of Pappus and Guldinus: Problem Solving

Pappus and Guldinus's theorems are powerful mathematical principles that are used for finding the surface area and volume of composite shapes. For example, consider a cylindrical storage tank with a conical top. Finding the surface area or volume can be challenging for such complex shapes. These theorems are particularly useful in calculating the volume and surface area of such systems. Here, the cylindrical storage tank with a conical top can be broken down into two simple shapes: a cylinder...

Parallel-Axis Theorem for an Area

Parallel-Axis Theorem for an Area

The moment of inertia is a fundamental concept in mechanical engineering that plays a significant role in designing rotationally symmetric objects such as flywheels, gears, and other mechanical systems. In this context, we will discuss the moment of inertia of a flywheel rotating about its centroidal axis and how it relates to the moment of inertia about an axis parallel to it.
For a flywheel approximated as a solid disc, consider an infinitesimal differential element with an arbitrary distance...

Solving Inequalities Graphically

Solving Inequalities Graphically

Solving inequalities graphically involves using a visual approach to determine where a mathematical expression meets a specific condition, such as being greater than or less than another value. By examining the position of a graph relative to the x-axis or another graph, it becomes possible to identify the range of x-values that satisfy the inequality. This method provides an intuitive understanding of solution intervals by showing where the inequality holds true.Graphical solutions to...

Block Diagram Reduction

Block Diagram Reduction

The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...

You might also read

Related Articles

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

Sort by

Same author

Beyond Parametric Boundaries: Rethinking the Distributed Lag Nonlinear Model in Meteorological Modelling for Oncology Emergencies.

Clinical oncology (Royal College of Radiologists (Great Britain))·2025

Same author

PROCESS guided case series of primary targeted muscle reinnervation and regenerative peripheral nerve interfaces in the prevention of post amputation and phantom limb pain.

Injury·2025

Same author

Chi-square and P-values versus machine learning feature selection.

Annals of oncology : official journal of the European Society for Medical Oncology·2024

Same author

Exploring the impact of dental metal ions.

British dental journal·2024

Same author

Worldwide burnout in dentists.

British dental journal·2024

Same author

Oral health's role in disease prevention.

British dental journal·2024

Search research articles

Related Experiment Video

Updated: Jul 7, 2026

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

A parallel improvement algorithm for the bipartite subgraph problem.

K C Lee¹, N Funabiki, Y Takefuji

¹Cirrus Logic Inc., Fremont, CA.

IEEE Transactions on Neural Networks

|January 1, 1992

Summary

This summary is machine-generated.

Researchers developed a novel parallel algorithm for the bipartite subgraph problem, achieving superior solutions faster than existing methods. This advancement also extends to the K-partite subgraph problem, offering a new computational approach.

Related Experiment Videos

Last Updated: Jul 7, 2026

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

Area of Science:

Graph theory
Computational complexity
Artificial intelligence

Background:

The bipartite subgraph problem is an NP-complete problem requiring the removal of minimum edges to create a bipartite graph.
Existing algorithms for this problem have limitations in efficiency and solution quality.

Purpose of the Study:

To introduce the first parallel improvement algorithm for the bipartite subgraph problem.
To extend this algorithm to the more general K-partite subgraph problem.

Main Methods:

Utilized a maximum neural network model for a parallel improvement approach.
Simulated a large number of instances to validate the algorithm's performance.

Main Results:

The proposed algorithm consistently finds solutions within 200 iterations.
Achieved superior solution quality compared to the best-known existing algorithms.
Successfully extended the algorithm to the K-partite subgraph problem, an area with no prior algorithmic solutions.

Conclusions:

The novel parallel algorithm offers a significant improvement for solving the bipartite subgraph problem.
This research opens new avenues for addressing the K-partite subgraph problem computationally.