SafeWatch
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.
Bibliographic record
Abstract
Driving while distracted or losing alertness significantly increases the risk of traffic accident. The emerging Internet of Things (IoT) systems for smart driving hold the promise of significantly reducing road accidents. In particular, detecting unsafe hand motions and warning the driver using smart sensors can improve the driver’s alertness and skill. However, due to the impact of the vehicle’s movement and the significant variation across different driving environments, detecting the position of the driver’s hand is challenging. This article presents SafeWatch—a system based on smartwatches and smartphones that detects the driver’s unsafe behaviors in a real-time manner. SafeWatch infers driver’s hand position based on several important features, such as the posture of the driver’s forearm and the vibration on the smartwatch. SafeWatch employs a novel adaptive training algorithm that keeps updating the training data set at run-time based on inferred hand positions in certain driving conditions. The evaluation with 75 real driving trips from six subjects shows that SafeWatch has a high accuracy over 97.0% for both recall and precision in detection of the unsafe hand positions when the condition lasts for more than 6.0 s , as well as over 97.1% recall and over 91.0% precision in detection of the unsafe hand movements when it lasts for more than 2.5 s . The relative position of the hand to the steering wheel also reveals some detailed driving habits, like the type of steering method.
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 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.000 | 0.000 |
| 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.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.009 | 0.050 |
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 it