MétaCan
Menu
Back to cohort
Record W2121931710 · doi:10.1109/aina.2008.147

Performance Evaluation of Trust Management in Pervasive Computing

2008· article· en· W2121931710 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldSocial Sciences
TopicAccess Control and Trust
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsComputer scienceUbiquitous computingTrust management (information system)Context-aware pervasive systemsOverhead (engineering)Computer securityDistributed computingTrusted ComputingNetwork packetComputer networkHuman–computer interaction

Abstract

fetched live from OpenAlex

In pervasive computing, interactions are possible among users, devices and applications anytime and anywhere. Security and privacy are critical issues in this environment because pervasive computing environments' decentralized and distributed nature means that classical, centralized security management mechanisms are not directly applicable. Pervasive computing's similarity to human society makes trust an effective solution to handle security and privacy problems in pervasive computing environments In this paper we present a specific framework for implementing the distributed trust scheme based on our previous work. This work is inspired by a study on security and privacy requirements in a pervasive computing environment's actual applications. We have evaluated the performance using simulation experiments with performance metrics of throughput, packet loss ratio and message overhead. The results demonstrate the proposed approach's usefulness.

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.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: Observational
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.448
Threshold uncertainty score0.266

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
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.065
GPT teacher head0.340
Teacher spread0.275 · 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

Quick stats

Citations16
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicAccess Control and TrustFrench-language works237,207