MétaCan
Menu
Back to cohort

Retrieval Optimization for Server-Based Repositories in Location-Based Mobile Commerce

2009· book-chapter· en· W2480278432 on OpenAlexaff
James E. Wyse

Bibliographic record

VenueAdvances in database research (ADR) book series/Advances in database research series · 2009
Typebook-chapter
Languageen
FieldComputer Science
TopicData Management and Algorithms
Canadian institutionsMemorial University of Newfoundland
Fundersnot available
KeywordsComputer scienceMobile commerceScope (computer science)Database transactionHeuristicTransactional leadershipDatabaseWorld Wide Web

Abstract

fetched live from OpenAlex

Location-based mobile commerce (LBMC) incorporates location-aware technologies, wire-free connectivity, and server-based repositories of business locations to support the processing of location-referent transactions (LRTs) between businesses and mobile consumers. LRTs are transactions in which the location of a business in relation to a consumer’s actual or anticipated location is a material transactional factor. Providing adequate support for LRTs requires the timely resolution of queries bearing transaction-related locational criteria. The research reported here evaluates and extends the author’s location-aware method (LAM) of resolving LRT-related queries. The results obtained reveal LAM’s query resolution behavior in a variety of simulated LBMC circumstances and confirm the method’s potential to improve the timeliness of transactional support to mobile consumers. The article also identifies and evaluates a heuristic useful in maintaining optimal query resolution performance as changes occur in the scale and scope of server-based repositories.

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.022
metaresearch head score (Gemma)0.006
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Science and technology studies, Scholarly communication, Open science, Research integrity
Consensus categoriesMeta-epidemiology (narrow), Scholarly communication
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.908
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0220.006
Meta-epidemiology (narrow)0.0020.002
Meta-epidemiology (broad)0.0020.000
Bibliometrics0.0060.005
Science and technology studies0.0010.003
Scholarly communication0.0020.045
Open science0.0080.004
Research integrity0.0010.005
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.053
GPT teacher head0.385
Teacher spread0.332 · 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; both teacher heads agree on what is shown here.

Study designNot applicable
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

Citations2
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueAdvances in database research (ADR) book series/Advances in database research seriesSame topicData Management and AlgorithmsFrench-language works237,207