Bayesian Prediction Bounds for the Exponential-type Distribution Based on Generalized Progressive Hybrid Censoring Scheme

2018 ◽  
Vol 33 (2) ◽  
pp. 93-101 ◽  
Author(s):  
Mohammed S. Kotb

Abstract This paper deals with predicting censored data in a general form for the underlying distribution based on generalized progressive hybrid censoring scheme. A conjugate prior is used and the predictive reliability function is obtained in the one-sample case. The special case of linear exponential distributed observations is considered and completed with numerical results.


2016 ◽  
Vol 31 (1) ◽  
Author(s):  
Mohammed S. Kotb

AbstractWe suggest a ranked set sample method to improve Bayesian prediction intervals. The paper deals with the Bayesian prediction intervals in the context of an ordered ranked set sample from a certain class of exponential-type distributions. A proper general prior density function is used and the predictive cumulative function is obtained in the two-sample case. The special case of linear exponential distributed observations is considered and completed with numerical results.



Author(s):  
Çağatay Çetinkaya

The Pareto distribution takes part in life-testing experiments as a finite range distribution. In this study, inference studies for the scale and shape parameters of the Pareto distribution under type-II hybrid censoring scheme are considered. The main reason for choosing this censoring scheme is its advantage of guaranteeing at least particular failures to be observed by the end of the experiment. Maximum likelihood and Bayes estimation methods are used with their approximate confidence intervals. Proposed estimation methods are compared numerically based on simulation studies. A numerical example is also used to illustrate the theoretical outcomes.



2020 ◽  
Vol 70 (6) ◽  
pp. 1275-1288
Author(s):  
Abd El-Mohsen Badawy ◽  
Miroslav Haviar ◽  
Miroslav Ploščica

AbstractThe notion of a congruence pair for principal MS-algebras, simpler than the one given by Beazer for K2-algebras [6], is introduced. It is proved that the congruences of the principal MS-algebras L correspond to the MS-congruence pairs on simpler substructures L°° and D(L) of L that were associated to L in [4].An analogy of a well-known Grätzer’s problem [11: Problem 57] formulated for distributive p-algebras, which asks for a characterization of the congruence lattices in terms of the congruence pairs, is presented here for the principal MS-algebras (Problem 1). Unlike a recent solution to such a problem for the principal p-algebras in [2], it is demonstrated here on the class of principal MS-algebras, that a possible solution to the problem, though not very descriptive, can be simple and elegant.As a step to a more descriptive solution of Problem 1, a special case is then considered when a principal MS-algebra L is a perfect extension of its greatest Stone subalgebra LS. It is shown that this is exactly when de Morgan subalgebra L°° of L is a perfect extension of the Boolean algebra B(L). Two examples illustrating when this special case happens and when it does not are presented.



2001 ◽  
Vol 66 (4) ◽  
pp. 1865-1883 ◽  
Author(s):  
Chaz Schlindwein

One of the main goals in the theory of forcing iteration is to formulate preservation theorems for not collapsing ω1 which are as general as possible. This line leads from c.c.c. forcings using finite support iterations to Axiom A forcings and proper forcings using countable support iterations to semi-proper forcings using revised countable support iterations, and more recently, in work of Shelah, to yet more general classes of posets. In this paper we concentrate on a special case of the very general iteration theorem of Shelah from [5, chapter XV]. The class of posets handled by this theorem includes all semi-proper posets and also includes, among others, Namba forcing.In [5, chapter XV] Shelah shows that, roughly, revised countable support forcing iterations in which the constituent posets are either semi-proper or Namba forcing or P[W] (the forcing for collapsing a stationary co-stationary subset ofwith countable conditions) do not collapse ℵ1. The iteration must contain sufficiently many cardinal collapses, for example, Levy collapses. The most easily quotable combinatorial application is the consistency (relative to a Mahlo cardinal) of ZFC + CH fails + whenever A ∪ B = ω2 then one of A or B contains an uncountable sequentially closed subset. The iteration Shelah uses to construct this model is built using P[W] to “attack” potential counterexamples, Levy collapses to ensure that the cardinals collapsed by the various P[W]'s are sufficiently well separated, and Cohen forcings to ensure the failure of CH in the final model.In this paper we give details of the iteration theorem, but we do not address the combinatorial applications such as the one quoted above.These theorems from [5, chapter XV] are closely related to earlier work of Shelah [5, chapter XI], which dealt with iterated Namba and P[W] without allowing arbitrary semi-proper forcings to be included in the iteration. By allowing the inclusion of semi-proper forcings, [5, chapter XV] generalizes the conjunction of [5, Theorem XI.3.6] with [5, Conclusion XI.6.7].



2004 ◽  
Vol 04 (01) ◽  
pp. 63-76 ◽  
Author(s):  
OLIVER JENKINSON

Given a non-empty finite subset A of the natural numbers, let EA denote the set of irrationals x∈[0,1] whose continued fraction digits lie in A. In general, EA is a Cantor set whose Hausdorff dimension dim (EA) is between 0 and 1. It is shown that the set [Formula: see text] intersects [0,1/2] densely. We then describe a method for accurately computing dimensions dim (EA), and employ it to investigate numerically the way in which [Formula: see text] intersects [1/2,1]. These computations tend to support the conjecture, first formulated independently by Hensley, and by Mauldin & Urbański, that [Formula: see text] is dense in [0,1]. In the important special case A={1,2}, we use our computational method to give an accurate approximation of dim (E{1,2}), improving on the one given in [18].



2014 ◽  
Vol 3 (2) ◽  
pp. 117-127
Author(s):  
Sanjay Kumar Singh ◽  
Umesh Singh ◽  
Abhimanyu Singh Yadav


2017 ◽  
Vol 139 (9) ◽  
Author(s):  
Alessio Artoni ◽  
Massimo Guiggiani

The teeth of ordinary spur and helical gears are generated by a (virtual) rack provided with planar generating surfaces. The resulting tooth surface shapes are a circle-involute cylinder in the case of spur gears, and a circle-involute helicoid for helical gears. Advantages associated with involute geometry are well known. Beveloid gears are often regarded as a generalization of involute cylindrical gears involving one additional degree-of-freedom, in that the midplane of their (virtual) generating rack is inclined with respect to the axis of the gear being generated. A peculiarity of their generation process is that the motion of the generating planar surface, seen from the fixed space, is a rectilinear translation (while the gear blank is rotated about a fixed axis); the component of such translation that is orthogonal to the generating plane is the one that ultimately dictates the shape of the generated, envelope surface. Starting from this basic fact, we set out to revisit this type of generation-by-envelope process and to profitably use it to explore peculiar design layouts, in particular for the case of motion transmission between skew axes (and intersecting axes as a special case). Analytical derivations demonstrate the possibility of involute helicoid profiles (beveloids) transmitting motion between skew axes through line contact and, perhaps more importantly, they lead to the derivation of designs featuring insensitivity of the transmission ratio to all misalignments within relatively large limits. The theoretical developments are confirmed by various numerical examples.



2018 ◽  
Vol 2018 ◽  
pp. 1-29
Author(s):  
Jyun-You Chiang ◽  
Shuai Wang ◽  
Tzong-Ru Tsai ◽  
Ting Li

This paper studies a discriminant problem of location-scale family in case of prediction from type II censored samples. Three model selection approaches and two types of predictors are, respectively, proposed to predict the future order statistics from censored data when the best underlying distribution is not clear with several candidates. Two members in the location-scale family, the normal distribution and smallest extreme value distribution, are used as candidates to illustrate the best model competition for the underlying distribution via using the proposed prediction methods. The performance of correct and incorrect selections under correct specification and misspecification is evaluated via using Monte Carlo simulations. Simulation results show that model misspecification has impact on the prediction precision and the proposed three model selection approaches perform well when more than one candidate distributions are competing for the best underlying distribution. Finally, the proposed approaches are applied to three data sets.



Sign in / Sign up

Export Citation Format

Share Document