When a candidate model for data is nonidentifiable, conventional wisdom dictates that the model must be simplified somehow, in order to gain identifiability. We explore two scenarios involving mismeasured variables where in fact model expansion, as opposed to model contraction, might be used to obtain an identifiable model. We compare the merits of model contraction and model expansion. We also...

The aim of this article is to simplify Pfanzagl’s proof of consistency for asymptotic maximum likelihood estimators, and to extend it to more general asymptotic M -estimators. The method relies on the existence of a sort of contraction of the parameter space which admits the true parameter as a fixed point. The proofs are short and elementary.

The aim of this article is to simplify Pfanzagl’s proof of consistency for asymptotic maximum likelihood estimators, and to extend it to more general asymptotic M -estimators. The method relies on the existence of a sort of contraction of the parameter space which admits the true parameter as a fixed point. The proofs are short and elementary.

The aim of this article is to simplify Pfanzagl’s proof of consistency for asymptotic maximum likelihood estimators, and to extend it to more general asymptotic M -estimators. The method relies on the existence of a sort of contraction of the parameter space which admits the true parameter as a fixed point. The proofs are short and elementary.

preterm contraction of uterus is a main cause of miscarriages and preterm labour. euphorbia known as ferphion in iranian traditional medicine texts like al-hawi, is reported for prevention of preterm labour. therefore, the objective of this research was to investigate the effect of euphorbia spinidens bornm. ex prokh. on motility of rat uterus. uterine horns were isolated form non-pregnant fema...

The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. This thesis presents a systematic approach to the design and analysis of BSP algorithms. We introduce an extension of the BSP model, called BSPRAM, which reconciles shared-memory style programming with e cient exploitation of data locality. The BSPRAM model can be optimally si...

We develop two generalizations of contraction theory, namely, semi-contraction and weak-contraction theory. First, using the notion seminorm, we propose a geometric framework for introduce matrix semimeasures characterize their properties. show that spectral abscissa is infimum over weighted semimeasures. For dynamical systems, use semimeasure Jacobian to contractivity properties trajectories. ...

The first complete running time analysis of a stochastic divide and conquer algorithm was given for Quicksort, a sorting algorithm invented 1961 by Hoare. We analyse here the variant Random Median Quicksort. The analysis includes the expectation, the asymptotic distribution, the moments and exponential moments. The asymptotic distribution is characterized by a stochastic fixed point equation. T...

The first complete running time analysis of a stochastic divide and conquer algorithm was given for Quicksort, a sorting algorithm invented 1961 by Hoare. We analyse here the variant Random Median Quicksort. The analysis includes the expectation, the asymptotic distribution, the moments and exponential moments. The asymptotic distribution is characterized by a stochastic fixed point equation. T...

Abstract. In this paper we use the contraction mapping theorem to obtain asymptotic stability results of the zero solution of a nonlinear neutral Volterra integro-differential equation with variable delays. Some conditions which allow the coefficient functions to change sign and do not ask the boundedness of delays are given. An asymptotic stability theorem with a necessary and sufficient condi...