MétaCan
Menu
Back to cohort
Record W2242196695 · doi:10.1137/140986438

Optimal Attitude Control with Two Rotation Axes

2019· preprint· en· W2242196695 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.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueSIAM Journal on Control and Optimization · 2019
Typepreprint
Languageen
FieldMathematics
TopicAdvanced Algebra and Geometry
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsRotation (mathematics)Euler anglesSequence (biology)Euler's rotation theoremMathematicsControl (management)Angle of rotationEuler's formulaDecompositionSpacecraftControl theory (sociology)Optimal controlGeometryComputer scienceMathematical analysisPhysicsMathematical optimizationArtificial intelligence

Abstract

fetched live from OpenAlex

Euler proved that every rotation of a 3-dimensional body can be realized as a sequence of three rotations around two given axes. If we allow sequences of an arbitrary length, such a decomposition will not be unique. In this paper we solve an optimal control problem minimizing the total angle of rotation for such sequences. We give the list of possible patterns that describe an optimal decomposition of an arbitrary rotation. Our results may be applied to the attitude control of a spacecraft with two available axes of rotation.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.862
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.001
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.013
GPT teacher head0.282
Teacher spread0.269 · 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