Search

Your search keyword '"Sylvie Alayrangues"' showing total 22 results
Start Over Author "Sylvie Alayrangues" Publication Year Range Last 50 years
22 results on '"Sylvie Alayrangues"'

7. Comment parler de sciences aux jeunes

Author

Sylvie Alayrangues, Aline Bonami, Samuel Guibal, Halima Hadi, Daniel Hennequin, Daniel Bideau, and Cyril Imbert

Subjects
General Medicine
Abstract

Le 1er fevrier 2016 s’est tenue a la prefecture de Paris et d’Ile-de-France (5, rue Leblanc, Paris, 15e ) la troisieme journee Sciences et medias. Ces journees sont organisees tous les deux ans par des societes savantes scientifiques. Se sont associees cette annee la Societe Chimique de France (SCF), la Societe Francaise de Physique (SFP), la Societe Francaise de Statistique (SFdS), la Societe Informatique de France (SIF), la Societe de Mathematiques Appliquees et Industrielles (SMAI) et la Societe Mathematique de France (SMF). Le but de ces journees est de participer a la reflexion sur la facon dont les medias traitent les questions scientifiques.

Published
2017

9. Une analyse des exercices d’algorithmique et de programmation du brevet 2017

Author

Sylvie Alayrangues, Emmanuel Beffara, Sébastien Daniel, Christophe Declercq, Anne Héam, Jean-Vincent Loddo, Philippe Marquet, Jean-Christophe Masseron, Antoine Meyer, Malika More, Florence Nény, Vincent Pantaloni, Gaëtan Perrin, Cécile Prouteau, Georges Saliba, Sylviane Schwer, Fabien Tarissan, Chloé Ubera, Jean-Marc Vincent, Emmanuel Volte, Université de Poitiers, Synthèse et analyse d'images (XLIM-ASALI), XLIM (XLIM), Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS)-Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS), Institut de recherche sur l'enseignement des mathématiques d'Aix-Marseille (IREM), Aix Marseille Université (AMU), Institut de Mathématiques de Marseille (I2M), Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), Institut de Recherche sur l’Enseignement des Mathématiques [Lorraine] (IREM), École supérieure du professorat et de l'éducation - Académie de Nantes (ESPE Nantes), Université de Nantes (UN), Laboratoire d'Informatique et de Mathématiques (LIM), Université de La Réunion (UR), IREM de Franche-Comté, IREM Paris-Nord, Université Paris 13 (UP13), Université de Lille, IREM de Paris, Université Paris Diderot - Paris 7 (UPD7), Laboratoire d'Informatique Gaspard-Monge (LIGM), Université Paris-Est Marne-la-Vallée (UPEM)-École des Ponts ParisTech (ENPC)-ESIEE Paris-Fédération de Recherche Bézout-Centre National de la Recherche Scientifique (CNRS), Université de Clermont-Ferrand, IRES Orléans, Université d'Orléans (UO), IREM Aquitaine, Université de Bordeaux (UB), Laboratoire d'Informatique de Paris-Nord (LIPN), Université Paris 13 (UP13)-Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS), Institut des Sciences sociales du Politique (ISP), École normale supérieure - Cachan (ENS Cachan)-Université Paris Nanterre (UPN)-Centre National de la Recherche Scientifique (CNRS), Institut de Recherche sur l’Enseignement des Mathématiques [Grenoble] (IREM), Performance analysis and optimization of LARge Infrastructures and Systems (POLARIS ), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-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 )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Analyse, Géométrie et Modélisation (AGM - UMR 8088), Centre National de la Recherche Scientifique (CNRS)-CY Cergy Paris Université (CY), Marquet, Philippe, Centre National de la Recherche Scientifique (CNRS)-Fédération de Recherche Bézout-ESIEE Paris-École des Ponts ParisTech (ENPC)-Université Paris-Est Marne-la-Vallée (UPEM), Université Sorbonne Paris Cité (USPC)-Institut Galilée-Université Paris 13 (UP13)-Centre National de la Recherche Scientifique (CNRS), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Nanterre (UPN), CY Cergy Paris Université (CY)-Centre National de la Recherche Scientifique (CNRS), IREM de Clermont-Ferrand, Laboratoire d'Informatique Gaspard-Monge (ligm), Performance analysis and optimization of LARge Infrastructures and Systems (POLARIS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA), Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Centre National de la Recherche Scientifique (CNRS), and Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU)

Subjects
[INFO]Computer Science [cs], [SHS] Humanities and Social Sciences, [INFO] Computer Science [cs], [SHS]Humanities and Social Sciences
Abstract

National audience; Nous proposons une analyse critique de l’ensemble des exercices de l’épreuve de mathématiques 2017 du brevet ayant trait au thème « Algorithmique et programmation » du programme de cycle 4. Certains de ces exercices ne mettent en jeu que de manière très superficielle des compétences spécifiquement informatiques, mais portent plutôt sur des compétences mathématiques « traditionnelles », liées par exemple à l’algèbre ou la géométrie. Notre analyse met en regard ces différentes compétences, et propose des adaptations de certains énoncés afin d’en permettre une exploitation plus riche.

Published
2019

12. Equivalence between Closed Connected n-G-Maps without Multi-Incidence and n-Surfaces

Author

Pascal Lienhardt, Xavier Daragon, Jacques-Olivier Lachaud, and Sylvie Alayrangues

Subjects
Statistics and Probability, Discrete mathematics, business.industry, Applied Mathematics, Discrete geometry, Condensed Matter Physics, Mathematical proof, Constructive, Modeling and Simulation, Geometry and Topology, Computer Vision and Pattern Recognition, Equivalence (formal languages), business, Geometric modeling, Generalized map, Subdivision, Mathematics
Abstract

Many combinatorial structures have been designed to represent the topology of space subdivisions and images. We focus here on two particular models, namely the n-G-maps used in geometric modeling and computational geometry and the n-surfaces used in discrete imagery. We show that a subclass of n-G-maps is equivalent to n-surfaces. To achieve this, we provide several characterizations of n-surfaces. Finally, the proofs being constructive, we show how to switch from one representation to another effectively.

Published
2008

13. Homology of Cellular Structures Allowing Multi-incidence

Author

Sylvie Alayrangues, Guillaume Damiand, Samuel Peltier, Pascal Lienhardt, Synthèse et analyse d'images (XLIM-ASALI), XLIM (XLIM), Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS)-Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS), Geometry Processing and Constrained Optimization (M2DisCo), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), and Université de Lyon-Université Lumière - Lyon 2 (UL2)

Subjects
Cellular homology, 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], 01 natural sciences, Mathematics::Algebraic Topology, Theoretical Computer Science, CW complex, Combinatorics, Simplicial complex, Morse homology, Mathematics::K-Theory and Homology, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, 0202 electrical engineering, electronic engineering, information engineering, Discrete Mathematics and Combinatorics, Mathematics, Simplicial approximation theorem, Discrete mathematics, 020207 software engineering, Simplicial homology, combinatorial maps, Computational Theory and Mathematics, 010201 computation theory & mathematics, Geometry and Topology, homology computation, Singular homology, Relative homology, MathematicsofComputing_DISCRETEMATHEMATICS, boundary operator
Abstract

International audience; This paper focuses on homology computation over ‘cellular’ structures that allow multi-incidence between cells. We deal here with combinatorial maps, more precisely chains of maps and subclasses such as maps and generalized maps. Homology computation on such structures is usually achieved by computing simplicial homology on a simplicial analog. But such an approach is computationally expensive because it requires computing this simplicial analog and performing the homology computation on a structure containing many more cells (simplices) than the initial one. Our work aims at providing a way to compute homologies directly on a cellular structure. This is done through the computation of incidence numbers. Roughly speaking, if two cells are incident, then their incidence number characterizes how they are attached. Having these numbers naturally leads to the definition of a boundary operator, which induces a homology. Hence, we propose a boundary operator for chains of maps and provide optimization for maps and generalized maps. It is proved that, under specific conditions, the homology of a combinatorial map as defined in the paper is equivalent to the homology of its simplicial analogue.

Published
2015

19. Border Operator for Generalized Maps

Author

Guillaume Damiand, Sylvie Alayrangues, Samuel Peltier, Pascal Lienhardt, SIC, XLIM (XLIM), Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS)-Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS)-Université de Poitiers, Geometry Processing and Constrained Optimization (M2DisCo), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), and IG

Subjects
Border operation, Generalized maps, Cellular homology, Computation, 020207 software engineering, 02 engineering and technology, Homology (mathematics), Data structure, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Simplicial homology, Combinatorics, Required property, 0202 electrical engineering, electronic engineering, information engineering, Tetrahedron, 020201 artificial intelligence & image processing, Klein bottle, Mathematics
Abstract

International audience; In this paper, we define a border operator for the generalized maps, a data structure for representing cellular quasi-manifolds. The interest of this work lies in the optimization of homology computation, by using a model with less cells than models in which cells are regular ones as tetrahedra and cubes. For instance, generalized maps have been used for representing segmented images. We first define a face operator to retrieve the faces of any cell, then deduce the border operator and prove that it satisfies the required property : border of border is void. At last, we study the links between the cellular homology defined from our border operator and the classical simplicial homology.

Published
2009

20. Computing Canonical Polygonal Schemata with Generalized Maps

Author

Guillaume Damiand, Sylvie Alayrangues, 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), SIC, XLIM (XLIM), Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS)-Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS)-Université de Poitiers, Image et Son, and ANR-06-MDCA-0008,FOGRIMMI,FOuille de GRandes IMages Microscopiques(2006)

Subjects
Discrete mathematics, Applied Mathematics, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 020207 software engineering, ComputerApplications_COMPUTERSINOTHERSYSTEMS, 02 engineering and technology, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], generalized map, topological invariant, canonical polygonal schema, 020303 mechanical engineering & transports, 0203 mechanical engineering, Schema (psychology), Polygonal chain, 0202 electrical engineering, electronic engineering, information engineering, Discrete Mathematics and Combinatorics, Generalized map, Algorithm, Computer Science::Databases, Mathematics
Abstract

International audience; This paper shows that a well-known algorithm proposed to compute the canonical polygonal schema of a surface can be transferred onto a 2-dimensional generalized map. We show that transformation rules on polygonal schemata can be achieved in O(1) with generalized maps, which can help optimizing existing algorithms.

Published
2008

21. Computation of Homology Groups and Generators

Author

Jacques-Olivier Lachaud, Samuel Peltier, Sylvie Alayrangues, Laurent Fuchs, SIGNAL-IMAGE-COMMUNICATION (SIC), Université de Poitiers-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), IG, Image et Son, and Peltier, Samuel

Subjects
Pure mathematics, Cellular homology, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], 0102 computer and information sciences, 02 engineering and technology, Homology (mathematics), Topology, 01 natural sciences, Image analysis, CW complex, Combinatorics, Morse homology, ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, 0202 electrical engineering, electronic engineering, information engineering, Shape invariant, Excision theorem, Mathematics, General Engineering, Topological invariant, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Computer Graphics and Computer-Aided Design, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], Human-Computer Interaction, Mayer–Vietoris sequence, 010201 computation theory & mathematics, Moore space (algebraic topology), 020201 artificial intelligence & image processing, Homology groups, Singular homology, Relative homology
Abstract

Topological invariants are extremely useful in many applications related to digital imaging and geometric modeling, and homology is a classical one, which has not yet been fully explored in image applications. We present an algorithm that computes the whole homology of an object of arbitrary dimension: Betti numbers, torsion coefficients and generators. Effective implementation of this algorithm has been realized in order to perform experimentations. Results on classical shapes in algebraic topology and on discrete objects are presented and discussed.

Published
2005

22. Equivalence between Closed Connected n - G -Maps without Multi-Incidence and n -Surfaces.

Author

Sylvie Alayrangues, Xavier Daragon, Jacques-Olivier Lachaud, and Pascal Lienhardt

Abstract

Abstract  Many combinatorial structures have been designed to represent the topology of space subdivisions and images. We focus here on two particular models, namely the n-G-maps used in geometric modeling and computational geometry and the n-surfaces used in discrete imagery. We show that a subclass of n-G-maps is equivalent to n-surfaces. To achieve this, we provide several characterizations of n-surfaces. Finally, the proofs being constructive, we show how to switch from one representation to another effectively. [ABSTRACT FROM AUTHOR]

Published
2008
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results