Bibliographic record
Abstract
Abstract. PPP-RTK has been widely investigated to take the advantages of both real-time kinematic (RTK) and precise point positioning (PPP) techniques. Prior to PPP-RTK, the conventional RTK based on the use of a single base station, on the one hand, has been extended to work within a regional network of multiple base stations, known as network RTK (NRTK). The RTK and NRTK enable fast ambiguity resolution over a short baseline or a local region. PPP, on the other hand, eliminates the need to establish any local network like NRTK, which is able to work in a single receiver mode but it suffers long convergence time in ambiguity resolution. PPP-RTK therefore can provide fast ambiguity resolution capability like RTK and NRTK. Current PPP-RTK techniques however still face challenges in supporting mass-market applications such as mobile devices and autonomous vehicles. Although PPP-RTK system (a combination of RTK and PPP technologies) can help expand the coverage of RTK and speed up the ambiguity resolution in PPP, the deployment and maintenance of a dense network of permanent base stations and a central data processing infrastructure for generation of SSR corrections increases not only the system cost but also the system complexity. This is particularly an obstacle for mass-market applications. In this paper, a new RTK approach is described. First it is based on a single base station state-space-representation (SSR) correction generation strategy to support fast ambiguity resolved PPP. Further it presents a new peer-to-peer propagation strategy to form a real-time dynamically generated network of base stations to support mass-market application users with unbounded coverage. As a result, the new approach eliminates the need to deploy and maintain a dense network of permanent base stations and central data processing infrastructure as required in a conventional PP-RTK system.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.005 | 0.003 |
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".