MétaCan
Menu
Back to cohort
Record W2112695860 · doi:10.1142/s021819590800257x

BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES

2008· article· en· W2112695860 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueInternational Journal of Computational Geometry & Applications · 2008
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsUniversity of British ColumbiaMcGill University
FundersMitacsSimon Fraser University
KeywordsEuclidean geometryBounded functionMathematicsEuclidean distancePlane (geometry)RADIUSClosenessCombinatoricsSet (abstract data type)TrajectoryGeometryMathematical analysisComputer sciencePhysics

Abstract

fetched live from OpenAlex

Given a set P of points (clients) in the plane, a Euclidean 2-centre of P is a set of two points (facilities) in the plane such that the maximum distance from any client to its nearest facility is minimized. Geometrically, a Euclidean 2-centre of P corresponds to a cover of P by two discs of minimum radius r (the Euclidean 2-radius). Given a set of mobile clients, where each client follows a continuous trajectory in the plane with bounded velocity, the motion of the corresponding mobile Euclidean 2-centre is not necessarily continuous. Consequently, we consider strategies for defining the trajectories of a pair of mobile facilities that guarantee a fixed-degree approximation of the Euclidean 2-centre while maintaining bounded relative velocity. In an attempt to balance the conflicting goals of closeness of approximation and a low maximum relative velocity, we introduce reflection-based 2-centre functions by reflecting the position of a mobile client across the mobile Steiner centre and the mobile rectilinear 1-centre, respectively.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.532
Threshold uncertainty score0.663

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.018
GPT teacher head0.287
Teacher spread0.269 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it