DOCSLIB.ORG

Fall 2014 Course Schedule

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Fall 2014 Course Schedule Fall 2014 Course Schedule TPL011: Introduction to C Programming ................................................................................................................................ 2 TPL036: Introduction to Ruby and Rails ................................................................................................................................. 2 TPL064: An Introduction to Computer Vision and Automated Object Recognition ................................................................ 3 TPL103: Introduction to Intel x86-64 ....................................................................................................................................... 4 TPL109: Introduction to ARM (Advanced/Acorn RISC Machine) Architecture & Software Systems ..................................... 5 TPL465: Intermediate Intel x86: Architecture, Assembly, and Applications ........................................................................... 6 TPL477: Introduction to Android Forensics and Security Testing ........................................................................................... 8 TPL482: JSON and JSON Schema ........................................................................................................................................ 9 TST414: Introduction to Bayesian Data Analysis.................................................................................................................. 10 TSV062: Privacy Engineering ............................................................................................................................................... 11 TSV064: Introduction to Hardware Hacking .......................................................................................................................... 12 TSV065: Introduction to Side-Channel Analysis ................................................................................................................... 13 TSV066: Linux/Unix Security ................................................................................................................................................ 14 TSV100: Introduction to Secure Coding ............................................................................................................................... 15 TSV404: Introduction to Vulnerability Assessment ............................................................................................................... 16 TSV427: Introduction to Reverse Engineering Software ...................................................................................................... 17 TSV432: Introduction to Trusted Computing and the Use of Trusted Platform Modules...................................................... 19 TSV436: Secure Code Review ............................................................................................................................................. 19 1 | P a g e Approved for Public Release; Distribution Unlimited. Case Number 14-3731 ©2014 The MITRE Corporation. ALL RIGHTS RESERVED Fall 2014 Course Schedule TPL011: Introduction to C Programming Course Description: This course is an introduction to the C programming language. C is primarily a systems programming language suitable for a wide variety of domains. It is the implementation language of the Linux kernel, many standard Unix utilities, and is the basis for higher level languages like C++ and Java. This class for people with prior programming experience in any language, but would like to learn C. It will include instruction as a lecture, with labs interleaved to give students experience in concepts being taught. Course Objectives: • A basic understanding of the C language and standard library • Understanding of common C programming techniques, including procedural and object oriented approaches • Be able to use the standard socket APIs for Linux and Windows • Be able to do file input and output safely Format: Presentation, exercises, and labs. Prerequisites: Previous programming experience. Target Audience: All MITRE technical staff, and staff applying to the Deep System Security & Trusted Computing Learning Path. Length: 2 Days Schedule: December 8-9, 2014 - 8:30am - 4:30pm - EST Instructor: Collin Hockey ([email protected]) is a Senior Digital/Microprocessor Hardware Engineer in Bedford in the Electronic Systems Development Department J82E. Since 2010, Collin has worked multiple projects, including GPS, the Tactical Wireless Channel Emulator, and most recently on embedded software for the Bistatic Radar portfolio. TPL036: Introduction to Ruby and Rails Course Description: This course provides a thorough introduction to the Ruby programming language. Students will explore what differentiates Ruby from other modern programming languages. The class will have a strong focus on the tools that Ruby provides to generate logic and build applications with less code than other programming languages. Once a basic understanding of the Ruby programming language is attained, the class will provide an introduction to Ruby on Rails. This is a popular development framework for rapidly creating web applications. Students will leave the class with the tools they need to create simple Ruby and Rails applications and explore the ecosystem further on their own. Course Objectives: • Install and setup a Ruby and Rails environment • Identify the basics of the Ruby programming language. • Create and configure a Rails application • Develop a basic understanding of programming with Ruby, with the tools necessary to learn more 2 | P a g e Approved for Public Release; Distribution Unlimited. Case Number 14-3731 ©2014 The MITRE Corporation. ALL RIGHTS RESERVED Fall 2014 Course Schedule • Provide knowledge on the architecture of a Ruby on Rails application, with the ability to create a basic web application using it. Format: Lecture/Lab Prerequisites: Experience with an object oriented programming language, such as Java or C# Target Audience: This course is open to all MITRE technical staff. Length: 2 Days (14 Hours) Schedule: 11-Feb-2015 - 12-Feb-2015 (8:30 - 4:30) Instructor: Andy is an architect and developer on popHealth, a Ruby-based open source platform for calculating clinical quality measures. The design of popHealth allows the software to calculate quality measures for very large groups of patients in an easily scalable fashion. Andy is Technical Lead of the current effort to deploy a popHealth prototype installation at VA. Andy holds a BS in Electrical Engineering from Eastern Nazarene College and an MS in Computer Systems Engineering from Boston University. TPL064: An Introduction to Computer Vision and Automated Object Recognition Course Description: How can computers understand and interpret the visual world of humans? This course is an introduction to computer vision and automated object recognition in images and videos. In the simplest terms, computer vision is the exploration of "teaching machines how to see." Although this field dates back more than forty years, the recent explosive growth of images and videos has made the challenges of automated image interpretation more exciting and relevant than ever. This course will be a hands- on exploration of some of the fundamental aspects of computer vision. Topics will include image processing, image segmentation, facial recognition, automated object recognition and detection. With the help of the instructor, participants will learn to employ the latest developments in object recognition to build their own recognition systems. Course Objectives: • To understand and address the major approaches of basic issues in computer vision • To develop hands-on experience with the latest automated image and video processing techniques • Learning about image processing and segmentation, facial recognition, automated object recognition and detection Format: Presentation, discussion, combined with a hands-on lab component. Prerequisites: Some programming experience in either C, C++, Python. Target Audience: Participants interested in learning about image and video processing with some programming skills background. Length: 2 Days - 14 Hours Schedule: December 1-2, 2014 - 8:30am - 4:30pm - EST 3 | P a g e Approved for Public Release; Distribution Unlimited. Case Number 14-3731 ©2014 The MITRE Corporation. ALL RIGHTS RESERVED Fall 2014 Course Schedule Instructor: Mikel Rodriguez ([email protected]) is a researcher at MITRE. He was a post-doctoral fellow at the INRIA Willow team at the Département d'Informatique of Ecole Normale Supérieure in Paris, France. Mikel completed his PhD in Computer Science at UCF. His research focuses mainly on video interpretation which includes tracking, visual motion analysis, activity recognition, and crowd behavior analysis. An overview of the computer vision research being done by Mikel Rodriguez and his group can be found at: www.computervision.mitre.org/research/overview/ TPL103: Introduction to Intel x86-64 Course Description: Intel processors have been a major force in personal computing for more than 30 years. An understanding of low level computing mechanisms used in Intel chips as taught in this course serves as a foundation upon which to better understand other hardware, as well as many technical specialties such as reverse engineering, compiler design, operating system design, code optimization, and vulnerability exploitation. 25% of the time will be spent bootstrapping knowledge of fully OS-independent aspects of Intel architecture. 50% will be spent learning Windows
Load more

Recommended publications
  • Bit Shifts Bit Operations, Logical Shifts, Arithmetic Shifts, Rotate Shifts
    Why bit operations Assembly languages all provide ways to manipulate individual bits in multi-byte values Some of the coolest “tricks” in assembly rely on Bit Shifts bit operations With only a few instructions one can do a lot very quickly using judicious bit operations And you can do them in almost all high-level ICS312 programming languages! Let’s look at some of the common operations, Machine-Level and starting with shifts Systems Programming logical shifts arithmetic shifts Henri Casanova ([email protected]) rotate shifts Shift Operations Logical Shifts The simplest shifts: bits disappear at one end A shift moves the bits around in some data and zeros appear at the other A shift can be toward the left (i.e., toward the most significant bits), or toward the right (i.e., original byte 1 0 1 1 0 1 0 1 toward the least significant bits) left log. shift 0 1 1 0 1 0 1 0 left log. shift 1 1 0 1 0 1 0 0 left log. shift 1 0 1 0 1 0 0 0 There are two kinds of shifts: right log. shift 0 1 0 1 0 1 0 0 Logical Shifts right log. shift 0 0 1 0 1 0 1 0 Arithmetic Shifts right log. shift 0 0 0 1 0 1 0 1 Logical Shift Instructions Shifts and Numbers Two instructions: shl and shr The common use for shifts: quickly multiply and divide by powers of 2 One specifies by how many bits the data is shifted In decimal, for instance: multiplying 0013 by 10 amounts to doing one left shift to obtain 0130 Either by just passing a constant to the instruction multiplying by 100=102 amounts to doing two left shifts to obtain 1300 Or by using whatever
    [Show full text]
  • AMIA 2017 Annual Symposium
    AMIA 2017 Annual Symposium Washington, DC, USA 4 - 8 November 2017 Volume 1 of 3 ISBN: 978-1-5108-5307-2 Printed from e-media with permission by: Curran Associates, Inc. 57 Morehouse Lane Red Hook, NY 12571 Some format issues inherent in the e-media version may also appear in this print version. Copyright© (2017) by American Medical Informatics Association All rights reserved. Printed by Curran Associates, Inc. (2018) For permission requests, please contact American Medical Informatics Association at the address below. American Medical Informatics Association 4720 Montgomery Lane, Suite 500 Bethesda, Maryland 20814 USA Phone: (301) 657-1291 Fax: (301) 657-1296 www.amia.org Additional copies of this publication are available from: Curran Associates, Inc. 57 Morehouse Lane Red Hook, NY 12571 USA Phone: 845-758-0400 Fax: 845-758-2633 Email: [email protected] Web: www.proceedings.com TABLE OF CONTENTS VOLUME 1 Enabling Interoperability between Healthcare Devices and EHR Systems.................................................................................................1 Swapna Abhyankar ; Paul Schluter ; Kathryn Bennett ; Daniel J. Vreeman ; Clement J. McDonald Applying a Process-based Framework to examine Interunit Patient Transfers .........................................................................................3 Joanna Abraham ; Shirley Burton ; Imade Ihianle Medical Benefit Drug Claims: Assessing the NDC Documentation Gap .....................................................................................................5
    [Show full text]
  • A Cross-Platform Programmer's Calculator
    – Independent Work Report Fall, 2015 – A Cross-Platform Programmer’s Calculator Brian Rosenfeld Advisor: Robert Dondero Abstract This paper details the development of the first cross-platform programmer’s calculator. As users of programmer’s calculators, we wanted to address limitations of existing, platform-specific options in order to make a new, better calculator for us and others. And rather than develop for only one- platform, we wanted to make an application that could run on multiple ones, maximizing its reach and utility. From the start, we emphasized software-engineering and human-computer-interaction best practices, prioritizing portability, robustness, and usability. In this paper, we explain the decision to build a Google Chrome Application and illustrate how using the developer-preview Chrome Apps for Mobile Toolchain enabled us to build an application that could also run as native iOS and Android applications [18]. We discuss how we achieved support of signed and unsigned 8, 16, 32, and 64-bit integral types in JavaScript, a language with only one numerical type [15], and we demonstrate how we adapted the user interface for different devices. Lastly, we describe our usability testing and explain how we addressed learnability concerns in a second version. The end result is a user-friendly and versatile calculator that offers value to programmers, students, and educators alike. 1. Introduction This project originated from a conversation with Dr. Dondero in which I expressed an interest in software engineering, and he mentioned a need for a good programmer’s calculator. Dr. Dondero uses a programmer’s calculator while teaching Introduction to Programming Systems at Princeton (COS 217), and he had found that the pre-installed Mac OS X calculator did not handle all of his use cases.
    [Show full text]
  • Bitwise Operators
    Logical operations ANDORNOTXORAND,OR,NOT,XOR •Loggpical operations are the o perations that have its result as a true or false. • The logical operations can be: • Unary operations that has only one operand (NOT) • ex. NOT operand • Binary operations that has two operands (AND,OR,XOR) • ex. operand 1 AND operand 2 operand 1 OR operand 2 operand 1 XOR operand 2 1 Dr.AbuArqoub Logical operations ANDORNOTXORAND,OR,NOT,XOR • Operands of logical operations can be: - operands that have values true or false - operands that have binary digits 0 or 1. (in this case the operations called bitwise operations). • In computer programming ,a bitwise operation operates on one or two bit patterns or binary numerals at the level of their individual bits. 2 Dr.AbuArqoub Truth tables • The following tables (truth tables ) that shows the result of logical operations that operates on values true, false. x y Z=x AND y x y Z=x OR y F F F F F F F T F F T T T F F T F T T T T T T T x y Z=x XOR y x NOT X F F F F T F T T T F T F T T T F 3 Dr.AbuArqoub Bitwise Operations • In computer programming ,a bitwise operation operates on one or two bit patterns or binary numerals at the level of their individual bits. • Bitwise operators • NOT • The bitwise NOT, or complement, is an unary operation that performs logical negation on each bit, forming the ones' complement of the given binary value.
    [Show full text]
  • Bits, Bytes, and Integers Today: Bits, Bytes, and Integers
    Bits, Bytes, and Integers Today: Bits, Bytes, and Integers Representing information as bits Bit-level manipulations Integers . Representation: unsigned and signed . Conversion, casting . Expanding, truncating . Addition, negation, multiplication, shifting . Summary Representations in memory, pointers, strings Everything is bits Each bit is 0 or 1 By encoding/interpreting sets of bits in various ways . Computers determine what to do (instructions) . … and represent and manipulate numbers, sets, strings, etc… Why bits? Electronic Implementation . Easy to store with bistable elements . Reliably transmitted on noisy and inaccurate wires 0 1 0 1.1V 0.9V 0.2V 0.0V For example, can count in binary Base 2 Number Representation . Represent 1521310 as 111011011011012 . Represent 1.2010 as 1.0011001100110011[0011]…2 4 13 . Represent 1.5213 X 10 as 1.11011011011012 X 2 Encoding Byte Values Byte = 8 bits . Binary 000000002 to 111111112 0 0 0000 . Decimal: 010 to 25510 1 1 0001 2 2 0010 . Hexadecimal 0016 to FF16 3 3 0011 . 4 4 0100 Base 16 number representation 5 5 0101 . Use characters ‘0’ to ‘9’ and ‘A’ to ‘F’ 6 6 0110 7 7 0111 . Write FA1D37B16 in C as 8 8 1000 – 0xFA1D37B 9 9 1001 A 10 1010 – 0xfa1d37b B 11 1011 C 12 1100 D 13 1101 E 14 1110 F 15 1111 Example Data Representations C Data Type Typical 32-bit Typical 64-bit x86-64 char 1 1 1 short 2 2 2 int 4 4 4 long 4 8 8 float 4 4 4 double 8 8 8 long double − − 10/16 pointer 4 8 8 Today: Bits, Bytes, and Integers Representing information as bits Bit-level manipulations Integers .
    [Show full text]
  • Integer Arithmetic and Undefined Behavior in C Brad Karp UCL Computer Science
    Carnegie Mellon Integer Arithmetic and Undefined Behavior in C Brad Karp UCL Computer Science CS 3007 23rd January 2018 (lecture notes derived from material from Eddie Kohler, John Regehr, Phil Gibbons, Randy Bryant, and Dave O’Hallaron) 1 Carnegie Mellon Outline: Integer Arithmetic and Undefined Behavior in C ¢ C primitive data types ¢ C integer arithmetic § Unsigned and signed (two’s complement) representations § Maximum and minimum values; conversions and casts § Perils of C integer arithmetic, unsigned and especially signed ¢ Undefined behavior (UB) in C § As defined in the C99 language standard § Consequences for program behavior § Consequences for compiler and optimizer behavior § Examples § Prevalence of UB in real-world Linux application-level code ¢ Recommendations for defensive programming in C 2 Carnegie Mellon Example Data Representations C Data Type Typical 32-bit Typical 64-bit x86-64 char 1 1 1 signed short (default) 2 2 2 and int 4 4 4 unsigned variants long 4 8 8 float 4 4 4 double 8 8 8 pointer 4 8 8 3 Carnegie Mellon Portable C types with Fixed Sizes C Data Type all archs {u}int8_t 1 {u}int16_t 2 {u}int32_t 4 {u}int64_t 8 uintptr_t 4 or 8 Type definitions available in #include <stdint.h> 4 Carnegie Mellon Shift Operations ¢ Left Shift: x << y Argument x 01100010 § Shift bit-vector x left y positions << 3 00010000 – Throw away extra bits on left Log. >> 2 00011000 § Fill with 0’s on right Arith. >> 2 00011000 ¢ Right Shift: x >> y § Shift bit-vector x right y positions Argument 10100010 § Throw away extra bits on right x § Logical shift << 3 00010000 § Fill with 0’s on left Log.
    [Show full text]
  • Episode 7.03 – Coding Bitwise Operations
    Episode 7.03 – Coding Bitwise Operations Welcome to the Geek Author series on Computer Organization and Design Fundamentals. I’m David Tarnoff, and in this series, we are working our way through the topics of Computer Organization, Computer Architecture, Digital Design, and Embedded System Design. If you’re interested in the inner workings of a computer, then you’re in the right place. The only background you’ll need for this series is an understanding of integer math, and if possible, a little experience with a programming language such as Java. And one more thing. This episode has direct consequences for our code. You can find coding examples on the episode worksheet, a link to which can be found on the transcript page at intermation.com. Way back in Episode 2.2 – Unsigned Binary Conversion, we introduced three operators that allow us to manipulate integers at the bit level: the logical shift left (represented with two adjacent less-than operators, <<), the arithmetic shift right (represented with two adjacent greater-than operators, >>), and the logical shift right (represented with three adjacent greater-than operators, >>>). These special operators allow us to take all of the bits in a binary integer and move them left or right by a specified number of bit positions. The syntax of all three of these operators is to place the integer we wish to shift on the left side of the operator and the number of bits we wish to shift it by on the right side of the operator. In that episode, we introduced these operators to show how bit shifts could take the place of multiplication or division by powers of two.
    [Show full text]
  • Openvms Linker Utility Manual
    OpenVMS Linker Utility Manual Order Number: AA–PV6CD–TK April 2001 This manual describes the OpenVMS Linker utility. Revision/Update Information: This manual supersedes the OpenVMS Linker Utility Manual, Version 7.1 Software Version: OpenVMS Alpha Version 7.3 OpenVMS VAX Version 7.3 Compaq Computer Corporation Houston, Texas © 2001 Compaq Computer Corporation Compaq, VAX, VMS, and the Compaq logo Registered in U.S. Patent and Trademark Office. OpenVMS is a trademark of Compaq Information Technologies Group, L.P. in the United States and other countries. UNIX is a trademark of The Open Group. All other product names mentioned herein may be the trademarks or registered trademarks of their respective companies. Confidential computer software. Valid license from Compaq required for possession, use, or copying. Consistent with FAR 12.211 and 12.212, Commercial Computer Software, Computer Software Documentation, and Technical Data for Commercial Items are licensed to the U.S. Government under vendor’s standard commercial license. Compaq shall not be liable for technical or editorial errors or omissions contained herein. The information in this document is provided "as is" without warranty of any kind and is subject to change without notice. The warranties for Compaq products are set forth in the express limited warranty statements accompanying such products. Nothing herein should be construed as constituting an additional warranty. ZK4548 The Compaq OpenVMS documentation set is available on CD–ROM. This document was prepared using VAX DOCUMENT Version 2.1. Contents Preface ............................................................ xi Part I Linker Utility Description 1 Introduction 1.1 Overview . ................................................ 1–1 1.1.1 Linker Functions .
    [Show full text]
  • VAX MACRO and Instruction Set Reference Manual
    VAX MACRO and Instruction Set Reference Manual Order Number: AA–PS6GD–TE April 2001 This document describes the features of the VAX MACRO instruction set and assembler. It includes a detailed description of MACRO directives and instructions, as well as information about MACRO source program syntax. Revision/Update Information: This manual supersedes the VAX MACRO and Instruction Set Reference Manual, Version 7.1 Software Version: OpenVMS VAX Version 7.3 Compaq Computer Corporation Houston, Texas © 2001 Compaq Computer Corporation Compaq, VAX, VMS, and the Compaq logo Registered in U.S. Patent and Trademark Office. OpenVMS is a trademark of Compaq Information Technologies Group, L.P. in the United States and other countries. All other product names mentioned herein may be trademarks of their respective companies. Confidential computer software. Valid license from Compaq required for possession, use, or copying. Consistent with FAR 12.211 and 12.212, Commercial Computer Software, Computer Software Documentation, and Technical Data for Commercial Items are licensed to the U.S. Government under vendor’s standard commercial license. Compaq shall not be liable for technical or editorial errors or omissions contained herein. The information in this document is provided "as is" without warranty of any kind and is subject to change without notice. The warranties for Compaq products are set forth in the express limited warranty statements accompanying such products. Nothing herein should be construed as constituting an additional warranty. ZK4515 The Compaq OpenVMS documentation set is available on CD-ROM. This document was prepared using DECdocument, Version 3.3-1b. Contents Preface ............................................................ xv VAX MACRO Language 1 Introduction 2 VAX MACRO Source Statement Format 2.1 Label Field .
    [Show full text]
  • Textbook Section 6.1 Draft
    Chapter Six A Computing Machine 6.1 Representing Information . 810 6.2 TOY Machine. 842 6.3 Machine Language Programming . 860 6.4 Simulator . 910 UR GOAL IN THIS CHAPTER IS to show you how simple the computer that you’re Ousing really is. We will describe in detail a simple imaginary machine that has many of the characteristics of real processors at the heart of the computational devices that surround us. You may be surprised to learn that many, many machines share these same properties, even some of the very first computers that were developed. Accordingly, we are able to tell the story in historical context. Imagine a world without comput- ers, and what sort of device might be received with enthusiasm, and that is not far from what we have! We tell out story from the standpoint of scientific computing— there is an equally fascinating story from the standpoint of commercial computing that we touch on just briefly. Next, our aim is to convince you that the basic concepts and constructs that we covered in Java programming are not so difficult to implement on a simple machine, using its own machine language. We will consider in detail conditionals, loops, functions, arrays, and linked structures. Since these are the same basic tools that we examined for Java, it follows that several of the computational tasks that we addressed in the first part of this book are not difficult to address at a lower level. This simple machine is a link on the continuum between your computer and the actual hardware circuits that change state to reflect the action of your programs.
    [Show full text]
  • Modular SIMD Arithmetic in Mathemagix Joris Van Der Hoeven, Grégoire Lecerf, Guillaume Quintin
    Modular SIMD arithmetic in Mathemagix Joris van der Hoeven, Grégoire Lecerf, Guillaume Quintin To cite this version: Joris van der Hoeven, Grégoire Lecerf, Guillaume Quintin. Modular SIMD arithmetic in Mathemagix. 2014. hal-01022383 HAL Id: hal-01022383 https://hal.archives-ouvertes.fr/hal-01022383 Preprint submitted on 10 Jul 2014 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Modular SIMD arithmetic in Mathemagix Joris van der Hoevena, Grégoire Lecerfb Laboratoire d’informatique LIX, UMR 7161 CNRS Campus de l’École polytechnique Route de Saclay 91128 Palaiseau Cedex, France a. Email: [email protected] b. Email: [email protected] Guillaume Quintin Laboratoire XLIM, UMR 7252 CNRS Université de Limoges 123, avenue Albert Thomas 87060 Limoges Cedex, France Email: [email protected] Version of June 29, 2014 Modular integer arithmetic occurs in many algorithms for computer algebra, cryp- tography, and error correcting codes. Although recent microprocessors typically offer a wide range of highly optimized arithmetic functions, modular integer operations still require dedicated implementations. In this article, we survey existing algorithms for modular integer arithmetic, and present detailed vectorized counterparts. We also present several applications, such as fast modular Fourier transforms and multiplica- tion of integer polynomials and matrices.
    [Show full text]
  • Software Design
    Software Design April 26, 2013 1. Introduction 1.1.1. Purpose of This Document This document provides a high level description of the design and implementation of Cypress, an open source certification testing tool for the calculation of Clinical Quality Measures (CQMs) as part of the stage 2 Meaningful Use (MU2) requirements of the EHR Incentive Program. This document has been written for software engineers, software architects, and technical program managers. The latest information about Cypress is available at the project’s open source website[1]. 1.1.2. Overview Cypress is an open source (see section 5) certification testing tool that automates testing of the ability of electronic health record (EHR) systems to correctly calculate MU Stage 2 CQM results. Cypress is recognized by the Office of the National Coordinator of Health IT (ONC) as the official test tool for use by Authorized Testing Laboratories (ATL) in CQM certification. In addition, Cypress can be used, free of charge, for pre-certification testing by any EHR developer. The CQM certification criteria addressed by Cypress are: • Capture and Export - the ability of an EHR system to capture the data required for each CQM for which the EHR system is being certified through its clinical user interface and to create a QRDA-I formatted data file with appropriate content that can be input by another EHR system for use in CQM calculation • Import and Calculate - the ability of an EHR system to incorporate data (from other EHR systems where necessary) in QRDA-I format and correctly calculate the CQM results and present them in QRDA-III format • Electronic Submission - the capability of an EHR system to create a standard data file that can be electronically accepted by the Centers for Medicaid & Medicare Services (CMS) Cypress includes a standard set of synthetic patient records that exercise all of the MU Stage 2 CQMs.
    [Show full text]