MétaCan
Menu
Back to cohort
Record W2491352701 · doi:10.1080/10255842.2016.1205043

Muscle wrapping on arbitrary meshes with the heat method

2016· article· en· W2491352701 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueComputer Methods in Biomechanics & Biomedical Engineering · 2016
Typearticle
Languageen
FieldEngineering
TopicMuscle activation and electromyography studies
Canadian institutionsUniversity of Saskatchewan
FundersNatural Sciences and Engineering Research Council of CanadaUniversity of Rochester
KeywordsPolygon meshRobustness (evolution)ComputationComputer sciencePath (computing)GeometryDifferential (mechanical device)AlgorithmMathematicsPhysicsComputer graphics (images)Chemistry

Abstract

fetched live from OpenAlex

Muscle paths play an important role in musculoskeletal simulations by determining a muscle's length and how its force is distributed to joints. Most previous approaches estimate the way in which muscles 'wrap' around bones and other structures with smooth analytical wrapping surfaces. In this paper, we employ Newton's method with discrete differential geometry to permit muscle wrapping over arbitrary polygonal mesh surfaces that represent underlying bones and structures. Precomputing distance fields allows us to speed up computations for the common situation where many paths cross the same wrapping surfaces. We found positive results for the accuracy, robustness, and efficiency of the method. However the method did not exhibit continuous changes in path length for dynamic simulations. Nonetheless this approach provides a valuable step toward fast muscle wrapping on arbitrary meshes.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.842
Threshold uncertainty score0.770

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.012
GPT teacher head0.268
Teacher spread0.256 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it