Standard e-business document types are usually too ambiguous due to an overwhelming choice of data elements. Business partners must agree on a shared subset and adapt their application interfaces accordingly. Small and medium enterprises (SMEs) cannot perform this task. UN/CEFACT’s Modeling Methodology (UMM) provides a methodology to define unambiguous business collaborations allowing software ...

RÉSUMÉ. La construction de logiciels à partir de plusieurs applications différentes et hétérogènes est de plus en plus fréquente. Cependant, il n’existe pas à présent une méthodologie de construction pour de tels logiciels. Dans cet article, nous proposons une architecture qui permet de créer des logiciels en faisant collaborer plusieurs services et applications différentes et hétérogènes, util...

— We prove the existence of solutions to two infinite systems of equations obtained by adding a transport term to the classical discrete coagulation-fragmentation system and in a second case by adding transport and spacial diffusion. In both case, the particles have the same velocity as the fluid and in the second case the diffusion coefficients are equal. First a truncated system in size is so...

Background It is well known that earning a bachelor's degree in engineering demanding task, but ripe with opportunity. For students from historically excluded demographic groups, this task exacerbated by oppressive circumstances. Although considerable research has documented how student outcomes differ across much less about the dynamic processes marginalize some students. Purpose The purpose o...

Le raisonnement à base de règles générales pouvant comporter différentes exceptions et le raisonnement non-monotone sont des domaines qui ont été bien étudiés et formalisés en Intelligence Artificielle. Ainsi, le Système P (Kraus et al., 1990) fournit un ensemble de postulats de rationalité permettant de définir les conclusions plausibles pouvant être obtenues à partir d’un ensemble de règles p...

In this paper we prove asymptotic normality of the total length of external branches in Kingman’s coalescent. The proof uses an embedded Markov chain, which can be described as follows: Take an urn with n black balls. Empty it in n steps according to the rule: In each step remove a randomly chosen pair of balls and replace it by one red ball. Finally remove the last remaining ball. Then the num...

Recall private signals are normalized to be equal to bids observed in data, i.e. x = b(x) for all x. Hence by de…nition, ; l are normalized versions of vh; vl de…ned over the support of bids [bL; bU ]. For clarity, I use notations vh; vl for the original, un-normalized conditional expectations de…ned over [xL; xU ]. This distinction is more than just notational, as regularity conditions in S1-S...