A biomechanical model for encoding joint dynamics: applications to transfemoral prosthesis control
Bibliographic record
Abstract
This paper presents and tests a framework for encoding joint dynamics into energy states using kinematic and kinetic knee joint sensor data and demonstrates how to use this information to predict the future energy state (torque and velocity requirements) of the joint without a priori knowledge of the activity sequence. The intended application is for enhancing micro-controlled prosthetics by making use of the embedded sensory potential of artificial limbs and classical mechanical principles of a prosthetic joint to report instantaneous energy state and most probable next energy state. When applied to the knee during preferred and fast speed walking in 8 human subjects (66 preferred-speed trials and 50 fast-speed trials), it was found that joint energy states could be consistently sequenced (75% consensus) according to mechanical energy transference conditions and subsequences appeared to reflect the stability and energy dissipation requirements of the knee during gait. When simple constraints were applied to the energy transfer input conditions (their signs), simulations indicated that it was possible to predict the future energy state with an accuracy of >80% when 2% cycle in advance (∼20 ms) of the switch and >60% for 4% (∼40 ms) in advance. This study justifies future research to explore whether this encoding algorithm can be used to identify submodes of other human activity that are relevant to TFP control, such as chair and stair activities and their transitions from walking, as well as unexpected perturbations.
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
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".