MétaCan
Menu
Back to cohort
Record W2608524074 · doi:10.5539/cis.v10n2p30

Research on Traffic Flow Statistics Algorithm Based on Inter - Frame Similarity

2017· article· en· W2608524074 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueComputer and Information Science · 2017
Typearticle
Languageen
FieldEngineering
TopicSimulation and Modeling Applications
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceBackground subtractionFrame (networking)Similarity (geometry)AlgorithmLoop (graph theory)Traffic flow (computer networking)Flow (mathematics)Data miningArtificial intelligenceImage (mathematics)MathematicsPixel

Abstract

fetched live from OpenAlex

Considering some existing shortcomings in traffic flow statistics algorithm based on background subtraction and virtual loop, according to the change discipline of inter-frame similarity while vehicles passing in and out the virtual loop, we come up with a traffic flow statistics algorithm based on inter - frame similarity, which is able to overcome two problems: one is missed inspection since some detection targets are close to background color; the other one is repeated detection resulting from over-low speed, then we carry out the experimental results by using the algorithm.

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.923
Threshold uncertainty score0.520

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0010.001
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.061
GPT teacher head0.360
Teacher spread0.299 · 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