MétaCan
Menu
Back to cohort
Record W1967081616 · doi:10.1145/1659753.1659755

A semantic approach for building pervasive spaces

2009· article· en· W1967081616 on OpenAlexfundno aff
Daniel Massaguer, Sharad Mehrotra, Nalini Venkatasubramanian

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPrivacy-Preserving Technologies in Data
Canadian institutionsnot available
FundersOffice of Energy Research and DevelopmentNational Science Foundation
KeywordsComputer scienceSemantics (computer science)Middleware (distributed applications)Ubiquitous computingAbstractionSet (abstract data type)ArchitectureRealization (probability)Distributed computingProgramming languageHuman–computer interaction

Abstract

fetched live from OpenAlex

Large and pervasive sensing, communications, and computing infrastructures are enabling the realization of pervasive spaces. Enabling such spaces, however, encompasses a set of challenges. First, programming each application such that it connects to each sensor and it interprets the data being sensed requires a concentration of expertise that is rarely available. Second, achieving a wise and fair usage of the infrastructures is impossible with current approaches due to their lack of awareness of domain and application semantics. This paper summarizes a PhD dissertation that focuses on designing and implementing a middleware that addresses these challenges and overcomes the limitations of previous approaches by featuring a distributed streaming architecture and by being aware of the semantics of the space and applications. Namely, we focus on (i) the design and implementation of the overall system architecture and its underlying programming and execution model, (ii) a set of mechanisms to provide the right level of abstraction to applications, and (iii) a set of mechanisms that are able to protect privacy due to the inclusion of semantics in the middleware.

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.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0020.002
Science and technology studies0.0030.009
Scholarly communication0.0070.014
Open science0.0030.005
Research integrity0.0030.004
Insufficient payload (model declined to judge)0.0040.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.038
GPT teacher head0.288
Teacher spread0.250 · 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 designTheoretical or conceptual
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

Citations3
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicPrivacy-Preserving Technologies in DataFrench-language works237,207