MétaCan
Menu
Back to cohort
Record W4402195061 · doi:10.1002/qre.3654

Reliability test for degradation data based on ranked set sampling

2024· article· en· W4402195061 on OpenAlexafffund
Wenhan Zhang, Xiaojun Zhu, Mu He, Narayanaswamy Balakrishnan

Bibliographic record

VenueQuality and Reliability Engineering International · 2024
Typearticle
Languageen
FieldEngineering
TopicEvaluation and Optimization Models
Canadian institutionsMcMaster University
FundersXi’an Jiaotong-Liverpool UniversityGovernment of Jiangsu ProvinceNatural Sciences and Engineering Research Council of CanadaNatural Science Foundation of Jiangsu ProvinceNational Natural Science Foundation of China
KeywordsReliability engineeringReliability (semiconductor)Sampling (signal processing)Computer scienceStatisticsData setData miningDegradation (telecommunications)Test (biology)EngineeringMathematicsBiology

Abstract

fetched live from OpenAlex

Abstract In this article, we consider test for the two null hypotheses for and , two widely useful tests in reliability, based on ranked set sampling (RSS). We derive the likelihood ratio test as well as the associated exact and asymptotic results. Considering a fixed significance level and power of the test, we show that the proposed test statistic outperforms the existing test. In small sample cases, the proposed test leads to a much narrower confidence interval for the reliability function . Then, the test statistics obtained from simple random sampling and RSS schemes are compared through which, the efficiency of using RSS is demonstrated. For illustration, we apply the proposed test to a degradation data from the reliability literature. Upon using RSS, the cost of measurement gets reduced and efficiency gets improved, suggesting the importance and use of RSS data in reliability experiments and their design.

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 imitation

Not 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.

metaresearch head score (Codex)0.020
metaresearch head score (Gemma)0.097
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.020
Threshold uncertainty score0.104

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0200.097
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0030.002
Science and technology studies0.0010.002
Scholarly communication0.0010.002
Open science0.0020.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.001

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.107
GPT teacher head0.364
Teacher spread0.257 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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".

Quick stats

Citations3
Published2024
Admission routes2
Has abstractyes

Explore more

Same venueQuality and Reliability Engineering InternationalSame topicEvaluation and Optimization ModelsFrench-language works237,207