In this paper we show that an arbitrary tree structured QBD Markov chain can be embedded in a tree-like QBD process with a special structure. Moreover, we present an algebraic proof that applying the natural fixed point iteration (FPI) to the nonlinear matrix equation V = B + ∑d s=1 Us(I − V )Ds that solves the tree-like QBD process, is equivalent to the more complicated iterative algorithm pre...

Structured syntactic knowledge is important for phrase reordering. This paper proposes using convolution tree kernel over source parse tree to model structured syntactic knowledge for BTG-based phrase reordering in the context of statistical machine translation. Our study reveals that the structured syntactic features over the source phrases are very effective for BTG constraint-based phrase re...

Abstract Discrete hazard models are widely applied for the analysis of time-to-event outcomes that intrinsically discrete or grouped versions continuous event times. Commonly, one assumes effect explanatory variables on can be described by a linear predictor function. This, however, may not appropriate when non-linear effects interactions between occur in data. To address this issue, we propose...