MétaCan
Menu
Back to cohort
Record W2973746593 · doi:10.1093/biomet/asz043

Column-orthogonal strong orthogonal arrays of strength two plus and three minus

2019· article· en· W2973746593 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueBiometrika · 2019
Typearticle
Languageen
FieldDecision Sciences
TopicOptimal Experimental Design Methods
Canadian institutionsSimon Fraser University
FundersNatural Sciences and Engineering Research Council of CanadaNational Natural Science Foundation of China
KeywordsOrthogonalityOrthogonal arrayMathematicsColumn (typography)Property (philosophy)Orthogonal functionsCombinatoricsOrthogonal basisSpace (punctuation)AlgorithmMathematical analysisGeometryStatisticsComputer scienceConnection (principal bundle)Taguchi methods

Abstract

fetched live from OpenAlex

Summary Strong orthogonal arrays have better space-filling properties than ordinary orthogonal arrays for computer experiments. We consider column-orthogonal strong orthogonal arrays of strength two plus and three minus, and present methods of constructing such designs. Several situations are examined, including those of four or higher levels and mixed levels. The methods are based on both regular and nonregular designs. The resulting designs inherit the good property of strong orthogonal arrays of strength two plus or three and have the additional property of column orthogonality. This type of design is a better choice for computer experiments.

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.003
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: Observational
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.288
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.004
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0020.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.118
GPT teacher head0.415
Teacher spread0.296 · 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