MétaCan
Menu
Back to cohort
Record W2069855588 · doi:10.4018/jssci.2010070103

Role-Based Autonomic Systems

2010· article· en· W2069855588 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

VenueInternational Journal of Software Science and Computational Intelligence · 2010
Typearticle
Languageen
FieldComputer Science
TopicService-Oriented Architecture and Web Services
Canadian institutionsNipissing University
Fundersnot available
KeywordsAutonomic computingComputer scienceAbnormalityOrder (exchange)Human–computer interactionDistributed computingComputer securityCloud computingOperating system

Abstract

fetched live from OpenAlex

Autonomic Computing is an emerging computing paradigm used to create computer systems capable of self-management in order to overcome the rapidly growing complexity of computing systems management. To possess self-* properties, there must be mechanisms to support self-awareness, that is an autonomic system should be able to perceive the abnormality of its components. After abnormality is checked, processes of self-healing, self-configuration, self-optimization, and self-protection must be completed to guarantee the system works correctly and continuously. In role-based collaboration (RBC), roles are the major media for interaction, coordination, and collaboration. A role can be used to check if a player behaves well or not. This paper investigates the possibility of using roles and their related mechanisms to diagnose the behavior of agents, and facilitate self-* properties of a system.

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

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0030.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.008
GPT teacher head0.261
Teacher spread0.253 · 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