MétaCan
Menu
Back to cohort
Record W1593312846 · doi:10.1109/robot.1988.12285

Computer simulation of elastic chains using a recursive formulation

2003· article· en· W1593312846 on OpenAlex
Inna Sharf, G.M.T. D’Eleuterio

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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicDynamics and Control of Mechanical Systems
Canadian institutionsUniversity of Toronto
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsFlexibility (engineering)Chain (unit)Translation (biology)Link (geometry)Computer scienceEuler's formulaRotation (mathematics)Dynamics (music)Topology (electrical circuits)Manipulator (device)AlgorithmApplied mathematicsSimulationTheoretical computer scienceMathematicsArtificial intelligenceMathematical analysisPhysicsCombinatoricsRobotChemistry

Abstract

fetched live from OpenAlex

A computer simulation procedure for the dynamics of topological chains, using a recursive Newton-Euler formulation, is presented. The bodies of the chain are, in general, elastic and the joints can permit arbitrary (rotational and/or translational) interbody motion. Relative interbody translation, however, is assumed small. As an example, a three-link quasianthropomorphic flexible-link manipulator is studied. The simulation results underscore the importance of modeling structural flexibility.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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.000
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.809
Threshold uncertainty score0.188

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
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.219
Teacher spread0.207 · 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