MétaCan
Menu
Back to cohort
Record W4366607838 · doi:10.1109/mdat.2022.3221909

Special Issue on Approximate Computing: Challenges, Methodologies, Algorithms, and Architectures for Dependable and Secure Systems

2023· article· en· W4366607838 on OpenAlexaff
Alberto Bosio, Mario Barbareschi, Alessandro Savino, Jie Han, Jürgen Teich

Bibliographic record

VenueIEEE Design and Test · 2023
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsComputer scienceCloud computingEnergy consumptionMobile broadbandBroadbandDistributed computingWirelessTelecommunicationsMobile cloud computingMobile deviceMobile computingElectricityComputer securityComputer networkWorld Wide WebEngineeringElectrical engineering

Abstract

fetched live from OpenAlex

The current trend in energy resources shapes how computing systems will address new challenges in the following years. As a matter of fact, following the current trend, by 2040, computers will require more energy than the world’s resources can generate. In the very upcoming future, by 2025, data centers alone will consume 20% of all available electricity. A similar trend already impacts the communications side where, for example, energy consumption in mobile broadband networks and mobile terminals is comparable to data centers. These trends can only accelerate by broadening the spectrum of possible mobile applications to the Internet of Things (IoT), which will connect 50 billion devices through wireless connections to the cloud infrastructure within a few years.

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.003
metaresearch head score (Gemma)0.009
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Editorial · Consensus signal: Editorial
Teacher disagreement score0.043
Threshold uncertainty score0.143

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.009
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0030.003
Science and technology studies0.0020.002
Scholarly communication0.0060.007
Open science0.0030.003
Research integrity0.0040.007
Insufficient payload (model declined to judge)0.0430.015

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.103
GPT teacher head0.319
Teacher spread0.216 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreEditorial

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 venueIEEE Design and TestSame topicParallel Computing and Optimization TechniquesFrench-language works237,207