Molecular modeling of intermolecular and intramolecular excluded volume interactions for polymers at interfaces

A hybrid modeling approach is proposed for inhomogeneous polymer solutions. The method is illustrated for the depletion problem with polymer chains up to N=103 segments in semidilute solutions and good solvent conditions. In a three-dimensional volume, a set of freely jointed chains is considered for which the translational degrees of freedom are sampled using a coarse grained Monte Carlo simulation and the conformational degrees of freedom of the chains are computed using a modified self-consistent field theory. As a result, both intramolecular and intermolecular excluded volume effects are accounted for, not only for chains near the surface, but in the bulk as well. Results are consistent with computer simulations and scaling considerations. More specifically, the depletion thickness, which is a measure for the bulk correlation length, scales as d~J-0.75 and converges to the mean field result in the concentrated regim

A graph-based mathematical morphology reader

This survey paper aims at providing a "literary" anthology of mathematical morphology on graphs. It describes in the English language many ideas stemming from a large number of different papers, hence providing a unified view of an active and diverse field of research

Certified Impossibility Results for Byzantine-Tolerant Mobile Robots

We propose a framework to build formal developments for robot networks using the COQ proof assistant, to state and to prove formally various properties. We focus in this paper on impossibility proofs, as it is natural to take advantage of the COQ higher order calculus to reason about algorithms as abstract objects. We present in particular formal proofs of two impossibility results forconvergence of oblivious mobile robots if respectively more than one half and more than one third of the robots exhibit Byzantine failures, starting from the original theorems by Bouzid et al.. Thanks to our formalization, the corresponding COQ developments are quite compact. To our knowledge, these are the first certified (in the sense of formally proved) impossibility results for robot networks