É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.

Pitfalls and limitations in the practical use of Förster's theory of resonance energy transfer.

Abstract: Disparate presentations in the literature of the basic equations of Forster's theory of resonance energy transfer are clarified and the limitations of these equations are discussed.

Nanoscale magnetic field mapping with a single spin scanning probe magnetometer

Abstract: We demonstrate quantitative magnetic field mapping with nanoscale resolution, by applying a lock-in technique on the electron spin resonance frequency of a single nitrogen-vacancy defect placed at the apex of an atomic force microscope tip. In addition, we report an all-optical magnetic imaging technique which is sensitive to large off-axis magnetic fields, thus extending the operation range of diamond-based magnetometry. Both techniques are illustrated by using a magnetic hard disk as a test sample. Owing to the non-perturbing and quantitative nature of the magnetic probe, this work should open up numerous perspectives in nanomagnetism and spintronics.

In situ diagnostics of the crystalline nature of single organic nanocrystals by nonlinear microscopy.

Abstract: We elucidate the crystalline nature and the three-dimensional orientation of isolated organic nanocrystals embedded in a sol-gel matrix, using a polarized nonlinear microscopy technique that combines two-photon fluorescence and second harmonic generation. This technique allows the distinction between monocrystalline structures and nanoscale polycrystalline aggregates responsible for incoherent second harmonic signals.

The Minimal Coverability Graph for Petri Nets

Abstract: We present the unique minimal coverability graph for Petri nets. When the reachability graph of a Petri net is infinite, the minimal coverability graph allows us to decide the same problems as the well-known Karp-Miller graph: the Finite Reachability Tree Problem, the Finite Reachability Set Problem, the Boundedness Problem, the Quasi-Liveness Problem and the Regularity Problem. The algorithm given for computing the minimal coverability graph is based on a new optimization of the Karp and Miller procedure.