About the World Wide Web Consortium (W3C)
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
CMPS 161 – Algorithm Design and Implementation I Current Course Description
CMPS 161 – Algorithm Design and Implementation I Current Course Description: Credit 3 hours. Prerequisite: Mathematics 161 or 165 or permission of the Department Head. Basic concepts of computer programming, problem solving, algorithm development, and program coding using a high-level, block structured language. Credit may be given for both Computer Science 110 and 161. Minimum Topics: • Fundamental programming constructs: Syntax and semantics of a higher-level language; variables, types, expressions, and assignment; simple I/O; conditional and iterative control structures; functions and parameter passing; structured decomposition • Algorithms and problem-solving: Problem-solving strategies; the role of algorithms in the problem- solving process; implementation strategies for algorithms; debugging strategies; the concept and properties of algorithms • Fundamental data structures: Primitive types; single-dimension and multiple-dimension arrays; strings and string processing • Machine level representation of data: Bits, bytes and words; numeric data representation; representation of character data • Human-computer interaction: Introduction to design issues • Software development methodology: Fundamental design concepts and principles; structured design; testing and debugging strategies; test-case design; programming environments; testing and debugging tools Learning Objectives: Students will be able to: • Analyze and explain the behavior of simple programs involving the fundamental programming constructs covered by this unit. • Modify and expand short programs that use standard conditional and iterative control structures and functions. • Design, implement, test, and debug a program that uses each of the following fundamental programming constructs: basic computation, simple I/O, standard conditional and iterative structures, and the definition of functions. • Choose appropriate conditional and iteration constructs for a given programming task. • Apply the techniques of structured (functional) decomposition to break a program into smaller pieces. -
How to Page a Document in Microsoft Word
1 HOW TO PAGE A DOCUMENT IN MICROSOFT WORD 1– PAGING A WHOLE DOCUMENT FROM 1 TO …Z (Including the first page) 1.1 – Arabic Numbers (a) Click the “Insert” tab. (b) Go to the “Header & Footer” Section and click on “Page Number” drop down menu (c) Choose the location on the page where you want the page to appear (i.e. top page, bottom page, etc.) (d) Once you have clicked on the “box” of your preference, the pages will be inserted automatically on each page, starting from page 1 on. 1.2 – Other Formats (Romans, letters, etc) (a) Repeat steps (a) to (c) from 1.1 above (b) At the “Header & Footer” Section, click on “Page Number” drop down menu. (C) Choose… “Format Page Numbers” (d) At the top of the box, “Number format”, click the drop down menu and choose your preference (i, ii, iii; OR a, b, c, OR A, B, C,…and etc.) an click OK. (e) You can also set it to start with any of the intermediate numbers if you want at the “Page Numbering”, “Start at” option within that box. 2 – TITLE PAGE WITHOUT A PAGE NUMBER…….. Option A – …And second page being page number 2 (a) Click the “Insert” tab. (b) Go to the “Header & Footer” Section and click on “Page Number” drop down menu (c) Choose the location on the page where you want the page to appear (i.e. top page, bottom page, etc.) (d) Once you have clicked on the “box” of your preference, the pages will be inserted automatically on each page, starting from page 1 on. -
Skepu 2: Flexible and Type-Safe Skeleton Programming for Heterogeneous Parallel Systems
Int J Parallel Prog DOI 10.1007/s10766-017-0490-5 SkePU 2: Flexible and Type-Safe Skeleton Programming for Heterogeneous Parallel Systems August Ernstsson1 · Lu Li1 · Christoph Kessler1 Received: 30 September 2016 / Accepted: 10 January 2017 © The Author(s) 2017. This article is published with open access at Springerlink.com Abstract In this article we present SkePU 2, the next generation of the SkePU C++ skeleton programming framework for heterogeneous parallel systems. We critically examine the design and limitations of the SkePU 1 programming interface. We present a new, flexible and type-safe, interface for skeleton programming in SkePU 2, and a source-to-source transformation tool which knows about SkePU 2 constructs such as skeletons and user functions. We demonstrate how the source-to-source compiler transforms programs to enable efficient execution on parallel heterogeneous systems. We show how SkePU 2 enables new use-cases and applications by increasing the flexibility from SkePU 1, and how programming errors can be caught earlier and easier thanks to improved type safety. We propose a new skeleton, Call, unique in the sense that it does not impose any predefined skeleton structure and can encapsulate arbitrary user-defined multi-backend computations. We also discuss how the source- to-source compiler can enable a new optimization opportunity by selecting among multiple user function specializations when building a parallel program. Finally, we show that the performance of our prototype SkePU 2 implementation closely matches that of -
Towards a Conceptual Model for an E-Government Interoperability Framework for South Africa
Towards a Conceptual Model for an e-Government Interoperability Framework for South Africa Paula Kotzé1,2 and Ronell Alberts1 1CSIR Meraka Institute, Pretoria, South Africa 2Department of Informatics, University of Pretoria, Pretoria, South Africa Keywords: e-Government, e-GIF, Interoperability. Abstract: In September 2016, the South African Government published a White Paper on the National Integrated ICT Policy highlighting some principles for e-Government and the development of a detailed integrated national e-Government strategy and roadmap. This paper focuses on one of the elements of such a strategy, namely the delivery infrastructure principles identified, and addresses the identified need for centralised coordination to ensure interoperability. The paper proposes a baseline conceptual model for an e- Government interoperability framework (e-GIF) for South Africa. The development of the model considered best practices and lessons learnt from previous national and international attempts to design and develop national and regional e-GIFs, with cognisance of the South African legislation and technical, social and political environments. The conceptual model is an enterprise model on an abstraction level suitable for strategic planning. 1 INTRODUCTION (Lallana, 2008: p.1) and is becoming an increasingly crucial issue, also for developing countries (United Implementing a citizen-centric approach, digitising Nations Development Programme, 2007). Many processes and making organisational changes to governments have finalised the design of national e- delivering government services are widely posited as Government strategies and are implementing priority a way to enhance services, save money and improve programmes. However, many of these interventions citizens’ quality of life (Corydon et al., 2016). The have not led to more effective public e-services, term electronic government (e-Government) is simply because they have ended up reinforcing the commonly used to represent the use of digital tools old barriers that made public access cumbersome. -
Software Requirements Implementation and Management
Software Requirements Implementation and Management Juho Jäälinoja¹ and Markku Oivo² 1 VTT Technical Research Centre of Finland P.O. Box 1100, 90571 Oulu, Finland [email protected] tel. +358-40-8415550 2 University of Oulu P.O. Box 3000, 90014 University of Oulu, Finland [email protected] tel. +358-8-553 1900 Abstract. Proper elicitation, analysis, and documentation of requirements at the beginning of a software development project are considered important preconditions for successful software development. Furthermore, successful development requires that the requirements be correctly implemented and managed throughout the rest of the development. This latter success criterion is discussed in this paper. The paper presents a taxonomy for requirements implementation and management (RIM) and provides insights into the current state of these practices in the software industry. Based on the taxonomy and the industrial observations, a model for RIM is elaborated. The model describes the essential elements needed for successful implementation and management of requirements. In addition, three critical elements of the model with which the practitioners are currently struggling are discussed. These elements were identified as (1) involvement of software developers in system level requirements allocation, (2) work product verification with reviews, and (3) requirements traceability. Keywords: Requirements engineering, software requirements, requirements implementation, requirements management 1/9 1. INTRODUCTION Among the key concepts of efficient software development are proper elicitation, analysis, and documentation of requirements at the beginning of a project and correct implementation and management of these requirements in the later stages of the project. In this paper, the latter issue related to the life of software requirements beyond their initial development is discussed. -
Dewarpnet: Single-Image Document Unwarping with Stacked 3D and 2D Regression Networks
DewarpNet: Single-Image Document Unwarping With Stacked 3D and 2D Regression Networks Sagnik Das∗ Ke Ma∗ Zhixin Shu Dimitris Samaras Roy Shilkrot Stony Brook University fsadas, kemma, zhshu, samaras, [email protected] Abstract Capturing document images with hand-held devices in unstructured environments is a common practice nowadays. However, “casual” photos of documents are usually unsuit- able for automatic information extraction, mainly due to physical distortion of the document paper, as well as var- ious camera positions and illumination conditions. In this work, we propose DewarpNet, a deep-learning approach for document image unwarping from a single image. Our insight is that the 3D geometry of the document not only determines the warping of its texture but also causes the il- lumination effects. Therefore, our novelty resides on the ex- plicit modeling of 3D shape for document paper in an end- to-end pipeline. Also, we contribute the largest and most comprehensive dataset for document image unwarping to date – Doc3D. This dataset features multiple ground-truth annotations, including 3D shape, surface normals, UV map, Figure 1. Document image unwarping. Top row: input images. albedo image, etc. Training with Doc3D, we demonstrate Middle row: predicted 3D coordinate maps. Bottom row: pre- state-of-the-art performance for DewarpNet with extensive dicted unwarped images. Columns from left to right: 1) curled, qualitative and quantitative evaluations. Our network also 2) one-fold, 3) two-fold, 4) multiple-fold with OCR confidence significantly improves OCR performance on captured doc- highlights in Red (low) to Blue (high). ument images, decreasing character error rate by 42% on average. -
Efficient High-Level Parallel Programming
Theoretical Computer Science EISEVIER Theoretical Computer Science 196 (1998) 71-107 Efficient high-level parallel programming George Horaliu Botoroga,*,‘, Herbert Kuchenb aAachen University of Technology, Lehrstuhl fiir Informatik IL Ahornstr. 55, D-52074 Aachen, Germany b University of Miinster, Institut fir Wirtschaftsinformatik, Grevener Str. 91, D-48159 Miinster, Germany Abstract Algorithmic skeletons are polymorphic higher-order functions that represent common parallel- ization patterns and that are implemented in parallel. They can be used as the building blocks of parallel and distributed applications by embedding them into a sequential language. In this paper, we present a new approach to programming with skeletons. We integrate the skeletons into an imperative host language enhanced with higher-order functions and currying, as well as with a polymorphic type system. We thus obtain a high-level programming language, which can be implemented very efficiently. We then present a compile-time technique for the implementation of the functional features which has an important positive impact on the efficiency of the language. Afier describing a series of skeletons which work with distributed arrays, we give two examples of parallel algorithms implemented in our language, namely matrix multiplication and Gaussian elimination. Run-time measurements for these and other applications show that we approach the efficiency of message-passing C up to a factor between 1 and 1.5. @ 1998-Elsevier Science B.V. All rights reserved Keywords: Algorithmic skeletons; High-level parallel programming; Efficient implementation of functional features; Distributed arrays 1. Introduction Although parallel and distributed systems gain more and more importance nowadays, the state of the art in the field of parallel software is far from being satisfactory. -
Map, Reduce and Mapreduce, the Skeleton Way$
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Procedia Computer Science ProcediaProcedia Computer Computer Science Science 00 1 (2010)(2012) 1–9 2095–2103 www.elsevier.com/locate/procedia International Conference on Computational Science, ICCS 2010 Map, Reduce and MapReduce, the skeleton way$ D. Buonoa, M. Daneluttoa, S. Lamettia aDept. of Computer Science, Univ. of Pisa, Italy Abstract Composition of Map and Reduce algorithmic skeletons have been widely studied at the end of the last century and it has demonstrated effective on a wide class of problems. We recall the theoretical results motivating the intro- duction of these skeletons, then we discuss an experiment implementing three algorithmic skeletons, a map,areduce and an optimized composition of a map followed by a reduce skeleton (map+reduce). The map+reduce skeleton implemented computes the same kind of problems computed by Google MapReduce, but the data flow through the skeleton is streamed rather than relying on already distributed (and possibly quite large) data items. We discuss the implementation of the three skeletons on top of ProActive/GCM in the MareMare prototype and we present some experimental obtained on a COTS cluster. ⃝c 2012 Published by Elsevier Ltd. Open access under CC BY-NC-ND license. Keywords: Algorithmic skeletons, map, reduce, list theory, homomorphisms 1. Introduction Algorithmic skeletons have been around since Murray Cole’s PhD thesis [1]. An algorithmic skeleton is a paramet- ric, reusable, efficient and composable programming construct that exploits a well know, efficient parallelism exploita- tion pattern. A skeleton programmer may build parallel applications simply picking up a (composition of) skeleton from the skeleton library available, providing the required parameters and running some kind of compiler+run time library tool specific of the target architecture at hand [2]. -
Libraries in West Malaysia and Singapore; a Short History
DOCUMENT RESUME ED 059 722 LI 003 461 AUTHOR Tee Edward Lim Huck TITLE Lib aries in West Malaysia and Slngap- e; A Sh History. INSTITUTION Malaya Univ., Kuala Lumpur (Malaysia). PUB DATE 70 NOTE 169p.;(210 References) EDRS PRICE MF-$0.65 HC-$6.58 DESCRIPTORS Foreign Countries; History; *Libraries; Library Planning; *Library Services; Library Surveys IDENTIFIERS *Library Development; Singapore; West Malaysia ABSTRACT An attempt is made to trace the history of every major library in Malay and Singapore. Social and recreational club libraries are not included, and school libraries are not extensively covered. Although it is possible to trace the history of Malaysia's libraries back to the first millenium of the Christian era, there are few written records pre-dating World War II. The lack of documentation on the early periods of library history creates an emphasis on developments in the modern period. This is not out of order since it is only recently that libraries in West Malaysia and Singapore have been recognized as one of the important media of mass education. Lack of funds, failure to recognize the importance of libraries, and problems caused by the federal structure of gc,vernment are blamed for this delay in development. Hinderances to future development are the lack of trained librarians, problems of having to provide material in several different languages, and the lack of national bibliographies, union catalogs and lists of serials. (SJ) (NJ (NJ LIBR ARIES IN WEST MALAYSIA AND SINGAPORE f=t a short history Edward Lirn Huck Tee B.A.HONS (MALAYA), F.L.A. -
Cleanroom Software Engineering Implementation of the Capability Maturity Model (Cmmsm) for Software
Technical Report CMU/SEI-96-TR-023 ESC-TR-96-023 Cleanroom Software Engineering Implementation of the Capability Maturity Model (CMMsm) for Software Richard C. Linger Mark C. Paulk Carmen J. Trammell December 1996 Technical Report CMU/SEI-96-TR-023 ESC-TR-96-023 December 1996 Cleanroom Software Engineering Implementation of the Capability Maturity Model (CMMsm) for Software Richard C. Linger Mark C. Paulk Software Engineering Institute Carmen J. Trammell University of Tennessee Process Program Unlimited distribution subject to the copyright Software Engineering Institute Carnegie Mellon University Pittsburgh, PA 15213 This report was prepared for the SEI Joint Program Office HQ ESC/AXS 5 Eglin Street Hanscom AFB, MA 01731-2116 The ideas and findings in this report should not be construed as an official DoD position. It is published in the interest of scientific and technical information exchange. FOR THE COMMANDER (signature on file) Thomas R. Miller, Lt Col, USAF SEI Joint Program Office This work is sponsored by the U.S. Department of Defense. Copyright © 1996 by Carnegie Mellon University. Permission to reproduce this document and to prepare derivative works from this document for internal use is granted, provided the copyright and “No Warranty” statements are included with all reproductions and derivative works. Requests for permission to reproduce this document or to prepare derivative works of this document for external and commercial use should be addressed to the SEI Licensing Agent. NO WARRANTY THIS CARNEGIE MELLON UNIVERSITY AND SOFTWARE ENGINEERING INSTITUTE MATERIAL IS FURNISHED ON AN “AS-IS” BASIS. CARNEGIE MELLON UNIVERSITY MAKES NO WARRANTIES OF ANY KIND, EITHER EXPRESSED OR IMPLIED, AS TO ANY MATTER INCLUDING, BUT NOT LIMITED TO, WARRANTY OF FITNESS FOR PURPOSE OR MERCHANTABILITY, EXCLUSIVITY, OR RESULTS OBTAINED FROM USE OF THE MATERIAL. -
Interoperability and Patient Access for Medicare Advantage Organization and Medicaid
Notice: This HHS-approved document has been submitted to the Office of the Federal Register (OFR) for publication and has not yet been placed on public display or published in the Federal Register. The document may vary slightly from the published document if minor editorial changes have been made during the OFR review process. The document published in the Federal Register is the official HHS-approved document. [Billing Code: 4120-01-P] DEPARTMENT OF HEALTH AND HUMAN SERVICES Centers for Medicare & Medicaid Services 42 CFR Parts 406, 407, 422, 423, 431, 438, 457, 482, and 485 Office of the Secretary 45 CFR Part 156 [CMS-9115-P] RIN 0938-AT79 Medicare and Medicaid Programs; Patient Protection and Affordable Care Act; Interoperability and Patient Access for Medicare Advantage Organization and Medicaid Managed Care Plans, State Medicaid Agencies, CHIP Agencies and CHIP Managed Care Entities, Issuers of Qualified Health Plans in the Federally-facilitated Exchanges and Health Care Providers AGENCY: Centers for Medicare & Medicaid Services (CMS), HHS. ACTION: Proposed rule. SUMMARY: This proposed rule is intended to move the health care ecosystem in the direction of interoperability, and to signal our commitment to the vision set out in the 21st Century Cures Act and Executive Order 13813 to improve access to, and the quality of, information that Americans need to make informed health care decisions, including data about health care prices CMS-9115-P 2 and outcomes, while minimizing reporting burdens on affected plans, health care providers, or payers. DATES: To be assured consideration, comments must be received at one of the addresses provided below, no later than 5 p.m. -
Early American Document Collection
________________________________________________________________________ Guide to MS-195: Early American Document Collection Tyler Black ’17, Smith Intern July 2016 2 MS – 195: Early American Document Collection (2 boxes, 2.87 cubic feet) Inclusive Dates: 1685-1812 Bulk Dates: 1727-1728; 1775-1787 Processed by: Tyler Black ‘17 July 2016 Provenance The Early American Document Collection is an artificial collection comprised of Colonial Era documents from a variety of donors and locations. Most are land and legal documents from Pennsylvania. Many of the documents in this collection were donated to Gettysburg College before the existence of Special Collections, thus there is no known donation information or accession records. Available provenance notes include: “Presented in memory of E.C. Goebel by his wife Janet C. Goebel” o Land Indenture for John Beard, from Samuel Miller and Wife, February 15, 1812 Rosenberger Collection o Land Deed for Tench Francis, from William Gregory, August 20, 1787 o Land Deed for Henry Drinker, from Tench Francis, May 23, 1794 o Land Grant for Henry Drinker, from Tench Francis and William Gregory, October 10, 1796 Donation of John George Butler (1826-1909), Class of 1850, College Trustee. Acquired from Philadelphia City Archives o Letter from Jos. Stamson to Rev. Benjamin Colman of Boston, containing a Catalog of Assorted Books, March 20, 1717 Donation from Stanley L. Klos, 2005 (Accession 2005-0291) o Land Deed for Samuel Dilworth in Northumberland County, signed by Thomas Mifflin, 3 March 1794 Purchase