Author: "Institute of Science and Technology [Austria] (IST Austria)" - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Institute of Science and Technology [Austria] (IST Austria)"' showing total 375 results

Start Over Author "Institute of Science and Technology [Austria] (IST Austria)"

375 results on '"Institute of Science and Technology [Austria] (IST Austria)"'

101. Lateral root emergence in Arabidopsis is dependent on transcription factor LBD29 regulating auxin influx carrier LAX3

Author: Anthony Bishopp, Benjamin Péret, Britta Kuempers, Ben Scheres, Kristine Hill, Ranjan Swarup, Siobhan M. Brady, Malcolm J. Bennett, Hidehiro Fukaki, Allison Gaudinier, Yujuan Du, Julien Lavenus, Silvana Porco, Ilda Casimiro, Antoine Larrieu, Kamal Swarup, Eva Benková, Tatsuaki Goh, Centre for Plant Integrative Biology, University of Nottingham, Reproduction et développement des plantes (RDP), École normale supérieure - Lyon (ENS Lyon)-Institut National de la Recherche Agronomique (INRA)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Department of Biology, Molecular Genetics, Faculty of Science, Utrecht University [Utrecht], Department of Plant Biology and Genome Center, University of California [Davis] (UC Davis), University of California, Kobe University, Graduate School of Science, Institute of Plant Sciences, Biologia Celular Y Zoologia, Universidad de Extremadura (UEX), Facultad de Ciencias (UDELAR), Institute of Science and Technology Austria, Biochimie et Physiologie Moléculaire des Plantes (BPMP), Université de Montpellier (UM)-Centre international d'études supérieures en sciences agronomiques (Montpellier SupAgro)-Institut national d’études supérieures agronomiques de Montpellier (Montpellier SupAgro)-Institut National de la Recherche Agronomique (INRA)-Centre National de la Recherche Scientifique (CNRS), École normale supérieure de Lyon (ENS de Lyon)-Institut National de la Recherche Agronomique (INRA)-Université Claude Bernard Lyon 1 (UCBL), University of California (UC), Konan University [Kobe, Japan], Universidad de Extremadura - University of Extremadura (UEX), Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), Institut National de la Recherche Agronomique (INRA)-Centre international d'études supérieures en sciences agronomiques (Montpellier SupAgro)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Institut national d’études supérieures agronomiques de Montpellier (Montpellier SupAgro), Institute of Science and Technology [Austria] (IST Austria), Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Centre international d'études supérieures en sciences agronomiques (Montpellier SupAgro)-Institut National de la Recherche Agronomique (INRA)-Institut national d’études supérieures agronomiques de Montpellier (Montpellier SupAgro), Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro), Péret, Benjamin, Bennett, Malcolm J, Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), and Université de Lyon-Université de Lyon-Institut National de la Recherche Agronomique (INRA)-École normale supérieure - Lyon (ENS Lyon)
Subjects: 0301 basic medicine, Auxin influx, Auxin efflux, lateral root emergence, root development, 580 Plants (Botany), racine laterale, Plant Roots, LBD29, 03 medical and health sciences, Auxin, Gene Expression Regulation, Plant, arabidopsis, auxin, Arabidopsis, Botany, [SDV.BV]Life Sciences [q-bio]/Vegetal Biology, Primordium, heterocyclic compounds, développement racinaire, Molecular Biology, Transcription factor, chemistry.chemical_classification, Vegetal Biology, biology, Indoleacetic Acids, auxine, Arabidopsis Proteins, Lateral root, fungi, Membrane Transport Proteins, food and beverages, biology.organism_classification, Cell biology, Pericycle, 030104 developmental biology, chemistry, Biologie végétale, Developmental Biology, Signal Transduction, Transcription Factors
Abstract: Lateral root primordia (LRP) originate from pericycle stem cells located deep within parental root tissues. LRP emerge through overlying root tissues by inducing auxin-dependent cell separation and hydraulic changes in adjacent cells. The auxin inducible auxin influx carrier LAX3 plays a key role concentrating this signal in cells overlying LRP. Delimiting LAX3 expression to two adjacent cell files overlying new LRP is critical to ensure auxin-regulated cell separation occurs solely along their shared walls. Multiscale modeling has predicted this highly focused pattern of expression requires auxin to sequentially induce auxin efflux and influx carriers PIN3 and LAX3, respectively. Consistent with model predictions, we report that LAX3 auxin inducible expression is regulated indirectly by the AUXIN RESPONSE FACTOR ARF7. Yeast-1-hybrid screens revealed the LAX3 promoter is bound by the transcription factor LBD29, which is a direct target for regulation by ARF7. Disrupting auxin inducible LBD29 expression or expressing an LBD29-SRDX transcriptional repressor phenocopied the lax3 mutant, resulting in delayed lateral root emergence. We conclude that sequential LBD29 and LAX3 induction by auxin is required to coordinate cell separation and organ emergence.
Published: 2016

102. Mapping the subcellular mechanical properties of live cells in tissues with fluorescence emission-Brillouin imaging

Author: Stephanie Werner, Lijuan Zhang, Thomas Greb, Yvon Jaillais, Kareem Elsayad, Jixiang Kong, Edmundo R. Sánchez Guajardo, Marçal Gallemí, Youssef Belkhadir, Vienna Biocenter Core Facilities, Partenaires INRAE, Austrian Academy of Sciences (OeAW), University Medical Center Göttingen (UMG), Gregor Mendel Institute of Molecular Plant Biology (GMI), Institute of Science and Technology [Austria] (IST Austria), Vienna Biocenter, Reproduction et développement des plantes (RDP), Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de la Recherche Agronomique (INRA)-École normale supérieure - Lyon (ENS Lyon), Centre for Organismal Studies, Universität Heidelberg [Heidelberg], Austrian Federal Ministry of Science, Research Economy, City of Vienna through the VBCF, Austrian Academy of Science through the Gregor Mendel Institute, Austrian Science Fund (FWF) P25594-168 B21, German Research Foundation (DFG) GR 2104/4-1, Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), École normale supérieure de Lyon (ENS de Lyon)-Institut National de la Recherche Agronomique (INRA)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), and Universität Heidelberg [Heidelberg] = Heidelberg University
Subjects: 0301 basic medicine, [SDV]Life Sciences [q-bio], Hydrostatic pressure, Arabidopsis, 01 natural sciences, Biochemistry, 010309 optics, Extracellular matrix, 03 medical and health sciences, 0103 physical sciences, Extracellular, [SDV.BV]Life Sciences [q-bio]/Vegetal Biology, Molecular Biology, biology, Chemistry, Cell Biology, biology.organism_classification, Cell biology, Extracellular Matrix, Multicellular organism, 030104 developmental biology, Microscopy, Fluorescence, Cytoplasm, Mutation, Signal transduction, Developmental biology
Abstract: International audience; Extracellular matrices (ECMs) are central to the advent of multicellular life, and their mechanical properties are modulated by and impinge on intracellular signaling pathways that regulate vital cellular functions. High spatial-resolution mapping of mechanical properties in live cells is, however, extremely challenging. Thus, our understanding of how signaling pathways process physiological signals to generate appropriate mechanical responses is limited. We introduce fluorescence emission-Brillouin scattering imaging (FBi), a method for the parallel and all-optical measurements of mechanical properties and fluorescence at the submicrometer scale in living organisms. Using FBi, we showed that changes in cellular hydrostatic pressure and cytoplasm viscoelasticity modulate the mechanical signatures of plant ECMs. We further established that the measured "stiffness" of plant ECMs is symmetrically patterned in hypocotyl cells undergoing directional growth. Finally, application of this method to Arabidopsis thaliana with photoreceptor mutants revealed that red and far-red light signals are essential modulators of ECM viscoelasticity. By mapping the viscoelastic signatures of a complex ECM, we provide proof of principle for the organism-wide applicability of FBi for measuring the mechanical outputs of intracellular signaling pathways. As such, our work has implications for investigations of mechanosignaling pathways and developmental biology.
Published: 2016

103. Constrained PRFs for Unbounded Inputs with Short Keys

Author: Georg Fuchsbauer, Hamza Abusalah, Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities (CASCADE), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Institute of Science and Technology [Austria] (IST Austria), Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris
Subjects: Combinatorics, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, 0102 computer and information sciences, 02 engineering and technology, Function (mathematics), 01 natural sciences, Algorithm, Mathematics
Abstract: International audience; A constrained pseudorandom function (CPRF) F:K×X→Y for a family T of subsets of X is a function where for any key k∈K and set S∈T one can efficiently compute a short constrained key k_S, which allows to evaluate F(k,⋅) on all inputs x∈S, while the outputs on all inputs x∉S look random even given k_S.Abusalah et al. recently constructed the first constrained PRF for inputs of arbitrary length whose sets S are decided by Turing machines. They use their CPRF to build broadcast encryption and the first ID-based non-interactive key exchange for an unbounded number of users. Their constrained keys are obfuscated circuits and are therefore large.In this work we drastically reduce the key size and define a constrained key for a Turing machine M as a short signature on M. For this, we introduce a new signature primitive with constrained signing keys that let one only sign certain messages, while forging a signature on others is hard even when knowing the coins for key generation.
Published: 2016

104. Entropic Ricci curvature bounds for discrete interacting systems

Author: Max Fathi, Jan Maas, Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), Laboratoire de Probabilités et Modèles Aléatoires (LPMA), Université Pierre et Marie Curie - Paris 6 (UPMC)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), and Institute of Science and Technology [Austria] (IST Austria)
Subjects: Statistics and Probability, Work (thermodynamics), Pure mathematics, General method, 01 natural sciences, 010104 statistics & probability, FOS: Mathematics, functional inequalities, 0101 mathematics, [MATH]Mathematics [math], Discrete Ricci curvature, Ricci curvature, birth-death processes, Mathematics, Markov chain, Bernoulli–Laplace model, Probability (math.PR), 010102 general mathematics, Complete graph, random transposition model, Birth–death process, Functional Analysis (math.FA), Mathematics - Functional Analysis, 60K35, Product (mathematics), 60J10, Mathematics::Differential Geometry, Statistics, Probability and Uncertainty, transport metrics, zero-range processes, Mathematics - Probability
Abstract: We develop a new and systematic method for proving entropic Ricci curvature lower bounds for Markov chains on discrete sets. Using different methods, such bounds have recently been obtained in several examples (e.g., 1-dimensional birth and death chains, product chains, Bernoulli-Laplace models, and random transposition models). However, a general method to obtain discrete Ricci bounds had been lacking. Our method covers all of the examples above. In addition, we obtain new Ricci curvature bounds for zero-range processes on the complete graph. The method is inspired by recent work of Caputo, Dai Pra and Posta on discrete functional inequalities., Comment: Published at http://dx.doi.org/10.1214/15-AAP1133 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
Published: 2016

105. Relativistic evaluation of the two-photon decay of the metastable 1s(2)2s2p P-3(0) state in berylliumlike ions with an effective-potential model

Author: Amaro, Pedro, Fratini, Filippo, Safari, Laleh, Machado, Jorge, Guerra, Mauro, Indelicato, Paul, Santos, José Paulo, Laboratorio de Instrumentaçao, Engenharia Biomédica e Fisica da Radiaçao (LIBPhys-UNL), Departamento de Fìsica [Lisboa] (DF), Faculdade de Ciências e Tecnologia = School of Science & Technology (FCT NOVA), Universidade Nova de Lisboa = NOVA University Lisbon (NOVA)-Universidade Nova de Lisboa = NOVA University Lisbon (NOVA)-Faculdade de Ciências e Tecnologia = School of Science & Technology (FCT NOVA), Universidade Nova de Lisboa = NOVA University Lisbon (NOVA)-Universidade Nova de Lisboa = NOVA University Lisbon (NOVA), Atominstitut, Vienna University of Technology (TU Wien), Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), Laboratoire Kastler Brossel (LKB (Jussieu)), Fédération de recherche du Département de physique de l'Ecole Normale Supérieure - ENS Paris (FRDPENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Institute of Science and Technology [Austria] (IST Austria), Université Pierre et Marie Curie - Paris 6 (UPMC)-Fédération de recherche du Département de physique de l'Ecole Normale Supérieure - ENS Paris (FRDPENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)
Subjects: [PHYS]Physics [physics]
Abstract: International audience; The two-photon 1s22s2p3P0→1s2s21S0 transition in berylliumlike ions is investigated theoretically within a fully relativistic framework and a second-order perturbation theory. We focus our analysis on how electron correlation, as well as the negative-energy spectrum, can affect the forbidden E1M1 decay rate. For this purpose, we include the electronic correlation via an effective local potential and within a single-configuration-state model. Due to its experimental interest, evaluations of decay rates are performed for berylliumlike xenon and uranium. We find that the negative-energy contribution can be neglected at the present level of accuracy in the evaluation of the decay rate. On the other hand, if contributions of electronic correlation are not carefully taken into account, it may change the lifetime of the metastable state by up to 20%. By performing a fully relativistic jj-coupling calculation, we find a decrease of the decay rate by two orders of magnitude compared to nonrelativistic LS-coupling calculations, for the selected heavy ions.
Published: 2016

106. Bose Gases at Positive Temperature and Non-Linear Gibbs Measures

Author: Lewin, Mathieu, Nam, Phan Thành, Rougerie, Nicolas, CEntre de REcherches en MAthématiques de la DEcision (CEREMADE), Centre National de la Recherche Scientifique (CNRS)-Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), Institute of Science and Technology [Austria] (IST Austria), Laboratoire de physique et modélisation des milieux condensés (LPM2C), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), ANR-13-JS01-0005,MaThoStaQ,Méthodes mathématiques pour le problème à N corps en mécanique statistique et quantique(2013), ANR-10-BLAN-0101,NoNAP,Problèmes non linéaires en physique atomique et nucléaire(2010), European Project: 258023,EC:FP7:ERC,ERC-2010-StG_20091028,MNIQS(2010), Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), and Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria)
Subjects: Mathematics - Analysis of PDEs, [PHYS.COND.GAS]Physics [physics]/Condensed Matter [cond-mat]/Quantum Gases [cond-mat.quant-gas], Quantum Gases (cond-mat.quant-gas), [PHYS.MPHY]Physics [physics]/Mathematical Physics [math-ph], FOS: Mathematics, FOS: Physical sciences, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], Mathematical Physics (math-ph), Condensed Matter - Quantum Gases, Mathematical Physics, Analysis of PDEs (math.AP)
Abstract: We summarize recent results on positive temperature equilibrium states of large bosonic systems. The emphasis will be on the connection between bosonic grand-canonical thermal states and the (semi-) classical Gibbs measures on one-body quantum states built using the corresponding mean-field energy functionals. An illustrative comparison with the case of "distinguishable" particles (boltzons) is provided., Proceedings of the 18th ICMP, Santiago de Chile, July 2015
Published: 2016

107. PSYNC: A partially synchronous language for fault-tolerant distributed algorithms

Author: Cezara Drăgoi, Thomas A. Henzinger, Damien Zufferey, Analyse Statique par Interprétation Abstraite (ANTIQUE), Département d'informatique - ENS Paris (DI-ENS), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Institute of Science and Technology [Austria] (IST Austria), Computer Science and Artificial Intelligence Laboratory [Cambridge] (CSAIL), Massachusetts Institute of Technology (MIT), Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), and Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria)
Subjects: Consensus, Scala, Computer science, Distributed computing, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Runtime system, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], Round model, Formal verification, Implementation, computer.programming_language, Abstraction (linguistics), Automated verification, 020207 software engineering, Lockstep, Computer Graphics and Computer-Aided Design, Asynchrony (computer programming), 020202 computer hardware & architecture, 010201 computation theory & mathematics, Asynchronous communication, Distributed algorithm, 020201 artificial intelligence & image processing, Partially synchrony, computer, Fault-tolerant distributed algorithms, Software
Abstract: International audience; Fault-tolerant distributed algorithms play an important role in many critical/high-availability applications. These algorithms are notoriously difficult to implement correctly, due to asynchronous communication and the occurrence of faults, such as the network dropping messages or computers crashing. We introduce PSYNC, a domain specific language based on the Heard-Of model, which views asynchronous faulty systems as synchronous ones with an adversarial environment that simulates asyn-chrony and faults by dropping messages. We define a runtime system for PSYNC that efficiently executes on asynchronous networks. We formalise the relation between the runtime system and PSYNC in terms of observational refinement. This high-level synchronous abstraction introduced by PSYNC simplifies the design and implementation of fault-tolerant distributed algorithms and enables automated formal verification. We have implemented an embedding of PSYNC in the SCALA programming language with a runtime system for partially synchronous networks. We show the applicability of PSYNC by implementing several important fault-tolerant distributed algorithms and we compare the implementation of consensus algorithms in PSYNC against implementations in other languages in terms of code size, runtime efficiency, and verification.
Published: 2016

108. Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction

Author: Peter Pickl, Tim Tzaneteas, Sébastien Breteaux, Sören Petrat, Volker Bach, Institut for Analysis and Algebra (IAA), Technische Universität Braunschweig = Technical University of Braunschweig [Braunschweig], Basque Center for Applied Mathematics (BCAM), Basque Center for Applied Mathematics, Institute of Science and Technology [Austria] (IST Austria), Ludwig-Maximilians-Universität München (LMU), Mathematisches Institut [Tübingen], Eberhard Karls Universität Tübingen = Eberhard Karls University of Tuebingen, and S. B.'s research is supported by the Basque Government through the BERC 2014-2017 program and by the Spanish Ministry of Economy and Competitiveness MINECO: BCAM Severo Ochoa accreditation SEV-2013-0323. S. P.'s research has received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement n° 291734. T. T. is supported by the DFG Graduiertenkolleg 1838, and for part of this work was supported by DFG Grant No. Ba-1477/5-1 and also by the European Research Council under the European Community’s Seventh Framework Program (FP7/2007-2013)/ERC grant agreement 20285.
Subjects: Mathematics(all), 530 Physics, General Mathematics, Many-body theory, Hartree–Fock method, FOS: Physical sciences, Kinetic energy, 01 natural sciences, Hartree–Fock, Mathematics - Analysis of PDEs, 510 Mathematics, [MATH.MATH-MP]Mathematics [math]/Mathematical Physics [math-ph], 0103 physical sciences, quantum many-body theory, FOS: Mathematics, Coulomb, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], 0101 mathematics, 35Q40, 35Q55, 82C10, 81V70, 81Q05, Mathematical Physics, Mathematical physics, Mathematics, mean-field, Applied Mathematics, 010102 general mathematics, Time evolution, Hartree-Fock, Mathematical Physics (math-ph), Fermion, Mean-field limit for fermions, interacting fermions, 010307 mathematical physics, Electric potential, time-dependent Hartree-Fock, Pair potential, Analysis of PDEs (math.AP)
Abstract: We study the time evolution of a system of $N$ spinless fermions in $\mathbb{R}^3$ which interact through a pair potential, e.g., the Coulomb potential. We compare the dynamics given by the solution to Schr{\"o}dinger's equation with the time-dependent Hartree-Fock approximation, and we give an estimate for the accuracy of this approximation in terms of the kinetic energy of the system. This leads, in turn, to bounds in terms of the initial total energy of the system., Comment: 35 pages
Published: 2016

109. The mean-field approximation and the non-linear Schrödinger functional for trapped Bose gases

Author: Mathieu Lewin, Nicolas Rougerie, Phan Thành Nam, CEntre de REcherches en MAthématiques de la DEcision (CEREMADE), Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), Laboratoire de physique et modélisation des milieux condensés (LPM2C), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), ANR-13-JS01-0005,MaThoStaQ,Méthodes mathématiques pour le problème à N corps en mécanique statistique et quantique(2013), European Project: 258023,EC:FP7:ERC,ERC-2010-StG_20091028,MNIQS(2010), Centre National de la Recherche Scientifique (CNRS)-Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), and Institute of Science and Technology [Austria] (IST Austria)
Subjects: Bose gas, [PHYS.COND.GAS]Physics [physics]/Condensed Matter [cond-mat]/Quantum Gases [cond-mat.quant-gas], Applied Mathematics, General Mathematics, 010102 general mathematics, Dirac delta function, Hartree, 01 natural sciences, symbols.namesake, Mathematics - Analysis of PDEs, Mean field theory, [MATH.MATH-MP]Mathematics [math]/Mathematical Physics [math-ph], Quantum mechanics, 0103 physical sciences, symbols, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], 010307 mathematical physics, 0101 mathematics, Hamiltonian (quantum mechanics), Ground state, Condensed Matter - Quantum Gases, Schrödinger's cat, Mathematical Physics, Mathematics, Energy functional
Abstract: International audience; We study the ground state of a trapped Bose gas, starting from the full many-body Schrödinger Hamiltonian, and derive the nonlinear Schrödinger energy functional in the limit of large particle number, when the interaction potential converges slowly to a Dirac delta function. Our method is based on quantitative estimates on the discrepancy between the full many-body energy and its mean-field approximation using Hartree states. These are proved using finite dimensional localization and a quantitative version of the quantum de Finetti theorem. Our approach covers the case of attractive interactions in the regime of stability. In particular, our main new result is a derivation of the 2D attractive nonlinear Schrödinger ground state.
Published: 2016

110. Nitrate Controls Root Development through Post-Transcriptional Regulation of the NRT1.1/NPF6.3 transporter/sensor

Author: Alain Gojon, Marjorie Pervent, Eva Benková, Philippe Nacry, Juliette Rochette, Francine Perrine-Walker, Alexandre Martinière, Eléonore Bouguyon, Lien Bach, Gabriel Krouk, Candela Cuesta, Biochimie et Physiologie Moléculaire des Plantes (BPMP), Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Centre international d'études supérieures en sciences agronomiques (Montpellier SupAgro)-Institut National de la Recherche Agronomique (INRA)-Institut national d’études supérieures agronomiques de Montpellier (Montpellier SupAgro), Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro), Institute of Science and Technology [Austria] (IST Austria), Université de Montpellier (UM), Université de Montpellier (UM)-Centre international d'études supérieures en sciences agronomiques (Montpellier SupAgro)-Institut national d’études supérieures agronomiques de Montpellier (Montpellier SupAgro)-Institut National de la Recherche Agronomique (INRA)-Centre National de la Recherche Scientifique (CNRS), and Institute of Science and Technology Austria
Subjects: 0106 biological sciences, 0301 basic medicine, Physiology, Arabidopsis, lateral root primordia, Plant Science, 01 natural sciences, 03 medical and health sciences, Auxin, Transcription (biology), Genetics, Transcriptional regulation, [SDV.BV]Life Sciences [q-bio]/Vegetal Biology, chemistry.chemical_classification, Regulation of gene expression, biology, Lateral root, auxin transport, food and beverages, Meristem, biology.organism_classification, root, Transport protein, Cell biology, 030104 developmental biology, chemistry, Biochemistry, nitrogen nutriton, NRT1.1 transcription, 010606 plant biology & botany
Abstract: Plants are able to modulate root growth and development to optimize their nitrogen nutrition. In Arabidopsis, the adaptive root response to nitrate (NO3-) depends on the NRT1.1/NPF6.3 transporter/sensor. NRT1.1 represses emergence of lateral root primordia (LRPs) at low concentration or absence of NO3- through a NO3- dependent auxin transport activity that lowers auxin accumulation in LRPs and thus inhibits their outgrowth from the primary root. However, these functional data strongly contrast with the known transcriptional regulation of NRT1.1, which is markedly repressed in LRPs in the absence of NO3-. To explain this discrepancy, we investigated in detail the spatio-temporal expression pattern of the NRT1.1 protein during LRP development and combined local transcript analysis with the use of transgenic lines expressing tagged NRT1.1 proteins. Our results show that although NO3- stimulates NRT1.1 transcription and probably mRNA stability both in primary root tissues and in LRPs, it acts differentially on protein accumulation, depending on the tissues with stimulation in cortex and epidermis of the primary root and a strong repression in LRPs and to a lower extent at the primary root tip. This demonstrates that NRT1.1 is strongly regulated at the post-transcriptional level by tissue-specific mechanisms. These mechanisms are crucial for controlling the large palette of adaptive responses to NO3- mediated by NRT1.1 as they ensure that the protein is present in the proper tissue under the specific conditions where it plays a signaling role in this particular tissue.
Published: 2016

111. Network architectures and operating principles reply to comments on 'Drivers of structural features in gene regulatory networks: from biophysical constraints to biological function'

Author: Martin, Olivier, Zagorski, M., Génétique Quantitative et Evolution - Le Moulon (Génétique Végétale) (GQE-Le Moulon), Institut National de la Recherche Agronomique (INRA)-Université Paris-Sud - Paris 11 (UP11)-AgroParisTech-Centre National de la Recherche Scientifique (CNRS), Institute of Physics, Jagiellonian University [Krakow] (UJ), Am Campus 1, Institute of Science and Technology Austria, Centre National de la Recherche Scientifique (CNRS)-AgroParisTech-Université Paris-Sud - Paris 11 (UP11)-Institut National de la Recherche Agronomique (INRA), Uniwersytet Jagielloński w Krakowie = Jagiellonian University (UJ), and Institute of Science and Technology [Austria] (IST Austria)
Subjects: ComputingMethodologies_PATTERNRECOGNITION, Quantitative Biology::Molecular Networks, [SDV]Life Sciences [q-bio], ComputingMethodologies_GENERAL, Quantitative Biology::Genomics
Abstract: Network architectures and operating principles reply to comments on "Drivers of structural features in gene regulatory networks: from biophysical constraints to biological function"
Published: 2016

112. Drivers of structural features in gene regulatory networks: from biophysical constraints to biological function

Author: Olivier C. Martin, Marcin Zagorski, André Krzywicki, Génétique Quantitative et Evolution - Le Moulon (Génétique Végétale) (GQE-Le Moulon), Institut National de la Recherche Agronomique (INRA)-Université Paris-Sud - Paris 11 (UP11)-AgroParisTech-Centre National de la Recherche Scientifique (CNRS), Laboratoire de Physique Theorique, Université Paris-Sud - Paris 11 (UP11), Université Paris Saclay (COmUE), Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), Institute of Physics, Uniwersytet Jagielloński w Krakowie = Jagiellonian University (UJ), Polish National Science CentreGrant No.DEC-2012/07/N/NZ2/00107 and by Foun-dation of Polish Scienceaward START. The research received funding from the People Programme (Marie Curie Actions), European Project: 291734,EC:FP7:PEOPLE,FP7-PEOPLE-2011-COFUND,ISTFELLOW(2012), Centre National de la Recherche Scientifique (CNRS)-AgroParisTech-Université Paris-Sud - Paris 11 (UP11)-Institut National de la Recherche Agronomique (INRA), and Institute of Science and Technology [Austria] (IST Austria)
Subjects: 0301 basic medicine, graph motif, In silico, Biophysics, Gene regulatory network, General Physics and Astronomy, Context (language use), Computational biology, Biology, computer.software_genre, Structuring, genetic regulation, 03 medical and health sciences, network structure, Artificial Intelligence, Selection (linguistics), Animals, Humans, Gene Regulatory Networks, Control (linguistics), [SDV.BDD]Life Sciences [q-bio]/Development Biology, fungi, food and beverages, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Phenotype, 030104 developmental biology, Gene Expression Regulation, Data mining, network function, General Agricultural and Biological Sciences, computer, Biological network, Function (biology), Transcription Factors
Abstract: International audience; Living cells can maintain their internal states, react to changing environments, grow, differentiate, divide, etc. All these processes are tightly controlled by what can be called a regulatory program. The logic of the underlying control can sometimes be guessed at by examining the network of influences amongst genetic components. Some associated gene regulatory networks have been studied in prokaryotes and eukaryotes, unveiling various structural features ranging from broad distributions of out-degrees to recurrent “motifs”, that is small subgraphs having a specific pattern of interactions. To understand what factors may be driving such structuring, a number of groups have introduced frameworks to model the dynamics of gene regulatory networks. In that context, we review here such in silico approaches and show how selection for phenotypes, i.e., network function, can shape network structure.
Published: 2016

113. Finding Non-Orientable Surfaces in 3-Manifolds

Author: Uli Wagner, Arnaud de Mesmay, Benjamin A. Burton, University of Queensland [Brisbane], Centre National de la Recherche Scientifique (CNRS), GIPSA - Architecture, Géométrie, Perception, Images, Gestes (GIPSA-AGPIG), Département Images et Signal (GIPSA-DIS), Grenoble Images Parole Signal Automatique (GIPSA-lab ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Grenoble Images Parole Signal Automatique (GIPSA-lab ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Institute of Science and Technology [Austria] (IST Austria), and Sandor Fekete and Anna Lubiw
Subjects: Computational Geometry (cs.CG), FOS: Computer and information sciences, Surface (mathematics), 0102 computer and information sciences, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], 01 natural sciences, Theoretical Computer Science, Combinatorics, symbols.namesake, Mathematics - Geometric Topology, 510 Mathematics, Genus (mathematics), [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], FOS: Mathematics, Discrete Mathematics and Combinatorics, 0101 mathematics, Topology (chemistry), Mathematics, 000 Computer science, knowledge, general works, 010102 general mathematics, Geometric Topology (math.GT), Mathematics::Geometric Topology, 68U05, 57M50, 68Q25, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, Computational Theory and Mathematics, 010201 computation theory & mathematics, Computer Science, Euler's formula, symbols, Computer Science - Computational Geometry, Geometry and Topology, F.2.2
Abstract: We investigate the complexity of finding an embedded non-orientable surface of Euler genus $g$ in a triangulated $3$-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into $3$-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case., v2: minor changes
Published: 2016

114. TIR1/AFB-Aux/IAA auxin perception mediates rapid cell wall acidification and growth of Arabidopsis hypocotyls

Author: Matyáš Fendrych, Jeffrey Leung, Jiří Friml, Institute of Science and Technology Austria, Institut Jean-Pierre Bourgin (IJPB), Institut National de la Recherche Agronomique (INRA)-AgroParisTech, European Research Council [ERC-2011-StG-20101109-PSDP], Marie Curie Actions FP7 REA grant [291734], Institute of Science and Technology [Austria] (IST Austria), Gary Stacey, and Friml, Jiri
Subjects: 0106 biological sciences, 0301 basic medicine, [SDV]Life Sciences [q-bio], Arabidopsis, Plant Biology, 01 natural sciences, Hypocotyl, Plant Growth Regulators, Gene Expression Regulation, Plant, Acid growth, heterocyclic compounds, Biology (General), chemistry.chemical_classification, biology, General Neuroscience, food and beverages, General Medicine, Hydrogen-Ion Concentration, Cell biology, Proton-Translocating ATPases, Biochemistry, Etiolation, Medicine, Research Article, Signal Transduction, QH301-705.5, growth, Science, Receptors, Cell Surface, Context (language use), General Biochemistry, Genetics and Molecular Biology, Cell wall, 03 medical and health sciences, Auxin, hypocotyl, Indoleacetic Acids, General Immunology and Microbiology, Arabidopsis Proteins, F-Box Proteins, fungi, Cell Biology, biology.organism_classification, Enzyme Activation, 030104 developmental biology, chemistry, A. thaliana, 570 Life sciences, cell wall, auxin, 010606 plant biology & botany, Hormone
Abstract: Despite being composed of immobile cells, plants reorient along directional stimuli. The hormone auxin is redistributed in stimulated organs leading to differential growth and bending. Auxin application triggers rapid cell wall acidification and elongation of aerial organs of plants, but the molecular players mediating these effects are still controversial. Here we use genetically-encoded pH and auxin signaling sensors, pharmacological and genetic manipulations available for Arabidopsis etiolated hypocotyls to clarify how auxin is perceived and the downstream growth executed. We show that auxin-induced acidification occurs by local activation of H+-ATPases, which in the context of gravity response is restricted to the lower organ side. This auxin-stimulated acidification and growth require TIR1/AFB-Aux/IAA nuclear auxin perception. In addition, auxin-induced gene transcription and specifically SAUR proteins are crucial downstream mediators of this growth. Our study provides strong experimental support for the acid growth theory and clarified the contribution of the upstream auxin perception mechanisms. DOI: http://dx.doi.org/10.7554/eLife.19048.001
Published: 2016

115. Abstraction-Based Parameter Synthesis for Multiaffine Systems

Author: Hui Kong, Christian Schilling, Sergiy Bogomolov, Gregory Batt, Radu Grosu, Ezio Bartocci, Institute of Science and Technology [Austria] (IST Austria), University of Freiburg [Freiburg], Vienna University of Technology (TU Wien), Computational systems biology and optimization (Lifeware), Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria)
Subjects: Model checking, 0209 industrial biotechnology, Theoretical computer science, Dynamical systems theory, Computer science, Kripke structure, 020207 software engineering, 02 engineering and technology, Automaton, Formalism (philosophy of mathematics), 020901 industrial engineering & automation, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY], Hybrid automaton, Algorithm
Abstract: International audience; Multiaffine hybrid automata (MHA) represent a powerful formalism to model complex dynamical systems. This formalism is particularly suited for the representation of biological systems which often exhibit highly non-linear behavior. In this paper, we consider the problem of parameter identification for MHA. We present an abstraction of MHA based on linear hybrid automata, which can be analyzed by the SpaceEx model checker. This abstraction enables a precise handling of time-dependent properties. We demonstrate the potential of our approach on a model of a genetic regulatory network and a myocyte model.
Published: 2015

116. A reduction from parity games to simple stochastic games

Author: Krishnendu Chatterjee, Nathanaël Fijalkow, Institute of Science and Technology [Austria] (IST Austria), Laboratoire Bordelais de Recherche en Informatique (LaBRI), and Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)
Subjects: FOS: Computer and information sciences, Computer Science::Computer Science and Game Theory, Theoretical computer science, Logarithm, Computer science, lcsh:Mathematics, 010102 general mathematics, ComputingMilieux_PERSONALCOMPUTING, 0102 computer and information sciences, lcsh:QA1-939, 01 natural sciences, lcsh:QA75.5-76.95, Computer Science - Computer Science and Game Theory, 010201 computation theory & mathematics, Reachability, [INFO]Computer Science [cs], lcsh:Electronic computers. Computer science, 0101 mathematics, Parity (mathematics), ComputingMilieux_MISCELLANEOUS, Computer Science and Game Theory (cs.GT), conference
Abstract: Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model various open systems in computer science, as for instance turn-based or concurrent moves, and deterministic or stochastic transitions. In this paper, we are interested in turn-based games, and specifically in deterministic parity games and stochastic reachability games (also known as simple stochastic games). We present a simple, direct and efficient reduction from deterministic parity games to simple stochastic games: it yields an arena whose size is linear up to a logarithmic factor in size of the original arena., In Proceedings GandALF 2011, arXiv:1106.0814
Published: 2011

117. Homological Reconstruction and Simplification in R3

Author: Dominique Attali, Ulrich Bauer, André Lieutier, Marc Glisse, Olivier Devillers, GIPSA - Architecture, Géométrie, Perception, Images, Gestes (GIPSA-AGPIG), Département Images et Signal (GIPSA-DIS), Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS), Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), Geometric computing (GEOMETRICA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria), Modélisation Géométrique & Multirésolution pour l'Image (MGMI), Laboratoire Jean Kuntzmann (LJK), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS), ANR-13-BS01-0008,TopData,Analyse Topologique des Données : Méthodes Statistiques et Estimation(2013), European Project: 255827,EC:FP7:ICT,FP7-ICT-2009-C,CG LEARNING(2010), Dassault Systèmes, Université Stendhal - Grenoble 3-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Stendhal - Grenoble 3-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Stendhal - Grenoble 3-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Stendhal - Grenoble 3-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS), Institute of Science and Technology [Austria] (IST Austria), and INRIA
Subjects: Discrete mathematics, Control and Optimization, Persistent homology, 010102 general mathematics, Scalar (mathematics), NP-hard problems, homology, 010103 numerical & computational mathematics, persistence, Homology (mathematics), [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], 01 natural sciences, Computer Science Applications, Visualization, Combinatorics, Computational Mathematics, Computational Theory and Mathematics, Geometry and Topology, 0101 mathematics, Mathematics
Abstract: We consider the problem of deciding whether the persistent homology group of a simplicial pair (K, L) can be realized as the homology H∗(X) of some complex X with L ⊂ X ⊂ K. We show that this problem is NP-complete even if K is embedded in R3. As a consequence, we show that it is NP-hard to simplify level and sublevel sets of scalar functions on S3 within a given tolerance constraint. This problem has relevance to the visualization of medical images by isosurfaces. We also show an implication to the theory of well groups of scalar functions: not every well group can be realized by some level set, and deciding whether a well group can be realized is NP-complete.; Nous considérons le problème de décider si le groupe d'homologie persistant de la paire simpliciale (K, L) peut être réalisée comme l'homologie H∗(X) d'un complexe X vérifiant L ⊂ X ⊂ K. Nous montrons que ce problème est NP-complet, même si K est plongé dans R3. Nous en déduisons qu'il est NP-dur de simplifier les niveaux de fonctions scalaires sur S3 avec une tolérance fixée. Ce problème est pertinent pour la visualisation des isosurfaces dans les images médicales. Nous montrons également une conséquence pour la théorie des "well groups" de fonctions scalaires: il n' est pas toujours possible de réaliser un well group comme un ensemble de niveau, et décider si une telle réalisation est possible est NP-dur.
Published: 2015

118. Contracts for Systems Design: Theory

Author: Benveniste, Albert, Caillaud, Benoît, Nickovic, Dejan, Passerone, Roberto, Raclet, Jean-Baptiste, Reinkemeier, Philipp, Sangiovanni-Vincentelli, Alberto, Damm, Werner, Henzinger, Tom, Larsen, Kim Guldstrand, Modélisation hybride & conception par contrats pour les systèmes embarqués multi-physiques (HYCOMES), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Austrian Institute of Technology [Vienna] (AIT), Department of Information Engineering and Computer Science (DISI), University of Trento [Trento], Assistance à la Certification d’Applications DIstribuées et Embarquées (IRIT-ACADIE), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Institute for Information Technology [Oldenburg] (OFFIS), Department of Electrical Engineering and Computer Science [Berkeley] (EECS), University of California [Berkeley] (UC Berkeley), University of California (UC)-University of California (UC), Department für Informatik [Oldenburg], Carl Von Ossietzky Universität Oldenburg = Carl von Ossietzky University of Oldenburg (OFFIS), Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), Center for Indlejrede Software Systemer (CISS), Aalborg University [Denmark] (AAU), This work was funded in part by the European STREP-COMBEST project number 215543, the Europeanprojects CESAR of the ARTEMIS Joint Undertaking and the European IP DANSE, the Artist DesignNetwork of Excellence number 214373, the TerraSwarm project funded by the STARnet phase of the FocusCenter Research Program (FCRP) administered by the Semiconductor Research Corporation (SRC), theiCyPhy program sponsored by IBM and United Technology Corporation, the VKR Center of ExcellenceMT-LAB, and the German Innovation Alliance on Embedded Systems SPES2020., Inria Rennes Bretagne Atlantique, INRIA, CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, University of California [Berkeley], University of California-University of California, Carl Von Ossietzky Universität Oldenburg, and Institute of Science and Technology [Austria] (IST Austria)
Subjects: system design, component based design, interface, ContBasedDesign, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, contract, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation
Abstract: Aircrafts, trains, cars, plants, distributed telecommunication military or health care systems,and more, involve systems design as a critical step. Complexity has caused system design times and coststo go severely over budget so as to threaten the health of entire industrial sectors. Heuristic methods andstandard practices do not seem to scale with complexity so that novel design methods and tools based on astrong theoretical foundation are sorely needed. Model-based design as well as other methodologies suchas layered and compositional design have been used recently but a unified intellectual framework with acomplete design flow supported by formal tools is still lacking.Recently an “orthogonal” approach has been proposed that can be applied to all methodologies introducedthus far to provide a rigorous scaffolding for verification, analysis and abstraction/refinement: contractbaseddesign. Several results have been obtained in this domain but a unified treatment of the topic that canhelp in putting contract-based design in perspective is missing. This paper intends to provide such treatmentwhere contracts are precisely defined and characterized so that they can be used in design methodologiessuch as the ones mentioned above with no ambiguity. In addition, the paper provides an important linkbetween interface and contract theories to show similarities and correspondences.This paper is complemented by a companion paper where contract based design is illustrated throughuse cases.
Published: 2015

119. Contracts for Systems Design: Methodology and Application cases

Author: Benveniste, Albert, Caillaud, Benoît, Nickovic, Dejan, Passerone, Roberto, Raclet, Jean-Baptiste, Reinkemeier, Philipp, Sangiovanni-Vincentelli, Alberto, Damm, Werner, Henzinger, Tom, Larsen, Kim Guldstrand, Modélisation hybride & conception par contrats pour les systèmes embarqués multi-physiques (HYCOMES), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), Austrian Institute of Technology [Vienna] (AIT), Department of Information Engineering and Computer Science (DISI), University of Trento [Trento], Assistance à la Certification d’Applications DIstribuées et Embarquées (IRIT-ACADIE), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Institute for Information Technology [Oldenburg] (OFFIS), Department of Electrical Engineering and Computer Science [Berkeley] (EECS), University of California [Berkeley], University of California-University of California, Department für Informatik [Oldenburg], Carl Von Ossietzky Universität Oldenburg, Institute of Science and Technology [Austria] (IST Austria), Center for Indlejrede Software Systemer (CISS), Aalborg University [Denmark] (AAU), This work was funded in part by the European STREP-COMBEST project number 215543, the Europeanprojects CESAR of the ARTEMIS Joint Undertaking and the European IP DANSE, the Artist DesignNetwork of Excellence number 214373, the TerraSwarm project funded by the STARnet phase of the FocusCenter Research Program (FCRP) administered by the Semiconductor Research Corporation (SRC), theiCyPhy program sponsored by IBM and United Technology Corporation, the VKR Center of ExcellenceMT-LAB, and the German Innovation Alliance on Embedded Systems SPES2020., Inria Rennes Bretagne Atlantique, INRIA, Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), University of California [Berkeley] (UC Berkeley), University of California (UC)-University of California (UC), Carl Von Ossietzky Universität Oldenburg = Carl von Ossietzky University of Oldenburg (OFFIS), and Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria)
Subjects: system design, component based design, interface, ContBasedDesign, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, contract, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation
Abstract: Recently, contract based design has been proposed as an ”orthogonal” approach that can beapplied to all methodologies proposed so far to cope with the complexity of system design. Contract baseddesign provides a rigorous scaffolding for verification, analysis and abstraction/refinement. Companionreport RR-8759 proposes a unified treatment of the topic that can help in putting contract-based design in perspective.This paper complements RR-8759 by further discussing methodological aspects of system design withcontracts in perspective and presenting two application cases.The first application case illustrates the use of contracts in requirement engineering, an area of system designwhere formal methods were scarcely considered, yet are stringently needed. We focus in particular to thecritical design step by which sub-contracts are generated for suppliers from a set of different viewpoints(specified as contracts) on the global system. We also discuss important issues regarding certification inrequirement engineering, such as consistency, compatibility, and completeness of requirements.The second example is developed in the context of the Autosar methodology now widely advocated inthe automotive sector. We propose a contract framework to support schedulability analysis, a key step inAutosar methodology. Our aim differs from the many proposals for compositional schedulability analysisin that we aim at defining sub-contracts for suppliers, not just performing the analysis by parts—we knowfrom companion paper RR-8759 that sub-contracting to suppliers differs from a compositional analysis entirelyperformed by the OEM. We observe that the methodology advocated by Autosar is in contradiction withcontract based design in that some recommended design steps cannot be refinements. We show how tocircumvent this difficulty by precisely bounding the risk at system integration phase. Another feature ofthis application case is the combination of manual reasoning for local properties and use of the formalcontract algebra to lift a collection of local checks to a system wide analysis.
Published: 2015

120. The Need for Language Support for Fault-tolerant Distributed Systems

Author: Drăgoi, Cezara, Henzinger, Thomas, Zufferey, Damien, Analyse Statique par Interprétation Abstraite (ANTIQUE), Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria), Institute of Science and Technology [Austria] (IST Austria), Computer Science and Artificial Intelligence Laboratory [Cambridge] (CSAIL), Massachusetts Institute of Technology (MIT), Département d'informatique - ENS Paris (DI-ENS), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Inria Paris-Rocquencourt, École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), and Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria)
Subjects: 000 Computer science, knowledge, general works, 005 Computer programming, programs & data, 010201 computation theory & mathematics, Computer Science, 0202 electrical engineering, electronic engineering, information engineering, 020207 software engineering, [INFO]Computer Science [cs], 0102 computer and information sciences, 02 engineering and technology, 000 Computer science, knowledge & systems, 01 natural sciences
Abstract: International audience; Fault-tolerant distributed algorithms play an important role in many critical/high-availability applications. These algorithms are notoriously difficult to implement correctly, due to asyn-chronous communication and the occurrence of faults, such as the network dropping messages or computers crashing. Nonetheless there is surprisingly little language and verification support to build distributed systems based on fault-tolerant algorithms. In this paper, we present some of the challenges that a designer has to overcome to implement a fault-tolerant distributed system. Then we review different models that have been proposed to reason about distributed algorithms and sketch how such a model can form the basis for a domain-specific programming language. Adopting a high-level programming model can simplify the programmer's life and make the code amenable to automated verification, while still compiling to efficiently executable code. We conclude by summarizing the current status of an ongoing language design and implementation project that is based on this idea.
Published: 2015

121. Polarity protein Par3 controls B-cell receptor dynamics and antigen extraction at the immune synapse

Author: Claire Desnos, Odile Malbec, Gregg G. Gundersen, Alejandro Amoroso, Lucie Sengmanivong, François Darchen, Ira Mellman, Danielle Lankar, Naga Venkata Gayathri Penmatcha, Dorian Obino, Anne Reversat, Maria-Isabel Yuseff, Ana-Maria Lennon-Duménil, Mathieu Maurin, Paolo Pierobon, Institute of Science and Technology [Austria] (IST Austria), Pontificia Universidad Católica de Chile (UC), Immunité et cancer (U932), Université Paris Descartes - Paris 5 (UPD5)-Institut Curie [Paris]-Institut National de la Santé et de la Recherche Médicale (INSERM), BioImaging Cell and Tissue Core Facility (PICT-IBiSA), Institut Curie [Paris], Laboratoire de Neurophotonique (UMR 8250), Université Paris Descartes - Paris 5 (UPD5)-Centre National de la Recherche Scientifique (CNRS), Biologie cellulaire et moléculaire de la sécrétion (BCMS), Centre National de la Recherche Scientifique (CNRS), Université Paris Descartes - Paris 5 (UPD5)-Institut Curie-Institut National de la Santé et de la Recherche Médicale (INSERM), and Institut Curie
Subjects: Cell Physiology, Immunological Synapses, [SDV]Life Sciences [q-bio], Antigen presentation, B-cell receptor, Dynein, Receptors, Antigen, B-Cell, Cell Cycle Proteins, Biology, Exocytosis, Immunological synapse, Mice, Antigen, Animals, Antigens, Molecular Biology, ComputingMilieux_MISCELLANEOUS, Adaptor Proteins, Signal Transducing, Antigen Presentation, B-Lymphocytes, Antigen processing, Microtubule organizing center, Cell Biology, Articles, Cell biology, Cell Adhesion Molecules
Abstract: Ancestral polarity protein Par3 is crucial for the polarization of B-cells toward a tethered antigen. This process is needed by these lymphocytes to uptake and process the antigen to mount the adaptive immune response., B-cell receptor (BCR) engagement with surface-tethered antigens leads to the formation of an immune synapse, which facilitates antigen uptake for presentation to T-lymphocytes. Antigen internalization and processing rely on the early dynein-dependent transport of BCR–antigen microclusters to the synapse center, as well as on the later polarization of the microtubule-organizing center (MTOC). MTOC repositioning allows the release of proteases and the delivery of MHC class II molecules at the synapse. Whether and how these events are coordinated have not been addressed. Here we show that the ancestral polarity protein Par3 promotes BCR–antigen microcluster gathering, as well as MTOC polarization and lysosome exocytosis, at the synapse by facilitating local dynein recruitment. Par3 is also required for antigen presentation to T-lymphocytes. Par3 therefore emerges as a key molecule in the coupling of the early and late events needed for efficient extraction and processing of immobilized antigen by B-cells.
Published: 2015

122. GROUND STATES OF LARGE BOSONIC SYSTEMS: THE GROSS-PITAEVSKII LIMIT REVISITED

Author: Nicolas Rougerie, Phan Thành Nam, Robert Seiringer, Institute of Science and Technology [Austria] (IST Austria), Laboratoire de physique et modélisation des milieux condensés (LPM2C), Université Joseph Fourier - Grenoble 1 (UJF)-Centre National de la Recherche Scientifique (CNRS), and ANR-13-JS01-0005,MaThoStaQ,Méthodes mathématiques pour le problème à N corps en mécanique statistique et quantique(2013)
Subjects: Bose gas, [PHYS.COND.GAS]Physics [physics]/Condensed Matter [cond-mat]/Quantum Gases [cond-mat.quant-gas], [PHYS.MPHY]Physics [physics]/Mathematical Physics [math-ph], FOS: Physical sciences, Second moment of area, 01 natural sciences, law.invention, symbols.namesake, Mathematics - Analysis of PDEs, law, 35Q40, 0103 physical sciences, FOS: Mathematics, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], many-body quantum mechanics, 0101 mathematics, 010306 general physics, Mathematical Physics, Mathematical physics, Mathematics, Condensed Matter::Quantum Gases, Numerical Analysis, Applied Mathematics, mean-field limits, 010102 general mathematics, Scattering length, Mathematical Physics (math-ph), Scaling limit, Quantum Gases (cond-mat.quant-gas), symbols, 81V70, Ground state, Hamiltonian (quantum mechanics), Condensed Matter - Quantum Gases, Analysis, Bose–Einstein condensate, Schrödinger's cat, Analysis of PDEs (math.AP), Bose–Einstein condensates
Abstract: We study the ground state of a dilute Bose gas in a scaling limit where the Gross-Pitaevskii functional emerges. This is a repulsive non-linear Schr\"odinger functional whose quartic term is proportional to the scattering length of the interparticle interaction potential. We propose a new derivation of this limit problem, with a method that bypasses some of the technical difficulties that previous derivations had to face. The new method is based on a combination of Dyson's lemma, the quantum de Finetti theorem and a second moment estimate for ground states of the effective Dyson Hamiltonian. It applies equally well to the case where magnetic fields or rotation are present.
Published: 2015

123. Derivation of nonlinear Gibbs measures from many-body quantum mechanics

Author: Phan Thành Nam, Mathieu Lewin, Nicolas Rougerie, CEntre de REcherches en MAthématiques de la DEcision (CEREMADE), Centre National de la Recherche Scientifique (CNRS)-Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), IST Austria, Institute of Science and Technology [Austria] (IST Austria), Laboratoire de physique et modélisation des milieux condensés (LPM2C), Université Joseph Fourier - Grenoble 1 (UJF)-Centre National de la Recherche Scientifique (CNRS), ANR-13-JS01-0005,MaThoStaQ,Méthodes mathématiques pour le problème à N corps en mécanique statistique et quantique(2013), European Project: 258023,EC:FP7:ERC,ERC-2010-StG_20091028,MNIQS(2010), Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), and Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria)
Subjects: Physics, General Mathematics, [PHYS.MPHY]Physics [physics]/Mathematical Physics [math-ph], Semiclassical physics, FOS: Physical sciences, Mathematical Physics (math-ph), Gibbs state, Measure (mathematics), Quantum relative entropy, 539 Modern physics, symbols.namesake, Nonlinear system, 510 Mathematics, Mathematics - Analysis of PDEs, [MATH.MATH-MP]Mathematics [math]/Mathematical Physics [math-ph], symbols, FOS: Mathematics, Coherent states, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], Statistical physics, Quantum, Schrödinger's cat, Mathematical Physics, Analysis of PDEs (math.AP)
Abstract: We prove that nonlinear Gibbs measures can be obtained from the corresponding many-body, grand-canonical, quantum Gibbs states, in a mean-field limit where the temperature T diverges and the interaction behaves as 1/T. We proceed by characterizing the interacting Gibbs state as minimizing a functional counting the free-energy relatively to the non-interacting case. We then perform an infinite-dimensional analogue of phase-space semiclassical analysis, using fine properties of the quantum relative entropy, the link between quantum de Finetti measures and upper/lower symbols in a coherent state basis, as well as Berezin-Lieb type inequalities. Our results cover the measure built on the defocusing nonlinear Schr{\"o}dinger functional on a finite interval, as well as smoother interactions in dimensions d\textgreater{}1., Comment: to appear in Journal de l'Ecole Polytechnique
Published: 2015

124. Compositionality for Quantitative Specifications

Author: Louis-Marie Traonouez, Uli Fahrenberg, Jan Křetínský, Axel Legay, Efficient STAtistical methods in SYstems of systems (ESTASYS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), Inria Rennes, CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), Institute of Science and Technology [Austria] (IST Austria), and UCL - SST/ICTM - Institute of Information and Communication Technologies, Electronics and Applied Mathematics
Subjects: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theoretical computer science, Iterative design, Computer science, Principle of compositionality, Computational intelligence, 0102 computer and information sciences, 02 engineering and technology, Residual, 01 natural sciences, Theoretical Computer Science, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], 0202 electrical engineering, electronic engineering, information engineering, Trace distance, [INFO]Computer Science [cs], Quotient, Mathematics, 020207 software engineering, Logic in Computer Science (cs.LO), Modal, 010201 computation theory & mathematics, Geometry and Topology, Engineering design process, Algorithm, Software, Energy (signal processing)
Abstract: International audience; We provide a framework for compositional and iterative design and verification of systems with quantitative information, such as rewards, time or energy. It is based on disjunctive modal transition systems where we allow actions to bear various types of quantitative information. Throughout the design process the actions can be further refined and the information made more precise. We show how to compute the results of standard operations on the systems, including the quotient (residual), which has not been previously considered for quantitative non-deterministic systems. Our quantitative framework has close connections to the modal nu-calculus and is compositional with respect to general notions of distances between systems and the standard operations.
Published: 2015

125. V-ATPase activity in the TGN/EE is required for exocytosis and recycling in Arabidopsis

Author: Volker Bischoff, Anett Doering, Yi Zhang, Staffan Persson, Simone Di Rubbo, Evelien Mylle, Eugenia Russinova, Samantha Vernhettes, York-Dieter Stierhof, Praveen Krishnamoorthy, Stefan Scholl, Yu Luo, Karin Schumacher, Johan M. Winne, Jiří Friml, Niloufer G. Irani, Isabelle Van Houtte, Lutz Neumetzler, Dept Plant Biotechnol & Bioinformat, Universiteit Gent = Ghent University [Belgium] (UGENT), Flanders Institute for Biotechnology, Heidelberg University, Max Planck Institute of Molecular Plant Physiology (MPI-MP), Max-Planck-Gesellschaft, Dept Plant Syst Biol, Institut Jean-Pierre Bourgin (IJPB), Institut National de la Recherche Agronomique (INRA)-AgroParisTech, Institute of Science and Technology [Austria] (IST Austria), and Eberhard Karls Universität Tübingen = Eberhard Karls University of Tuebingen
Subjects: 0106 biological sciences, ATPase, [SDV]Life Sciences [q-bio], Plant Science, Vacuole, Biology, Endocytosis, 01 natural sciences, Exocytosis, Article, 03 medical and health sciences, symbols.namesake, chemistry.chemical_compound, vacuolar H+-ATPase, trafficking, [SDV.IDA]Life Sciences [q-bio]/Food engineering, V-ATPase, Brassinosteroid, endomembrane system, [SDV.BV]Life Sciences [q-bio]/Vegetal Biology, Secretion, [SPI.GPROC]Engineering Sciences [physics]/Chemical and Process Engineering, 030304 developmental biology, 0303 health sciences, plasma-membrane, Golgi apparatus, cell, golgi-apparatus, gene-expression, Cell biology, carbohydrates (lipids), Biochemistry, chemistry, plant golgi, symbols, biology.protein, cellulose synthase complexes, reveals, 010606 plant biology & botany
Abstract: International audience; In plants, vacuolar H+-ATPase (V-ATPase) activity acidifies both the trans-Golgi network/early endosome (TGN/EE) and the vacuole. This dual V-ATPase function has impeded our understanding of how the pH homeostasis within the plant TGN/EE controls exo- and endocytosis. Here, we show that the weak V-ATPase mutant deetiolated3 (det3) displayed a pH increase in the TGN/EE, but not in the vacuole, strongly impairing secretion and recycling of the brassinosteroid receptor and the cellulose synthase complexes to the plasma membrane, in contrast to mutants lacking tonoplast-localized V-ATPase activity only. The brassinosteroid insensitivity and the cellulose deficiency defects in det3 were tightly correlated with reduced Golgi and TGN/EE motility. Thus, our results provide strong evidence that acidification of the TGN/EE, but not of the vacuole, is indispensable for functional secretion and recycling in plants.
Published: 2015

126. A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface

Author: Vincent Cohen-Addad, Arnaud de Mesmay, École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL), and Institute of Science and Technology [Austria] (IST Austria)
Subjects: Surface (mathematics), Combinatorics, Discrete mathematics, Minimum cut, Maximum cut, Genus (mathematics), Scheme (mathematics), [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Graph (abstract data type), [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], ComputingMilieux_MISCELLANEOUS, Mathematics
Abstract: Given a graph G cellularly embedded on a surface Σ of genus g, a cut graph is a subgraph of G such that cutting Σ along G yields a topological disk. We provide a fixed parameter tractable approximation scheme for the problem of computing the shortest cut graph, that is, for any e > 0, we show how to compute a (1 + e) approximation of the shortest cut graph in time f(e, g)n3.
Published: 2015

127. Efficient zero-knowledge proofs for commitments from learning with errors over rings

Author: Vadim Lyubashevsky, Fabrice Benhamouda, Stephan Krenn, Krzysztof Pietrzak, École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL), Laboratoire d'informatique de l'école normale supérieure (LIENS), Département d'informatique - ENS Paris (DI-ENS), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities (CASCADE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Austrian Institute of Technology [Vienna] (AIT), Institute of Science and Technology [Austria] (IST Austria), ANR-13-JS02-0003,CLE,Cryptography from Learning with Errors(2013), European Project: 321310,EC:FP7:ERC,ERC-2012-ADG_20120216,PERCY(2013), European Project: 259668,EC:FP7:ERC,ERC-2010-StG_20091028,PSPC(2010), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt, Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Département d'informatique de l'École normale supérieure (DI-ENS), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris)
Subjects: Discrete mathematics, Ring (mathematics), Mathematics::Commutative Algebra, Computer science, 004 Data processing & computer science, Multiplicative function, Rejection sampling, 020206 networking & telecommunications, 0102 computer and information sciences, 02 engineering and technology, 000 Computer science, knowledge & systems, 01 natural sciences, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, Commitment scheme, Zero-knowledge proof, Communication complexity, Constant (mathematics), Algorithm, Learning with errors, ComputingMilieux_MISCELLANEOUS
Abstract: We extend a commitment scheme based on the learning with errors over rings $$\mathsf{RLWE}$$ problem, and present efficient companion zero-knowledge proofs of knowledge. Our scheme maps elements from the ring or equivalently, n elements from $$\mathbb F_q$$ to a small constant number of ring elements. We then construct $$\varSigma $$-protocols for proving, in a zero-knowledge manner, knowledge of the message contained in a commitment. We are able to further extend our basic protocol to allow us to prove additive and multiplicative relations among committed values. Our protocols have a communication complexity of $$\mathcal {O}Mn\log q$$ and achieve a negligible knowledge error in one run. Here M is the constant from a rejection sampling technique that we employ, and can be set close to 1 by adjusting other parameters. Previously known $$\varSigma $$-protocols for LWE-related languages only achieved a noticeable or even constant knowledge error thus requiring many repetitions of the protocol, or relied on "smudging" out the error which necessitates working over large fields, resulting in poor efficiency.
Published: 2015

128. Sharp interface limit for two components Bose-Einstein condensates

Author: Goldman, Michael, Royo-Letelier, Jimena, Max Planck Institute for Mathematics in the Sciences (MPI-MiS), Max-Planck-Gesellschaft, Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), and Institute of Science and Technology [Austria] (IST Austria)
Subjects: Condensed Matter::Quantum Gases, Bose Einstein condensates, Mathematics - Analysis of PDEs, Condensed Matter::Other, Gamma convergence, FOS: Mathematics, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], sharp interface limit, Analysis of PDEs (math.AP)
Abstract: We study a double Cahn-Hilliard type functional related to the Gross-Pitaevskii energy of two-components Bose-Einstein condensates. In the case of large but same order intercomponent and intracomponent coupling strengths, we prove $\Gamma$-convergence to a perimeter minimisation functional with an inhomogeneous surface tension. We study the asymptotic behavior of the surface tension as the ratio between the intercomponent and intracomponent coupling strengths becomes very small or very large. We obtain as a consequence, symmetry breaking of the minimisers for the harmonic potential when this radio is sufficiently large.
Published: 2015

129. High accuracy decoding of dynamical motion from a large retinal population

Author: Marre, Olivier, Botella-Soler, Vicente, Simmons, Kristina D, Mora, Thierry, Tkačik, Gašper, Berry II, Michael J, Princeton University, Institut de la Vision, Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), Institute of Science and Technology [Austria] (IST Austria), University of Pennsylvania [Philadelphia], Laboratoire de Physique Statistique de l'ENS (LPS), Université Paris Diderot - Paris 7 (UPD7)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Fédération de recherche du Département de physique de l'Ecole Normale Supérieure - ENS Paris (FRDPENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), HAL UPMC, Gestionnaire, Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), University of Pennsylvania, Fédération de recherche du Département de physique de l'Ecole Normale Supérieure - ENS Paris (FRDPENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Retinal Ganglion Cells, Light, Guinea Pigs, Models, Neurological, Motion Perception, Action Potentials, Urodela, Synaptic Transmission, lcsh:Biology (General), FOS: Biological sciences, Quantitative Biology - Neurons and Cognition, [SDV.BBM] Life Sciences [q-bio]/Biochemistry, Molecular Biology, Animals, 570 Life sciences, biology, Neurons and Cognition (q-bio.NC), Computer Simulation, [SDV.BBM]Life Sciences [q-bio]/Biochemistry, Molecular Biology, Nerve Net, lcsh:QH301-705.5, Photic Stimulation, Vision, Ocular, Research Article
Abstract: Motion tracking is a challenge the visual system has to solve by reading out the retinal population. It is still unclear how the information from different neurons can be combined together to estimate the position of an object. Here we recorded a large population of ganglion cells in a dense patch of salamander and guinea pig retinas while displaying a bar moving diffusively. We show that the bar’s position can be reconstructed from retinal activity with a precision in the hyperacuity regime using a linear decoder acting on 100+ cells. We then took advantage of this unprecedented precision to explore the spatial structure of the retina’s population code. The classical view would have suggested that the firing rates of the cells form a moving hill of activity tracking the bar’s position. Instead, we found that most ganglion cells in the salamander fired sparsely and idiosyncratically, so that their neural image did not track the bar. Furthermore, ganglion cell activity spanned an area much larger than predicted by their receptive fields, with cells coding for motion far in their surround. As a result, population redundancy was high, and we could find multiple, disjoint subsets of neurons that encoded the trajectory with high precision. This organization allows for diverse collections of ganglion cells to represent high-accuracy motion information in a form easily read out by downstream neural circuits., Author Summary It remains unclear how the brain is able to track the location of moving objects by reading the spike trains received from the retina. To address this question, we recorded a large population of ganglion cells, the retinal output, in a dense patch of salamander and guinea pig retinas while displaying a bar moving in complex motion. From previous studies, the naive expectation was that individual ganglion cells would spike when an object was moving on their receptive field center and that the entire population’s activity would resemble a “hill” that continuously tracked the object’s location. However, our analysis revealed that this picture did not hold. Instead, ganglion cells fired sparsely and coded for the bar trajectory even when it was far from their receptive field center. Nevertheless, we showed that the bar’s position could be reconstructed from retinal activity with an accuracy better than the spacing between photoreceptors, when using more than 100 cells. We also showed that the retinal code was highly redundant, over-representing the same information more than 6-fold. Yet, this unexpected representation allowed for precise object tracking using a simple decoder, as long as the temporal structure of the spike trains was accounted for.
Published: 2014

130. Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

Author: Thomas Henzinger, Dale Miller, Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), Proof search and reasoning with logic specifications (PARSIFAL), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Institute of Science and Technology [Austria] (IST Austria), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Inria Saclay - Ile de France, and Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)
Subjects: [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], ComputingMilieux_MISCELLANEOUS, Computational logic
Abstract: International audience
Published: 2014

131. Bursting and division in a nonlinear cell population model

Author: Yvinec, Romain, Physiologie de la reproduction et des comportements [Nouzilly] (PRC), Institut National de la Recherche Agronomique (INRA)-Institut Français du Cheval et de l'Equitation [Saumur]-Université de Tours-Centre National de la Recherche Scientifique (CNRS), Heidelberg University, Institute of Science and Technology Austria (IST Austria). AUT., and Institut National de la Recherche Agronomique (INRA)-Institut Français du Cheval et de l'Equitation [Saumur]-Université de Tours (UT)-Centre National de la Recherche Scientifique (CNRS)
Subjects: [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], population cellulaire, protéine, stochasticite, modèle non linéaire, [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], processus de markov, simulation numérique, Probabilités, Systèmes dynamiques, Dynamical Systems, ComputingMilieux_MISCELLANEOUS, Probability
Abstract: International audience
Published: 2014

132. Perfect-Information Stochastic Mean-Payoff Parity Games

Author: Krishnendu Chatterjee, Hugo Gimbert, Laurent Doyen, Youssouf Oualhadj, Institute of Science and Technology [Austria] (IST Austria), Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Institut de Mathématiques [Mons], and Université de Mons (UMons)
Subjects: Computer Science::Computer Science and Game Theory, 005 Computer programming, programs & data, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], Stochastic process, Stochastic game, Perfect information, ComputingMilieux_PERSONALCOMPUTING, Mean payoff, Functional requirement, 0102 computer and information sciences, 02 engineering and technology, 000 Computer science, knowledge & systems, 01 natural sciences, Combinatorics, 510 Mathematics, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Markov decision process, Special case, 000 Computer science, knowledge general works, Reactive system, Mathematics
Abstract: International audience; The theory of graph games is the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic processes, we use 2-1/2-player games where some transitions of the game graph are controlled by two adversarial players, the System and the Environment, and the other transitions are determined probabilistically. We consider 2-1/2-player games where the objective of the System is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a mean-payoff condition). We establish that the problem of deciding whether the System can ensure that the probability to satisfy the mean-payoff parity objective is at least a given threshold is in NP ∩ coNP, matching the best known bound in the special case of 2-player games (where all transitions are deterministic) with only parity objectives, or with only mean-payoff objectives. We present an algorithm running in time O(d * n^{2d}*MeanGame) to compute the set of almost-sure winning states from which the objective can be ensured with probability 1, where n is the number of states of the game, d the number of priorities of the parity objective, and MeanGame is the complexity to compute the set of almost-sure winning states in 2-1/2-player mean-payoff games. Our results are useful in the synthesis of stochastic reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective).
Published: 2014

133. On the low lying spectrum of the magnetic Schr\'odinger operator with kagome periodicity

Author: Jimena Royo-Letelier, Philippe Kerdelhué, Laboratoire de Mathématiques d'Orsay (LMO), Université Paris-Sud - Paris 11 (UP11)-Centre National de la Recherche Scientifique (CNRS), and Institute of Science and Technology [Austria] (IST Austria)
Subjects: Physics, Schrödinger operator, Magnetism, Mathematics::Analysis of PDEs, Statistical and Nonlinear Physics, Electron, Spectral analysis, Mathematics::Spectral Theory, Magnetic flux, Magnetic field, Operator (computer programming), Mathematics - Analysis of PDEs, Lattice (order), Quantum mechanics, Homogeneous space, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], Hexagonal lattice, Mathematical Physics
Abstract: In a semi-classical regime, we study a periodic magnetic Schrödinger operator in ℝ2. This is inspired by recent experiments on artificial magnetism with ultra cold atoms in optical lattices, and by the new interest for the operator on the hexagonal lattice describing the behavior of an electron in a graphene sheet. We first review some results for the square (Harper), triangular and hexagonal lattices. Then, we study the case when the periodicity is given by the kagome lattice considered by Hou. Following the techniques introduced by Helffer–Sjöstrand and Carlsson, we reduce this problem to the study of a discrete operator on ℓ2(ℤ2;ℂ3) and a pseudo-differential operator on L2(ℝ;ℂ3), which keep the symmetries of the kagome lattice. We estimate the coefficients of these operators in the case of a weak constant magnetic field. Plotting the spectrum for rational values of the magnetic flux divided by 2πh where h is the semi-classical parameter, we obtain a picture similar to Hofstadter's butterfly. We study the properties of this picture and prove the symmetries of the spectrum and the existence of flat bands, which do not occur in the case of the three previous models.
Published: 2014

134. Compositional Contract Abstraction for System Design

Author: Benveniste, Albert, Nickovic, Dejan, Henzinger, Thomas, Modélisation hybride & conception par contrats pour les systèmes embarqués multi-physiques (HYCOMES), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), AIT, Austrian Institute of Technology [Vienna] (AIT), Institute of Science and Technology [Austria] (IST Austria), INRIA, Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), and Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria)
Subjects: system design, component based design, interface, ContBasedDesign, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, abstract interpretation, abstraction, contract
Abstract: Contract-based design has been recently proposed as a framework for concurrent system design in the context of complex supplier chains, where sub-system design can be sub-contracted to suppliers while guaranteeing correct system integration. A unifying meta-theory of contracts was proposed in [Benveniste et al. 2012], which subsumes known frameworks such as interface theories, modal interfaces, and Assume/Guarantee contracts. This report proposes, for this meta-theory of contracts, a generic abstraction technique allowing to prove contract properties based on their abstractions. More precisely, we show how to lift abstractions, from components to contracts, in a systematic way. In doing so, fundamental relations such as being a correct implementation or a valid environment, refining, can be checked on abstractions. Our abstraction technique is fully compositional with respect to contract conjunction. Compositionality of abstraction with respect to contract composition is only partially achieved. We believe that the results we obtain are the best achievable ones and we explain the obstructions we see against improving them. Our abstraction technique complements observers, proposed as a testing technique adapted to contracts in [6]. The latter allow disproving properties, whereas abstraction allows proving them. Key-words: system design, component based design, contract, interface, abstraction, abstract interpretation.; La conception par contrats a été proposée récemment comme une approche formelle pour la conception de systèmes permettant le développement parallèle de sysèmes dans un contexte de chaine complexe de sous-traitants. Les théories d'interfaces, les interfaces modales et les contrats hypothèse/garantie, sont autant de formalismes en ce sens. L'article collectif [Benveniste et al. 2012] a proposé une "méta-théorie" des contrats, unifiant les formalismes précédents. Le présent rapport développe, pour cette méta-théorie des contrats, une technique systématique d'abstraction. Les propriétés fondamentales des contrats (relation d'implémentation, d'environnement, de raffinement) peuvent être prouvées sur les abstractions. L'abstraction proposée offre de bonnes propriétés de compositionnalité, même si toutes les propriétés souhaitables ne sont pas valides. Cette technique d'abstraction complète celle des observateurs, qui permettent d'invalider des propriétés de contrats par une approche de type test. Mots-clés : conception des systèmes, composant, contrat, interface, abstraction, interprétation abstraite.
Published: 2014

135. Logical vs. Behavioural Specifications

Author: Beneš, Nikola, Fahrenberg, Uli, Křetínský, Jan, Legay, Axel, Traonouez, Louis-Marie, Masaryk University [Brno] (MUNI), Efficient STAtistical methods in SYstems of systems (ESTASYS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), Institute of Science and Technology [Austria] (IST Austria), Inria Rennes, Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), and Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria)
Subjects: logic, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, specification, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Computer Science::Logic in Computer Science, modal transition system, refinement, [INFO]Computer Science [cs], component-based design
Abstract: There are two fundamentally different approaches to specifying and verifying properties of systems. The logical approach makes use of specifications given as formulae of temporal or modal logics and relies on efficient model checking algorithms; the behavioural approach exploits various equivalence or refinement checking methods, provided the specifications are given in the same formalism as implementations. In this paper we provide translations between the logical formalism of nu-calculus and the behavioural formalism of disjunctive modal transition systems. The translations preserve structural properties of the specification and allow us to perform logical operations on the behavioural specifications as well as behavioural compositions on logical formulae. The unification of both approaches provides additional methods for component-based stepwise design.
Published: 2014

136. Chambers's formula for the graphene and the Hou model with kagome periodicity and applications

Author: Helffer, Bernard, Kerdelhué, Philippe, Royo-Letelier, Jimena, Laboratoire de Mathématiques d'Orsay (LM-Orsay), Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11), Laboratoire de Mathématiques Jean Leray (LMJL), Centre National de la Recherche Scientifique (CNRS)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN), Laboratoire de Mathématiques d'Orsay (LMO), Université Paris-Sud - Paris 11 (UP11)-Centre National de la Recherche Scientifique (CNRS), and Institute of Science and Technology [Austria] (IST Austria)
Subjects: Chambers's formula, Mathematics - Analysis of PDEs, Mathematics::Analysis of PDEs, FOS: Mathematics, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], Graphene, kagome model, semiclassical analysis, Analysis of PDEs (math.AP)
Abstract: The aim of this article is to prove that for the graphene model like for a model considered by the physicist Hou on a kagome lattice, there exists a formula which is similar to the one obtained by Chambers for the Harper model. As an application, we propose a semi-classical analysis of the spectrum of the Hou butterfly near a flat band.
Published: 2014
Full Text: View/download PDF

137. Majority Vote of Diverse Classifiers for Late Fusion

Author: Amaury Habrard, Stéphane Ayache, Emilie Morvant, Lampert Group, Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), Laboratoire Hubert Curien (LHC), Institut d'Optique Graduate School (IOGS)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS), éQuipe AppRentissage et MultimediA [Marseille] (QARMA), Laboratoire d'informatique Fondamentale de Marseille (LIF), Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), European Project: 308036,EC:FP7:ERC,ERC-2012-StG_20111012,L3VISU(2013), Institute of Science and Technology [Austria] (IST Austria), Laboratoire Hubert Curien [Saint Etienne] (LHC), Institut d'Optique Graduate School (IOGS)-Université Jean Monnet [Saint-Étienne] (UJM)-Centre National de la Recherche Scientifique (CNRS), and Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU)-Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU)
Subjects: FOS: Computer and information sciences, Majority rule, Computer science, Machine Learning (stat.ML), 02 engineering and technology, Machine learning, computer.software_genre, Machine Learning (cs.LG), Set (abstract data type), Majority vote, [STAT.ML]Statistics [stat]/Machine Learning [stat.ML], Statistics - Machine Learning, 0202 electrical engineering, electronic engineering, information engineering, Quadratic programming, computer.programming_language, Modality (human–computer interaction), business.industry, [INFO.INFO-MM]Computer Science [cs]/Multimedia [cs.MM], 020207 software engineering, Pascal (programming language), 16. Peace & justice, Multimedia (cs.MM), Computer Science - Learning, Ranking, Classifier fusion, Benchmark (computing), Multimedia analysis, 020201 artificial intelligence & image processing, Pairwise comparison, Artificial intelligence, business, computer, Computer Science - Multimedia
Abstract: In the past few years, a lot of attention has been devoted to multimedia indexing by fusing multimodal informations. Two kinds of fusion schemes are generally considered: The early fusion and the late fusion. We focus on late classifier fusion, where one combines the scores of each modality at the decision level. To tackle this problem, we investigate a recent and elegant well-founded quadratic program named MinCq coming from the machine learning PAC-Bayesian theory. MinCq looks for the weighted combination, over a set of real-valued functions seen as voters, leading to the lowest misclassification rate, while maximizing the voters' diversity. We propose an extension of MinCq tailored to multimedia indexing. Our method is based on an order-preserving pairwise loss adapted to ranking that allows us to improve Mean Averaged Precision measure while taking into account the diversity of the voters that we want to fuse. We provide evidence that this method is naturally adapted to late fusion procedures and confirm the good behavior of our approach on the challenging PASCAL VOC'07 benchmark., Comment: IAPR Joint International Workshops on Statistical Techniques in Pattern Recognition and Structural and Syntactic Pattern Recignition, Joensuu : Finland (2014)
Published: 2014

138. Strichartz inequality for orthonormal functions

Author: Mathieu Lewin, Elliott H. Lieb, Rupert L. Frank, Robert Seiringer, Department of Mathematics (Caltech), Analyse, Géométrie et Modélisation (AGM - UMR 8088), Centre National de la Recherche Scientifique (CNRS)-CY Cergy Paris Université (CY), Department of Mathematics, Princeton University, Department of Physics, Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), European Project: 258023,EC:FP7:ERC,ERC-2010-StG_20091028,MNIQS(2010), and Institute of Science and Technology [Austria] (IST Austria)
Subjects: Hölder's inequality, Pure mathematics, General Mathematics, [PHYS.MPHY]Physics [physics]/Mathematical Physics [math-ph], Mathematics::Analysis of PDEs, FOS: Physical sciences, Poincaré inequality, 01 natural sciences, Sobolev inequality, symbols.namesake, Mathematics - Analysis of PDEs, Operator (computer programming), [MATH.MATH-MP]Mathematics [math]/Mathematical Physics [math-ph], 0103 physical sciences, FOS: Mathematics, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], Orthonormal basis, Log sum inequality, 0101 mathematics, 10. No inequality, Cauchy–Schwarz inequality, Mathematical Physics, Mathematics, Applied Mathematics, 010102 general mathematics, Mathematical analysis, Mathematical Physics (math-ph), Mathematics::Spectral Theory, symbols, 010307 mathematical physics, Bessel's inequality, Analysis of PDEs (math.AP)
Abstract: We prove a Strichartz inequality for a system of orthonormal functions, with an optimal behavior of the constant in the limit of a large number of functions. The estimate generalizes the usual Strichartz inequality, in the same fashion as the Lieb-Thirring inequality generalizes the Sobolev inequality. As an application, we consider the Schr\"odinger equation in a time-dependent potential and we show the existence of the wave operator in Schatten spaces., Comment: Final version to appear in the Journal of the European Mathematical Society
Published: 2014

139. Learning A Priori Constrained Weighted Majority Votes

Author: Emilie Morvant, Aurélien Bellet, Amaury Habrard, Marc Sebban, University of Southern California (USC), Laboratoire Hubert Curien (LHC), Institut d'Optique Graduate School (IOGS)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS), Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), ANR-13-BS02-0001,CompA,Complexité algébrique(2013), European Project: 308036,EC:FP7:ERC,ERC-2012-StG_20111012,L3VISU(2013), Laboratoire Hubert Curien [Saint Etienne] (LHC), Institut d'Optique Graduate School (IOGS)-Université Jean Monnet [Saint-Étienne] (UJM)-Centre National de la Recherche Scientifique (CNRS), Institute of Science and Technology [Austria] (IST Austria), and Similarity of locally structured data in computer vision, SoLSTiCe, ANR-13-BS02-01,Similarity of locally structured data in computer vision, SoLSTiCe, ANR-13-BS02-01
Subjects: 0102 computer and information sciences, 02 engineering and technology, Machine learning, computer.software_genre, Mathematical proof, 01 natural sciences, [STAT.ML]Statistics [stat]/Machine Learning [stat.ML], Artificial Intelligence, Ensemble learning, Sample compression, 0202 electrical engineering, electronic engineering, information engineering, Mathematics, Randomized weighted majority algorithm, Weighted Majority Algorithm, PAC-Bayesian bounds, business.industry, Weighted majority vote, 010201 computation theory & mathematics, A priori and a posteriori, 020201 artificial intelligence & image processing, Artificial intelligence, Minification, business, Nearest neighbors, computer, Classifier (UML), Software, Large margin nearest neighbor
Abstract: The published version is available here: http://link.springer.com/article/10.1007/s10994-014-5462-z; International audience; Weighted majority votes allow one to combine the output of several classifiers or voters. MinCq is a recent algorithm for optimizing the weight of each voter based on the minimization of a theoretical bound over the risk of the vote with elegant PAC-Bayesian generalization guarantees. However, while it has demonstrated good performance when combining weak classifiers, MinCq cannot make use of the useful a priori knowledge that one may have when using a mixture of weak and strong voters. In this paper, we propose P-MinCq, an extension of MinCq that can incorporate such knowledge in the form of a constraint over the distribution of the weights, along with general proofs of convergence that stand in the sample compression setting for data-dependent voters. The approach is applied to a vote of k-NN classifiers with a specific modeling of the voters' performance. P-MinCq significantly outperforms the classic k-NN classifier, a symmetric NN and MinCq using the same voters. We show that it is also competitive with LMNN, a popular metric learning algorithm, and that combining both approaches further reduces the error.
Published: 2014

140. Searching for Collective Behavior in a Large Network of Sensory Neurons

Author: Gašper Tkačik, Michael J. Berry, Dario Amodei, Olivier Marre, William Bialek, Elad Schneidman, Institute of Science and Technology [Austria] (IST Austria), Institut de la Vision, Centre National de la Recherche Scientifique (CNRS)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Université Pierre et Marie Curie - Paris 6 (UPMC), Princeton University, Weizmann Institute of Science [Rehovot, Israël], Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), and HAL UPMC, Gestionnaire
Subjects: Collective behavior, Entropy, [SDV]Life Sciences [q-bio], Action Potentials, 01 natural sciences, 0302 clinical medicine, Statistical physics, lcsh:QH301-705.5, education.field_of_study, Ecology, Artificial neural network, Physics, Principle of maximum entropy, Fishes, Sensory Systems, Small set, [SDV] Life Sciences [q-bio], Computational Theory and Mathematics, Modeling and Simulation, Probability distribution, Research Article, Neural Networks, Sensory Receptor Cells, Movement, Models, Neurological, Population, Urodela, Retina, Statistical Mechanics, 03 medical and health sciences, Cellular and Molecular Neuroscience, 0103 physical sciences, Genetics, Animals, Entropy (information theory), 010306 general physics, education, Biology, Molecular Biology, Ecology, Evolution, Behavior and Systematics, Probability, Computational Neuroscience, Quantitative Biology::Neurons and Cognition, business.industry, Probabilistic logic, Computational Biology, lcsh:Biology (General), 570 Life sciences, biology, Artificial intelligence, Nerve Net, business, 030217 neurology & neurosurgery, Neuroscience
Abstract: Maximum entropy models are the least structured probability distributions that exactly reproduce a chosen set of statistics measured in an interacting network. Here we use this principle to construct probabilistic models which describe the correlated spiking activity of populations of up to 120 neurons in the salamander retina as it responds to natural movies. Already in groups as small as 10 neurons, interactions between spikes can no longer be regarded as small perturbations in an otherwise independent system; for 40 or more neurons pairwise interactions need to be supplemented by a global interaction that controls the distribution of synchrony in the population. Here we show that such “K-pairwise” models—being systematic extensions of the previously used pairwise Ising models—provide an excellent account of the data. We explore the properties of the neural vocabulary by: 1) estimating its entropy, which constrains the population's capacity to represent visual information; 2) classifying activity patterns into a small set of metastable collective modes; 3) showing that the neural codeword ensembles are extremely inhomogenous; 4) demonstrating that the state of individual neurons is highly predictable from the rest of the population, allowing the capacity for error correction., Author Summary Sensory neurons encode information about the world into sequences of spiking and silence. Multi-electrode array recordings have enabled us to move from single units to measuring the responses of many neurons simultaneously, and thus to ask questions about how populations of neurons as a whole represent their input signals. Here we build on previous work that has shown that in the salamander retina, pairs of retinal ganglion cells are only weakly correlated, yet the population spiking activity exhibits large departures from a model where the neurons would be independent. We analyze data from more than a hundred salamander retinal ganglion cells and characterize their collective response using maximum entropy models of statistical physics. With these models in hand, we can put bounds on the amount of information encoded by the neural population, constructively demonstrate that the code has error correcting redundancy, and advance two hypotheses about the neural code: that collective states of the network could carry stimulus information, and that the distribution of neural activity patterns has very nontrivial statistical properties, possibly related to critical systems in statistical physics.
Published: 2014

141. Online Learning in Episodic Markovian Decision Processes by Relative Entropy Policy Search

Author: Zimin, A., Gergely Neu, Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), Sequential Learning (SEQUEL), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Automatique, Génie Informatique et Signal (LAGIS), Université de Lille, Sciences et Technologies-Centrale Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Centre National de la Recherche Scientifique (CNRS), European Project: 270327,EC:FP7:ICT,FP7-ICT-2009-6,COMPLACS(2011), European Project: 246016,EC:FP7:PEOPLE,FP7-PEOPLE-COFUND-2008,ABCDE(2010), Institute of Science and Technology [Austria] (IST Austria), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Laboratoire d'Automatique, Génie Informatique et Signal (LAGIS), Université de Lille, Sciences et Technologies-Centrale Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, and Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Computer Science::Machine Learning, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]
Abstract: International audience; We study the problem of online learning in finite episodic Markov decision processes (MDPs) where the loss function is allowed to change between episodes. The natural performance measure in this learning problem is the regret defined as the difference between the total loss of the best stationary policy and the total loss suffered by the learner. We assume that the learner is given access to a finite action space A and the state space X has a layered structure with L layers, so that state transitions are only possible between consecutive layers. We describe a variant of the recently proposed Relative Entropy Policy Search algorithm and show that its regret after T episodes is 2 sqrt(L|X ||A|T log(|X ||A|/L)) in the bandit setting and 2L sqrt(T log(|X ||A|/L)) in the full information setting, given that the learner has perfect knowledge of the transition probabilities of the underlying MDP. These guarantees largely improve previously known results under much milder assumptions and cannot be significantly improved under general assumptions.
Published: 2013

142. Short Blind Signatures

Author: David Pointcheval, Olivier Blazy, Damien Vergnaud, Georg Fuchsbauer, Ruhr-Universität Bochum [Bochum], Institute of Science and Technology [Austria] (IST Austria), Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities (CASCADE), Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Université Paris sciences et lettres (PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Département d'informatique - ENS Paris (DI-ENS), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Inria Paris-Rocquencourt, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), École normale supérieure - Paris (ENS-PSL), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL)
Subjects: mixed commitments, Theoretical computer science, Computer Networks and Communications, Computer science, Hash function, Bilinear interpolation, 0102 computer and information sciences, 02 engineering and technology, Computer security, computer.software_genre, 01 natural sciences, [SHS]Humanities and Social Sciences, 0202 electrical engineering, electronic engineering, information engineering, Blind signature, medicine, Session (computer science), Safety, Risk, Reliability and Quality, Computer Science::Cryptography and Security, Blindness, medicine.disease, WSN, Signature (logic), 010201 computation theory & mathematics, Hardware and Architecture, ComputingMilieux_COMPUTERSANDSOCIETY, Blind signatures, 020201 artificial intelligence & image processing, computer, e-cash, Software
Abstract: International audience; Blind signatures allow users to obtain signatures on messages hidden from the signer; moreover, the signer cannot link the resulting message/signature pair to the signing session. This paper presents blind signature schemes, in which the number of interactions between the user and the signer is minimal and whose blind signatures are short. Our schemes are defined over bilinear groups and are proved secure in the common-reference-string model without random oracles and under standard assumptions: CDH and the decision-linear assumption. (We also give variants over asymmetric groups based on similar assumptions.) The blind signatures are Waters signatures, which consist of 2 group elements. Moreover, we instantiate partially blind signatures, where the message consists of a part hidden from the signer and a commonly known public part, and schemes achieving perfect blindness. We propose new variants of blind signatures, such as signer-friendly partially blind signatures, where the public part can be chosen by the signer without prior agreement, 3-party blind signatures, as well as blind signatures on multiple aggregated messages provided by independent sources. We also extend Waters signatures to non-binary alphabets by proving a new result on the underlying hash function.
Published: 2013

143. ECHIDNA-mediated post-Golgi trafficking of auxin carriers for differential cell elongation

Author: Kristoffer Jonsson, Heather E. McFarlane, Stéphanie Robert, Jiří Friml, Ranjan Swarup, Delphine Gendre, Errin Johnson, Yohann Boutté, Lacey Samuels, Rishikesh P. Bhalerao, Université de Bordeaux Ségalen [Bordeaux 2], Umea Plant Science Center (UPSC), Department of Forest Genetics and Plant Physiology, Swedish University of Agricultural Sciences (SLU)-Swedish University of Agricultural Sciences (SLU), Dept Bot, University of British Columbia (UBC), University of Nottingham, UK (UON), Institute of Science and Technology [Austria] (IST Austria), Knut and Alice Wallenberg Foundation, Swedish University of Agricultural Sciences (Excellence), and Natural Sciences and Engineering Research Council of Canada
Subjects: 0106 biological sciences, Electron Microscope Tomography, EFFLUX, [SDV]Life Sciences [q-bio], Arabidopsis, Vesicular Transport Proteins, Golgi Apparatus, 01 natural sciences, Cell membrane, heterocyclic compounds, NETWORK, chemistry.chemical_classification, 0303 health sciences, APICAL HOOK DEVELOPMENT, Multidisciplinary, Plant Stems, Membrane transport protein, IAA, food and beverages, Biological Sciences, ETHYLENE, Cell biology, Transport protein, Protein Transport, medicine.anatomical_structure, GROWTH, sorting, Auxin influx, morphogenesis, Biology, Cell Enlargement, Endocytosis, 03 medical and health sciences, Auxin, medicine, Secretion, Secretory pathway, 030304 developmental biology, Indoleacetic Acids, Arabidopsis Proteins, fungi, Cell Membrane, PIN, Membrane Transport Proteins, TRANSPORT, chemistry, biology.protein, ARABIDOPSIS-THALIANA, ATPASE ACTIVITY, 010606 plant biology & botany, ROOT GRAVITROPISM
Abstract: The plant hormone indole-acetic acid (auxin) is essential for many aspects of plant development. Auxin-mediated growth regulation typically involves the establishment of an auxin concentration gradient mediated by polarly localized auxin transporters. The localization of auxin carriers and their amount at the plasma membrane are controlled by membrane trafficking processes such as secretion, endocytosis, and recycling. In contrast to endocytosis or recycling, how the secretory pathway mediates the localization of auxin carriers is not well understood. In this study we have used the differential cell elongation process during apical hook development to elucidate the mechanisms underlying the post-Golgi trafficking of auxin carriers in Arabidopsis. We show that differential cell elongation during apical hook development is defective in Arabidopsis mutant echidna (ech). ECH protein is required for the trans-Golgi network (TGN)-mediated trafficking of the auxin influx carrier AUX1 to the plasma membrane. In contrast, ech mutation only marginally perturbs the trafficking of the highly related auxin influx carrier LIKE-AUX1-3 or the auxin efflux carrier PIN-FORMED-3, both also involved in hook development. Electron tomography reveals that the trafficking defects in ech mutant are associated with the perturbation of secretory vesicle genesis from the TGN. Our results identify differential mechanisms for the post-Golgi trafficking of de novo-synthesized auxin carriers to plasma membrane from the TGN and reveal how trafficking of auxin influx carriers mediates the control of differential cell elongation in apical hook development.
Published: 2013

144. Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory

Author: Uli Fahrenberg, Axel Legay, Nikola Beneš, Jan Křetínský, Benoît Delahaye, Masaryk University [Brno] (MUNI), AELOS, Laboratoire d'Informatique de Nantes Atlantique (LINA), Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN), Efficient STAtistical methods in SYstems of systems (ESTASYS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), Institute of Science and Technology [Austria] (IST Austria), Pedro R. D’Argenio, Hernán Melgratti, Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), and Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria)
Subjects: Model checking, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Normal modal logic, Modal logic, 020207 software engineering, 0102 computer and information sciences, 02 engineering and technology, Fixed point, 01 natural sciences, Rotation formalisms in three dimensions, Linear logic, Logic in Computer Science (cs.LO), Algebra, Modal, 010201 computation theory & mathematics, Computer Science::Logic in Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Hennessy–Milner logic, [INFO]Computer Science [cs], Algorithm, Mathematics
Abstract: International audience; There are two fundamentally different approaches to specifying and verifying properties of systems. The logical approach makes use of specifications given as formulae of temporal or modal logics and relies on efficient model checking algorithms; the behavioural approach exploits various equivalence or refinement checking methods, provided the specifications are given in the same formalism as implementations. In this paper we provide translations between the logical formalism of Hennessy-Milner logic with greatest fixed points and the behavioural formalism of disjunctive modal transition systems. We also introduce a new operation of quotient for the above equivalent formalisms, which is adjoint to structural composition and allows synthesis of missing specifications from partial implementations. This is a substantial generalisation of the quotient for deterministic modal transition systems defined in earlier papers.
Published: 2013

145. Infinite-state games with finitary conditions

Author: Chatterjee, Krishnendu, Fijalkow, Nathanaël, Institute of Science and Technology [Austria] (IST Austria), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Faculty of Mathematics, Informatics, and Mechanics [Warsaw] (MIMUW), and University of Warsaw (UW)
Subjects: FOS: Computer and information sciences, Computer Science::Computer Science and Game Theory, TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, 02 engineering and technology, 000 Computer science, knowledge & systems, Computer Science - Computer Science and Game Theory, Computer Science::Logic in Computer Science, Bounds in omega-regularity, 0202 electrical engineering, electronic engineering, information engineering, Two-player games, [INFO]Computer Science [cs], ComputingMilieux_MISCELLANEOUS, 060201 languages & linguistics, 000 Computer science, knowledge, general works, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], Pushdown games, ComputingMilieux_PERSONALCOMPUTING, 06 humanities and the arts, Verification and synthesis, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Infinite-state systems, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, 0602 languages and literature, Computer Science, 020201 artificial intelligence & image processing, Computer Science::Formal Languages and Automata Theory, conference, Computer Science and Game Theory (cs.GT)
Abstract: We study two-player zero-sum games over infinite-state graphs equipped with ωB and finitary conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state graphs, memoryless strategies are sufficient for finitary BÃ¼chi, and finite-memory suffices for finitary parity games. We then study pushdown games with boundedness conditions, with two contributions. First we prove a collapse result for pushdown games with ωB-conditions, implying the decidability of solving these games. Second we consider pushdown games with finitary parity along with stack boundedness conditions, and show that solving these games is EXPTIME-complete.
Published: 2013

146. Nondeterminism in the Presence of a Diverse or Unknown Future

Author: Denis Kuperberg, Udi Boker, Orna Kupferman, Michał Skrzypczak, Institute of Science and Technology [Austria] (IST Austria), The Hebrew University of Jerusalem (HUJ), Faculty of Mathematics, Informatics, and Mechanics [Warsaw] (MIMUW), and University of Warsaw (UW)
Subjects: Discrete mathematics, TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, Nested word, Theoretical computer science, Computer science, 010102 general mathematics, 0102 computer and information sciences, ω-automaton, Nonlinear Sciences::Cellular Automata and Lattice Gases, 01 natural sciences, Mobile automaton, Nondeterministic algorithm, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], 010201 computation theory & mathematics, Deterministic automaton, Quantum finite automata, Automata theory, Nondeterministic finite automaton, 0101 mathematics, Computer Science::Formal Languages and Automata Theory
Abstract: International audience; Choices made by nondeterministic word automata depend on both the past (the prefix of the word read so far) and the future (the suffix yet to be read). In several applications, most notably synthesis, the future is diverse or unknown, leading to algorithms that are based on deterministic automata. Hoping to retain some of the advantages of nondeterministic automata, researchers have studied restricted classes of nondeterministic automata. Three such classes are nondeterministic automata that are good for trees (GFT; i.e., ones that can be expanded to tree automata accepting the derived tree languages, thus whose choices should satisfy diverse futures), good for games (GFG; i.e., ones whose choices depend only on the past), and determinizable by pruning (DBP; i.e., ones that embody equivalent deterministic automata). The theoretical properties and relative merits of the different classes are still open, having vagueness on whether they really differ from deterministic automata. In particular, while DBP ⊆ GFG ⊆ GFT, it is not known whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also open is the possible succinctness of GFG and GFT automata compared to deterministic automata. We study these problems for ω-regular automata with all common acceptance conditions. We show that GFT=GFG⊃DBP, and describe a determinization construction for GFG automata.
Published: 2013

147. Contracts for System Design

Author: Kim G. Larsen, Thomas A. Henzinger, Werner Damm, Alberto Sangiovanni-Vincentelli, Philipp Reinkemeier, Jean-Baptiste Raclet, Roberto Passerone, Dejan Nickovic, Benoît Caillaud, Albert Benveniste, System synthesis and supervision, scenarios (S4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Austrian Institute of Technology [Vienna] (AIT), Department of Information Engineering and Computer Science (DISI), University of Trento [Trento], Assistance à la Certification d’Applications DIstribuées et Embarquées (IRIT-ACADIE), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Institute for Information Technology [Oldenburg] (OFFIS), Department of Electrical Engineering and Computer Science [Berkeley] (EECS), University of California [Berkeley] (UC Berkeley), University of California (UC)-University of California (UC), Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), Aalborg University [Denmark] (AAU), iCyPhy program sponsored by IBM and United Technology Corporation, VKR Center of Excellence MT-LAB, German Innovation Alliance on Embedded Systems SPES2020, INRIA, European Project: 214373,ICT,FP7-ICT-2007-1,ARTISTDESIGN(2007), Modélisation hybride & conception par contrats pour les systèmes embarqués multi-physiques (HYCOMES), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Department of Electrical Engineering and Computer Sciences (Berkeley EECS), Department für Informatik [Oldenburg], Carl Von Ossietzky Universität Oldenburg, Institute of Science and Technology [Austria] (IST Austria), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Carl Von Ossietzky Universität Oldenburg = Carl von Ossietzky University of Oldenburg (OFFIS), CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Université de Rennes (UNIV-RENNES)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Rennes (ENS Rennes)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Université de Rennes (UNIV-RENNES), Université Toulouse 1 Capitole (UT1)-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1)-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), University of California [Berkeley], University of California, Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, AIT, and University of California-University of California
Subjects: system design, 0209 industrial biotechnology, Test, Interface Theories, Embedded systems, component based design, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], 02 engineering and technology, Contract based design, 020901 industrial engineering & automation, SoftwareMica, Contract-based Design, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], ContBasedDesign, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.1: Requirements/Specifications, System Level Design, Program Verification, Verification, ACM: D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.1: Formal Definitions and Theory, 020207 software engineering, Computer Graphics and Computer-Aided Design, Formal semantics, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, 020202 computer hardware & architecture, Hardware and Architecture, interface, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, contract
Abstract: Systems design has become a key challenge and differentiating factor over the last decades for system companies. Aircrafts, trains, cars, plants, distributed telecommunication military or health care systems, and more, involve systems design as a critical step. Complexity has caused system design times and costs to go severely over budget so as to threaten the health of entire industrial sectors. Heuristic methods and standard practices do not seem to scale with complexity so that novel design methods and tools based on a strong theoretical foundation are sorely needed. Model-based design as well as other methodologies such as layered and compositional design have been used recently but a unified intellectual framework with a complete design flow supported by formal tools is still lacking albeit some attempts at this framework such as Platform-based Design have been successfully deployed. Recently an "orthogonal" approach has been proposed that can be applied to all methodologies proposed thus far to provide a rigorous scaffolding for verification, analysis and abstraction/refinement: contractbased design. Several results have been obtained in this domain but a unified treatment of the topic that can help in putting contract-based design in perspective is still missing. This paper intends to provide such treatment where contracts are precisely defined and characterized so that they can be used in design methodologies such as the ones mentioned above with no ambiguity. In addition, the paper provides an important link between interfaces and contracts to show similarities and correspondences. Examples of the use of contracts in design are provided as well as in depth analysis of existing literature.; Cet article fait le point sur le concept de contrat pour la conception de systèmes. Les contrats que nous proposons portent, non seulement sur des propriétés de typage de leurs interfaces, mais incluent une description abstraite de comportements. Nous proposons une méta-théorie, ou, si l'on veut, une théorie générique des contrats, qui permet le développement séparé de sous-systèmes. Nous montrons que cette méta-théorie se spécialise en l'une ou l'autre des théories connues.
Published: 2012

148. Guest Editorial: Special Issue on Structured Prediction and Inference

Author: Christoph H. Lampert, Matthew B. Blaschko, Organ Modeling through Extraction, Representation and Understanding of Medical Image Content (GALEN), Ecole Centrale Paris-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Centre de vision numérique (CVN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec, Institute of Science and Technology [Austria] (IST Austria), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Ecole Centrale Paris, and Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria)
Subjects: Computer science, business.industry, Dimensionality reduction, Word error rate, Inference, Machine learning, computer.software_genre, Field (computer science), Support vector machine, Statistical classification, Artificial Intelligence, Pattern recognition (psychology), [INFO]Computer Science [cs], Computer Vision and Pattern Recognition, Artificial intelligence, Structured prediction, business, computer, Software, ComputingMilieux_MISCELLANEOUS
Abstract: Computer vision has been profoundly influenced by machine learning in the past two decades. Canonical papers in the field, such as [Turk and Pentland(1991)], have applied statistical methods to visual data to achieve results that are both compelling and accurate. Classification algorithms, such as support vector machines, are now commonly applied to discriminatively train vision systems. Such systems empirically minimize risk functionals that measure the expected classification error rate given an i.i.d. sampling assumption [Vapnik(1998), Scholkopf and Smola(2002)]. While many intermediate goals in computer vision can be formulated as classification, regression, or dimensionality reduction– the settings most commonly addressed in the machine learning literature–more appropriate statistical methods are needed to train vision systems that make collections of related predictions, such as in segmentation, parts based models, or scene layout analysis. In these settings, the independence assumptions made by binary classifiers no longer hold, and independent prediction may not be computationally or statistically feasible. Structured output prediction [Bakir et al(2007)Bakir, Hofmann, Scholkopf, Smola, Taskar, and Vishwanathan, Nowozin and Lampert(2011)] is the task of predicting related variables given some input, such as image or video data. Study of structured output prediction in the machine learning field has led to a number of techniques be
Published: 2012

149. Synchronous interface theories and time triggered scheduling

Author: Uli Fahrenberg, Dejan Nickovic, Axel Legay, Benoît Delahaye, Thomas A. Henzinger, AELOS, Laboratoire d'Informatique de Nantes Atlantique (LINA), Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS), Efficient STAtistical methods in SYstems of systems (ESTASYS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria), Holger Giese, Grigore Rosu, TC 6, WG 6.1, Giese, Holger, Rosu, Grigore, Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), and Institute of Science and Technology [Austria] (IST Austria)
Subjects: Theoretical computer science, Computer science, Interface model, Computation, Distributed computing, 004 Data processing & computer science, Mathematical properties, 020207 software engineering, Shared variables, Interface theory, 02 engineering and technology, Systems modeling, Fully automatic, Compatibility (mechanics), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, [INFO]Computer Science [cs]
Abstract: International audience; We propose synchronous interfaces, a new interface theory for discrete-time systems. We use an application to time-triggered scheduling to drive the design choices for our formalism; in particular, additionally to deriving useful mathematical properties, we focus on providing a syntax which is adapted to natural high-level system modeling. As a result, we develop an interface model that relies on a guarded-command based language and is equipped with shared variables and explicit discrete-time clocks. We define all standard interface operations: compatibility checking, composition, refinement, and shared refinement. Apart from the synchronous interface model, the contribution of this paper is the establishment of a formal relation between interface theories and real-time scheduling, where we demonstrate a fully automatic framework for the incremental computation of time-triggered schedules.
Published: 2012

150. Lapin: An efficient authentication protocol based on Ring-LPN

Author: Stefan Heyse, Krzysztof Pietrzak, Vadim Lyubashevsky, Christof Paar, Eike Kiltz, Horst Gortz Institute for IT Security, Ruhr University Bochum (RUB), Ruhr-Universität Bochum [Bochum], Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities (CASCADE), Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Institute of Science and Technology [Austria] (IST Austria), Anne Canteaut, Département d'informatique - ENS Paris (DI-ENS), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Inria Paris-Rocquencourt, École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), and Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria)
Subjects: Ring (mathematics), Otway–Rees protocol, Computer science, business.industry, Byte, 020206 networking & telecommunications, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 010201 computation theory & mathematics, Authentication protocol, Universal composability, 0202 electrical engineering, electronic engineering, information engineering, Noise (video), business, Communication complexity, Protocol (object-oriented programming), Computer network
Abstract: International audience; We propose a new authentication protocol that is provably secure based on a ring variant of the learning parity with noise (LPN) problem. The protocol follows the design principle of the LPN-based protocol from Eurocrypt'11 (Kiltz et al.), and like it, is a two round protocol secure against active attacks. Moreover, our protocol has small communication complexity and a very small footprint which makes it applicable in scenarios that involve low-cost, resource-constrained devices. Performance-wise, our protocol is more efficient than previous LPN-based schemes, such as the many variants of the Hopper-Blum (HB) protocol and the aforementioned protocol from Eurocrypt'11. Our implementation results show that it is even comparable to the standard challenge-and-response protocols based on the AES block-cipher. Our basic protocol is roughly 20 times slower than AES, but with the advantage of having 10 times smaller code size. Furthermore, if a few hundred bytes of non-volatile memory are available to allow the storage of some off-line pre-computations, then the online phase of our protocols is only twice as slow as AES.
Published: 2012

Catalog

Books, media, physical & digital resources

See catalog results

Searchworks

Select search scope, currently: Articles Catalog books, media & more in Jio Institute collections Articles journal articles & other e-resources

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Publication Type

Journal

Region

Database

Publisher

375 results on '"Institute of Science and Technology [Austria] (IST Austria)"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources