MétaCan
Menu
Back to cohort
Record W2036679198 · doi:10.1109/acssc.2014.7094542

Detecting convoys in networks of short-ranged sensors

2014· article· en· W2036679198 on OpenAlex
Sean Lawlor, Michael Rabbat

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.

Bibliographic record

Venue2014 48th Asilomar Conference on Signals, Systems and Computers · 2014
Typearticle
Languageen
FieldComputer Science
TopicAnomaly Detection Techniques and Applications
Canadian institutionsMcGill University
Fundersnot available
KeywordsComputer scienceLicenseMarkov chainMarkov processConstruct (python library)Hidden Markov modelProperty (philosophy)Process (computing)False positive paradoxSeries (stratigraphy)Data miningArtificial intelligenceReal-time computingMachine learningComputer networkMathematics

Abstract

fetched live from OpenAlex

Detecting groups of vehicles travelling together as a convoy is an important problem in military and law enforcement applications. License plate recognition sensors provide discrete, irregularly sampled, time series information about where vehicles are travelling. With this irregular time series, we would like to determine when vehicles travel as a convoy. We construct a semi-Markov process to model network traffic and utilize the Markov property to develop a sequential hypothesis test. This requires defining two models for how vehicles travel through the network and testing the likelihood between them. The main contribution of this work is the modeling of the alternate hypothesis of when two vehicles are traveling as a convoy. We present performance results based on simulated data showing the tradeoff between false-positives and true detections.

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.001
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.953
Threshold uncertainty score0.852

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.023
GPT teacher head0.243
Teacher spread0.220 · 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