A Unified Framework to Compute over Tree Synchronized Grammars and Primal Grammars

Tree languages are powerful tools for the representation and schematization of infinite sets of terms for various purposes (unification theory, verification and specification ...). In order to extend the regular tree language framework, more complex formalisms have been developed. In this paper, we focus on Tree Synchronized Grammars and Primal Grammars which introduce specific control structures to represent non regular sets of terms. We propose a common unified framework in order to achieve the membership test for these particular languages. Thanks to a proof system, we provide a full operational framework, that allows us to transform tree grammars into Prolog programs (as it already exists for word grammars with DCG) whose goal is to recognize terms of the corresponding language

Genes and Ant for Defaults Logic

Default Logic and Logic Programming with stable model semantics are recognized as powerful frameworks for incomplete information representation. Their expressive power are suitable for non monotonic reasoning, but the counterpart is their very high level of theoretical complexity. The purpose of this paper is to show how heuristics issued from combinatorial optimization and operation research can be used to built non monotonic reasonning systems

Wave-vortex interaction

We present an experimental study on the effect of a electromagneticaly generated vortex flow on parametrically amplified waves at the surface of a fluid. The underlying vortex flow, generated by a periodic Lorentz force, creates spatio-temporal fluctuations that interact nonlinearly with the standing surface waves. We characterize the bifurcation diagram and measure the power spectrum density (PSD) of the local surface wave amplitude. We show that the parametric instability threshold increases with increasing intensity of the vortex flow.Comment: 8 pages, 10 figures, submitted to Phys. Rev.

Enhanced Eshelby twist on thin wurtzite InP nanowires and measurement of local crystal rotation

We have performed a detailed study of the lattice distortions of InP wurtzite nanowires containing an axial screw dislocation. Eshelby predicted that this kind of system should show a crystal rotation due to the dislocation induced torque. We have measured the twisting rate and the dislocation Burgers vector on individual wires, revealing that nanowires with a 10-nm radius have a twist up to 100% larger than estimated from elasticity theory. The strain induced by the deformation has a Mexican-hat-like geometry, which may create a tube-like potential well for carriers

Revisiting graphene oxide chemistry via spatially-resolved electron energy loss spectroscopy

The type and distribution of oxygen functional groups in graphene oxide and reduced graphene oxide remain still a subject of great debate. Local analytic techniques are required to access the chemistry of these materials at a nanometric scale. Electron energy loss spectroscopy in a scanning transmission electron microscope can provide the suitable resolution, but GO and RGO are extremely sensitive to electron irradiation. In this work we employ a dedicated experimental set-up to reduce electron illumina- tion below damage limit. GO oxygen maps obtained at a few nanometres scale show separated domains with diferent oxidation levels. The C/O ratio varies from about 4:1 to 1:1, the latter corresponding to a complete functionalization of the graphene flakes. In RGO the residual oxygen concentrates mostly in regions few tens nanometres wide. Specific energy-loss near-edge structures are observed for diferent oxidation levels. By combining these findings with first principles simulations we propose a model for the highly oxidized domains where graphene is fully functionalized by hydroxyl groups forming a 2D-sp3 carbon network analogous to that of graphane.AT, AZ and OS acknowledge support from the Agence Nationale de la Recherche (ANR), program of future investment TEMPOS-CHROMATEM (No. ANR-10-EQPX-50). The work has also received funding from the European Union in Seventh Framework Programme (No. FP7/2007 -2013) under Grant Agreement No. n312483 (ESTEEM2). AMB and WKM are grateful for Financial support from the Spanish Ministry MINECO and the European Regional development Fund (project ENE2013-48816-C5-5-R) and from the Regional Government of Aragon and the European Social Fund (DGA-ESF-T66 Grupo Consolidado). The authors are grateful to P. Launois, S. Rouziere and C.P. Ewels for useful discussion.Peer reviewe

GADEL: a Genetic Algorithm to Compute Default Logic Extensions

In the area of Default Logic, after many theoretical works, some operational systems are now able to deal with real world applications. However, due to the theoretical complexity of the problem, finding a Default Logic extension in a practical way is not yet possible in whole generality. Our work presents a new methodology to implement an automated default reasoning system based on Genetic Algorithms techniques. The aim of this paper is not to exhibit a program able to compute extensions of every kind of default theories in a minimal time, but to present a new promising approach of the problem. We provide here a formal description of the components required for a Default Logic extension search based on Genetic Algorithms principles. We give also a formal result to ensure the correctness of our approach and some experimental results that are very interesting w.r.t. other existing systems