Bibliographic record
Abstract
We propose a computational-kinematics approach based on elimination procedures to synthesize a steering four-bar linkage. In this regard, we aim at minimizing the root-mean square error of the synthesized linkage in meeting the steering condition over a number of linkage configurations within the linkage range of motion. A minimization problem is thus formulated, whose normality conditions lead to two polynomial equations in two unknown design variables. Upon eliminating one of these two variables, a monovariate polynomial equation is obtained, whose roots yield all locally-optimum linkages. From these roots, the global optimum, as well as unfeasible local optima, are readily identified. The global optimum, however, turns out to be impractical because of the large differences in its link lengths, which we refer to as dimensional unbalance. To cope with this drawback, we use a kinematically-equivalent focal mechanism, i.e., a six-bar linkage with an input-output function identical to that of the four-bar linkage. Given that the synthesized linkage requires a rotational input, as opposed to most existing steering linkages, which require a translational input, we propose a spherical four-bar linkage to drive the steering linkage. The spherical linkage is synthesized so as to yield a speed reduction as close as possible to 2:1 and to have a maximum transmission quality.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".