Displaying 381 – 400 of 838

Showing per page

A versatile scheme for predicting renewal times

Gusztáv Morvai, Benjamin Weiss (2016)

Kybernetika

There are two kinds of universal schemes for estimating residual waiting times, those where the error tends to zero almost surely and those where the error tends to zero in some integral norm. Usually these schemes are different because different methods are used to prove their consistency. In this note we will give a single scheme where the average error is eventually small for all time instants, while the error itself tends to zero along a sequence of stopping times of density one.

A viscosity solution method for Shape-From-Shading without image boundary data

Emmanuel Prados, Fabio Camilli, Olivier Faugeras (2006)

ESAIM: Mathematical Modelling and Numerical Analysis

In this paper we propose a solution of the Lambertian shape-from-shading (SFS) problem by designing a new mathematical framework based on the notion of viscosity solution. The power of our approach is twofolds: (1) it defines a notion of weak solutions (in the viscosity sense) which does not necessarily require boundary data. Moreover, it allows to characterize the viscosity solutions by their “minimums”; and (2) it unifies the works of [Rouy and Tourin, SIAM J. Numer. Anal.29 (1992) 867–884],...

A weighted version of Gamma distribution

Kanchan Jain, Neetu Singla, Rameshwar D. Gupta (2014)

Discussiones Mathematicae Probability and Statistics

Weighted Gamma (WG), a weighted version of Gamma distribution, is introduced. The hazard function is increasing or upside-down bathtub depending upon the values of the parameters. This distribution can be obtained as a hidden upper truncation model. The expressions for the moment generating function and the moments are given. The non-linear equations for finding maximum likelihood estimators (MLEs) of parameters are provided and MLEs have been computed through simulations and also for a real data...

A zero-inflated geometric INAR(1) process with random coefficient

Hassan S. Bakouch, Mehrnaz Mohammadpour, Masumeh Shirozhan (2018)

Applications of Mathematics

Many real-life count data are frequently characterized by overdispersion, excess zeros and autocorrelation. Zero-inflated count time series models can provide a powerful procedure to model this type of data. In this paper, we introduce a new stationary first-order integer-valued autoregressive process with random coefficient and zero-inflated geometric marginal distribution, named ZIGINAR RC ( 1 ) process, which contains some sub-models as special cases. Several properties of the process are established....

About stability of risk-seeking optimal stopping

Raúl Montes-de-Oca, Elena Zaitseva (2014)

Kybernetika

We offer the quantitative estimation of stability of risk-sensitive cost optimization in the problem of optimal stopping of Markov chain on a Borel space X . It is supposed that the transition probability p ( · | x ) , x X is approximated by the transition probability p ˜ ( · | x ) , x X , and that the stopping rule f ˜ * , which is optimal for the process with the transition probability p ˜ is applied to the process with the transition probability p . We give an upper bound (expressed in term of the total variation distance: sup x X p ( · | x ) - p ˜ ( · | x ) ) for...

About the density of spectral measure of the two-dimensional SaS random vector

Marta Borowiecka-Olszewska, Jolanta K. Misiewicz (2003)

Discussiones Mathematicae Probability and Statistics

In this paper, we consider a symmetric α-stable p-sub-stable two-dimensional random vector. Our purpose is to show when the function e x p - ( | a | p + | b | p ) α / p is a characteristic function of such a vector for some p and α. The solution of this problem we can find in [3], in the language of isometric embeddings of Banach spaces. Our proof is based on simple properties of stable distributions and some characterization given in [4].

About the maximum information and maximum likelihood principles

Igor Vajda, Jiří Grim (1998)

Kybernetika

Neural networks with radial basis functions are considered, and the Shannon information in their output concerning input. The role of information- preserving input transformations is discussed when the network is specified by the maximum information principle and by the maximum likelihood principle. A transformation is found which simplifies the input structure in the sense that it minimizes the entropy in the class of all information-preserving transformations. Such transformation need not be unique...

Currently displaying 381 – 400 of 838