A Reliability Verification Test Model Based on Hybrid Bayesian Prior Distribution

2012 ◽  
Author(s):  
Feng Gao ◽  
Xiaoyun Zheng ◽  
Chang Liu
Keyword(s):  
Prior Distribution ◽  
Test Model ◽  
Model Based ◽  
Verification Test ◽  
Bayesian Prior ◽  
Reliability Verification

A New High-Efficiency Heavy-Duty Combustion Turbine 701F

1994 ◽  
Vol 116 (2) ◽  
pp. 389-394 ◽  
Author(s):  
I. Fukue ◽  
S. Aoki ◽  
K. Aoyama ◽  
S. Umemura ◽  
A. Merola ◽  
...  
Keyword(s):  
High Efficiency ◽  
Pressure Ratio ◽  
Heavy Duty ◽  
Test Program ◽  
Testing Program ◽  
Industrial Grade ◽  
Design Changes ◽  
Compressor Pressure Ratio ◽  
Verification Test ◽  
Reliability Verification

The 701F is a high-temperature 50 Hz industrial grade 220 MW size engine based on a scaling of the 501F 150 MW class 60 Hz machine, and incorporates a higher compressor pressure ratio to increase the thermal efficiency. The prototype engine is under a two-year performance and reliability verification testing program at MHI’s Yokohama Plant and was initially fired in June of 1992. This paper describes the 701F design features design changes made from 501F. The associated performance and reliability verification test program will also be presented.

Automated toxicity test model based on a bio-inspired technique and AdaBoost classifier

2018 ◽  
Vol 71 ◽  
pp. 346-358
Author(s):  
Alaa Tharwat ◽  
Tarek Gaber ◽  
Aboul Ella Hassanien ◽  
Mohamed Elhoseny
Keyword(s):  
Toxicity Test ◽  
Test Model ◽  
Model Based ◽  
Adaboost Classifier

scholarly journals Fracture Network Numerical Well Test Model Based on the Discrete-fracture Model

2015 ◽  
Vol 126 ◽  
pp. 512-516
Author(s):  
Yizhao Wan ◽  
Yuewu Liu ◽  
Weiping Ouyang ◽  
Congcong Niu ◽  
Guofeng Han ◽  
...  
Keyword(s):  
Fracture Network ◽  
Fracture Model ◽  
Test Model ◽  
Well Test ◽  
Discrete Fracture Model ◽  
Model Based ◽  
Discrete Fracture ◽  
Numerical Well Test ◽  
Well Test Model

scholarly journals Simultaneous parameter estimation and variable selection via the logit-normal continuous analogue of the spike-and-slab prior

2019 ◽  
Vol 16 (150) ◽  
pp. 20180572 ◽  
Author(s):  
W. Thomson ◽  
S. Jabbari ◽  
A. E. Taylor ◽  
W. Arlt ◽  
D. J. Smith
Keyword(s):  
Parameter Estimation ◽  
Statistical Models ◽  
Prior Distribution ◽  
Biological Data ◽  
Variable Model ◽  
Machine Learning Methods ◽  
Spike And Slab Prior ◽  
Unseen Data ◽  
Continuous Analogue ◽  
Bayesian Prior

We introduce a Bayesian prior distribution, the logit-normal continuous analogue of the spike-and-slab, which enables flexible parameter estimation and variable/model selection in a variety of settings. We demonstrate its use and efficacy in three case studies—a simulation study and two studies on real biological data from the fields of metabolomics and genomics. The prior allows the use of classical statistical models, which are easily interpretable and well known to applied scientists, but performs comparably to common machine learning methods in terms of generalizability to previously unseen data.

An Accelerated Life Test Model Based on Reliability Kinetics

Technometrics ◽  
1995 ◽  
Vol 37 (2) ◽  
pp. 133-146 ◽  
Author(s):  
William Q. Meeker ◽  
Michael J. LuValle
Keyword(s):  
Accelerated Life Test ◽  
Test Model ◽  
Life Test ◽  
Model Based ◽  
Accelerated Life

Requirements Traceability within Model-Based Testing

2011 ◽  
Vol 2 (2) ◽  
pp. 1-21 ◽  
Author(s):  
Vanessa Grosch
Keyword(s):  
Model Checking ◽  
Graphical Representation ◽  
Timed Automata ◽  
Test Cases ◽  
Test Model ◽  
Requirements Traceability ◽  
Formal Approach ◽  
Model Based ◽  
State Charts ◽  
Model Based Testing

Requirements traceability enables the linkage between all development artifacts during the development process. Within model-based testing, requirements traceability links the original requirements with test model elements and generated test cases. Current approaches are either not practical or lack the necessary formal foundation for generating requirements-based test cases using model-checking techniques involving the requirements trace. This paper describes a practical and formal approach to ensure requirements traceability. The descriptions of the requirements are defined on path fragments of timed automata or timed state charts. The graphical representation of these paths is called a computation sequence chart (CSC). CSCs are automatically transformed into temporal logic formulae. A model-checking algorithm considers these formulae when generating test cases.

Sign in / Sign up

Export Citation Format

Share Document