OASIS SDD TC Version Proposal Draft 2 after Jan. 2007 F2F Brent A. Miller STSM, IBM Corp.

Slides:



Advertisements
Similar presentations
PHP I.
Advertisements

Huffman code and ID3 Prof. Sin-Min Lee Department of Computer Science.
Data Representation COE 202 Digital Logic Design Dr. Aiman El-Maleh
The Binary Numbering Systems
Introduction to C Programming
1.2 Row Reduction and Echelon Forms
Linear Equations in Linear Algebra
4/5/05Tucker, Sec Applied Combinatorics, 4rth Ed. Alan Tucker Section 5.4 Distributions Prepared by Jo Ellis-Monaghan.
Hash Tables1 Part E Hash Tables  
Combinations We should use permutation where order matters
Hash Tables1 Part E Hash Tables  
Number Systems Lecture 02.
Fundamentals of Python: From First Programs Through Data Structures
Structured COBOL Programming, Stern & Stern, 9th Edition
Computer Science 1000 Spreadsheets II Permission to redistribute these slides is strictly prohibited without permission.
Fundamentals of Python: First Programs
Lecture 6 of Advanced Databases XML Schema, Querying & Transformation Instructor: Mr.Ahmed Al Astal.
Number Systems Spring Semester 2013Programming and Data Structure1.
CL1 Proposal Redefine “install”. Add update artifact. Remove inconsistencies introduced by “baseUninstall” package type.
Intro and Review Welcome to Java. Introduction Java application programming Use tools from the JDK to compile and run programs. Videos at
SQL: Data Manipulation Presented by Mary Choi For CS157B Dr. Sin Min Lee.
New Perspectives on XML, 2nd Edition
14- 1 Chapter 14.  To familiarize you with ◦ How files may be sorted ◦ How to process file during SORT procedure  Before it is sorted  After it is.
© Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. Chapter 2 Chapter 2 - Introduction to C Programming.
Sequential Files Chapter 13. Master Files Set of files used to store companies data in areas like payroll, inventory Set of files used to store companies.
Lecture 2: Introduction to C Programming. OBJECTIVES In this lecture you will learn:  To use simple input and output statements.  The fundamental data.
Chapter 3: Formatted Input/Output Copyright © 2008 W. W. Norton & Company. All rights reserved. 1 Chapter 3 Formatted Input/Output.
Lecture 2: Introduction to C Programming. OBJECTIVES In this lecture you will learn:  To use simple input and output statements.  The fundamental data.
1 Representation of Data within the Computer Oct., 1999(Revised 2001 Oct)
XML 2nd EDITION Tutorial 4 Working With Schemas. XP Schemas A schema is an XML document that defines the content and structure of one or more XML documents.
1 Tutorial 14 Validating Documents with Schemas Exploring the XML Schema Vocabulary.
Tutorial 13 Validating Documents with Schemas
OASIS SDD TC Version Proposal Draft 2 after Jan F2F Brent A. Miller STSM, IBM Corp.
Data Representation, Number Systems and Base Conversions
Structured Programming
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Python Primer 1: Types and Operators © 2013 Goodrich, Tamassia, Goldwasser1Python Primer.
XSD: XML Schema Language Kanda Runapongsa Dept. of Computer Engineering Khon Kaen University.
Sum-of-Products (SOP)
#D8 Specification v1.0 Erratum #1 SDD 1.1 Proposal.
OASIS SDD TC Version Proposal Brent A. Miller STSM, IBM Corp.
“Custom” Checks/Constraints/Actions A proposal for the OASIS SDD TC Rich Aquino, Macrovision Julia McCarthy, IBM March 1, 2007.
Characters CS240.
OASIS SDD TC Version Proposal Draft 3 after Jan F2F Brent A. Miller STSM, IBM Corp.
 A macro represents a commonly used group of statements in the source programming language.  The macro processor replaces each macro instruction with.
ECE DIGITAL LOGIC LECTURE 4: BINARY CODES Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 01/26/2016.
Huffman code and Lossless Decomposition Prof. Sin-Min Lee Department of Computer Science.
Skill Area 311 Part B. Lecture Overview Assembly Code Assembler Format of Assembly Code Advantages Assembly Code Disadvantages Assembly Code High-Level.
1 1.2 Linear Equations in Linear Algebra Row Reduction and Echelon Forms © 2016 Pearson Education, Ltd.
Chapter 3: Formatted Input/Output 1 Chapter 3 Formatted Input/Output.
Digital logic COMP214  Lecture 2 Dr. Sarah M.Eljack Chapter 1 1.
Concepts of Database Management, Fifth Edition Chapter 3: The Relational Model 2: SQL.
 2004 SDU Uniquely Decodable Code 1.Related Notions 2.Determining UDC 3.Kraft Inequality.
CHAPTER 5: Representing Numerical Data
Chapter 10 SQL DDL.
NUMBER SYSTEMS.
Lec 3: Data Representation
Structured Programming
Chapter 3 Data Representation
The Selection Structure
Perturbation method, lexicographic method
Eugenia Fernandez IUPUI
© 2013 Goodrich, Tamassia, Goldwasser
SDD 1.1 General Direction Proposal
Data Representation Data Types Complements Fixed Point Representation
Chapter 14 Sorting and Merging.
Chapter 6 Control Statements: Part 2
Database Systems: Design, Implementation, and Management Tenth Edition
Working with Formulas and Functions
Decision Making Using the IF and EVALUATE Statements
Presentation transcript:

OASIS SDD TC Version Proposal Draft 2 after Jan F2F Brent A. Miller STSM, IBM Corp.

Current State versionStringType: –We specify this –This is incorporated in the specification –Used in (PD).packageIdentity.IdentityType, (DD).resultingResource.backwardCompatibility, ( DD).resource, (DD).resultingResource, (DD).root[x]U.identity, (DD).ResourceConstraintGroup.versionConstraint –Blue = ones that we control and specify as VRML –We specify a version comparison algorithm

Problem Statement (1) We control the “make it up” version specifications –Descriptor identities We do not control the “look it up” version specifications –Resource –resultingResource –Version constraints  Examples of version indication methods on next slide Hence, we cannot constrain version to VRML format in all cases

Version Indication Examples In just one hosting environment (OS), in just several popular OSes, we find “version” information consisting of some combination of: –Generation –Edition –Ver –KernelVer –Maint –BuildNum –CodeName –ProdNum My computer’s version identification information is “Version 5.1 (Build 2600.xpsp_sp2_gdr :Service Pack 2) ” –Windows version numbers ( “5.1” ) are little used –“XP” serves as a major version number, but doesn’t appear as a classic one –Build number is a key identifier, but does not update the version number –Etc. (and similarly in other OSes/hosting environments/applications…) Fixes (maintenance level, patches applies) are key version indicators in many OSes

Proposal 1.Accommodate (“import”) all version specifications genericVersionString This enables a single, consolidated version representation for: –Capturing versions returned this way from environments, to enable mapping to sequence defined in #2 below –Containing version information that can’t be mapped to the sequence 2.Define sequence in schema to allow genericVersionString to be mapped to version parts for version comparison 3.Specify mapping to this sequence in profiles –Manufacturer-to-SDD neutral vocabulary –Current “VRML” definition needs to be expanded to include non-numeric characters; probably split into separate elements –Add a string for versions that can’t be structured?? 4.Update version comparison algorithm to handle non-numeric values  Result is:  Normalization of version information  Accommodation of “all” versions with structuring for comparison  Consistent with CIM/SMASH (

Schema [add]: [current]: [replace with]: type=“string" minoccurs=“1”/> type=“string" minoccurs=“0”/> type=“string" minoccurs=“0”/> Notes: 1.Assume 4 elements (a la CIM/SMASH/VRML) 2.Should version part strings have restrictions? 3.Do we need a choice for VersionStringType to allow a genericVersionString as the other choice?

Version comparison algorithm –Standard versions are of the form type VersionStringType, with each part being numeric. Non-standard versions may include alphabetic characters are mapped to the individual parts of VersionStringType according to mappings specified in profiles. Equality is determined by testing the equality of each part. Least significant parts may be omitted if they are “0”, e.g., 1.1 is equivalent to ; 4a.1.2 is equivalent to 4a –To compare versions, each version part is evaluated from left to right using either alphanumeric or alphabetic comparison (alphabetic comparison which MUST use a non-Unicode, locale-insensitive, case- insensitive collating sequence). For version parts that consist of a number followed by a letter, the numeric part is compared first: a version part “4a” is greater than a version part “4”; a version part of “40” is greater than “4a”. Comparison stops when the version parts are different (in this case, the greater version is the one with the greater version part), when no corresponding version part exists in one of the versions being compared (in this case, the greater version is the one with remaining non-zero version part(s)) or when the versions are equal.

Example (1) Windows “Version 5.1 (Build 2600.xpsp_sp2_gdr :Service Pack 2)” 1.Accommodate (“import”) all version specifications genericVersionString= “Version 5.1 (Build 2600.xpsp_sp2_gdr :Service Pack 2)” 2.Specify mapping to structure in profiles –major=“5” –minor=“1” –discriminant=“2600” –additionalDiscriminant=“”

Example (2) RHEL “RHEL AS 3 Update 8 k xenU” 1.Accommodate (“import”) all version specifications genericVersionString= “RHEL AS 3 Update 8 k xenU” (note: K is kernel version, which is distinct from the Linux release) 2.Specify mapping to structure in profiles –major=“AS 3” –minor=“” –discriminant=“” –additionalDiscriminant=“”