MétaCan
Menu
Back to cohort
Record W2170760354 · doi:10.1007/978-3-7643-8448-7_4

Employing Intelligent Agents to Automate SLA Creation

2007· book-chapter· en· W2170760354 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

VenueBirkhäuser Basel eBooks · 2007
Typebook-chapter
Languageen
FieldComputer Science
TopicMobile Agent-Based Network Management
Canadian institutionsWestern University
Fundersnot available
KeywordsNegotiationService-level agreementProcess managementService levelService providerComputer scienceProcess (computing)Order (exchange)Service (business)MediationSoftwareSoftware agentBusinessQuality of serviceMarketingComputer networkFinance

Abstract

fetched live from OpenAlex

Service Level Agreements (SLAs) are commonly prepared and signed agreements that form the contracts between a service provider and its customers, defining the obligations and liabilities of the parties. Naturally, SLAs should reflect the business needs of both customer and supplier. SLAs are usually formed through either the adoption of a boilerplate agreement from the provider, or through a mediation/negotiation process between the parties. With the increasing adoption of software supply being implemented as a network service, such schemes are rigid or slow and costly, This paper proposes a system that the parties can use to facilitate both fast and flexible agreements. It proposes automation of SLA creation from a set of Service Level Objectives (SLOs), making use of software agents and adopting a social order function by incorporating it into the decision process.

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 categoriesMeta-epidemiology (narrow), Insufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Other · Consensus signal: Other
Teacher disagreement score0.929
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.003

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.062
GPT teacher head0.293
Teacher spread0.231 · 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