DOCSLIB.ORG

On the Automated Derivation of Domain-Specific UML Profiles

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
On the Automated Derivation of Domain-Specific UML Profiles Schriften aus der Fakultät Wirtschaftsinformatik und 37 Angewandte Informatik der Otto-Friedrich-Universität Bamberg On the Automated Derivation of Domain-Specifc UML Profles Alexander Kraas 37 Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich- Universität Bamberg Contributions of the Faculty Information Systems and Applied Computer Sciences of the Otto-Friedrich-University Bamberg Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich- Universität Bamberg Contributions of the Faculty Information Systems and Applied Computer Sciences of the Otto-Friedrich-University Bamberg Band 37 2019 On the Automated Derivation of Domain-Specifc UML Profles Alexander Kraas 2019 Bibliographische Information der Deutschen Nationalbibliothek Die Deutsche Nationalbibliothek verzeichnet diese Publikation in der Deutschen Nationalbibliographie; detaillierte bibliographische Informationen sind im Internet über http://dnb.d-nb.de/ abrufbar. Diese Arbeit hat der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg als Dissertation vorgelegen. 1. Gutachter: Prof. Dr. Gerald Lüttgen, Otto-Friedrich-University Bamberg, Germany 2. Gutachter: Prof. Dr. Richard Paige, McMaster University, Canada Tag der mündlichen Prüfung: 13.05.2019 Dieses Werk ist als freie Onlineversion über den Publikationsserver (OPUS; http://www. opus-bayern.de/uni-bamberg/) der Universität Bamberg erreichbar. Das Werk – ausge- nommen Cover, Zitate und Abbildungen – steht unter der CC-Lizenz CC-BY. Lizenzvertrag: Creative Commons Namensnennung 4.0 http://creativecommons.org/licenses/by/4.0 Herstellung und Druck: docupoint, Magdeburg Umschlaggestaltung: University of Bamberg Press © University of Bamberg Press, Bamberg 2019 http://www.uni-bamberg.de/ubp/ ISSN: 1867-7401 ISBN: 978-3-86309-670-0 (Druckausgabe) eISBN: 978-3-86309-671-7 (Online-Ausgabe) URN: urn:nbn:de:bvb:473-opus4-548916 DOI: http://dx.doi.org/10.20378/irbo-54891 Abstract Similar to general-purpose languages, domain-specific languages (DSL) can be de- veloped based on grammar formalisms, the model-driven engineering (MDE) is also becoming more and more important for the development of DSLs. On the one hand, metamodels can be used to define the syntax and semantics of DSLs. On the other hand, a DSL can be realized by adapting the Unified Modeling Lan- guage (UML) via the profiling mechanism, i.e., by defining a UML profile. For example, metamodels for a DSL can be created with the language concepts provi- ded by the Meta Object Facility (MOF), distinguishing between the Essential MOF (EMOF) and the Complete MOF (CMOF). The latter variant is based on the EMOF but provides additional language concepts. A higher degree of abstraction and reu- se of existing metamodels can be achieved by employing the language concepts provided by CMOF, which can be advantageous for the creation of more complex DSLs. Apart from DSLs proposed in the literature, a model-based specification of DSLs becomes increasingly important for standardization. Both metamodels and UML profiles are often provided for standardized DSLs. The mappings of metamodels to UML profiles are usually only specified in some abstract manner by such stan- dards. Therefore, such mappings do not provide all the details required to create executable model transformations. Moreover, the static semantics of metamodels and/or UML profiles are usually specified only in natural language. Thus, on the one hand, ambiguities can occur, and on the other hand, the soundness of the sta- tic semantics cannot be verified and validated without a manual translation into a machine-processable language. The main goal of this dissertation is to remedy the identified weaknesses in de- veloping DSLs, for which a CMOF-compliant metamodel and a UML profile shall be created. To achieve this goal, we propose a holistic MDE-based approach for automatically deriving UML profiles and model transformations based on CMOF metamodels. This approach enables an automatic transfer of DSL’s static semanti- cs to UML profiles, so that the well-formedness of UML models with applied UML profile of a DSL can be verified automatically. In addition, the interoperability bet- ween UML and DSL models can already be validated in the development phase using the derived model transformations. Apart from new DSLs that are created from scratch, our approach also supports a migration of existing grammar-based DSLs towards CMOF-based metamodels, provided syntax rules exist. II To verify and evaluate the presented derivation approach, we have implemen- ted a toolchain that we used to conduct two case studies on the Specification and Description Language (SDL) and the Test Description Language (TDL). Zusammenfassung Ähnlich wie Allzwecksprachen können domänenspezifische Sprachen (DSL) mittels Grammatikformalismen entwickelt werden, aber auch das modellgetriebene En- gineering (MDE) gewinnt für letztgenannte Sprachen immer mehr an Bedeutung. Einerseits können Metamodelle dazu verwendet werden, die Syntax und Seman- tik von DSLs zu definieren. Andererseits kann eine DSL auch durch eine Anpas- sung der Unified Modeling Language (UML) unter Verwendung des Profilierungs- mechanismus, welcher auf UML-Profilen basiert, realisiert werden. So können beispielsweise Metamodelle für DSLs mit den Sprachkonzepten der Meta Object Facility (MOF) erstellt werden, wobei zwischen dem Essential MOF (EMOF) und dem Complete MOF (CMOF) unterschieden wird. Die letztgenannte Variante ba- siert auf dem EMOF, bietet aber zusätzliche Sprachkonzepte. Mit den Sprachkon- zepten des CMOF kann ein höherer Grad an Abstraktion und Wiederverwendung bestehender Metamodelle erreicht werden, was für die Erstellung komplexer DSLs von Vorteil sein kann. Neben den in der Literatur vorgestellten DSLs wird eine modellbasierte Spezifi- kation von DSLs auch in der Standardisierung immer wichtiger. Sowohl Metamo- delle als auch UML-Profile werden oft für standardisierte DSLs angeboten. Die Ab- bildung von Metamodellen auf UML-Profile wird von solchen Standards meistens nur abstrakt spezifiziert. Daher liefern diese Abbildungen nicht alle Details, die für die Erstellung von ausführbaren Modelltransformationen erforderlich sind. Darüber hinaus wird die statische Semantik von Metamodellen und/oder UML- Profilen in der Regel nur in natürlicher Sprache angegeben. So können einerseits Unklarheiten auftreten, andererseits kann die Korrektheit der statischen Seman- tik nicht ohne eine manuelle Übersetzung in eine maschinenlesbare Sprache ve- rifiziert und validiert werden. Hauptziel der vorliegenden Dissertation ist es, die identifizierten Schwachstel- len bei der Entwicklung von DSLs, für die ein CMOF-konformes Metamodell und ein UML-Profil erstellt werden sollen, zu beheben. Um dieses Ziel zu errei- chen, wird ein ganzheitlicher MDE-basierter Ansatz zur automatischen Ableitung von UML-Profilen und Modelltransformationen auf Basis von CMOF-Metamodel- len vorgeschlagen. Dieser Ansatz ermöglicht eine automatische Übertragung der statischen Semantik auf UML-Profile, so dass die Wohlgeformtheit von UML- Modellen, die ein UML-Profil einer DSL angewendet haben, automatisch über- prüft werden kann. Des Weiteren kann die Interoperabilität zwischen UML- und DSL-Modellen bereits in der Entwicklungsphase mit den abgeleiteten Modelltrans- IV formationen validiert werden. Neben neu zu entwickelnden DSLs ermöglicht un- ser Ansatz auch eine Migration bestehender Grammatik-basierter DSLs zu CMOF- basierten Metamodellen, sofern Syntaxregeln existieren. Um den vorgestellten Ableitungsansatz zu überprüfen und zu bewerten, wurde eine Werkzeugkette implementiert, mit der zwei Fallstudien für die Specification and Description Language (SDL) und die Test Description Language (TDL) durchge- führt wurden. Contents 1 Introduction 1 1.1 Motivation . 2 1.2 Research Objective and Questions . 6 1.3 Research Methodology . 8 1.4 Obtained Results . 9 1.5 Publications . 10 1.6 Structure of the Thesis . 13 2 Foundations of MDE-based Language Development 15 2.1 Design and Development Process . 15 2.2 Metamodelling Employing the MOF . 17 2.2.1 The 4-Layered MOF Hierarchy . 17 2.2.2 The Essential MOF . 19 2.2.3 Package . 19 2.2.4 The Complete MOF . 23 2.3 Using OCL for Specifying the Static Semantics . 28 2.4 Model Transformations . 31 2.4.1 Model-to-Model Transformations . 33 2.4.2 Model-to-Text Transformations . 36 2.4.3 Notational Conventions for Model Transformations . 39 2.5 The Unified Modeling Language and UML Profiles . 40 2.5.1 The UML Diagrams . 41 2.5.2 Extending the UML Using UML Profiles . 44 2.6 Methods for Verification and Validation . 47 2.6.1 Background . 47 2.6.2 Metamodels and UML Profiles. 49 2.6.3 Verification of Model Transformations. 50 2.7 Summary . 53 3 A New UML Profile for SDL – Lessons Learned 55 3.1 Evolution of SDL and our Contributions . 55 3.1.1 Historical Evolution of SDL and of its UML Profile . 56 3.1.2 Our Contributions to a new UML Profile for SDL . 57 3.1.3 The SDL-UML Modelling and Validation Framework . 58 3.2 Foundations of SDL and of its UML Profile . 59 VI Contents 3.2.1 Fundamental Parts of an SDL Specification . 59 3.2.2 Formalization of SDL . 63 3.2.3 The UML Profile for SDL . 66 3.3 Identified Shortcomings of SDL-UML 2007 . 71 3.3.1 Drawbacks of the Data Type Model . 72 3.3.2 Issues Concerning the Representation of SDL Expressions . 76 3.3.3 Shortcomings of SDL’s Action Language . 81 3.4 Introduced Enhancements . 85 3.4.1 Specification of Data Types . 86 3.4.2 Representation of SDL Expressions
Load more

Recommended publications
  • Neuron C Reference Guide Iii • Introduction to the LONWORKS Platform (078-0391-01A)
    Neuron C Provides reference info for writing programs using the Reference Guide Neuron C programming language. 078-0140-01G Echelon, LONWORKS, LONMARK, NodeBuilder, LonTalk, Neuron, 3120, 3150, ShortStack, LonMaker, and the Echelon logo are trademarks of Echelon Corporation that may be registered in the United States and other countries. Other brand and product names are trademarks or registered trademarks of their respective holders. Neuron Chips and other OEM Products were not designed for use in equipment or systems, which involve danger to human health or safety, or a risk of property damage and Echelon assumes no responsibility or liability for use of the Neuron Chips in such applications. Parts manufactured by vendors other than Echelon and referenced in this document have been described for illustrative purposes only, and may not have been tested by Echelon. It is the responsibility of the customer to determine the suitability of these parts for each application. ECHELON MAKES AND YOU RECEIVE NO WARRANTIES OR CONDITIONS, EXPRESS, IMPLIED, STATUTORY OR IN ANY COMMUNICATION WITH YOU, AND ECHELON SPECIFICALLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of Echelon Corporation. Printed in the United States of America. Copyright © 2006, 2014 Echelon Corporation. Echelon Corporation www.echelon.com Welcome This manual describes the Neuron® C Version 2.3 programming language. It is a companion piece to the Neuron C Programmer's Guide.
    [Show full text]
  • Navigation Techniques in Augmented and Mixed Reality: Crossing the Virtuality Continuum
    Chapter 20 NAVIGATION TECHNIQUES IN AUGMENTED AND MIXED REALITY: CROSSING THE VIRTUALITY CONTINUUM Raphael Grasset 1,2, Alessandro Mulloni 2, Mark Billinghurst 1 and Dieter Schmalstieg 2 1 HIT Lab NZ University of Canterbury, New Zealand 2 Institute for Computer Graphics and Vision Graz University of Technology, Austria 1. Introduction Exploring and surveying the world has been an important goal of humankind for thousands of years. Entering the 21st century, the Earth has almost been fully digitally mapped. Widespread deployment of GIS (Geographic Information Systems) technology and a tremendous increase of both satellite and street-level mapping over the last decade enables the public to view large portions of the 1 2 world using computer applications such as Bing Maps or Google Earth . Mobile context-aware applications further enhance the exploration of spatial information, as users have now access to it while on the move. These applications can present a view of the spatial information that is personalised to the user’s current context (context-aware), such as their physical location and personal interests. For example, a person visiting an unknown city can open a map application on her smartphone to instantly obtain a view of the surrounding points of interest. Augmented Reality (AR) is one increasingly popular technology that supports the exploration of spatial information. AR merges virtual and real spaces and offers new tools for exploring and navigating through space [1]. AR navigation aims to enhance navigation in the real world or to provide techniques for viewpoint control for other tasks within an AR system. AR navigation can be naively thought to have a high degree of similarity with real world navigation.
    [Show full text]
  • Parallel Range, Segment and Rectangle Queries with Augmented Maps
    Parallel Range, Segment and Rectangle Queries with Augmented Maps Yihan Sun Guy E. Blelloch Carnegie Mellon University Carnegie Mellon University [email protected] [email protected] Abstract The range, segment and rectangle query problems are fundamental problems in computational geometry, and have extensive applications in many domains. Despite the significant theoretical work on these problems, efficient implementations can be complicated. We know of very few practical implementations of the algorithms in parallel, and most implementations do not have tight theoretical bounds. In this paper, we focus on simple and efficient parallel algorithms and implementations for range, segment and rectangle queries, which have tight worst-case bound in theory and good parallel performance in practice. We propose to use a simple framework (the augmented map) to model the problem. Based on the augmented map interface, we develop both multi-level tree structures and sweepline algorithms supporting range, segment and rectangle queries in two dimensions. For the sweepline algorithms, we also propose a parallel paradigm and show corresponding cost bounds. All of our data structures are work-efficient to build in theory (O(n log n) sequential work) and achieve a low parallel depth (polylogarithmic for the multi-level tree structures, and O(n) for sweepline algorithms). The query time is almost linear to the output size. We have implemented all the data structures described in the paper using a parallel augmented map library. Based on the library each data structure only requires about 100 lines of C++ code. We test their performance on large data sets (up to 108 elements) and a machine with 72-cores (144 hyperthreads).
    [Show full text]
  • Handwritten Digit Classication Using 8-Bit Floating Point Based Convolutional Neural Networks
    Downloaded from orbit.dtu.dk on: Apr 10, 2018 Handwritten Digit Classication using 8-bit Floating Point based Convolutional Neural Networks Gallus, Michal; Nannarelli, Alberto Publication date: 2018 Document Version Publisher's PDF, also known as Version of record Link back to DTU Orbit Citation (APA): Gallus, M., & Nannarelli, A. (2018). Handwritten Digit Classication using 8-bit Floating Point based Convolutional Neural Networks. DTU Compute. (DTU Compute Technical Report-2018, Vol. 01). General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Handwritten Digit Classification using 8-bit Floating Point based Convolutional Neural Networks Michal Gallus and Alberto Nannarelli (supervisor) Danmarks Tekniske Universitet Lyngby, Denmark [email protected] Abstract—Training of deep neural networks is often con- In order to address this problem, this paper proposes usage strained by the available memory and computational power. of 8-bit floating point instead of single precision floating point This often causes it to run for weeks even when the underlying which allows to save 75% space for all trainable parameters, platform is employed with multiple GPUs.
    [Show full text]
  • High Dynamic Range Video
    High Dynamic Range Video Karol Myszkowski, Rafał Mantiuk, Grzegorz Krawczyk Contents 1 Introduction 5 1.1 Low vs. High Dynamic Range Imaging . 5 1.2 Device- and Scene-referred Image Representations . ...... 7 1.3 HDRRevolution ............................ 9 1.4 OrganizationoftheBook . 10 1.4.1 WhyHDRVideo? ....................... 11 1.4.2 ChapterOverview ....................... 12 2 Representation of an HDR Image 13 2.1 Light................................... 13 2.2 Color .................................. 15 2.3 DynamicRange............................. 18 3 HDR Image and Video Acquisition 21 3.1 Capture Techniques Capable of HDR . 21 3.1.1 Temporal Exposure Change . 22 3.1.2 Spatial Exposure Change . 23 3.1.3 MultipleSensorswithBeamSplitters . 24 3.1.4 SolidStateSensors . 24 3.2 Photometric Calibration of HDR Cameras . 25 3.2.1 Camera Response to Light . 25 3.2.2 Mathematical Framework for Response Estimation . 26 3.2.3 Procedure for Photometric Calibration . 29 3.2.4 Example Calibration of HDR Video Cameras . 30 3.2.5 Quality of Luminance Measurement . 33 3.2.6 Alternative Response Estimation Methods . 33 3.2.7 Discussion ........................... 34 4 HDR Image Quality 39 4.1 VisualMetricClassification. 39 4.2 A Visual Difference Predictor for HDR Images . 41 4.2.1 Implementation......................... 43 5 HDR Image, Video and Texture Compression 45 1 2 CONTENTS 5.1 HDR Pixel Formats and Color Spaces . 46 5.1.1 Minifloat: 16-bit Floating Point Numbers . 47 5.1.2 RGBE: Common Exponent . 47 5.1.3 LogLuv: Logarithmic encoding . 48 5.1.4 RGB Scale: low-complexity RGBE coding . 49 5.1.5 LogYuv: low-complexity LogLuv . 50 5.1.6 JND steps: Perceptually uniform encoding .
    [Show full text]
  • Supporting Technology for Augmented Reality Game-Based Learning
    DOCTORAL THESIS Supporting Technology for Augmented Reality Game-Based Learning Hendrys Fabián Tobar Muñoz 2017 Doctorate in Technology Supervised by: PhD. Ramon Fabregat PhD. Silvia Baldiris Presented in partial fulfillment of the requirements for a doctoral degree from the University of Girona The research reported in this thesis was partially sponsored by: The financial support by COLCIENCIAS – Colombia’s Administrative Department of Science Technology and Innovation within the program of doctoral scholarships. The research reported in this thesis was carried out as part of the following projects: ARreLS project, funded by Spanish Economy and Competitiveness Ministry(TIN2011-23930) Open Co-Creation Project, funded by the Spanish Economy and Competitiveness Ministry (TIN2014-53082-R) The research reports in this thesis was developed within the research lines of the Communications and Distributed Systems research group (BCDS, ref GRCT40) which is part of the DURSI consolidated research group COMUNICACIONS I SISTEMES INTEL·LIGENTS. © Hendrys Fabián Tobar Muñoz, Girona, Catalonia, Spain, 2017 All Rights Reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without written permission granted by the author. Gracias a Dios Todopoderoso y a Su Divina Providencia. Este trabajo está dedicado a mi Reina Omaira que es lo más hermoso de este mundo. ______________________________________________________________________________________________________________________ Thanks to God Almighty and His Divine Providence. This work is dedicated to my Queen Omaira who is the most beautiful of this world (I swear, this sounds better in Spanish) ACKNOWLEDGEMENTS I have always liked games and digital technologies and I have always believed in their educational potential.
    [Show full text]
  • PAM: Parallel Augmented Maps
    PAM: Parallel Augmented Maps Yihan Sun Daniel Ferizovic Guy E. Belloch Carnegie Mellon University Karlsruhe Institute of Technology Carnegie Mellon University [email protected] [email protected] [email protected] Abstract 1 Introduction Ordered (key-value) maps are an important and widely-used The map data type (also called key-value store, dictionary, data type for large-scale data processing frameworks. Beyond table, or associative array) is one of the most important da- simple search, insertion and deletion, more advanced oper- ta types in modern large-scale data analysis, as is indicated ations such as range extraction, filtering, and bulk updates by systems such as F1 [60], Flurry [5], RocksDB [57], Or- form a critical part of these frameworks. acle NoSQL [50], LevelDB [41]. As such, there has been We describe an interface for ordered maps that is augment- significant interest in developing high-performance paral- ed to support fast range queries and sums, and introduce a lel and concurrent algorithms and implementations of maps parallel and concurrent library called PAM (Parallel Augment- (e.g., see Section 2). Beyond simple insertion, deletion, and ed Maps) that implements the interface. The interface includes search, this work has considered “bulk” functions over or- a wide variety of functions on augmented maps ranging from dered maps, such as unions [11, 20, 33], bulk-insertion and basic insertion and deletion to more interesting functions such bulk-deletion [6, 24, 26], and range extraction [7, 14, 55]. as union, intersection, filtering, extracting ranges, splitting, One particularly useful function is to take a “sum” over a and range-sums.
    [Show full text]
  • Distributed Cognitions GENERAL EDITORS: ROY PEA Psychological and Educational JOHN SEELY BROWN Considerations
    Learning in doing: Social, cognitive, and computational perspectives Distributed cognitions GENERAL EDITORS: ROY PEA Psychological and educational JOHN SEELY BROWN considerations The construction zone: Working for cognitive change in school Denis Newman, Peg Grrfin, and Michael Cole Plans and situated actions: The problem of human-machine Edited by interaction Lucy Suchman GAVRIEL SALOMON Situated learning: Legitimate peripheral participation University of Ha$, Israel Jean Lave and Etienne Wenger Street mathematics and school mathematics Terezinha Nunes, Anahria Dim Schliemann, and David William Carraher Understanding practice: Perspectives on activity and context Seth Chaiklin andJean Lave (editors) I943 CAMBRIDGE UNIVERSITY PRESS Published by the Press Syndicate of the University of Cambridge The Pin Building, Trumpington Street, Cambridge CB2 1RI' 40 West 20th Street, New York, NY 10011-4211, USA Contents 10 Stamford Road, Oakleigh, Melbourne 3166, Australia 0 Cambridge Universify Press 1993 First phlished 1993 Printed in the United States of America Library of Conqcsr Catalo@n~-in-PublicdionData Disaibuted cognitions : psychological and educational considerations I / edited by Gavriel Salomon. List of contribufon page vii I p. cm. - (Learning in doing) Includes index. Series foreword ix ISBN 0-521-41406-7 (hard) xi 1. Cognition and culture. 2. Knowledge, Sociology of. 3. Cognition - Social aspects. 4. Learning. Psychology of - Social aswcts. I. Salomon. Gavriel. 11. Series. 1 A cultural-historical approach to distributed 92-41220 cognition CIP MICHAEL COLE AND YRJO ENGESTR~M A catalog record for this book is available from the British Library. 2 Practices of distributed intelligence and designs for education ISBN 0-521-41406-7 hardback ROY D. PEA 3 Person-plus: a distributed view of thinking and learning D.
    [Show full text]
  • Towards Bendable Augmented Maps
    15-3 MVA2011 IAPR Conference on Machine Vision Applications, June 13-15, 2011, Nara, JAPAN Towards Bendable Augmented Maps Sandy Martedi∗ and Hideo Saito † Graduate School of Science and Technology Keio University, Japan Abstract Three different kinds assumptions are often used for representing the shape of a paper:rigid, foldable and nonrigid. Nonrigid surface detection is intensively ex- plored as challenging topics which addresses two prob- lems: recovering the paper shape and estimating the camera pose. The state-of-the-art researches try to (a) (b) solve both problems robustly for real time purpose. We Figure 1. Application overview. (a). An aug- propose an augmented reality application that use a mented map (b). Bendable augmented map. The nonrigid detection method to recover the shape of the 3D building model is overlaid on top of bended bendable paper using dots as keypoints and estimate paper map. the camera pose simultaneously. Our approach recov- ers the multi-planarity of the paper as the initial shape and iteratively approximates the surface shape. The multi-planarity is estimated by using the tracking by we use multiple planes as the initial shape of the op- descriptor update method that uses the correspondence timization. We then optimize our shape by applying between captured and reference keypoints. We then op- the progressive finite newton optimization [22]. We timize the shape using the progressive finite newton op- then overlay the 3D building model onto the regular- timization method. ized map using the piecewise homography computation as shown in Fig. 1. 1 Introduction We design the setup of our application using a monocular camera and a display.
    [Show full text]
  • 1.3. Thesis Guide
    Understanding How to Translate from Children’s Tangible Learning Apps to Mobile Augmented Reality through Technical Development Research by Shubhra Sarker B.Sc. in Computer Science, Khulna University, 2016 Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science in the School of Interactive Arts and Technology Faculty of Communication, Arts and Technology © Shubhra Sarker 2019 SIMON FRASER UNIVERSITY Fall 2019 Copyright in this work rests with the author. Please ensure that any reproduction or re-use is done in accordance with the relevant national copyright legislation. Approval Name: Shubhra Sarker Degree: Master of Science Title: Understanding How to Translate from Children’s Tangible Learning Apps to Mobile Augmented Reality through Technical Development Research Examining Committee: Chair: Marek Hatala Professor Alissa Antle Senior Supervisor Professor Bernhard Riecke Supervisor Associate Professor Steve Dipaola External Examiner Professor Date Defended/Approved: December 17, 2019 ii Abstract In this thesis, I discuss the design and development of two Augmented Reality (AR) applications derived from two tangible systems. In this technology development research, I explore if it is feasible to port tangible systems to mobile (tablet-based) AR systems so that these systems can be more widely deployed as research prototypes and eventually as products. I use two existing tangible systems (Youtopia, PhonoBlocks), which have been validated empirically, as case studies. To do this, I begin by determining the key requirements that each AR system must have – those known through theoretical design guidance or shown in previous studies to be important for the effectiveness of the tangible system. I designed and implemented design and technical AR solutions for each requirement.
    [Show full text]
  • Map Generation from Large Scale Incomplete and Inaccurate Data
    Map Generation from Large Scale Incomplete and Inaccurate Data Labels Rui Zhang Conrad Albrecht Wei Zhang [email protected] [email protected] [email protected] IBM T.J. Watson Research Center IBM T.J. Watson Research Center IBM T.J. Watson Research Center Yorktown Heights, New York Yorktown Heights, New York Yorktown Heights, New York Xiaodong Cui Ulrich Finkler David Kung [email protected] [email protected] [email protected] IBM T.J. Watson Research Center IBM T.J. Watson Research Center IBM T.J. Watson Research Center Yorktown Heights, New York Yorktown Heights, New York Yorktown Heights, New York Siyuan Lu [email protected] IBM T.J. Watson Research Center Yorktown Heights, New York Figure 1: Houses (red semi-transparent boxes) and roads (white semi-transparent lines) generated from aerial imagery (background). ABSTRACT and map data, both of which cover the contiguous United States Accurately and globally mapping human infrastructure is an impor- (CONUS). We approach the technical challenge of inaccurate and tant and challenging task with applications in routing, regulation incomplete training data adopting state-of-the-art convolutional compliance monitoring, and natural disaster response management neural network architectures such as the U-Net and the CycleGAN arXiv:2005.10053v1 [cs.CV] 20 May 2020 etc.. In this paper we present progress in developing an algorithmic to incrementally generate maps with increasingly more accurate pipeline and distributed compute system that automates the process and more complete labels of man-made infrastructure such as roads of map creation using high resolution aerial images.
    [Show full text]
  • Exploring Per-Input Filter Selection and Approximation Techniques for Deep Neural Networks
    Exploring Per-Input Filter Selection and Approximation Techniques for Deep Neural Networks Yamini Gaur Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements for the degree of Master of Science in Computer Engineering Patrick R. Schaumont, Chair Steve Jian, Co-chair Amos L. Abbott May 1, 2019 Blacksburg, Virginia Keywords: Approximate Computing, Convolution Layers, Fully Connected Layers, Neural Networks Copyright 2019, Yamini Gaur Exploring Per-Input Filter Selection and Approximation Techniques for Deep Neural Networks Yamini Gaur (ABSTRACT) We propose a dynamic, input dependent filter approximation and selection technique to improve the computational efficiency of Deep Neural Networks. The approximation tech- niques convert 32 bit floating point representation of filter weights in neural networks into smaller precision values. This is done by reducing the number of bits used to represent the weights. In order to calculate the per-input error between the trained full precision filter weights and the approximated weights, a metric called Multiplication Error(ME) has been chosen. For convolutional layers, ME is calculated by subtracting the approximated filter weights from the original filter weights, convolving the difference with the input and calcu- lating the grand-sum of the resulting matrix. For fully connected layers, ME is calculated by subtracting the approximated filter weights from the original filter weights, performing matrix multiplication between the difference and the input and calculating the grand-sum of the resulting matrix. ME is computed to identify approximated filters in a layer that result in low inference accuracy. In order to maintain the accuracy of the network, these filters weights are replaced with the original full precision weights.
    [Show full text]