The role of deep learning-based variable speed running training method in agility improvement of badminton players
Bibliographic record
Abstract
Variable speed running training method is an efficient training method targeting the improvement of athletes' agility.In this paper, 30 male students from two badminton special classes of physical education majoring in a college of 2021 were selected as experimental subjects, and hexagonal ball reaction test, hexagonal jump test, repeated straddle test, standing bench press test, closed-eye in-situ step test, and low gravity center of gravity quadrangular running test were chosen as the evaluation indexes of agility quality.A new high-resolution multi-scale feature fusion network was designed for running stance estimation, and the effects of variable speed running training method and conventional agility training on the agility quality of young badminton players were analyzed.The performance curve of the RHPNet designed in this paper has low convergence difficulty and high recognition accuracy, which tends to 0.83, and performs much better than the LSTM network.The intergroup data after the experiments of the experimental group and the control group show that there are significant differences in the performance of the hexagonal jump test, the 20s repeated straddle test, the hexagonal ball reaction test, and the closed-eye in-situ step test.It verifies the effectiveness of the network designed in this paper in the estimation of athletes' movements during running, and also shows that the training effect of variable speed running training is better than that of conventional agility training.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.007 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".