Interface step-induced thin-film delamination and buckling

Atomistic simulations based on experimental observations provide the first evidence that the interface delamination of a thin film from its substrate may start from interface steps. Buckling of the film after interface gliding from both edges of its delaminated part is also observed. In the framework of the Föppl–von Kármán theory of thin plates, the expression of the critical strain beyond which the film buckles has been then analytically determined as a function of the step height and gliding displacements. Both numerical and analytical results confirm that the formation of blisters is favoured in the neighbourhood of interfacial imperfections.     

Preparation of Phospholipid Multilayer Patterns of Controlled Size and Thickness by Capillary Assembly on a Microstructured Substrate

By dragging a phospholipid solution on microstructured silicon surfaces, phospholipid molecules are selectively deposited inside the microstructures to get regular phospholipid multilayer patterns of controlled thickness over a large scale (～cm²). By varying the dragging speed, the thickness of the patterns varies between 28 and 100 nm on average (7 to 25 bilayers). Electroswelling of phospholipid multilayer patterns leads to the formation of giant liposomes of controlled size and narrow size distributions.     

Influence of the suspension flocculated state on the microstructure of alumina spheres elaborated by colloidal granulation

A process of granulation by a colloidal method based on ceramic powder agglomeration makes it possible to produce millimetric spheres with a very homogeneous distribution in terms of shape and size. The starting suspension consists of a mixture of alumina submicrometer particles and silica nanoparticles such as mSiO₂/mAl₂O₃ = 1.1%. Heterocoagulation between the two oxides occurs forming a flocculated network the structure of which can be modified by a shear application. The outer appearance of the spheres is nearly perfect whereas the inner structure exhibits some defects (cracks and porosity). It has been shown that the green spheres are more porous as well as the grains of the starting suspension are less flocculated. During the drying step, the high mobility of these agglomerates increases the overall density on the surface and leads to the formation of a spherical empty cavity in the sphere centre.     

A performance study of plane wave finite element methods with a Padé-type artificial boundary condition in acoustic scattering

This paper proposes an original numerical method and studies its performance for solving high-frequency scattering problems involving elongated scatterers. The approach is based on coupling a high-order Padé-type non-reflecting boundary condition with plane wave finite element formulations. It is shown that for some numerical examples the approximate solution of suitable accuracy can be obtained using a small number of degrees of freedom.     

Fifth International Deer Biology Congress

News

Fifth International Deer Biology Congress     

Effects of aerosol scattering phase function formulation on point-spread-function calculations

The quality of the image produced by an outdoor optical system is affected by the presence of atmospheric aerosols between object and receiver. The properties of the point-spread function that result from aerosol particles were calculated by a new Monte Carlo code called MEDIA (an acronym for Modélisation des Effets de Diffusion Inhérents à l'Atmosphère). The influence of the scattering phase function's angular dependence on the irradiance of the focal plane of a detector was studied. Calculations were performed by use of Mie theory and of the Henyey-Greenstein formulation for the same asymmetry parameter and various detector optical characteristics and atmospheric conditions. Major variations were observed for strong forward-peaked scattering phase functions and a large detector field of view.     

Flying over the reality gap: From simulated to real indoor airships

Because of their ability to naturally float in the air, indoor airships (often called blimps) constitute an appealing platform for research in aerial robotics. However, when confronted to long lasting experiments such as those involving learning or evolutionary techniques, blimps present the disadvantage that they cannot be linked to external power sources and tend to have little mechanical resistance due to their low weight budget. One solution to this problem is to use a realistic flight simulator, which can also significantly reduce experimental duration by running faster than real time. This requires an efficient physical dynamic modelling and parameter identification procedure, which are complicated to develop and usually rely on costly facilities such as wind tunnels. In this paper, we present a simple and efficient physics-based dynamic modelling of indoor airships including a pragmatic methodology for parameter identification without the need for complex or costly test facilities. Our approach is tested with an existing blimp in a vision-based navigation task. Neuronal controllers are evolved in simulation to map visual input into motor commands in order to steer the flying robot forward as fast as possible while avoiding collisions. After evolution, the best individuals are successfully transferred to the physical blimp, which experimentally demonstrates the efficiency of the proposed approach. Jean-Christophe Zufferey and Alexis Guanella contributed equally to this work.     

Doubly-striped disk mirroring: Reliable storage for video servers

Disk striping is essential in Video-On-Demand servers to allow concurrent access for a large number of users to the same copy of a video object. On the other hand, disk striping makes the system more vulnerable to component failures. We propose a replication scheme for video content and an associated I/O scheduling algorithm that enables the system to tolerate a component failure. The scheme, called doubly-striped mirrors, compares favorably to other approaches for implementing redundancy such as RAID in terms of cost, bandwidth efficiency, buffer usage and system availability.     

Timed substitutions for regular signal-event languages

In the classical framework of formal languages, a refinement operation is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studied, because they describe a change in the specification level, from an abstract view to a more concrete one, or conversely. For timed systems, there is up to now no uniform notion of substitution. In this paper, we study timed substitutions in the general framework of signal-event languages, where both signals and events are taken into account. We prove that regular signal-event languages are closed under substitution and inverse substitution. To obtain these results, we use in a crucial way a “well known” result: regular signal-event languages are closed under intersection. In fact, while this result is indeed easy for languages defined by Alur and Dill’s timed automata, it turns out that the construction is much more tricky when considering the most involved model of signal-event automata. We give here a construction working on finite and infinite signal-event words and taking into account signal stuttering, unobservability of zero-duration τ-signals and Zeno runs. Note that if several constructions have been proposed in particular cases, it is the first time that a general construction is provided.     

Approximate bisimulation relations for constrained linear systems

In this paper, we define the notion of approximate bisimulation relation between two continuous systems. While exact bisimulation requires that the observations of two systems are and remain identical, approximate bisimulation allows the observations to be different provided the distance between them remains bounded by some parameter called precision. Approximate bisimulation relations are conveniently defined as level sets of a so-called bisimulation function which can be characterized using Lyapunov-like differential inequalities. For a class of constrained linear systems, we develop computationally effective characterizations of bisimulation functions that can be interpreted in terms of linear matrix inequalities and optimal values of static games. We derive a method to evaluate the precision of the approximate bisimulation relation between a constrained linear system and its projection. This method has been implemented in a Matlab toolbox: MATISSE. An example of use of the toolbox in the context of safety verification is shown.