École normale supérieure de Cachan

About: École normale supérieure de Cachan is a education organization based out in Cachan, Île-de-France, France. It is known for research contribution in the topics: Decidability & Finite element method. The organization has 2717 authors who have published 5585 publications receiving 175925 citations.

Combined hardening and softening constitutive model of plasticity: precursor to shear slip line failure

Abstract: In this work, we present a finite element model capable of describing both the plastic deformation which accumulates during the hardening phase as the precursor to failure and the failure process leading to softening phenomena induced by shear slip lines. This is achieved by activating subsequently hardening and softening mechanisms with the localization condition which separates them. The chosen model problem of von Mises plasticity is addressed in detail, along with particular combination of mixed and enhanced finite element approximations which are selected to control the locking phenomena and guarantee mesh-invariant computation of plastic dissipation. Several numerical simulations are presented in order to illustrate the ability of the presented model to predict the final orientation of the shear slip lines for the case of non-proportional loading.

Extracting a data flow analyser in constructive logic

Abstract: We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lattices together with a library of lattice functors for modular construction of complex abstract domains. Constraints are expressed in an intermediate representation that allows for both efficient constraint resolution and correctness proof of the analysis with respect to an operational semantics. The proof of existence of a correct, minimal solution to the constraints is constructive which means that the extraction mechanism of Coq provides a provably correct data flow analyser in OCAML. The library of lattices together with the intermediate representation of constraints are defined in an analysis-independent fashion that provides a basis for a generic framework for proving and extracting static analysers in Coq.

Real‐time ligand binding pocket database search using local surface descriptors

Abstract: Because of the increasing number of structures of unknown function accumulated by ongoing structural genomics projects, there is an urgent need for computational methods for characterizing protein tertiary structures. As functions of many of these proteins are not easily predicted by conventional sequence database searches, a legitimate strategy is to utilize structure information in function characterization. Of particular interest is prediction of ligand binding to a protein, as ligand molecule recognition is a major part of molecular function of proteins. Predicting whether a ligand molecule binds a protein is a complex problem due to the physical nature of protein-ligand interactions and the flexibility of both binding sites and ligand molecules. However, geometric and physicochemical complementarity is observed between the ligand and its binding site in many cases. Therefore, ligand molecules which bind to a local surface site in a protein can be predicted by finding similar local pockets of known binding ligands in the structure database. Here, we present two representations of ligand binding pockets and utilize them for ligand binding prediction by pocket shape comparison. These representations are based on mapping of surface properties of binding pockets, which are compactly described either by the two-dimensional pseudo-Zernike moments or the three-dimensional Zernike descriptors. These compact representations allow a fast real-time pocket searching against a database. Thorough benchmark studies employing two different datasets show that our representations are competitive with the other existing methods. Limitations and potentials of the shape-based methods as well as possible improvements are discussed.

Transparent incremental state saving in time warp parallel discrete event simulation

Abstract: Many systems rely on the ability to rollback (or restore) parts of the system state to undo or recover from undesired or erroneous computations. Examples of such systems include fault tolerant systems with checkpointing, editors with undo capabilities, transaction and data base systems and optimistically synchronized parallel and distributed simulations. An essential part of such systems is the state saving mechanism. It should not only allow efficient state saving, but also support efficient state restoration in case of roll back. Furthermore, it is often a requirement that this mechanism is transparent to the user. In this paper we present a method to implement a transparent incremental state saving mechanism in an optimistically synchronized parallel discrete event simulation system based on the Time Warp mechanism. The usefulness of this approach is demonstrated by simulations of large, detailed, realistic FCA and a DCA-like cellular phone systems.

Iso-scallop tool path generation in 5-axis milling

Abstract: This paper presents a new method of computing constant scallop height tool paths in 5-axis milling on sculptured surfaces. Usually, iso-scallop tool path computation methods are based on approximations. The attempted scallop height is modelled in a given plane to ensure a fast computation of the tool path. We propose a different approach, based on the concept of the machining surface, which ensures a more accurate computation. The machining surface defines the tool path as a surface, which applies in 3- or 5-axis milling with the cutting tools usually used. The machining surface defines a bi-parametric modelling of the locus of a particular point of the tool, and the iso-scallop surface allows to easily find iso-scallop tool centre locations. An implementation of the algorithms is done on a free-form surface with a filleted end mill in 5-axis milling.