Approximate Analysis of Multi-State Weighted k-Out-of-n Systems Applied to Transmission Lines
Bibliographic record
Abstract
Multi-state weighted k-out-of-n systems are widely applied in various scenarios, such as multiple line (power/oil transmission line) transmission systems where the capability of fault tolerance is desirable. However, the complex operating environment and the dynamic features of load demands influence the evaluation of system reliability. In this paper, a stochastic multiple-valued (SMV) approach is proposed to efficiently predict the reliability of two models of systems with non-repairable components and dynamically repairable components. The weights/performances and reliabilities of multi-state components (MSCs) are represented by stochastic sequences consisting of a fixed number of multi-state values with the positions being randomly permutated. Using stochastic sequences with L multiple values, linear computational complexities with parameters n and L are required by the SMV approach to compute the reliability of different multi-state k-out-of-n systems at a reasonable accuracy, compared to the complexities of universal generating functions (UGF) and fuzzy universal generating functions (FUGF) that increase exponentially with the value of n. The analysis of two benchmarks shows that the proposed SMV approach is more efficient than the analysis using UGF or FUGF.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".