MétaCan
Menu
Back to cohort
Record W2071474793 · doi:10.1109/mobserv.2014.22

Coordinating Crowd-Sourced Services

2014· article· en· W2071474793 on OpenAlexafffund
Ahmed Abdel Moamen, Nadeem Jamali

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Crowdsensing and Crowdsourcing
Canadian institutionsUniversity of Saskatchewan
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceService (business)Heading (navigation)Set (abstract data type)sortGovernment (linguistics)World Wide WebCrowdsourcingServerCode (set theory)Computer securityData scienceBusinessDatabaseEngineeringMarketing

Abstract

fetched live from OpenAlex

The growing ubiquity of smartphones and similar personal connected computational devices, each with a number of sensors, has created an opportunity for useful services based on crowd-sourced data. A busy professional could find a restaurant to go to for a quick lunch based on information available from smartphones of people already there having lunch, waiting to be seated, or even heading there, a government could conduct a census in real-time, or "sense" public opinion. Although the programming required for offering a new service of this sort can be significant if done from scratch, these applications have something in common: they use a similar pattern of coordinated communications between the various parties. This creates an opportunity to offer a set of coordination mechanisms as a platform to service designers, into which they can simply plug in their service specific code to offer a new service. This paper identifies the coordination mechanisms required for these crowd-sourced services as types of multi-origin communication. We present details of how these core mechanisms can be implemented using Actors, and introduce high-level programming constructs for launching a new service. Finally, we use examples to illustrate the implementation of services.

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.005
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.025

Distilled classifier scores by category (both heads)

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

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.003
GPT teacher head0.185
Teacher spread0.182 · 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

Citations19
Published2014
Admission routes2
Has abstractyes

Explore more

Same topicMobile Crowdsensing and CrowdsourcingFrench-language works237,207