DOCSLIB.ORG

Parts 43 and 45 Technical Specifications

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Parts 43 and 45 Technical Specifications CFTC Technical Specification Parts 43 and 45 swap data reporting and public dissemination requirements September 17, 2020 Version 2.0 This Technical Specification document (“Tech Spec”) provides technical specifications for reporting swap data to Swap Data Repositories (SDRs) under parts 43 and 45. i TABLE OF CONTENTS INDEX OF DATA ELEMENTS ........................................................................................................................................................................................... III 1 INTRODUCTION ................................................................................................................................................................................................. VI 1.1 BACKGROUND .................................................................................................................................................................................................................. VI 1.2 STRUCTURE AND DESCRIPTION OF COLUMN HEADINGS ............................................................................................................................................................ VI 1.3 EXPLANATION OF DATA ELEMENT OR CATEGORY .................................................................................................................................................................... IX 1.4 UNIQUE PRODUCT IDENTIFIER (UPI) ..................................................................................................................................................................................... X 2 TECHNICAL SPECIFICATION AND VALIDATION RULES ......................................................................................................................................... 1 3 APPENDIX ......................................................................................................................................................................................................... 37 A. ADDITIONAL DATA ELEMENTS PUBLICLY DISSEMINATED - REQUIREMENTS FOR SDRS ONLY ............................................................................................................. 37 B. NOTIONAL AMOUNT ....................................................................................................................................................................................................... 38 C. MAPPING OF DAY COUNT CONVENTION ALLOWABLE VALUES TO ISO 20022, FPML, AND FIX/FIXML VALUES ................................................................................ 39 D. VALUATION METHOD ...................................................................................................................................................................................................... 48 E. COLLATERALISATION CATEGORY ......................................................................................................................................................................................... 49 F. EVENTS: VALID ACTION TYPE AND EVENT TYPE COMBINATIONS FOR PART 43 AND PART 45 REPORTING ........................................................................................... 50 4. REFERENCES ..................................................................................................................................................................................................... 60 ii Index of Data Elements A E Action type ......................................................................................................................................................................................7 Affiliated counterparty for margin and capital indicator .................................................................................................................32 Effective date ................................................................................................................................................................................ 27 Allocation indicator ........................................................................................................................................................................26 Embedded option type ................................................................................................................................................................. 25 Amendment indicator ......................................................................................................................................................................9 Event identifier ................................................................................................................................................................................ 9 Event timestamp ............................................................................................................................................................................. 9 Event type....................................................................................................................................................................................... 8 Exchange rate .............................................................................................................................................................................. 19 B Exchange rate basis ..................................................................................................................................................................... 20 Execution timestamp .................................................................................................................................................................... 27 Block trade election indicator ........................................................................................................................................................27 Expiration date.............................................................................................................................................................................. 27 Buyer identifier ................................................................................................................................................................................5 F C Final contractual settlement date ................................................................................................................................................. 26 Call amount ...................................................................................................................................................................................11 First exercise date ........................................................................................................................................................................ 24 Call currency .................................................................................................................................................................................11 Fixed rate...................................................................................................................................................................................... 20 CDS index attachment point .........................................................................................................................................................25 Fixing date .................................................................................................................................................................................... 16 CDS index detachment point ........................................................................................................................................................25 Floating rate reset frequency period............................................................................................................................................. 16 Central counterparty .......................................................................................................................................................................1 Floating rate reset frequency period multiplier ............................................................................................................................. 17 Cleared ............................................................................................................................................................................................1 Clearing account origin ...................................................................................................................................................................1 Clearing member ............................................................................................................................................................................1 I Clearing receipt timestamp .............................................................................................................................................................3 Clearing swap USIs ........................................................................................................................................................................2 Clearing swap UTIs .........................................................................................................................................................................2 Index factor ..................................................................................................................................................................................
Load more

Recommended publications
  • So Many Date Formats: Which Should You Use? Kamlesh Patel, Jigar Patel, Dilip Patel, Vaishali Patel Rang Technologies Inc, Piscataway, NJ
    Paper – 2463-2017 So Many Date Formats: Which Should You Use? Kamlesh Patel, Jigar Patel, Dilip Patel, Vaishali Patel Rang Technologies Inc, Piscataway, NJ ABSTRACT Nearly all data is associated with some Date information. In many industries, a SAS® programmer comes across various Date formats in data that can be of numeric or character type. An industry like pharmaceuticals requires that dates be shown in ISO 8601 formats due to industry standards. Many SAS programmers commonly use a limited number of Date formats (like YYMMDD10. or DATE9.) with workarounds using scans or substring SAS functions to process date-related data. Another challenge for a programmer can be the source data, which can include either Date-Time or only Date information. How should a programmer convert these dates to the target format? There are many existing Date formats (like E8601 series, B8601 series, and so on) and informants available to convert the source Date to the required Date efficiently. In addition, there are some useful functions that we can explore for deriving timing-related variables. For these methods to be effective, one can use simple tricks to remember those formats. This poster is targeted to those who have a basic understanding of SAS dates. KEYWORDS SAS, date, time, Date-Time, format, informat, ISO 8601, tips, Basic, Extended, Notation APPLICATIONS: SAS v9.2 INTRODUCTION Date and time concept in SAS is very interesting and can be handled very efficiently if SAS programmers know beyond basics of different SAS Date formats and informats along with many different Date functions. There are various formats available to use as per need in SAS.
    [Show full text]
  • ASN.1. Communication Between Heterogeneous Systems – Errata
    ASN.1. Communication between heterogeneous systems – Errata These errata concern the June 5, 2000 electronic version of the book "ASN.1. Communication between heterogeneous systems", by Olivier Dubuisson (© 2000). (freely available at http://www.oss.com/asn1/resources/books‐whitepapers‐pubs/asn1‐ books.html#dubuisson.) N.B.: The first page number refers to the PDF electronic copy and is the number printed on each page, not the number at the bottom of the Acrobat Reader window. The page number in parentheses refers to the paper copy published by Morgan Kaufmann. Page 9 (page 8 for the paper copy): ‐ last line, replace "(the number 0 low‐weighted byte" with "(the number 0 low‐weighted bit". Page 19 (page 19 for the paper copy): ‐ on the paper copy, second bullet, replace "the Physical Layer marks up..." with "the Data Link Layer marks up...". ‐ on the electronic copy, second bullet, replace "it is down to the Physical Layer to mark up..." with "it is down to the Data Link Layer to mark up...". Page 25 (page 25 for the paper copy): second paragraph, replace "that all the data exchange" with "that all the data exchanged". Page 32 (page 32 for the paper copy): last paragraph, replace "The order number has at least 12 digits" with "The order number has always 12 digits". Page 34 (page 34 for the paper copy): first paragraph, replace "it will be computed again since..." with "it will be computed again because...". Page 37 for the electronic copy only: in the definition of Quantity, replace "unites" with "units". Page 104 (page 104 for the paper copy): ‐ in rule <34>, delete ", digits"; ‐ at the end of section 8.3.2, add the following paragraph: Symbols such as "{", "[", "[[", etc, are also lexical tokens of the ASN.1 notation.
    [Show full text]
  • Understanding JSON Schema Release 2020-12
    Understanding JSON Schema Release 2020-12 Michael Droettboom, et al Space Telescope Science Institute Sep 14, 2021 Contents 1 Conventions used in this book3 1.1 Language-specific notes.........................................3 1.2 Draft-specific notes............................................4 1.3 Examples.................................................4 2 What is a schema? 7 3 The basics 11 3.1 Hello, World!............................................... 11 3.2 The type keyword............................................ 12 3.3 Declaring a JSON Schema........................................ 13 3.4 Declaring a unique identifier....................................... 13 4 JSON Schema Reference 15 4.1 Type-specific keywords......................................... 15 4.2 string................................................... 17 4.2.1 Length.............................................. 19 4.2.2 Regular Expressions...................................... 19 4.2.3 Format.............................................. 20 4.3 Regular Expressions........................................... 22 4.3.1 Example............................................. 23 4.4 Numeric types.............................................. 23 4.4.1 integer.............................................. 24 4.4.2 number............................................. 25 4.4.3 Multiples............................................ 26 4.4.4 Range.............................................. 26 4.5 object................................................... 29 4.5.1 Properties...........................................
    [Show full text]
  • Chapter 5 Type Declarations
    Ch.5: Type Declarations Plan Chapter 5 Type Declarations (Version of 27 September 2004) 1. Renaming existing types . 5.2 2. Enumeration types . 5.3 3. Constructed types . 5.5 4. Parameterised/polymorphic types . 5.10 5. Exceptions, revisited . 5.12 6. Application: expression evaluation . 5.13 °c P. Flener/IT Dept/Uppsala Univ. FP 5.1 Ch.5: Type Declarations 5.1. Renaming existing types 5.1. Renaming existing types Example: polynomials, revisited Representation of a polynomial by a list of integers: type poly = int list ² Introduction of an abbreviation for the type int list ² The two names denote the same type ² The object [4,2,8] is of type poly and of type int list - type poly = int list ; type poly = int list - type poly2 = int list ; type poly2 = int list - val p:poly = [1,2] ; val p = [1,2] : poly - val p2:poly2 = [1,2] ; val p2 = [1,2] : poly2 - p = p2 ; val it = true : bool °c P. Flener/IT Dept/Uppsala Univ. FP 5.2 Ch.5: Type Declarations 5.2. Enumeration types 5.2. Enumeration types Declaration of a new type having a finite number of values Example (weekend.sml) datatype months = Jan | Feb | Mar | Apr | May | Jun | Jul | Aug | Sep | Oct | Nov | Dec datatype days = Mon | Tue | Wed | Thu | Fri | Sat | Sun fun weekend Sat = true | weekend Sun = true | weekend d = false - datatype months = Jan | ... | Dec ; datatype months = Jan | ... | Dec - datatype days = Mon | ... | Sun ; datatype days = Mon | ... | Sun - fun weekend ... ; val weekend = fn : days -> bool °c P. Flener/IT Dept/Uppsala Univ. FP 5.3 Ch.5: Type Declarations 5.2.
    [Show full text]
  • Nominal Wyvern: Employing Semantic Separation for Usability Yu Xiang Zhu CMU-CS-19-105 April 2019
    Nominal Wyvern: Employing Semantic Separation for Usability Yu Xiang Zhu CMU-CS-19-105 April 2019 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Thesis Committee: Jonathan Aldrich, Chair Heather Miller Alex Potanin, Victoria University of Wellington, NZ Submitted in partial fulfillment of the requirements for the degree of Master of Science. Copyright c 2019 Yu Xiang Zhu Keywords: Nominality, Wyvern, Dependent Object Types, Subtype Decidability Abstract This thesis presents Nominal Wyvern, a nominal type system that empha- sizes semantic separation for better usability. Nominal Wyvern is based on the dependent object types (DOT) calculus, which provides greater expressiv- ity than traditional object-oriented languages by incorporating concepts from functional languages. Although DOT is generally perceived to be nominal due to its path-dependent types, it is still a mostly structural system and relies on the free construction of types. This can present usability issues in a subtyping- based system where the semantics of a type are as important as its syntactic structure. Nominal Wyvern overcomes this problem by semantically separat- ing structural type/subtype definitions from ad hoc type refinements and type bound declarations. In doing so, Nominal Wyvern is also able to overcome the subtype undecidability problem of DOT by adopting a semantics-based sep- aration between types responsible for recursive subtype definitions and types that represent concrete data. The result is a more intuitive type system that achieves nominality and decidability while maintaining the expressiveness of F-bounded polymorphism that is used in practice. iv Acknowledgments This research would not have been possible without the support from the following in- dividuals.
    [Show full text]
  • Cablelabs® Specifications Cablelabs' DHCP Options Registry CL-SP-CANN-DHCP-Reg-I13-160317
    CableLabs® Specifications CableLabs' DHCP Options Registry CL-SP-CANN-DHCP-Reg-I13-160317 ISSUED Notice This CableLabs specification is the result of a cooperative effort undertaken at the direction of Cable Television Laboratories, Inc. for the benefit of the cable industry and its customers. You may download, copy, distribute, and reference the documents herein only for the purpose of developing products or services in accordance with such documents, and educational use. Except as granted by CableLabs in a separate written license agreement, no license is granted to modify the documents herein (except via the Engineering Change process), or to use, copy, modify or distribute the documents for any other purpose. This document may contain references to other documents not owned or controlled by CableLabs. Use and understanding of this document may require access to such other documents. Designing, manufacturing, distributing, using, selling, or servicing products, or providing services, based on this document may require intellectual property licenses from third parties for technology referenced in this document. To the extent this document contains or refers to documents of third parties, you agree to abide by the terms of any licenses associated with such third-party documents, including open source licenses, if any. Cable Television Laboratories, Inc. 2006-2016 CL-SP-CANN-DHCP-Reg-I13-160317 CableLabs® Specifications DISCLAIMER This document is furnished on an "AS IS" basis and neither CableLabs nor its members provides any representation or warranty, express or implied, regarding the accuracy, completeness, noninfringement, or fitness for a particular purpose of this document, or any document referenced herein. Any use or reliance on the information or opinion in this document is at the risk of the user, and CableLabs and its members shall not be liable for any damage or injury incurred by any person arising out of the completeness, accuracy, or utility of any information or opinion contained in the document.
    [Show full text]
  • Array Databases: Concepts, Standards, Implementations
    Baumann et al. J Big Data (2021) 8:28 https://doi.org/10.1186/s40537-020-00399-2 SURVEY PAPER Open Access Array databases: concepts, standards, implementations Peter Baumann , Dimitar Misev, Vlad Merticariu and Bang Pham Huu* *Correspondence: b. Abstract phamhuu@jacobs-university. Multi-dimensional arrays (also known as raster data or gridded data) play a key role in de Large-Scale Scientifc many, if not all science and engineering domains where they typically represent spatio- Information Systems temporal sensor, image, simulation output, or statistics “datacubes”. As classic database Research Group, Jacobs technology does not support arrays adequately, such data today are maintained University, Bremen, Germany mostly in silo solutions, with architectures that tend to erode and not keep up with the increasing requirements on performance and service quality. Array Database systems attempt to close this gap by providing declarative query support for fexible ad-hoc analytics on large n-D arrays, similar to what SQL ofers on set-oriented data, XQuery on hierarchical data, and SPARQL and CIPHER on graph data. Today, Petascale Array Database installations exist, employing massive parallelism and distributed processing. Hence, questions arise about technology and standards available, usability, and overall maturity. Several papers have compared models and formalisms, and benchmarks have been undertaken as well, typically comparing two systems against each other. While each of these represent valuable research to the best of our knowledge there is no comprehensive survey combining model, query language, architecture, and practical usability, and performance aspects. The size of this comparison diferentiates our study as well with 19 systems compared, four benchmarked to an extent and depth clearly exceeding previous papers in the feld; for example, subsetting tests were designed in a way that systems cannot be tuned to specifcally these queries.
    [Show full text]
  • Project Overview 1 Introduction 2 a Quick Introduction to SOOL
    CMSC 22600 Compilers for Computer Languages Handout 1 Autumn 2016 October 6, 2016 Project Overview 1 Introduction The project for the course is to implement a small object-oriented programming language, called SOOL. The project will consist of four parts: 1. the parser and scanner, which coverts a textual representation of the program into a parse tree representation. 2. the type checker, which checks the parse tree for type correctness and produces a typed ab- stract syntax tree (AST) 3. the normalizer, which converts the typed AST representation into a static single-assignment (SSA) representation. 4. the code generator, which takes the SSA representation and generates LLVM assembly code. Each part of the project builds upon the previous parts, but we will provide reference solutions for previous parts. You will implement the project in the Standard ML programming language and submission of the project milestones will be managed using Phoenixforge. Important note: You are expected to submit code that compiles and that is well documented. Points for project code are assigned 30% for coding style (documentation, choice of variable names, and program structure), and 70% for correctness. Code that does not compile will not receive any points for correctness. 2 A quick introduction to SOOL SOOL is a statically-typed object-oriented language. It supports single inheritance with nominal subtyping and interfaces with structural subtyping. The SOOL version of the classic Hello World program is class main () { meth run () -> void { system.print ("hello world\n"); } } Here we are using the predefined system object to print the message. Every SOOL program has a main class that must have a run function.
    [Show full text]
  • Representation of Date and Time Data Standard
    REPRESENTATION OF DATE AND TIME DATA STANDARD Standard No.: EX000013.1 January 6, 2006 This standard has been produced through the Environmental Data Standards Council (EDSC). Representation of Date and Time Data Standard Std No.: EX000013.1 Foreword The Environmental Data Standards Council (EDSC) identifies, prioritizes and pursues the creation of data standards for those areas where information exchange standards will provide the most value in achieving environmental results. The Council involves Tribes and Tribal Nations, state and federal agencies in the development of the standards and then provides the draft materials for general review. Business groups, non-governmental organizations, and other interested parties may then provide input and comment for Council consideration and standard finalization. Standards are available at http://www.epa.gov/datastandards 1.0 INTRODUCTION This is a format standard which indicates how one displays a particular day within a Gregorian calendar month and specifies an instance of time in the day. Time is expressed in Coordinated Universal Time (UTC). UTC is the official time scale, maintained by the Bureau International des Poids et Mesures (BIPM), and the International Earth Rotation Service (IERS). Examples of the formats follow: a. Date only format When the need is for an expression only of a calendar date, then the complete representation shall be a single numeric data element comprising eight digits, where [YYYY] represents a calendar year, [MM] the ordinal number of a calendar month within the calendar year, and [DD] the ordinal number of a day within the calendar month. Extended format: YYYY-MM-DD EXAMPLE 1985-04-12 b.
    [Show full text]
  • Flask-JSON Documentation Release 0.3.4
    Flask-JSON Documentation Release 0.3.4 Sergey Kozlov Aug 23, 2019 Contents 1 Installation 3 2 Initialization 5 3 Basic usage 7 4 Examples 9 5 Creating JSON responses 11 5.1 Jsonify HTTP errors........................................... 13 6 Encoding values 15 6.1 Iterables................................................. 15 6.2 Time values................................................ 15 6.3 Translation strings............................................ 16 6.4 Custom types............................................... 16 6.5 Encoding order.............................................. 17 7 Errors handing 19 8 JSONP support 21 9 Testing 23 10 Configuration 25 11 API 29 11.1 Low-Level API.............................................. 34 12 Flask-JSON Changelog 37 12.1 0.3.4................................................... 37 12.2 0.3.3................................................... 37 12.3 0.3.2................................................... 37 12.4 0.3.1................................................... 37 12.5 0.3.0................................................... 37 12.6 0.2.0................................................... 38 12.7 0.1.................................................... 38 12.8 0.0.1................................................... 38 i Index 39 ii Flask-JSON Documentation, Release 0.3.4 Flask-JSON is a simple extension that adds better JSON support to Flask application. It helps to handle JSON-based requests and provides the following features: • json_response() and @as_json to generate JSON responses.
    [Show full text]
  • An Introduction to Lean
    An Introduction to Lean Jeremy Avigad Leonardo de Moura Gabriel Ebner and Sebastian Ullrich Version 1fc176a, updated at 2017-01-09 14:16:26 -0500 2 Contents Contents 3 1 Overview 5 1.1 Perspectives on Lean ............................... 5 1.2 Where To Go From Here ............................. 12 2 Defining Objects in Lean 13 2.1 Some Basic Types ................................ 14 2.2 Defining Functions ................................ 17 2.3 Defining New Types ............................... 20 2.4 Records and Structures ............................. 22 2.5 Nonconstructive Definitions ........................... 25 3 Programming in Lean 27 3.1 Evaluating Expressions .............................. 28 3.2 Recursive Definitions ............................... 30 3.3 Inhabited Types, Subtypes, and Option Types . 32 3.4 Monads ...................................... 34 3.5 Input and Output ................................ 35 3.6 An Example: Abstract Syntax ......................... 36 4 Theorem Proving in Lean 38 4.1 Assertions in Dependent Type Theory ..................... 38 4.2 Propositions as Types .............................. 39 4.3 Induction and Calculation ............................ 42 4.4 Axioms ...................................... 45 5 Using Automation in Lean 46 6 Metaprogramming in Lean 47 3 CONTENTS 4 Bibliography 48 1 Overview This introduction offers a tour of Lean and its features, with a number of examples foryou to play around with and explore. If you are reading this in our online tutorial system, you can run examples like the one below by clicking the button that says “try it yourself.” #check "hello world!" The response from Lean appears in the small window underneath the editor text, and also in popup windows that you can read when you hover over the indicators in the left margin. Alternatively, if you have installed Lean and have it running in a stand-alone editor, you can copy and paste examples and try them there.
    [Show full text]
  • Formats and Protocols for Continuous Data CD-1.1
    IDC Software documentation Formats and Protocols for Continuous Data CD-1.1 Document Version: 0.3 Document Edition: English Document Status: Final Document ID: IDC 3.4.3 Document Date: 18 December 2002 IDC Software documentation Formats and Protocols for Continuous Data CD-1.1 Version: 0.3 Notice This document was published December 2002 as Revision 0.3, using layout templates established by the IPT Group of CERN and IDC Corporate Style guidelines. This document is a re-casting of Revision 0.2published in December 2001 as part of the International Data Centre (IDC) Documentation. It was first published in July 2000 and was repub- lished electronically as Revision 0.1 in September 2001 and as Revision 0.2 in December 2001 to include minor changes (see the following Change Page for Revision 0.2). IDC documents that have been changed substantially are indicated by a whole revision number (for example, Revision 1). Trademarks IEEE is a registered trademark of the Institute of Electrical and Electronics Engineers, Inc. Motorola is a registered trademark of Motorola Inc. SAIC is a trademark of Science Applications International Corporation. Sun is a registered trademark of Sun Microsystems. UNIX is a registered trademark of UNIX System Labs, Inc. This document has been prepared using the Software Documentation Layout Templates that have been prepared by the IPT Group (Information, Process and Technology), IT Division, CERN (The European Laboratory for Particle Physics). For more information, go to http://framemaker.cern.ch/. page ii Final Abstract Version: 0.3 Abstract This document describes the formats and protocols of Continuous Data (CD-1.1), a standard to be used for transmitting continuous, time series data from stations of the International Monitoring System (IMS) to the International Data Centre (IDC) and for transmitting these data from the IDC to National Data Centers (NDCs).
    [Show full text]