نتایج جستجو برای: generalized relative type
تعداد نتایج: 1818617 فیلتر نتایج به سال:
The asymptotic properties of smoothing parameter estimates for smoothing splines are developed. We consider a variety of estimates including Generalized Cross Validation, Generalized Maximum Likelihood, and more generally Type II ML estimates and the properties of the marginal posterior mode. Under the usual Sobolov space frequentist assumptions on the function to be estimated , consistency and...
Abstract. In this note, we give some estimates of the generalized quadrature formula of Gauss-Jacobi type for phi-preinvex functions.
This paper presents estimates of the parameters based on adaptive type-II progressive hybrid censoring scheme (AT-II PHCS) in the presence of the competing risks model. We consider the competing risks have generalized exponential distributions (GED). The maximum likelihood method is used to derive point and asymptotic confidence intervals for the unknown parameters. The relative risks due to ea...
Introducing contravariant trace-densities for quantum states on semifinite algebras, we restore one to one correspondence between quantum operations described by normal CP maps and their trace densities as Hermitian positive operator-valued contravariant kernels. The CB-norm distance between two quantum operations with type one input algebras is explicitly expressed in terms of these densities,...
The research in this paper was motivated by one of the most important open problems in the theory of generalized polygons, namely the existence problem for semi-finite thick generalized polygons. We show here that no semi-finite generalized hexagon of order (2, t) can have a subhexagon H of order 2. Such a subhexagon is necessarily isomorphic to the split Cayley generalized hexagon H(2) or its ...
Given integers d 1, and g 2, a g-addition chain for d is a sequence of integers a0 = 1, a1, a2, . . . , ar 1, ar = d where ai = aj1 +aj2 + · · ·+ajk , with 2 k g, and 0 j1 j2 · · · jk i 1. The length of a g-addition chain is r, the number of terms following 1 in the sequence. We denote by lg(d) the length of a shortest addition chain for d. Many results have been established in th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید