MétaCan
Menu
Back to cohort
Record W2144026205 · doi:10.1109/access.2014.2365091

SMoW: An Energy-Bandwidth Aware Web Browsing Technique for Smartphones

2014· article· en· W2144026205 on OpenAlexaff
Abdurhman Albasir, Kshirasagar Naik

Bibliographic record

VenueIEEE Access · 2014
Typearticle
Languageen
FieldEngineering
TopicGreen IT and Sustainability
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceBandwidth (computing)Mobile phoneWeb navigationWorld Wide WebMobile WebWeb pageSmart phonePhoneMobile deviceWirelessMultimediaComputer networkTelecommunicationsMobile technology

Abstract

fetched live from OpenAlex

With the rapid advancement of mobile devices, people have become more attached to them than ever. This rapid growth combined with millions of applications (apps) make smart phones a favorite means of communication among users. In general, the available contents on smart phones, apps, and Web, come in two versions: (1) free content that is monetized via advertisements (ads) and (2) paid content that is monetized by user subscription fees. However, the resources, namely, energy, bandwidth, and processing power, on-board are limited, and the existence of ads in Web sites and free apps can significantly increase the usage of these resources. These issues necessitate a good understanding of the mobile advertising eco-system and how such limited resources can be efficiently used. In this paper, we present the results of a novel Web browsing technique that adapts the Web pages delivered to smart phone, based on the smart phone's current battery level and the network type. Web pages are adapted by controlling the amount of ads to be displayed. Validation tests confirm that the system can extend smart phone battery life by up to 30% and save wireless bandwidth up to ~44%.

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.000
metaresearch head score (Gemma)0.000
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical
Teacher disagreement score0.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0020.001

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.264
Teacher spread0.249 · 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 designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations8
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueIEEE AccessSame topicGreen IT and SustainabilityFrench-language works237,207