Coverage Probability of the Credible Interval and Credible Probability of the Condence Interval of the Hierarchical Normal Model
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 20, Issue 4
Abstract
It is well known that the coverage probability of a given nominal level condence interval and the credible probability of a given nominal level credible interval will attain the nominal level. Moreover, it is commonly believed that the two switching concepts probabilities, that is, the coverage probability of a given nominal level credible interval and the credible probability of a given nominal level condence interval, can not attain the nominal level in general. For the hierarchical normal model, we show that the two switching concepts probabilities can attain the nominal level in the limit when a skillful classied variable is innity. The numerical simulations illustrate the correctness of our findings.
Authors and Affiliations
Ying-Ying Zhang, Teng-Zhong Rong
Effects of Radiation and Chemical Reaction on MHD Unsteady Heat and Mass Transfer of Casson Fluid Flow Past a Vertical Plate
Effects of radiation and chemical reaction on MHD unsteady heat and mass transfer of Casson fluid flow past a vertical plate has been studied in this paper. The model equations are transformed into non-dimensional form b...
Boundary Layer Analysis of Unsteady Forced Convection of a Newtonian Fluid with Variable Thermo-physical Properties in the Presence of Induced Magnetic Field
This paper attempts to effectively model the effects of variable viscosity and thermal conductivity on the unsteady hydromagnetic boundary layer flow past a semi-infinite plate when the oncoming free-stream is perturbed...
Novel Technique for Utilizing Analogue Video Signal for IRFPA Raw Data Transfer for Calibration Purposes
Infrared focal plane array (IRFPA) is a bi-dimensional array of micro scaled infrared detectors which become essential sensing devices in a wide range of applications. Due to the need for mobility and power saving, new u...
Some Commutativity Theorems in Prime Rings with Involution and Derivations
Let R be a ring with involution ′∗′ . An additive map x 7→ x ∗ of R into itself is called an involution if (i) (xy) ∗ = y ∗ x ∗ and (ii) (x∗)∗ = x holds for all x; y ∈ R. An additive mapping δ : R → R is called a derivat...
Structure of Some Pregroups and Length Functions
The concept of Pregroups was introduced by Stallings in 1971. Subsequently the concept of Pregroups was developed by many other researchers. Stallings originally defined a set with a binary operation satisfying five axi...