Image-Based Rendering (IBR) is another promising method to describe a virtual environment. We have already developed a method to generate interpolated images without any distortion (Endo, et al. 1998) based on one IBR method called View Morphing (Seitz and Dyer 1996). This method makes it possible for an observer to freely walk around a plane, which is defined by three points where three base i...

The Yule model is a widely used speciation model in evolutionary biology. Despite its simplicity many aspects of the Yule model have not been explored mathematically. In this paper, we formalise two analytic approaches for obtaining probability densities of individual branch lengths of phylogenetic trees generated by the Yule model. These methods are flexible and permit various aspects of the t...

There are many parameters which are very difficult to calibrate in the threshold autoregressive prediction model for nonlinear time series. The threshold value, autoregressive coefficients, and the delay time are key parameters in the threshold autoregressive prediction model. To improve prediction precision and reduce the uncertainties in the determination of the above parameters, a new DNA de...

Traditional error di usion halftoning is a high quality method for producing binary images from digital grayscale images. Error di usion shapes the quantization noise power into the high frequency regions where the human eye is the least sensitive. Error di usion may be extended to color images by using error lters with matrix-valued coe cients to take into account the correlation among color p...

Based on uniform recursive trees, we introduce random trees with the factor of time, which are named Yule recursive trees. The structure and the distance between the vertices in Yule recursive trees are investigated in this paper. For arbitrary time t > 0, we first give the probability that a Yule recursive tree Yt is isomorphic to a given rooted tree γ ; and then prove that the asymptotic dist...

In this paper we will derive a solver for a symmetric strongly nonsingular higher order generator representable semiseparable plus band matrix. The solver we will derive is based on the Levinson algorithm, which is used for solving strongly nonsingular Toeplitz systems. In a first part an O(p 2 n) solver for a semiseparable matrix of semiseparability rank p is derived, and in a second part we d...

The rapid fixation of an advantageous allele leads to a reduction in linked neutral variation around the target of selection. The genealogy at a neutral locus in such a selective sweep can be simulated by first generating a random path of the advantageous allele's frequency and then a structured coalescent in this background. Usually the frequency path is approximated by a logistic growth curve...