Bibliographic record
Abstract
This paper presents the development of a mathematical model and computer simulation of an ROV tether operating in low-tension situations. This model makes use of a lumped mass approach in which the ROV tether is considered to be a system of point masses connected by visco-elastic springs. Using this approach, the formulation of the equations of motion for each of the point masses is explicit. The positions and velocities of the point masses at time t are used to calculate the internal and hydrodynamic forces which are, in turn, used to solve for the accelerations. Direct numerical integration is then used to calculate the positions and velocities at a time t+/spl Delta/t. Although this formulation is stable when the tension in the tether disappears, it is necessary to include bending effects in order to generate realistic results for low-tension maneuvers. The present work accomplishes this by first assuming that all sections of the tether have negligible rotational inertia. As a result, the curvature in the tether at any point can be related to the internal bending forces. This relation is then discretized using the Galerkin method of weighted residuals, to allow calculation of the bending forces at the node points. The mathematical model was implemented in C/C++ and was used to model several tether maneuvers. In a static validation test case in which a constant bending moment was applied at the ends of the discretized tether, the model agreed within 4% with the exact analytical solution. To facilitate a qualitative review of the bending model, the modeled tether was harmonically oscillated at one end. This generated slack, coiled sections of tether which showed a strong tendency to uncoil and straighten the tether.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 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.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 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".