MétaCan
Menu
Back to cohort
Record W1992789520 · doi:10.1115/detc2005-84871

Some Special Cases of the Burmester Problem for Four and Five Poses

2005· article· en· W1992789520 on OpenAlexaff
Jorge Angeles, Shaoping Bai

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRobotic Mechanisms and Dynamics
Canadian institutionsMcGill University
Fundersnot available
KeywordsDyadRevolute jointBar (unit)Intersection (aeronautics)Linkage (software)MathematicsPoint (geometry)PlanarCombinatoricsSet (abstract data type)Computer scienceGeometryPsychologyEngineeringSocial psychologyPhysics

Abstract

fetched live from OpenAlex

The Burmester problem aims at finding the geometric parameters of a planar four-bar linkage for a prescribed set of finitely separated poses. The synthesis related to the Burmester problem deals with both revolute-revolute (RR) and prismatic-revolute (PR) dyads. A PR dyad is a special case of RR dyad, i.e., a dyad with one end-point at infinity. The special nature of PR dyads warrants a special treatment, outside of the general methods of four-bar linkage synthesis, which target mainly RR dyads. In this paper, we study the synthesis of planar four-bar linkages addressing the problem of the determination of PR dyads. The conditions for the presence of PR dyads with the prescribed poses are derived. A synthesis method is developed by resorting to the parallelism condition of the displacement vectors of the circle points of PR dyads. We show that the “circle” point of a PR dyad can be determined as one common intersection of three or four circles, depending on whether four or, correspondingly, five poses are prescribed.

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.

How this classification was reachedexpand

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: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.550
Threshold uncertainty score0.127

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.201
Teacher spread0.189 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations21
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Mechanisms and DynamicsFrench-language works237,207