MétaCan
Menu
Back to cohort
Record W2563307839 · doi:10.1145/2996913.2996991

Fast transportation network traversal with hyperedges

2016· article· en· W2563307839 on OpenAlexaff
Petko Bakalov, Erik Hoel, Wee-Liang Heng

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicData Management and Algorithms
Canadian institutionsEsri (Canada)
Fundersnot available
KeywordsComputer scienceScalabilityTree traversalEnhanced Data Rates for GSM EvolutionJoinsFlow networkDistributed computingSortingRelational databaseDatabaseAlgorithm

Abstract

fetched live from OpenAlex

Network data models are frequently used as a mechanism to solve wide range of problems typical for the GIS applications and transportation planning in particular. Because of their popularity and efficiency those models tend to grow in size and complexity. This growth however creates multiple scalability issues caused by the large number of network elements that have to be examined during the network traversal. In this paper we present an extension of our network model tailored towards improving the performance of hierarchical point to point solve operations. The proposed solution is based on introducing a new network edge type that we term hyperedges. We describe how hyperedges can be specified with a re-interpretation of our existing any-vertex connectivity policy on edges, discusses some modeling issues, and also provide insights of our implementation experience and the impact which those novel network elements have on the solve performance. Our solution is based on the existing database functionality (tables, joins, sorting algorithms) provided by a standard relational DBMS and has been implemented and tested and currently being shipped as a part of the ESRI ArcGIS 10.1 platform and all subsequent releases.

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 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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.808
Threshold uncertainty score0.121

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.0000.000
Scholarly communication0.0000.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.007
GPT teacher head0.181
Teacher spread0.174 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designOther design
Domainnot available
GenreMethods

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

Quick stats

Citations1
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicData Management and AlgorithmsFrench-language works237,207