#### Filter Results:

- Full text PDF available (21)

#### Publication Year

1995

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We present a perfect simulation algorithm for measures that are absolutely continuous with respect to some Poisson process and can be obtained as invariant measures of birth-and-death processes. Examples include area-and perimeter-interacting point processes (with stochastic grains), invariant measures of loss networks, and the Ising contour and random… (More)

Birth and death processes can be constructed as projections of higher dimensional Poisson processes. The existence and uniqueness in the strong sense of the solutions of the time change problem are obtained. It is shown that the solution of the time change problem is equivalent to the solution of the corresponding martingale problem. Moreover , the… (More)

Spatial birth and death processes are obtained as solutions of a system of stochastic equations. The processes are required to be locally finite, but may involve an infinite population over the full (noncompact) type space. Conditions are given for existence and uniqueness of such solutions, and for temporal and spatial ergodicity. For birth and death… (More)

We present a probabilistic approach for the study of systems with exclusions, in the regime traditionally studied via cluster-expansion methods. In this paper we focus on its application for the gases of Peierls contours found in the study of the Ising model at low temperatures, but most of the results are general. We realize the equilibrium measure as the… (More)

- BY ANTONIO GALVES, CHARLOTTE GALVES, JESÚS E. GARCÍA, NANCY L. GARCIA, FLORENCIA LEONARDI
- 2009

We introduce a new criterion to select in a consistent way the probabilistic context tree generating a sample. The basic idea is to construct a totally ordered set of candidate trees. This set is composed by the " champion trees " , the ones that maximize the likelihood of the sample for each number of degrees of freedom. The smallest maximizer criterion… (More)

We study one dimensional continuous loss networks with length distribution G and cable capacity C. We prove that the unique stationary distribution L of the network for which the restriction on the number of calls to be less than C is imposed only in the segment ?L; L] is the same as the distribution of a stationary M=G=1 queue conditioned to be less than C… (More)

We consider infinite order chains whose transition probabilities depends on a finite suffix of the past. These suffixes are of variable length and the set of the lengths of all suffix is unbounded. We assume that the probability transitions for each of these suffixes are continuous with exponential decay rate. For these chains, we prove the weak consistency… (More)

- Nancy L Garcia, Mark L McMulkin, Bryan J Tompkins, Paul M Caskey, Shelley L Mader, Glen O Baird
- Pediatric physical therapy : the official…
- 2011

PURPOSE
To investigate the effect of treated clubfoot disorder on gross motor skill level measured by the Alberta Infant Motor Scale (AIMS).
METHODS
Fifty-two babies participated: 26 were treated for idiopathic clubfoot (12 with the Ponseti treatment method, 9 with the French physical therapy technique, and 5 with a combination of both methods); 26 were… (More)

Given a random sample from a continuous and positive density f , the logistic transformation is applied and a log density estimate is provided by using basis functions approach. The number of basis functions acts as the smoothing parameter and it is estimated by minimizing a penalized proxy of the Kullback-Leibler distance which includes as particular cases… (More)

Let X 1 ; X 2 ; : : : ; X N be a random sample from a N(; 1) population. Using the B-value process fB(t); 0 t 1g introduced by Lan and Wittes (1988) one can design a sequential test for H 0 : = 0 versus H 1 : > 0 ; for some functions 1 (t) > 2 (t): if B(t) > 1 (t) stop and reject H 0 , if B(t) < 2 (t) stop and do not reject H 0 , otherwise take one more… (More)