Group-wise analysis of time series of images requires to compare observed longitudinal evolutions. In medical imaging, longitudinal anatomical changes can be modeled by using deformations resulting from the non-rigid registration of follow-up images. The comparison of longitudinal trajectories is therefore the transport of longitudinal deformations in a common reference frame. We previously sho...

Improving on work by Schild, De Giacomo and Lenzerini, we establish a tight connection between description logics and hybrid logics, and use this to transfer results on complexity and expressive power from one to the other.

BACKGROUND The Transtheoretical Model suggests that individuals vary according to their readiness to change behavior. Previous work in smoking cessation and other health areas suggests that interventions are more successful when they are tailored to an individual's stage of change with regards to the specific behavior. We report on the performance of a single-item measure ("Ladder") to assess t...

The Munich chain-ladder method for claims reserving was introduced by Quarg and Mack on an axiomatic basis. We analyze these axioms, and we define a modified Munich chain-ladder method which is based on an explicit stochastic model. This stochastic model then allows us to consider claims prediction and prediction uncertainty for the Munich chain-ladder method in a consistent way.

Let G be a subdivision of a ladder graph. In this paper we study magic evaluation with type (1, 1, 1) for a given any general ladder graph G. We prove that subdivided ladder admits magic evaluation having type (1, 1, 1). We also prove such a subdivision admits consecutive magic evaluation having type (1, 1, 0). AMS (MOS) Subject Classification Codes: 05C78

The ladder graph plays an important role in many applications as Electronics, Electrical and Wireless communication areas. The aim of this work is to present a new class of odd graceful labeling for the ladder graph. In particular, we show that the ladder graph Ln with m-pendant Ln mk1 is odd graceful. We also show that the subdivision of ladder graph Ln with m-pendant S(Ln)  mk1 is odd grace...

We study the consistency of the ladder approximation and the rainbow approximation of the Dyson-Schwinger equation of QCD. By considering the non-Abelian property of QCD, we show that the QED-type Ward-Takahashi identity is not required for the rainbow-ladder approximation of QCD. It indicates that there does not exists any internal inconsistency in the usual rainbow-ladder approximation of QCD...

We consider the chain ladder reserving method in a Bayesian set up, which allows for combining individual claims development data with portfolio information as for instance development patterns from industry-wide data. We derive the Bayes estimators and the credibility estimators within this Bayesian framework. We show that the credibility estimators are exact Bayesian in the case of the expone...