Visual tools to select a layout for an adapted living area
|
|
- Marjorie Barnett
- 6 years ago
- Views:
Transcription
1 Visual tools to select a layout for an adapted living area Sébastien AUPETIT, Arnaud PURET, Pierre GAUCHER, Nicolas MONMARCHÉ and Mohamed SLIMANE Université François Rabelais Tours, Laboratoire d Informatique, 64 avenue Jean Portalis, Tours, France {aupetit,arnaud.puret,gaucher,monmarche,slimane}@univ-tours.fr Abstract. In this paper, we present several visual tools used in the HM2PH project in order to include the future occupant in the design of her/his adapted house. The common goal is help the occupant to choose between a set of topological layouts. Each tool presents different characteristics and properties. Keywords. visualization, adapted living area, conception 1. Introduction and context In this paper, we present a part of our work on the HM2PH project (Habitat Modulaire et Mobile pour Personnes Handicapées 1 ) [6,5,11] which is developed at the Laboratoire d Informatique de l Université François-Rabelais de Tours. The main HM2PH goal consists in designing a affordable mobile and adapted living area for disabled persons. To simplify the design process, we rely on softwares. As other studies (see [3]), we need to take into account the specification of the specialists but we also aim at the inclusion of the future occupant into the design process. With such aim in mind, we split the design of the house into several steps (see Figure 1) grouped into three parts: the definition of the required features of the house, the layout design, and the layout validation and finalization. The first part can be half-automated. Laws, recommendations and information databases are automatically used but assistive technologies and wishes of the person are defined by the specialist and the future occupant. They define all the characteristics that the living area must satisfy. The second part is concerned with the design of a layout that satisfies the needs. The third part aims to validate and to finalize the selected layout. If the validation fails, a feedback process can be used to backtrack to the layout design part. The layout design part is organized according to the method we have used to automatically compute valid layouts from the needs. There is a lot of methods to compute satisfying layouts such as algebraic methods [2], deductive methods [9], methods with local propagation [4] or Constraint-Satisfaction-Problem based methods [12]. In our work, we considered a Constraint-Satisfaction-Problem based method [7,8,11] for many rea- 1 Modular and mobile house for disabled persons
2 Figure 1. The steps of the HM2PH design process sons (see [11] for a full explanation). Let us recall the main ones. The computed layouts fully respect the explained constraints. The layout generation can be split into two processes [7,8]: a generation of topological layouts and a geometric optimization. This split has for advantage to greatly reduce the computing cost. A topological layout is a global organization of rooms in the house that can be considered as an abstract layout or a draft layout. For a topological layout, dimensions, orientations and positions of the rooms are defined by ranges of values. All layouts, that can be derived from it, share the same organization and satisfy the needs in a same manner. Moreover, an exhaustive generation of topological layouts is tractable. To obtain a concrete layout for which each numerical ranges has only one value, a geometric optimization process is applied. It consists in reducing each range of values of a topological layout to the best suited value for a given criterion while satisfying the needs. The obtained layout is then a concrete layout. When a single concrete layout has been chosen by the occupant, it is needed to layout the required equipments and furnitures in the house to provide a realistic model of the house and to be able to validate the layout in a concrete realistic manner. During the overall process, the future occupant can decide if a topological layout or if the inteior is well organized or not. Automatic and visual validation tools [11] of the chosen layout are provided to help in this task. This validation and the finalization of the layout form the last steps of the design process. From the needs, lots of topological layouts can be generated. Moreover, the geometric optimization of a topological layout is time consuming. It is therefore impossible to apply the geometric optimization to all the topological layouts. But, very few topological layouts are usually interesting for the future occupant. Then, we need to choose few suitable topological layouts on which the geometric optimization is performed. A way to achieve it is to provide various visual tools to select layouts to the future occupant. Such tools are presented in this paper. 2. Key principles to compare the properties of topological layouts To compare topological layouts, we propose to follow two complementary approaches: a continuous one and a discrete one. The continuous approach considers pairwise dissimilarities between layouts. This dissimilarity is defined by the future occupant from interesting characteristic rooms such as the corridors or the kitchen. It evaluates how those
3 The black level shows the probability that there is a part of a corridor at this location. The first three representations are related to virtual layouts and the last to a concrete layout. Figure 2. Representations from four topological layouts showing where the corridors are located. (a) Positionning of the clusters (b) Inspection of a cluster Figure 3. Two-stages radial representation of the layouts. rooms are positioned and sized equally in two topological layouts (see [11] for details). It has been formally shown (in [10,11]) that this dissimilarity is a distance and that an euclidean embedding of the topological layouts can be built. Such embedding allows to consider a layout as a vector/point. It allows to manipulate a vector space of both concrete and virtual topological layouts. The virtual topological layouts can be combined for example as a weighted barycenter. The intrinsic properties of the dissimilarity allows to build a graphical representation from a virtual topological layout displayed with colors (showing where the interesting characteristic rooms are located on the layout) (see Figure 2). The second approach, which is a discrete one, considers the presence or absence of interesting rooms on nine locations/sectors (North, North-Est, Est, South-Est, South, South-West, West, North-West, Center). A topological layout is then ranked as verifying or not the presence of a type of rooms in a particular location. These two approaches lead us to define three kinds of visual tools to select a topological layout. 3. Selection of topological layouts by the future occupant 3.1. Two-stages radial representation The two-stages radial representation considers the dissimilarity approach (see [1,11] for details). It consists in clustering topological layouts with the K-means method and to represent the center of the clusters on a circle. The centers are positioned in order that the angle between two classes is representative of the dissimilarity between them and such that the sum of the distances between all the classes following the order on the circle is minimum. Virtual layout representations are used to show the center of the clusters and to show the average of all the topological layouts. The user can interactively inspect the content of a cluster and see the topological layouts composing the cluster by clicking on the center of a cluster. Figure 3 gives an example.
4 Figure 4. Nicheworks representation of a HAC built from the topological layouts. Figure 5. The interactive filtering method Hierarchical Ascendant Classification and the Nicheworks representation The second visual tool is based on two well known techniques: the Hierarchical Ascendant Classification (HAC) and the Nicheworks representation (see [10] for details). The pairwise dissimilarities are considered and a HAC is built on the representatives of the layouts. The hierarchy is plotted using the Nicheworks representation [13] which plots a tree using a concentrical approach and using an angles splitting process. Each sub-tree is plotted recursively on a screen space proportional to its number of leafs. In our tool, the leaves correspond to the topological layouts and the inner nodes correspond to the virtual topological layouts. Using the previously described representation of virtual topological layouts, the tool allows to progressively choose a layout (on the leaves) from the mean of all layouts (the root of the tree). Figure 4 gives an example Interactive filtering The third visual tool, which is also the most intuitive, considers the presence or the absence of interesting rooms on given location. The tool can be qualified as a filtering method. A filter rejects all layouts for which the interesting characteristic (type of rooms and location) is not present. For each filter, the list of valid topological layouts is displayed independently of the other filters. Then a last list is displayed showing only the layouts passing simultaneously all the filters. The user can interactively remove, add or change a filter. Figure 5 gives an example Differences between the three visual tools The three tools have been designed with different aims and show different properties: the aim (what can we do with it?), the intuitiveness of the analysis (do we need knowledge to understand the representation?), the simplicity (do we need to set up lots of parameters to use it?) and the abstraction capability (does the method allow to obtain an abstract view of the data?). The Table 1 gives the properties of the tools.
5 Table 1. Properties of the three visual tools. High rating is the best. Two-stages radial representation HAC combined with NicheWorks Interactive filtering Aim Trends search Progressive choice Filter layouts Intuitiveness of the analysis low medium high Simplicity low medium medium Abstraction capability medium high low 4. Conclusion In this paper, we have presented three visual tools to include the future occupant in the process of designing the future adapted house. The three tools are using different key principles and methods leading to different properties. The two-stages radial representation is more suited as an initial trend search in the set of topological layouts whereas others (HAC combined with NicheWorks and Interactive filtering) are more suited to make a decision by progressive choices or by filtering the layouts. In the future, we plan to link the tools together allowing to switch from one to another while keeping the context (the current cluster, the current layout... ). References [1] S. Aupetit, A. Puret, P. Gaucher, N. Monmarché, and M. Slimane. Classification automatique et visualisation de plans d habitations adaptées. Handicap 2006, pages 81 88, [2] Philippe Charman. Gestion des contraintes géométriques pour l aide à l aménagement spatial. PhD thesis, INRIA, [3] M. Ferreira, J. M., T. Amaral, D. Santos, A. Agiannidis, and M. Edge. The custodian tool: Simple design of home automation systems for people with special needs. EIB Scientific Conference, [4] G. Kwaiter. Etude et développement d un modeleur déclaratif 3D temps réel d environnements virtuels, basés sur les métaheuristiques issues de la recherche locale. PhD thesis, Université Paul Sabatier de Toulouse, [5] J. Leloup. Spécification d un espace vide mobile et adapté pour des personnes en déficit d autonomie. PhD thesis, Université François Rabelais, Tours, [6] J. Leloup, P. Gaucherand J. Garcia, and J. Siffert. The hmph project: Software for the design of an adapted living area. AAATE 2003, pages , [7] B. Medjdoub and B. Yannoub. Separating topology and geometry in space planning. Computer-Aided Design, 32(1):39 61, [8] B. Medjdoub and B. Yannoub. Dynamic space ordering at a topological level in space planning. AI in Engineering, 15(1):47 60, [9] D. Plemenos. Contribution à l étude et au développement des techniques de modélisation, génération et visualisation de scènes. PhD thesis, Université de Nantes, [10] A. Puret, S. Aupetit, P. Gaucher, N. Monmarché, and M. Slimane. Selection by visualization of topological layouts for adapted living area design. LNCS : ICCHP 2006, 4061: , [11] Arnaud Puret. Projet HM2PH, Génération automatique de plans et visite virtuelle d habitats adaptés pour personnes handicapées. Thèse de doctorat, Université François Rabelais de Tours, [12] O. Le Roux, V. Gaildrat, and R. Caubet. Design of a new constraints solver for 3d declarative modelling. 3IA 2000, pages 75 87, [13] G. J. Wills. Nicheworks - interactive visualization of very large graphs. Journal of Computational and Graphical Statistics, 8(2): , 1999.
Visualization process of Temporal Data
Visualization process of Temporal Data Chaouki Daassi 1, Laurence Nigay 2 and Marie-Christine Fauvet 2 1 Laboratoire SysCom, Université de Savoie, Chambéry, France 2 Laboratoire CLIPS-IMAG BP 53-38041,
More informationVector Representation of Graphs: Application to the Classification of Symbols and Letters
Vector Representation of Graphs: Application to the Classification of Symbols and Letters Nicolas Sidère, Pierre Héroux, Jean-Yves Ramel To cite this version: Nicolas Sidère, Pierre Héroux, Jean-Yves Ramel.
More informationDeclarative Approach of Inverse Lighting Problems
Declarative Approach of Inverse Lighting Problems V. Jolivet, D. Plemenos, P. Poulingeas. MSI Laboratory. 83 rue d Isle, 87000 Limoges. France. E-mail: jolivet@unilim.fr plemenos@unilim.fr poulinge@msi.unilim.fr
More informationObject Detection in Natural Scenery
Object Detection in Natural Scenery P. MAKRIS and N. VINCENT Laboratoire d'informatique Université de Tours (LI/E3I) 64, avenue Jean Portalis 37200 Tours FRANCE Abstract: - In this paper we are tackling
More informationSoCQ : un système de gestion de données et de services en environnement pervasif
SoCQ : un système de gestion de données et de services en environnement pervasif Yann Gripay, Le-Quyen La, Frédérique Laforest, Jean-Marc Petit Université de Lyon, CNRS INSA-Lyon, LIRIS, UMR5205 7 avenue
More informationConstraint-Based 3D-Object Layout using a Genetic Algorithm
Constraint-Based 3D-Object Layout using a Genetic Algorithm Stéphane Sanchez Olivier Le Roux Hervé Luga Véronique Gaildrat Department of Computer Science IRIT UPS, 118 route de Narbonne, 31062 Toulouse
More informationSpatial Relations and Architectural Plans Layout problems and a language for their design requirements
Spatial Relations and Architectural Plans Layout problems and a language for their design requirements Can BAYKAN * Abstract: Programs for the solution of space layout problems are not widely used in practice.
More informationComparison of spatial indexes
Comparison of spatial indexes Nathalie Andrea Barbosa Roa To cite this version: Nathalie Andrea Barbosa Roa. Comparison of spatial indexes. [Research Report] Rapport LAAS n 16631,., 13p. HAL
More informationHierarchical Clustering Lecture 9
Hierarchical Clustering Lecture 9 Marina Santini Acknowledgements Slides borrowed and adapted from: Data Mining by I. H. Witten, E. Frank and M. A. Hall 1 Lecture 9: Required Reading Witten et al. (2011:
More informationLandmarks on sonar image classification for registration
Landmarks on sonar image classification for registration Cedric Rominger 1, Arnaud Martin 1 1 E3I2, EA3876 ENSIETA, 2 rue François Verny, 29806 Brest Cedex, France, {Cedric.Rominger,Arnaud.Martin}@ensieta.fr
More informationXML Document Classification using SVM
XML Document Classification using SVM Samaneh Chagheri, Catherine Roussey, Sylvie Calabretto, Cyril Dumoulin To cite this version: Samaneh Chagheri, Catherine Roussey, Sylvie Calabretto, Cyril Dumoulin.
More informationSemantic Indexing of Algorithms Courses Based on a New Ontology
Semantic Indexing of Algorithms Courses Based on a New Ontology EL Guemmat Kamal 1, Benlahmer Elhabib 2, Talea Mohamed 1, Chara Aziz 2, Rachdi Mohamed 2 1 Université Hassan II - Mohammedia Casablanca,
More informationA Pretopological Approach for Clustering ( )
A Pretopological Approach for Clustering ( ) T.V. Le and M. Lamure University Claude Bernard Lyon 1 e-mail: than-van.le@univ-lyon1.fr, michel.lamure@univ-lyon1.fr Abstract: The aim of this work is to define
More informationBlazo Nastov. Journée des doctorant, Nîmes, France 19 June 2014
Apport de l Ingénierie des Langages de Modélisation à l Ingénierie Système Basée sur les Modèles : conception d une méthode outillée pour la génération de Langages Métier interopérables, analysables et
More informationThe K-Ring: a versatile model for the design of MIMD computer topology
The K-Ring: a versatile model for the design of MIMD computer topology P. Kuonen Computer Science Department Swiss Federal Institute of Technology CH-115 Lausanne, Switzerland E-mail: Pierre.Kuonen@epfl.ch
More informationDistance Transform. Etienne Folio. Technical Report n o 0806, JUNE 2008 revision 1748
Distance Transform Etienne Folio Technical Report n o 0806, JUNE 2008 revision 1748 Abstract: A distance transform, also known as distance map or distance field, is a representation of a distance function
More informationSIMULATION OF A TIRE INSPECTION SYSTEM
SIMULATION OF A TIRE INSPECTION SYSTEM W. H. GRAY 1, C. DUMONT 1,2, and M. A. ABIDI 1 1 IRIS Laboratory, University of Tennessee, Knoxville, TN, 37996 U.S.A. 2 Le2I laboratory, IUT Le Creusot, University
More informationA COMPARATIVE STUDY OF METHODS FOR MANUFACTURING PROCESS PLAN SIMULATION
Advances in Production Engineering & Management 5 (010) 3, 163-170 ISSN 1854-650 Scientific paper A COMPARAIVE SUDY OF MEHODS FOR MANUFACURING PROCESS PLAN SIMULAION Hamou, S. * ; Linares, J.M. ** ; Cheikh,
More informationModeling and Simulation in Scilab/Scicos with ScicosLab 4.4
Modeling and Simulation in Scilab/Scicos with ScicosLab 4.4 Stephen L. Campbell, Jean-Philippe Chancelier and Ramine Nikoukhah Modeling and Simulation in Scilab/Scicos with ScicosLab 4.4 Second Edition
More informationTraffic Grooming in Bidirectional WDM Ring Networks
Traffic Grooming in Bidirectional WDM Ring Networks Jean-Claude Bermond, David Coudert, Xavier Munoz, Ignasi Sau To cite this version: Jean-Claude Bermond, David Coudert, Xavier Munoz, Ignasi Sau. Traffic
More informationAN APPROACH TO CLASSIFY SYNONYMS IN A DICTIONARY OF VERBS
IADIS International Conference on Applied Computing 2005 AN APPROACH TO CLASSIFY SYNONYMS IN A DICTIONARY OF VERBS Awada Ali Lebanese University Faculty of sciences section 1 Hadath - Lebanon ABSTRACT
More informationAROMA results for OAEI 2009
AROMA results for OAEI 2009 Jérôme David 1 Université Pierre-Mendès-France, Grenoble Laboratoire d Informatique de Grenoble INRIA Rhône-Alpes, Montbonnot Saint-Martin, France Jerome.David-at-inrialpes.fr
More informationInformation mining and information retrieval : methods and applications
Information mining and information retrieval : methods and applications J. Mothe, C. Chrisment Institut de Recherche en Informatique de Toulouse Université Paul Sabatier, 118 Route de Narbonne, 31062 Toulouse
More informationApplying Description Logic to Product Behavioral Design within Advanced CAD Systems
Applying Description Logic to Product Behavioral Design within Advanced CAD Systems François de Bertrand de Beuvron Amadou Coulibaly LICIA, INSA Strasbourg, FRANCE beuvron@liia.u-strasbg.fr amadou.coulibaly@insa-strasbourg.fr
More informationWORKING MODES WITH A DECLARATIVE MODELER
Author manuscript, published in "International Conference on Computational Graphics and Visualisation Techniques (CompuGraphics'97) (1997) 117-126" WORKING MODES WITH A DECLARATIVE MODELER Christian COLIN
More informationChristophe DENIS 1 and Sethy MONTAN 2
ESAIM: PROCEEDINGS, March 2012, Vol. 35, p. 107-113 Fédération Denis Poisson (Orléans-Tours) et E. Trélat (UPMC), Editors NUMERICAL VERIFICATION OF INDUSTRIAL NUMERICAL CODES Christophe DENIS 1 and Sethy
More informationA Constraint Programming Based Approach to Detect Ontology Inconsistencies
The International Arab Journal of Information Technology, Vol. 8, No. 1, January 2011 1 A Constraint Programming Based Approach to Detect Ontology Inconsistencies Moussa Benaissa and Yahia Lebbah Faculté
More informationSolving Geometric Constraints by Homotopy
Solving Geometric Constraints by Homotopy Hervé Lamure, Dominique Michelucci To cite this version: Hervé Lamure, Dominique Michelucci. Solving Geometric Constraints by Homotopy. IEEE Transactions on Visualization
More informationComputer Vision and Graph-Based Representation
Jean-Yves Ramel Romain Raveaux Laboratoire Informatique de Tours - FRANCE Computer Vision and Graph-Based Representation Presented by: Romain Raveaux About me I About me II Recherche Partners ISRC 2011
More informationA Self Organizing Map for dissimilarity data 0
A Self Organizing Map for dissimilarity data Aïcha El Golli,2, Brieuc Conan-Guez,2, and Fabrice Rossi,2,3 Projet AXIS, INRIA-Rocquencourt Domaine De Voluceau, BP 5 Bâtiment 8 7853 Le Chesnay Cedex, France
More informationA DH-parameter based condition for 3R orthogonal manipulators to have 4 distinct inverse kinematic solutions
Wenger P., Chablat D. et Baili M., A DH-parameter based condition for R orthogonal manipulators to have 4 distinct inverse kinematic solutions, Journal of Mechanical Design, Volume 17, pp. 150-155, Janvier
More informationKeyGlasses : Semi-transparent keys to optimize text input on virtual keyboard
KeyGlasses : Semi-transparent keys to optimize text input on virtual keyboard Mathieu Raynal, Nadine Vigouroux To cite this version: Mathieu Raynal, Nadine Vigouroux. KeyGlasses : Semi-transparent keys
More informationA test bed for distributed real-time scheduling experimentation based on the CHORUS micro-kernel
A test bed for distributed real-time scheduling experimentation based on the CHORUS micro-kernel Joelle DELACROIX**, Christian SANTELLANI* ** CNAM, Département Informatique, 292 rue Saint Martin, 75141
More informationA System Performance in Presence of Faults Modeling Framework Using AADL and GSPNs
A System Performance in Presence of Faults Modeling Framework Using AADL and GSPNs Belhassen MAZIGH 1 and Kais BEN FADHEL 1 Department of Computer Science, Faculty of Science of Monastir, Avenue of the
More informationAn Interactive Tool for Coordination of Spatial Topology and Geometry
SMART TOPOLOGICAL GEOMETRY An Interactive Tool for Coordination of Spatial Topology and Geometry CHIEH-JEN LIN Department of Interior Design, Tainan University of Technology, Taiwan abstract: This paper
More informationIDECSE: A Semantic Integrated Development Environment for Composite Services Engineering
IDECSE: A Semantic Integrated Development Environment for Composite Services Engineering Ahmed Abid 1, Nizar Messai 1, Mohsen Rouached 2, Thomas Devogele 1 and Mohamed Abid 3 1 LI, University Francois
More informationWorkspaces of planar parallel manipulators
Workspaces of planar parallel manipulators Jean-Pierre Merlet Clément M. Gosselin Nicolas Mouly INRIA Sophia-Antipolis Dép. de Génie Mécanique INRIA Rhône-Alpes BP 93 Université Laval 46 Av. Felix Viallet
More informationPerformance Evaluation
A not so Short Introduction Why, Who, When and How? Jean-Marc Vincent 12 1 Laboratoire LIG, projet Inria-Mescal UniversitéJoseph Fourier Jean-Marc.Vincent@imag.fr 2 LICIA Laboratoire International de Calcul
More informationDiscovering Search Algorithms with Program Transformation
Discovering Search Algorithms with Program Transformation Tristan Cazenave 1 Abstract. Minimax is the basic algorithm used in two-persons player complete information computer games. It is also used in
More informationAO4AADL Compiler. Sihem Loukil. June 2011
AO4AADL Compiler Sihem Loukil June 2011 We present in this report the main tools used in our work. Then, we detail one of our main contributions. Finally, we present the several steps to implement our
More information7 th Grade Accelerated Learning Targets Final 5/5/14
7 th Grade Accelerated Learning Targets Final 5/5/14 BSD Grade 7 Long Term Learning Targets & Supporting Learning Targets Quarter 1 & 2 Quarter 3 Quarter 4 7.02, 7.03, 7.04, 7.05 7.06, 8.04, 8.05 7.08,
More informationGeneric Design Space Exploration for Reconfigurable Architectures
Generic Design Space Exploration for Reconfigurable Architectures Lilian Bossuet, Guy Gogniat, Jean Luc Philippe To cite this version: Lilian Bossuet, Guy Gogniat, Jean Luc Philippe. Generic Design Space
More informationControl of an automatic parking gate
Control of an automatic parking gate Jean-Marc ROUSSEL jean-marc.roussel@lurpa.ens-cachan.fr LURPA,ENS Cachan 61, avenue du Prsident Wilson 94235 CACHAN Cedex April 2, 212 1 Introduction This document
More informationImplementation of Dynamic Algebra in Epsilonwriter
Implementation of Dynamic Algebra in Epsilonwriter Jean-François Nicaud, Christophe Viudez Aristod, 217 rue de Paris, 91120 Palaiseau, France jeanfrancois.nicaud@laposte.net cviudez@free.fr http://www.epsilonwriter.com
More informationLearning and Recognizing Visual Object Categories Without First Detecting Features
Learning and Recognizing Visual Object Categories Without First Detecting Features Daniel Huttenlocher 2007 Joint work with D. Crandall and P. Felzenszwalb Object Category Recognition Generic classes rather
More informationOperational process interferometric for the generation of a digital model of ground Applied to the couple of images ERS-1 ERS-2 to the area of Algiers
Operational process interferometric for the generation of a digital model of ground Applied to the couple of images ERS-1 ERS-2 to the area of Algiers F. Hocine, M.Ouarzeddine, A. elhadj-aissa,, M. elhadj-aissa,,
More informationFast checking of CMM geometry with a patented tool
17 International Congress of Metrology, 13012 (2015) DOI: 10.1051/ metrolo gy/201513012 C Owned by the authors, published by EDP Sciences, 2015 Fast checking of CMM geometry with a patented tool Jean-François
More informationAn Experimental Assessment of the 2D Visibility Complex
An Experimental Assessment of the D Visibility Complex Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang To cite this version: Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang.
More informationFormal modelling of ontologies within Event-B
Formal modelling of ontologies within Event-B Yamine Ait Ameur, Idir Ait-Sadoune, Kahina Hacid, Linda Mohand Oussaid To cite this version: Yamine Ait Ameur, Idir Ait-Sadoune, Kahina Hacid, Linda Mohand
More informationself-organizing maps and symbolic data
self-organizing maps and symbolic data Aïcha El Golli, Brieuc Conan-Guez, Fabrice Rossi AxIS project, National Research Institute in Computer Science and Control (INRIA) Rocquencourt Research Unit Domaine
More informationScalewelis: a Scalable Query-based Faceted Search System on Top of SPARQL Endpoints
Scalewelis: a Scalable Query-based Faceted Search System on Top of SPARQL Endpoints Joris Guyonvarc H, Sébastien Ferré To cite this version: Joris Guyonvarc H, Sébastien Ferré. Scalewelis: a Scalable Query-based
More informationComputing and maximizing the exact reliability of wireless backhaul networks
Computing and maximizing the exact reliability of wireless backhaul networks David Coudert, James Luedtke, Eduardo Moreno, Konstantinos Priftis To cite this version: David Coudert, James Luedtke, Eduardo
More informationReverse-engineering of UML 2.0 Sequence Diagrams from Execution Traces
Reverse-engineering of UML 2.0 Sequence Diagrams from Execution Traces Romain Delamare, Benoit Baudry, Yves Le Traon To cite this version: Romain Delamare, Benoit Baudry, Yves Le Traon. Reverse-engineering
More informationMARTE based design approach for targeting Reconfigurable Architectures
MARTE based design approach for targeting Reconfigurable Architectures Imran Rafiq Quadri, Samy Meftali, Jean-Luc Dekeyser To cite this version: Imran Rafiq Quadri, Samy Meftali, Jean-Luc Dekeyser. MARTE
More informationInformation management - Topic Maps visualization
Information management - Topic Maps visualization Benedicte Le Grand Laboratoire d Informatique de Paris 6, Universite Pierre et Marie Curie, Paris, France Benedicte.Le-Grand@lip6.fr http://www-rp.lip6.fr/~blegrand
More informationDeveloping interfaces for the TRANUS system
Developing interfaces for the TRANUS system Julien Armand To cite this version: Julien Armand. Developing interfaces for the TRANUS system. Modélisation et simulation. 2016. HAL Id: hal-01401264
More informationTopological Approach for the Modeling of Complex and Mechatronic Systems
Topological Approach for the Modeling of Complex and Mechatronic Systems Mariem Miladi Chaabane, Régis Plateaux, Jean-Yves Choley, Chafik Karra, Alain Riviere and Mohamed Haddar Abstract The main objective
More informationService Reconfiguration in the DANAH Assistive System
Service Reconfiguration in the DANAH Assistive System Said Lankri, Pascal Berruet, Jean-Luc Philippe To cite this version: Said Lankri, Pascal Berruet, Jean-Luc Philippe. Service Reconfiguration in the
More informationPrentice Hall Mathematics: Course Correlated to: Colorado Model Content Standards and Grade Level Expectations (Grade 6)
Colorado Model Content Standards and Grade Level Expectations (Grade 6) Standard 1: Students develop number sense and use numbers and number relationships in problemsolving situations and communicate the
More informationParametric Design with Standard Elements for Non-Standard Architecture
Parametric Design with Standard Elements for Non-Standard Architecture CIBLAC Thierry Ecole Nationale Supérieure d Architecture de Paris La Villette, ARIAM-LAREA, France tciblac@paris-lavillette.archi.fr
More informationBs. in Computer Science and Operational Research, rank : 1st Université Blaise Pascal, Clermont II, Clermont-Ferrand, France
Mathieu LACROIX Laboratoire LAMSADE Université Paris Dauphine Bureau C605 Place du Maréchal de Lattre de Tassigny 75775 Paris cedex 16 - France Tél : +33 (0)1 44 05 48 53 E-mail : lacroix@lamsade.dauphine.fr
More informationPosted on arxiv April
On the predictability of the number of convex vertices Jean Souviron 1 COGITECH Jean Souviron 613 D Ailleboust Montréal, Quebec, H2R 1K2 Canada JeanSouviron@hotmail.com Abstract : Convex hulls are a fundamental
More informationPerformance Level Descriptors. Mathematics
Performance Level Descriptors Grade 3 Well Students rarely, Understand that our number system is based on combinations of 1s, 10s, and 100s (place value, compare, order, decompose, and combine using addition)
More informationGloria Mattelyne Granum. Lesson Plan for Seventh Grade Mathematics. Stage 1 Desired Results
Gloria Mattelyne Granum Lesson Plan for Seventh Grade Mathematics Established Goals: Stage 1 Desired Results This lesson plan addresses objective 7.9 of the SOL for Geometry: The student will compare and
More informationNull space computation of sparse singular matrices with MUMPS
Null space computation of sparse singular matrices with MUMPS Xavier Vasseur (CERFACS) In collaboration with Patrick Amestoy (INPT-IRIT, University of Toulouse and ENSEEIHT), Serge Gratton (INPT-IRIT,
More informationVisualization and Analysis of Inverse Kinematics Algorithms Using Performance Metric Maps
Visualization and Analysis of Inverse Kinematics Algorithms Using Performance Metric Maps Oliver Cardwell, Ramakrishnan Mukundan Department of Computer Science and Software Engineering University of Canterbury
More informationDeformetrica: a software for statistical analysis of anatomical shapes
Deformetrica: a software for statistical analysis of anatomical shapes Alexandre Routier, Marcel Prastawa, Benjamin Charlier, Cédric Doucet, Joan Alexis Glaunès, Stanley Durrleman To cite this version:
More informationDTS-Edit: an Interactive Development Environment for Structured Dialog Applications
DTS-Edit: an Interactive Development Environment for Structured Dialog Applications Fabrice Depaulis, Sabrina Maiano and Guillaume Texier LISI / ENSMA, Téléport 2, 1 Avenue Clément Ader, BP 40109, 86961
More informationQuasi-tilings. Dominique Rossin, Daniel Krob, Sebastien Desreux
Quasi-tilings Dominique Rossin, Daniel Krob, Sebastien Desreux To cite this version: Dominique Rossin, Daniel Krob, Sebastien Desreux. Quasi-tilings. FPSAC/SFCA 03, 2003, Linkoping, Sweden. 2003.
More informationCompromise Based Evolutionary Multiobjective Optimization Algorithm for Multidisciplinary Optimization
Compromise Based Evolutionary Multiobjective Optimization Algorithm for Multidisciplinary Optimization Benoît Guédas, Xavier Gandibleux, Philippe Dépincé To cite this version: Benoît Guédas, Xavier Gandibleux,
More informationXML Element Retrieval using terms propagation
International Conference on Automation, Control, Engineering and Computer Science (ACECS'4) Proceedings - Copyright IPCO-204, pp.58-63 ISSN 2356-5608 XML Element Retrieval using terms propagation Samia
More informationA Practical Approach for 3D Model Indexing by combining Local and Global Invariants
A Practical Approach for 3D Model Indexing by combining Local and Global Invariants Jean-Philippe Vandeborre, Vincent Couillet, Mohamed Daoudi To cite this version: Jean-Philippe Vandeborre, Vincent Couillet,
More informationSeparating topology and geometry in space planning
COMPUTER-AIDED DESIGN Computer-Aided Design 32 (2000) 39 61 www.elsevier.com/locate/cad Separating topology and geometry in space planning B. Medjdoub a, *, B. Yannou b,1 a The Martin Centre, University
More informationImplementing an Automatic Functional Test Pattern Generation for Mixed-Signal Boards in a Maintenance Context
Implementing an Automatic Functional Test Pattern Generation for Mixed-Signal Boards in a Maintenance Context Bertrand Gilles, Laurent Tchamnda Nana, Valérie-Anne Nicolas To cite this version: Bertrand
More informationFormation. Application Server Description du cours
Formation Application Server 2017 Description du cours Formation Application Server 2017 Description Cette formation d une durée de 5 jours aborde les concepts de l infrastructure logicielle System Platform
More informationELIESER : USER MANUAL
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE ELIESER : USER MANUAL Nicolas MERLET, Josiane ZERUBIA N 0180 Septembre 1995 PROGRAMME 4 apport technique ISSN 0249-6399 ELIESER : USER
More informationVisualizing the inner structure of n-body data using skeletonization
Rochester Institute of Technology RIT Scholar Works Presentations and other scholarship 2007 Visualizing the inner structure of n-body data using skeletonization Edward Dale Hans-Peter Bischof Follow this
More informationSOUND SPATIALIZATION BASED ON FAST BEAM TRACING IN THE DUAL SPACE. Marco Foco, Pietro Polotti, Augusto Sarti, Stefano Tubaro
SOUND SPATIALIZATION BASED ON FAST BEAM TRACING IN THE DUAL SPACE Marco Foco, Pietro Polotti, Augusto Sarti, Stefano Tubaro Dipartimento di Elettronica e Informazione Politecnico di Milano Piazza L. Da
More informationOptimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature
Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature Fabien Feschet and Laure Tougne {ffeschet,ltougne}@univ-lyon2.fr Laboratoire E.R.I.C. Université Lyon2 5 av. Pierre
More informationInteraction between ring shaped permanent magnets with symbolic gradients: application to magnetic bearing system optimization
Interaction between ring shaped permanent magnets with symbolic gradients: application to magnetic bearing system optimization Benoît Delinchant, Frédéric Wurtz, Jean-Paul Yonnet, Jean-Louis Coulomb To
More informationQualitative classification and evaluation in possibilistic decision trees
Qualitative classification evaluation in possibilistic decision trees Nahla Ben Amor Institut Supérieur de Gestion de Tunis, 41 Avenue de la liberté, 2000 Le Bardo, Tunis, Tunisia E-mail: nahlabenamor@gmxfr
More informationA reasoning model based on the production of acceptable. arguments
A reasoning model based on the production of acceptable arguments Leila AMGOUD 1 Claudette CAYROL 2 1 Department of Electronic Engineering, Queen Mary and Westfield College University of London, London
More informationMoveability and Collision Analysis for Fully-Parallel Manipulators
Moveability and Collision Analysis for Fully-Parallel Manipulators Damien Chablat, Philippe Wenger To cite this version: Damien Chablat, Philippe Wenger. Moveability and Collision Analysis for Fully-Parallel
More informationDETERMINATION OF THE WORKSPACE OF A 3-PRPR PARALLEL MECHANISM FOR HUMAN-ROBOT COLLABORATION
DETERMINATION OF THE WORKSPACE OF A 3-PRPR PARALLEL MECHANISM FOR HUMAN-ROBOT COLLABORATION Alexandre Lecours, Clément Gosselin Département de Génie Mécanique, Université Laval, Québec, Québec, Canada
More informationHigh Performance Computing: Tools and Applications
High Performance Computing: Tools and Applications Edmond Chow School of Computational Science and Engineering Georgia Institute of Technology Lecture 15 Numerically solve a 2D boundary value problem Example:
More informationHETEROGENEITY ASSESSMENT OF HISTOLOGICAL TISSUE SECTIONS IN WHOLE SLIDE IMAGES
12th European Congress on Digital Pathology HETEROGENEITY ASSESSMENT OF HISTOLOGICAL TISSUE SECTIONS IN WHOLE SLIDE IMAGES BELHOMME Philippe 1, TORALBA Simon 1,3, PLANCOULAINE Benoît 1, OGER Myriam 1,2,
More informationLesson 3. Prof. Enza Messina
Lesson 3 Prof. Enza Messina Clustering techniques are generally classified into these classes: PARTITIONING ALGORITHMS Directly divides data points into some prespecified number of clusters without a hierarchical
More informationThe packing problem: A divide and conquer algorithm on cellular automata
The packing problem: A divide and conquer algorithm on cellular automata Nicolas Bacquey Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen Université de Caen Basse-Normandie,
More informationTowards a PIM for virtual prototyping
Towards a PIM for virtual prototyping Adel SGHAIER, Thierry SORIANO, Skander TURKI Mechatronics department LIISIM SUPMECA Maison des technologies 83000 Toulon FRANCE Abstract: We work on the way of modelling
More informationKinematic Analysis of a Family of 3R Manipulators
Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,
More informationADVENTURERS. Long and Medium Term Planning
ADVENTURERS Long and Medium Term Planning Medium-Term Planning W Topic Curriculum objective 1 Number, place value and rounding To recognise the place value of each digit in a four-digit number (thousands,
More informationFuzzy sensor for the perception of colour
Fuzzy sensor for the perception of colour Eric Benoit, Laurent Foulloy, Sylvie Galichet, Gilles Mauris To cite this version: Eric Benoit, Laurent Foulloy, Sylvie Galichet, Gilles Mauris. Fuzzy sensor for
More informationFeature-Based Facial Expression Recognition: Experiments With a Multi-Layer Perceptron
Feature-Based Facial Expression Recognition: Experiments With a Multi-Layer Perceptron Zhengyou Zhang To cite this version: Zhengyou Zhang. Feature-Based Facial Expression Recognition: Experiments With
More informationFuzzy Multilevel Graph Embedding for Recognition, Indexing and Retrieval of Graphic Document Images
Cotutelle PhD thesis for Recognition, Indexing and Retrieval of Graphic Document Images presented by Muhammad Muzzamil LUQMAN mluqman@{univ-tours.fr, cvc.uab.es} Friday, 2 nd of March 2012 Directors of
More informationMining Social Network Graphs
Mining Social Network Graphs Analysis of Large Graphs: Community Detection Rafael Ferreira da Silva rafsilva@isi.edu http://rafaelsilva.com Note to other teachers and users of these slides: We would be
More informationTaking Benefit from the User Density in Large Cities for Delivering SMS
Taking Benefit from the User Density in Large Cities for Delivering SMS Yannick Léo, Anthony Busson, Carlos Sarraute, Eric Fleury To cite this version: Yannick Léo, Anthony Busson, Carlos Sarraute, Eric
More informationFast and precise kinematic skeleton extraction of 3D dynamic meshes
Fast and precise kinematic skeleton extraction of 3D dynamic meshes Julien Tierny, Jean-Philippe Vandeborre, Mohamed Daoudi To cite this version: Julien Tierny, Jean-Philippe Vandeborre, Mohamed Daoudi.
More informationBased on Raymond J. Mooney s slides
Instance Based Learning Based on Raymond J. Mooney s slides University of Texas at Austin 1 Example 2 Instance-Based Learning Unlike other learning algorithms, does not involve construction of an explicit
More informationHow to simulate a volume-controlled flooding with mathematical morphology operators?
How to simulate a volume-controlled flooding with mathematical morphology operators? Serge Beucher To cite this version: Serge Beucher. How to simulate a volume-controlled flooding with mathematical morphology
More informationTopological Classification of Data Sets without an Explicit Metric
Topological Classification of Data Sets without an Explicit Metric Tim Harrington, Andrew Tausz and Guillaume Troianowski December 10, 2008 A contemporary problem in data analysis is understanding the
More information