this paper addresses the problem of design of variable length codes (VLC) that would allow to exploit higher-order source statistics while still being resilient to transmission errors. The codes introduced extend and generalize the family of codes called multiplexed codes, referred to as stationary multiplexed codes. The design principle consists in creating xed length codes (FLCs) for high pri...

We present a novel method for representing and evolving objects of arbitrary dimension. The method, called the Vector Distance Function (VDF) method, uses the vector that connects any point in space to its closest point on the object. It can deal with smooth manifolds with and without boundaries and with shapes of diierent dimensions. It can be used to evolve such objects according to a variety...

Les codes correcteurs d'erreurs sont une des solutions permettant d'améliorer la qualité des communications numériques. Le principe du codage canal est d'introduire de la redondance dans la séquence d'information binaire afin de corriger les erreurs de transmission durant la réception de l’information. Deux grandes classes de codes correcteurs d’erreurs existent : les codes convolutifs et les c...

We describe a set of modular extensions to our Auto/Graph veriication toolset for networks of communicating processes. These software additions operate from a common le exchange format for automata and networks, called fc2. Tool functionalities comprise graphical depiction of objects, global model construction from hierarchical descriptions, varr ious types of model reductions and of veriicatio...

Whereas most of the literature assumes that the number of processors p is a function of the problem size n, in scalable algorithms p becomes a parameter of the time complexity. This is a more realistic modelisation of real parallel machines and yields optimal algorithms, for the case that n p, where \ " is a function depending on the architecture of the interconnection network. In this paper we...

This report studies the performance of Peer-to-Peer Storage Systems (P2PSS) in terms of data lifetime and availability. Two schemes for recovering lost data are modeled through absorbing Markov chains and their performance are evaluated and compared. The first scheme relies on a centralized controller that can recover multiple losses at once, whereas the second scheme is distributed and recover...

To address challenging flexible docking problems, a number of docking algorithms pre-generate large collections of candidate conformers. To remove the redundancy from such ensembles, a central problem in this context is to report a selection of conformers maximizing some geometric diversity criterion. We make three contributions to this problem. First, we resort to geometric optimization so as ...

The problem of redundancy resolution for underwater remote vehicle-manipulator systems (URVM) is addressed in the current work. In URVM applications, it is beneficial to have the underwater remote vehicle (URV) hold station using its thrusters while a human pilot operates the serial manipulator. This provides a stable platform for the manipulator and eases the pilot’s job drastically when curre...

We give a new analysis and proof of the Normal limiting distribution of the number of phrases in the 1978 Lempel-Ziv compression algorithm on random sequences built from a memoriless source. This work is a follow-up of our last paper on this subject in 1995. The analysis stands on the asymptotic behavior of a DST obtained by the insertion of random sequences. Our proofs are augmented of new res...

Nowadays, sensors and Integrated Circuits (ICs) are present in all kind of applications, ranging from computers to portable devices, from automotive to biomedical applications. The demand on low power ICs is also increasing each year. But with CMOS technology scaling, it becomes difficult to design analog circuits such as high gain Operational Amplifiers (op-amps). In this work, a Switched-Capa...