Related Experiment Video
Updated: Aug 16, 2026

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
Published on: July 14, 2015
Avoiding spurious submovement decompositions: a globally optimal algorithm
Brandon Rohrer1, Neville Hogan
1Intelligent Systems and Robotics Center, Sandia National Laboratories, Albuquerque, NM 87185, USA. brrohre@sandia.gov
Abstract:
Evidence for the existence of discrete submovements underlying continuous human movement has motivated many attempts to "extract" them. Although they produce visually convincing results, all of the methodologies that have been employed are prone to produce spurious decompositions. Examples of potential failures are given. A branch-and-bound algorithm for submovement extraction, capable of global nonlinear minimization (and hence capable of avoiding spurious decompositions), is developed and demonstrated.
Related Concept Videos
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Statically Indeterminate Problem Solving
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Optimization Problems
Rationalizing Substitutions
Methods of Medium Optimization