MétaCan
Menu
Back to cohort
Record W4386829003 · doi:10.52209/1609-1825_2023_2_174

10.52209/1609-1825_2023_2_174

2023· article· en· W4386829003 on OpenAlexaff
С. Ж. Кабикенов, Aidana Sungatollakyzy, В. С. Шалаев, Zakir MAKSUDOV

Bibliographic record

VenueTrudy Universiteta · 2023
Typearticle
Languageen
FieldEngineering
TopicTransportation Systems and Logistics
Canadian institutionsCanadian Association of Nurses in Oncology
Fundersnot available
KeywordsMinificationSet (abstract data type)Process (computing)Computer scienceRowMatrix (chemical analysis)Mathematical modelData setBasis (linear algebra)Mathematical optimizationMathematicsArtificial intelligenceStatistics

Abstract

fetched live from OpenAlex

A mathematical model is presented for obtaining data on reduced costs, which can be used in the optimization of machine sets to improve the recruitment process for mechanized detachments during road construction. The mathematical model for calculating the reduced costs, taking into account the probability coefficients for the use of equipment in the set, is built on the basis of a matrix that includes nine columns for types of machines and six rows for the main road construction technologies. By changing the basic input data, the model allows you to automatically recalculate all data. By applying the minimization criterion, it is possible to choose such a set that the total reduced costs for each set of machines and for each technology would be minimal. Optimization of a set of machines of various sizes for mechanized detachments, when designing roads, will reduce the time for building roads and reduce costs.

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 imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Other · Consensus signal: Other
Teacher disagreement score0.091
Threshold uncertainty score0.130

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.001
Scholarly communication0.0030.003
Open science0.0020.002
Research integrity0.0030.001
Insufficient payload (model declined to judge)0.9090.910

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.015
GPT teacher head0.177
Teacher spread0.162 · 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; the direct Gemma label and the distilled Codex classifier agree on what is shown here.

Study designNot applicable
Domainnot available
GenreOther

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

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueTrudy UniversitetaSame topicTransportation Systems and LogisticsFrench-language works237,207