MétaCan
Menu
Back to cohort
Record W1980707820 · doi:10.1145/2815317.2815336

Reliability Evaluation of Imperfect K-Terminal Stochastic Networks using Polygon-to Chain and Series-parallel Reductions

2015· article· en· W1980707820 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
FieldEngineering
TopicReliability and Maintenance Optimization
Canadian institutionsUniversité Laval
Fundersnot available
KeywordsComputer scienceReliability (semiconductor)ImperfectSeries (stratigraphy)Wireless sensor networkReduction (mathematics)Wireless ad hoc networkAlgorithmWirelessTheoretical computer scienceMathematicsComputer networkTelecommunications

Abstract

fetched live from OpenAlex

In this paper, we propose a mathematical model for determining the exact value of the reliability of Mobile Ad hoc (MANET) and Wireless Sensor (WSN) Networks which are considered in this research as a collection of Imperfect Stochastic Networks (ISN). The performance in term of reliability is a fundamental challenge in ISN. In the literature several techniques have been used for determining the reliability and few of them are able to produce exact values. The aim of this work introduces a general framework that extends and combines two major models proposed by Satyanarana and Wood, and Carlier and Theologou. These models are based on the reduction using the factoring theorem. The operations of reduction are called Polygon-to Chain and series-parallel decompositions. The algorithm is also very effective for imperfect networks whose nodes and links could fail.

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: Empirical
Teacher disagreement score0.459
Threshold uncertainty score0.424

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.029
GPT teacher head0.269
Teacher spread0.239 · 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

Citations6
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicReliability and Maintenance OptimizationFrench-language works237,207