MétaCan
Menu
Back to cohort
Record W2122416539 · doi:10.1061/9780784413609.253

Method of Critical Stochastic Inputs for Extreme Uncertainty Problems: Theory and Applications

2014· article· en· W2122416539 on OpenAlexaff
Konstantin Ashkinadze

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldDecision Sciences
TopicComplex Systems and Decision Making
Canadian institutionsJacobs (Canada)
Fundersnot available
KeywordsCertaintyPrincipal (computer security)Computer scienceConservatismSet (abstract data type)Action (physics)Stochastic processUncertainty reduction theoryMathematical optimizationMathematicsStatistics

Abstract

fetched live from OpenAlex

Engineering systems in diverse fields of technology are subject to actions of outer environment that cannot, in principle, be predicted with certainty. Observations over short periods of time provide limited information about such factors as height and energy of ocean waves, magnitudes of earthquakes, hurricane wind speed, etc.; however, there is no assurance that the chosen level of action will never be surpassed. This uncertainty that undermines the very basis of the system's design is called "extreme uncertainty". One approach in quantification of the extremely uncertain actions is the method of critical stochastic inputs (MCSI). This method assumes that the maximum magnitude of the action can be assessed with greater certainty and is known; however, the frequency spectra or wave profiles are set based on their worst possible pattern for the given system, with controlled reduction based on probability of exceedance to avoid undue conservatism in the design. The MCSI naturally arises in many applications in various fields of engineering. In the paper, the opportunities of usage of the method in five real-life examples are outlined and the principal theorems of the method are formulated and proven.

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.006
metaresearch head score (Gemma)0.012
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: Methods · Consensus signal: Methods
Teacher disagreement score0.006
Threshold uncertainty score0.032

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.012
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.003
Scholarly communication0.0010.002
Open science0.0010.003
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0040.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.182
GPT teacher head0.449
Teacher spread0.267 · 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
GenreMethods

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

Citations0
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicComplex Systems and Decision MakingFrench-language works237,207