On Non-Continuous Dirichlet Processes

We introduce here some Itô calculus for non-continuous Dirichlet processes. Such calculus extends what was known for continuous Dirichlet processes or for semimartingales. In particular we prove that non-continuous Dirichlet processes are stable under C ¹ transformation.     

Robust Speed Control of a Low Damped Electromechanical System Based on CRONE Control: Application to a Four Mass Experimental Test Bench

Robust speed control of a low damped electromechanical system with backlash is studied, controlled load angular speed being not measured. The proposed control strategy combines a Luenberger observer (load angular speed and load torque disturbance estimations) and a robust CRONE controller. The observer provides estimation of the load angular speed and of the disturbance torque applied on the load. Through the computation of only three independent parameters (as many as a PID controller), the CRONE controller permits to ensure the robust speed control of the load in spite of plant parametric variations and speed observation errors. The proposed control strategy is applied to a four mass experimental test bench.     

Controlled synthesis of amphiphilic biodegradable polylactide‐grafted dextran copolymers

The whole controlled synthesis of novel amphiphilic polylactide (PLA)‐grafted dextran copolymers was achieved. The control of the architecture of such biodegradable and potentially biocompatible copolymers has required a three‐step synthesis based on the “grafting from” concept. The first step consisted of the partial silylation of the dextran hydroxyl groups. This protection step was followed by the ring‐opening polymerization of D ,L ‐lactide initiated from the remaining OH functions of the partially silylated polysaccharide. The third step involved the silylether group deprotection under very mild conditions. Based on previous studies, in which the control of the first step was achieved, this study is focused on the last two steps. Experimental conditions were investigated to ensure a controlled polymerization of D ,L ‐lactide, in terms of grafting efficiency, graft length, and transesterification limitation. After polymerization, the final step was studied in order to avoid degradation of both polysaccharide backbone and polyester grafts. The chemical stability of dextran backbone was checked throughout each step of the synthesis. PLA‐grafted dextrans and PLA‐grafted (silylated dextrans) were proved to adopt a core‐shell conformation in various solvents. Furthermore, preliminary experiments on the potential use of these amphiphilic grafted copolymers as liquid/liquid interface stabilizers were performed. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 2577–2588, 2004     

Metallo‐supramolecular block copolymer micelles: Improved preparation and characterization

Micelles prepared from amphiphilic block copolymers in which a poly(styrene) segment is connected to a poly(ethylene oxide) block via a bis‐(2,2′:6′,2″‐terpyridine‐ruthenium) complex have been intensely studied. In most cases, the micelle populations were found to be strongly heterogeneous in size because of massive micelle/micelle aggregation. In the study reported in this article we tried to improve the homogeneity of the micelle population. The variant preparation procedure developed, which is described here, was used to prepare two “protomer”‐type micelles: PS₂₀‐[Ru]‐PEO₇₀ and PS₂₀‐[Ru]‐PEO₃₇₅. The dropwise addition of water to a solution of the compounds in dimethylformamide was replaced by the controlled addition of water by a syringe pump. The resulting micelles were characterized by sedimentation velocity and sedimentation equilibrium analyses in an analytical ultracentrifuge and by transmission electron microscopy of negatively stained samples. Sedimentation analysis showed virtually unimodal size distributions, in contrast to the findings on micelles prepared previously. PS₂₀‐[Ru]‐PEO₇₀ micelles were found to have an average molar mass of 318,000 g/mol (corresponding to 53 protomers per micelle, which is distinctly less than after micelle preparation by the standard method) and an average hydrodynamic diameter (d_h) of 18 nm. For PS₂₀‐[Ru]‐PEO₃₇₅ micelles, the corresponding values were M = 603,000 g/mol (31 protomers per micelle) and d_h = 34 nm. The latter particles were found to be identical to the “equilibrium” micelles prepared in pure water. Both micelle types had a very narrow molar mass distribution but a much broader distribution of s values and thus of hydrodynamic diameters. This indicates a conformational heterogeneity that is stable on the time scale of sedimentation velocity analysis. The findings from electron microscopy were in disagreement with those from the sedimentation analysis both in average micelle diameter and in the width of the distributions, apparently because of imperfections in the staining procedure. The preparation procedure described also may be useful in micelle formation from other types of protomers. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 4458–4465, 2004     

Markovian Solutions of Inviscid Burgers Equation

For solutions of (inviscid, forceless, one dimensional) Burgers equation with random initial condition, it is heuristically shown that a stationary Feller–Markov property (with respect to the space variable) at some time is conserved at later times, and an evolution equation is derived for the infinitesimal generator. Previously known explicit solutions such as Frachebourg–Martin's (white noise initial velocity) and Carraro–Duchon's Lévy process intrinsic-statistical solutions (including Brownian initial velocity) are recovered as special cases.     

A short proof for a generalization of Vizing's theorem

For a simple graph of maximum degree Δ, it is always possible to color the edges with Δ + 1 colors (Vizing); furthermore, if the set of vertices of maximum degree is independent, Δ colors suffice (Fournier). In this article, we give a short constructive proof of an extension of these results to multigraphs. Instead of considering several color interchanges along alternating chains (Vizing, Gupta), using counting arguments (Ehrenfeucht, Faber, Kierstead), or improving nonvalid colorings with Fournier's Lemma, the method of proof consists of using one single easy transformation, called “sequential recoloring”, to augment a partial k-coloring of the edges.     

RESTRICTION RESPECTUEUSE ET RECONSTRUCTION DES CHAINES ET DES RELATIONS INFINITES

We show a faithful restriction theorem among infinite chains which implies a reconstructibility conjecture of Halin. This incite us to study the reconstructibility in the sense of Fraïssé and to prove it for orders of cardinality infinite or ≥ 3 and for multirelations of cardinality infinite or ≥ 7, what improves the theory obtained by G. Lopez in the finite case. For this work we had to study the infinite classes of difference which have to be a linear order of type ω, ω* or ω* + ω; this complete the theory made by G. Lopez for the finite case ([13]). We show also Ulam-reconstructibility for linear orders which have a fixed point.     

Multihour engineering and traffic routing optimization in hierarchical telephone networks

Classical hierarchical routing in telephone networks is extended to a wider class called out-of-chain routing in such a way that some useful properties of hierarchical routing are retained. This new routing pattern offers more potential paths than the fixed hierarchical one and can be introduced as a dynamic routing where the fixed alternate sequences change at some predetermined instants during the day. The effect of this new routing pattern on the network performances is examined. The main topic of this paper is to present heuristic methods used to optimise such routings in large networks. We show on artificial networks that the throughput of a given network can be significantly improved by suitable routing choices. We demonstrate that the integration of routing changes within a multihour dimensioning process is possible but the lack of realistic data does not permit at this time to quantify the value of routing optimization on real networks.