Misplaced Pages

#243756

81-525: Open XML Paper Specification (also referred to as OpenXPS ) is an open specification for a page description language and a fixed-document format. Microsoft developed it as the XML Paper Specification (XPS). In June 2009, Ecma International adopted it as international standard ECMA-388 . It is an XML -based (more precisely XAML -based) specification, based on a new print path (print processing data representation and data flow) and

162-480: A color-managed vector document format that supports device independence and resolution independence . In Windows 8 .xps was replaced with the ECMA standard .oxps format which is not natively supported in older Windows versions. OpenXPS was introduced by Microsoft as an alternative to Portable Document Format (PDF). However, PDF remained the standard choice, and support for and user familiarity with XPS files

243-742: A royalty-free basis. Many definitions of the term standard permit patent holders to impose " reasonable and non-discriminatory licensing" royalty fees and other licensing terms on implementers or users of the standard. For example, the rules for standards published by the major internationally recognized standards bodies such as the Internet Engineering Task Force (IETF), International Organization for Standardization (ISO), International Electrotechnical Commission (IEC), and ITU-T permit their standards to contain specifications whose implementation will require payment of patent licensing fees. Among these organizations, only

324-407: A static model, the data is analyzed and a model is constructed, then this model is stored with the compressed data. This approach is simple and modular, but has the disadvantage that the model itself can be expensive to store, and also that it forces using a single model for all data being compressed, and so performs poorly on files that contain heterogeneous data. Adaptive models dynamically update

405-497: A "free software and open standards law." The decree includes the requirement that the Venezuelan public sector must use free software based on open standards, and includes a definition of open standard: Lossless data compression Lossless compression is a class of data compression that allows the original data to be perfectly reconstructed from the compressed data with no loss of information . Lossless compression

486-681: A common patent policy under the banner of the WSC . However, the ITU-T definition should not necessarily be considered also applicable in ITU-R, ISO and IEC contexts, since the Common Patent Policy does not make any reference to "open standards" but rather only to "standards." In section 7 of its RFC 2026, the IETF classifies specifications that have been developed in a manner similar to that of

567-768: A component within lossy data compression technologies (e.g. lossless mid/side joint stereo preprocessing by MP3 encoders and other lossy audio encoders). Lossless compression is used in cases where it is important that the original and the decompressed data be identical, or where deviations from the original data would be unfavourable. Common examples are executable programs, text documents, and source code. Some image file formats, like PNG or GIF , use only lossless compression, while others like TIFF and MNG may use either lossless or lossy methods. Lossless audio formats are most often used for archiving or production purposes, while smaller lossy audio files are typically used on portable players and in other cases where storage space

648-704: A consensus basis. The definitions of the term open standard used by academics, the European Union , and some of its member governments or parliaments such as Denmark , France , and Spain preclude open standards requiring fees for use, as do the New Zealand , South African and the Venezuelan governments. On the standard organisation side, the World Wide Web Consortium (W3C) ensures that its specifications can be implemented on

729-402: A data format which is made public, is thoroughly documented and neutral with regard to the technological tools needed to peruse the same data. The E-Government Interoperability Framework (e-GIF) defines open standard as royalty-free according to the following text: While a universally agreed definition of "open standards" is unlikely to be resolved in the near future, the e-GIF accepts that

810-606: A definition of "open standards" needs to recognise a continuum that ranges from closed to open, and encompasses varying degrees of "openness." To guide readers in this respect, the e-GIF endorses "open standards" that exhibit the following properties: The e-GIF performs the same function in e-government as the Road Code does on the highways. Driving would be excessively costly, inefficient, and ineffective if road rules had to be agreed each time one vehicle encountered another. The Portuguese Open Standards Law, adopted in 2011, demands

891-535: A definition of open standards, which also is used in pan-European software development projects. It states: The French Parliament approved a definition of "open standard" in its "Law for Confidence in the Digital Economy." The definition is (Article 4): A clear royalty-free stance and far reaching requirements case is the one for India's Government 4.1 Mandatory Characteristics An Identified Standard will qualify as an "Open Standard", if it meets

SECTION 10

#1732800770244

972-605: A full, irrevocable and irreversible way to the Portuguese State; e) There are no restrictions to its implementation. A Law passed by the Spanish Parliament requires that all electronic services provided by the Spanish public administration must be based on open standards. It defines an open standard as royalty-free, according to the following definition (ANEXO Definiciones k): An open standard fulfills

1053-450: A higher level with lower resolution continues with the sums. This is called discrete wavelet transform . JPEG2000 additionally uses data points from other pairs and multiplication factors to mix them into the difference. These factors must be integers, so that the result is an integer under all circumstances. So the values are increased, increasing file size, but the distribution of values could be more peaked. The adaptive encoding uses

1134-447: A much higher probability than large values. This is often also applied to sound files, and can compress files that contain mostly low frequencies and low volumes. For images, this step can be repeated by taking the difference to the top pixel, and then in videos, the difference to the pixel in the next frame can be taken. A hierarchical version of this technique takes neighboring pairs of data points, stores their difference and sum, and on

1215-435: A number of better-known compression benchmarks. Some benchmarks cover only the data compression ratio , so winners in these benchmarks may be unsuitable for everyday use due to the slow speed of the top performers. Another drawback of some benchmarks is that their data files are known, so some program writers may optimize their programs for best performance on a particular data set. The winners on these benchmarks often come from

1296-538: A particular type of file: for example, lossless audio compression programs do not work well on text files, and vice versa. In particular, files of random data cannot be consistently compressed by any conceivable lossless data compression algorithm; indeed, this result is used to define the concept of randomness in Kolmogorov complexity . It is provably impossible to create an algorithm that can losslessly compress any data. While there have been many claims through

1377-465: A random access database of objects that may be created from PostScript or generated directly from applications, whereas XPS is based on XML. Both formats are compressed , albeit using different methods. The filter pipeline architecture of XPS is also similar to the one used in printers supporting the PostScript page description language. PDF includes dynamic capabilities purposely not supported by

1458-598: A set of principles which have contributed to the exponential growth of the Internet and related technologies. The "OpenStand Principles" define open standards and establish the building blocks for innovation. Standards developed using the OpenStand principles are developed through an open, participatory process, support interoperability, foster global competition, are voluntarily adopted on a global level and serve as building blocks for products and services targeted to meet

1539-464: A single additional bit is required to tell the decoder that the normal coding has been turned off for the entire input; however, most encoding algorithms use at least one full byte (and typically more than one) for this purpose. For example, deflate compressed files never need to grow by more than 5 bytes per 65,535 bytes of input. In fact, if we consider files of length N, if all files were equally probable, then for any lossless compression that reduces

1620-409: A specific type of input data in mind or with specific assumptions about what kinds of redundancy the uncompressed data are likely to contain. Some of the most common lossless compression algorithms are listed below. See list of lossless video codecs Cryptosystems often compress data (the "plaintext") before encryption for added security. When properly implemented, compression greatly increases

1701-410: A very small program. However, even though it cannot be determined whether a particular file is incompressible, a simple theorem about incompressible strings shows that over 99% of files of any given length cannot be compressed by more than one byte (including the size of the decompressor). Abstractly, a compression algorithm can be viewed as a function on sequences (normally of octets). Compression

SECTION 20

#1732800770244

1782-456: A wide range of meanings associated with their usage. There are a number of definitions of open standards which emphasize different aspects of openness, including the openness of the resulting specification, the openness of the drafting process, and the ownership of rights in the standard. The term "standard" is sometimes restricted to technologies approved by formalized committees that are open to participation by all interested parties and operate on

1863-714: Is determined by the market. The ITU-T is a standards development organization (SDO) that is one of the three sectors of the International Telecommunication Union (a specialized agency of the United Nations ). The ITU-T has a Telecommunication Standardization Bureau director's Ad Hoc group on IPR that produced the following definition in March 2005, which the ITU-T as a whole has endorsed for its purposes since November 2005: The ITU-T , ITU-R , ISO , and IEC have harmonized on

1944-557: Is here meant in the sense of fulfilling the following requirements: The Network Centric Operations Industry Consortium (NCOIC) defines open standard as the following: Specifications for hardware and/or software that are publicly available implying that multiple vendors can compete directly based on the features and performance of their products. It also implies that the existing open system can be removed and replaced with that of another vendor with minimal effort and without major interruption. The Danish government has attempted to make

2025-478: Is limited or exact replication of the audio is unnecessary. Most lossless compression programs do two things in sequence: the first step generates a statistical model for the input data, and the second step uses this model to map input data to bit sequences in such a way that "probable" (i.e. frequently encountered) data will produce shorter output than "improbable" data. The primary encoding algorithms used to produce bit sequences are Huffman coding (also used by

2106-407: Is limited. It has been described as neglected technology, which may cause difficulties to recipients of documents in a format they are not familiar with. The XPS document format consists of structured XML markup that defines the layout of a document and the visual appearance of each page, along with rendering rules for distributing, archiving, rendering, processing and printing the documents. Notably,

2187-456: Is made by heuristics ; for example, a compression application may consider files whose names end in ".zip", ".arj" or ".lha" uncompressible without any more sophisticated detection. A common way of handling this situation is quoting input, or uncompressible parts of the input in the output, minimizing the compression overhead. For example, the zip data format specifies the 'compression method' of 'Stored' for input files that have been copied into

2268-436: Is not possible to produce a lossless algorithm that reduces the size of every possible input sequence. Real compression algorithm designers accept that streams of high information entropy cannot be compressed, and accordingly, include facilities for detecting and handling this condition. An obvious way of detection is applying a raw compression algorithm and testing if its output is smaller than its input. Sometimes, detection

2349-562: Is possible because most real-world data exhibits statistical redundancy . By contrast, lossy compression permits reconstruction only of an approximation of the original data , though usually with greatly improved compression rates (and therefore reduced media sizes). By operation of the pigeonhole principle , no lossless compression algorithm can shrink the size of all possible data: Some data will get longer by at least one symbol or bit. Compression algorithms are usually effective for human- and machine-readable documents and cannot shrink

2430-467: Is sometimes beneficial to compress only the differences between two versions of a file (or, in video compression , of successive images within a sequence). This is called delta encoding (from the Greek letter Δ , which in mathematics, denotes a difference), but the term is typically only used if both versions are meaningful outside compression and decompression. For example, while the process of compressing

2511-436: Is successful if the resulting sequence is shorter than the original sequence (and the instructions for the decompression map). For a compression algorithm to be lossless , the compression map must form an injection from "plain" to "compressed" bit sequences. The pigeonhole principle prohibits a bijection between the collection of sequences of length N and any subset of the collection of sequences of length N −1. Therefore, it

Open XML Paper Specification - Misplaced Pages Continue

2592-506: Is then published in the form of RFC 6852 in January 2013. The European Union defined the term for use within its European Interoperability Framework for Pan-European eGovernment Services, Version 1.0 although it does not claim to be a universal definition for all European Union use and documentation. To reach interoperability in the context of pan-European eGovernment services, guidance needs to focus on open standards. The word "open"

2673-656: The Certified for Windows level of Windows Logo conformance certification were required to have XPS drivers for printing since 1 June 2007. Microsoft released XPS under a royalty-free patent license called the Community Promise for XPS , allowing users to create implementations of the specification that read, write and render XPS files as long as they included a notice within the source that technologies implemented may be encumbered by patents held by Microsoft. Microsoft also required that organizations "engaged in

2754-759: The GSM phones (adopted as a government standard), Open Group which promotes UNIX , and the Internet Engineering Task Force (IETF) which created the first standards of SMTP and TCP/IP. Buyers tend to prefer open standards which they believe offer them cheaper products and more choice for access due to network effects and increased competition between vendors. Open standards which specify formats are sometimes referred to as open formats . Many specifications that are sometimes referred to as standards are proprietary, and only available (if they can be obtained at all) under restrictive contract terms from

2835-477: The LZ77 -based deflate algorithm with a selection of domain-specific prediction filters. However, the patents on LZW expired on June 20, 2003. Many of the lossless compression techniques used for text also work reasonably well for indexed images , but there are other techniques that do not work for typical text that are useful for some images (particularly simple bitmaps), and other techniques that take advantage of

2916-602: The United States and other countries and their legal usage requires licensing by the patent holder. Because of patents on certain kinds of LZW compression, and in particular licensing practices by patent holder Unisys that many developers considered abusive, some open source proponents encouraged people to avoid using the Graphics Interchange Format (GIF) for compressing still image files in favor of Portable Network Graphics (PNG), which combines

2997-500: The Windows Color System color management technology for color conversion precision across devices and higher dynamic range . It includes a software raster image processor (RIP) (downloadable separately). The print subsystem supports named colors , simplifying color definition for images transmitted to printers supporting those colors. XPS supports HD Photo images natively for raster images. The XPS format used in

3078-405: The deflate algorithm ) and arithmetic coding . Arithmetic coding achieves compression rates close to the best possible for a particular statistical model, which is given by the information entropy , whereas Huffman compression is simpler and faster but produces poor results for models that deal with symbol probabilities close to 1. There are two primary ways of constructing statistical models: in

3159-448: The unicity distance by removing patterns that might facilitate cryptanalysis . However, many ordinary lossless compression algorithms produce headers, wrappers, tables, or other predictable output that might instead make cryptanalysis easier. Thus, cryptosystems must utilize compression algorithms whose output does not contain these predictable patterns. Genetics compression algorithms (not to be confused with genetic algorithms ) are

3240-611: The "Simplified BSD License" as stated in the IETF Trust Legal Provisions and Copyright FAQ based on RFC 5377. In August 2012, the IETF combined with the W3C and IEEE to launch OpenStand and to publish The Modern Paradigm for Standards. This captures "the effective and efficient standardization processes that have made the Internet and Web the premiere platforms for innovation and borderless commerce". The declaration

3321-590: The IE-hosted XPS Viewer, as well as XPS Document Writer. Since then, Microsoft released the XPS Essentials Pack for Windows XP, Server 2003 , and Vista, which includes the standalone viewer, an IFilter plug-in that helps Windows Desktop Search index the contents of XPS files, and another plug-in for Windows Explorer to help generate thumbnails for XPS files. Installing this pack enables operating systems prior to Windows Vista to use

Open XML Paper Specification - Misplaced Pages Continue

3402-495: The IETF and ITU-T explicitly refer to their standards as "open standards", while the others refer only to producing "standards". The IETF and ITU-T use definitions of "open standard" that allow "reasonable and non-discriminatory" patent licensing fee requirements. There are those in the open-source software community who hold that an "open standard" is only open if it can be freely adopted, implemented and extended. While open standards or architectures are considered non-proprietary in

3483-518: The IETF itself as being "open standards," and lists the standards produced by ANSI , ISO , IEEE , and ITU-T as examples. As the IETF standardization processes and IPR policies have the characteristics listed above by ITU-T, the IETF standards fulfill the ITU-T definition of "open standards." However, the IETF has not adopted a specific definition of "open standard"; both RFC 2026 and the IETF's mission statement (RFC 3935) talks about "open process," but RFC 2026 does not define "open standard" except for

3564-860: The Windows development teams on the specification and reference architecture for the new format. Microsoft submitted the XPS specification to Ecma International . In June 2007 Ecma International Technical Committee 46 (TC46) was set up to develop a standard based on the Open XML Paper Specification (OpenXPS). At the 97th General Assembly held in Budapest , June 16, 2009, Ecma International approved Open XML Paper Specification (OpenXPS) as an Ecma standard (ECMA-388). TC46's members included: XPS files can be infected with malware. Open specification The terms open and standard have

3645-409: The XPS format. There are many resources for converting from XPS to PDF and some for converting from PDF to XPS. A method often suggested is to open an XPS file in a program with printing capability, and then "print" to a virtual PDF printer such as Microsoft Print to PDF, with a similar procedure to convert from PDF to XPS. Windows Vista and later supports both creating and viewing XPS. In addition,

3726-484: The XPS print spooler instead of the older GDI -based spooler. The XPS print spooler can produce better quality prints for printers that directly consume the XPS format. XPS had the support of printing companies such as Konica Minolta , Sharp , Canon , Epson , Hewlett-Packard , and Xerox and software and hardware companies such as CSR (formerly Zoran) , and Global Graphics . Native XPS printers were introduced by Canon, Konica Minolta, Toshiba , and Xerox. Devices at

3807-453: The algorithm, and for any lossless data compression algorithm that makes at least one file smaller, there will be at least one file that it makes larger. This is easily proven with elementary mathematics using a counting argument called the pigeonhole principle , as follows: Most practical compression algorithms provide an "escape" facility that can turn off the normal coding for files that would become longer by being encoded. In theory, only

3888-431: The archive verbatim. Mark Nelson, in response to claims of "magic" compression algorithms appearing in comp.compression, has constructed a 415,241 byte binary file of highly entropic content, and issued a public challenge of $ 100 to anyone to write a program that, together with its input, would be smaller than his provided binary data yet be able to reconstitute it without error. A similar challenge, with $ 5,000 as reward,

3969-650: The business of developing (i) scanners that output XPS Documents; (ii) printers that consume XPS Documents to produce hard-copy output; or (iii) print driver or raster image software products or components thereof that convert XPS Documents for the purpose of producing hard-copy output, [...] will not sue Microsoft or any of its licensees under the XML Paper Specification or customers for infringement of any XML Paper Specification Derived Patents (as defined below) on account of any manufacture, use, sale, offer for sale, importation or other disposition or promotion of any XML Paper Specification implementations." The specification itself

4050-580: The class of context-mixing compression software. Matt Mahoney , in his February 2010 edition of the free booklet Data Compression Explained , additionally lists the following: The Compression Ratings website published a chart summary of the "frontier" in compression ratio and time. The Compression Analysis Tool is a Windows application that enables end users to benchmark the performance characteristics of streaming implementations of LZF4, Deflate, ZLIB, GZIP, BZIP2 and LZMA using their own data. It produces measurements and charts with which users can compare

4131-429: The compression speed, decompression speed and compression ratio of the different compression methods and to examine how the compression level, buffer size and flushing operations affect the results. Lossless data compression algorithms cannot guarantee compression for all input data sets. In other words, for any lossless data compression algorithm, there will be an input data set that does not get smaller when processed by

SECTION 50

#1732800770244

4212-649: The degree of openness will be taken into account when selecting an appropriate standard: The UK government 's definition of open standards applies to software interoperability, data and document formats. The criteria for open standards are published in the "Open Standards Principles" policy paper and are as follows. The Cabinet Office in the UK recommends that government departments specify requirements using open standards when undertaking procurement exercises in order to promote interoperability and re-use, and avoid technological lock-in. The Venezuelan Government approved

4293-504: The document writer defaults to the .oxps format. Microsoft provides two free converters. XpsConverter converts documents between .xps and .oxps format, while OxpsConverter converts documents from .oxps to .xps format. XPS specifies a set of document layout functionality for paged, printable documents. It also has support for features such as color gradients , transparencies , CMYK color spaces , printer calibration , multiple-ink systems and print schemas . XPS supports

4374-455: The error in the above-mentioned lossless audio compression scheme could be described as delta encoding from the approximated sound wave to the original sound wave, the approximated version of the sound wave is not meaningful in any other context. No lossless compression algorithm can efficiently compress all possible data (see § Limitations for more on this) . For this reason, many different algorithms exist that are designed either with

4455-435: The fact that DNA sequences have characteristic properties, such as inverted repeats. The most successful compressors are XM and GeCo. For eukaryotes XM is slightly better in compression ratio, though for sequences larger than 100 MB its computational requirements are impractical. Self-extracting executables contain a compressed application and a decompressor. When executed, the decompressor transparently decompresses and runs

4536-506: The following conditions: The South African Government approved a definition in the "Minimum Interoperability Operating Standards Handbook" (MIOS). For the purposes of the MIOS, a standard shall be considered open if it meets all of these criteria. There are standards which we are obliged to adopt for pragmatic reasons which do not necessarily fully conform to being open in all respects. In such cases, where an open standard does not yet exist,

4617-581: The following criteria: Italy has a general rule for the entire public sector dealing with Open Standards, although concentrating on data formats, in Art. 68 of the Code of the Digital Administration ( Codice dell'Amministrazione Digitale ) [applications must] allow representation of data under different formats, at least one being an open data format. [...] [it is defined] an open data format,

4698-416: The form for which they were designed to compress. Many of the lossless compression techniques used for text also work reasonably well for indexed images . These techniques take advantage of the specific characteristics of images such as the common phenomenon of contiguous 2-D areas of similar tones. Every pixel but the first is replaced by the difference to its left neighbor. This leads to small values having

4779-679: The latest generation of lossless algorithms that compress data (typically sequences of nucleotides) using both conventional compression algorithms and specific algorithms adapted to genetic data. In 2012, a team of scientists from Johns Hopkins University published the first genetic compression algorithm that does not rely on external genetic databases for compression. HAPZIPPER was tailored for HapMap data and achieves over 20-fold compression (95% reduction in file size), providing 2- to 4-fold better compression much faster than leading general-purpose compression utilities. Genomic sequence compression algorithms, also known as DNA sequence compressors, explore

4860-469: The main lesson from the argument is not that one risks big losses, but merely that one cannot always win. To choose an algorithm always means implicitly to select a subset of all files that will become usefully shorter. This is the theoretical reason why we need to have different compression algorithms for different kinds of files: there cannot be any algorithm that is good for all kinds of data. The "trick" that allows lossless compression algorithms, used on

4941-794: The markup language for XPS is a subset of XAML , allowing it to incorporate vector elements in documents. An XPS file is a ZIP archive using the Open Packaging Conventions , containing the files which make up the document. These include an XML markup file for each page, text, embedded fonts , raster images, 2D vector graphics , as well as the digital rights management information. The contents of an XPS file can be examined by opening it in an application which supports ZIP files. There are two incompatible XPS formats available. The original document writer printed to .xps in Windows 7 and Windows Vista . Beginning with Windows 8 ,

SECTION 60

#1732800770244

5022-627: The model as the data is compressed. Both the encoder and decoder begin with a trivial model, yielding poor compression of initial data, but as they learn more about the data, performance improves. Most popular types of compression used in practice now use adaptive coders. Lossless compression methods may be categorized according to the type of data they are designed to compress. While, in principle, any general-purpose lossless compression algorithm ( general-purpose meaning that they can accept any bitstring) can be used on any type of data, many are unable to achieve significant compression on data that are not of

5103-400: The needs of markets and consumers. This drives innovation which, in turn, contributes to the creation of new markets and the growth and expansion of existing markets. There are five, key OpenStand Principles, as outlined below: 1. Cooperation Respectful cooperation between standards organizations, whereby each respects the autonomy, integrity, processes, and intellectual property rules of

5184-411: The organization that owns the copyright on the specification. As such these specifications are not considered to be fully open . Joel West has argued that "open" standards are not black and white but have many different levels of "openness". A more open standard tends to occur when the knowledge of the technology becomes dispersed enough that competition is increased and others are able to start copying

5265-413: The original application. This is especially often used in demo coding, where competitions are held for demos with strict size limits, as small as 1 kilobyte . This type of compression is not strictly limited to binary executables, but can also be applied to scripts, such as JavaScript . Lossless compression algorithms and their implementations are routinely tested in head-to-head benchmarks . There are

5346-410: The other hand, it has also been proven that there is no algorithm to determine whether a file is incompressible in the sense of Kolmogorov complexity. Hence it is possible that any particular file, even if it appears random, may be significantly compressed, even including the size of the decompressor. An example is the digits of the mathematical constant pi , which appear random but can be generated by

5427-711: The others. 2. Adherence to Principles – Adherence to the five fundamental principles of standards development, namely 3. Collective Empowerment Commitment by affirming standards organizations and their participants to collective empowerment by striving for standards that: 4. Availability Standards specifications are made accessible to all for implementation and deployment. Affirming standards organizations have defined procedures to develop specifications that can be implemented under fair terms. Given market diversity, fair terms may vary from royalty-free to fair, reasonable, and non-discriminatory terms (FRAND). 5. Voluntary Adoption Standards are voluntarily adopted and success

5508-752: The printing architecture of Windows Vista uses XPS as the spooler format. Apps can create XPS documents by printing to XPS Document Writer, a virtual printer that comes bundled with Windows. These files open in XPS Viewer, an optional component that comes with Windows Vista and later. In Windows Vista, XPS is hosted within Internet Explorer , but in subsequent versions, it is a standalone app. Both versions support digital rights management and digital signatures . Windows 8 also comes with an app called "Reader", which reads XPS and PDF files. The .NET Framework 3.0 installer for Windows XP also adds

5589-404: The probabilities from the previous sample in sound encoding, from the left and upper pixel in image encoding, and additionally from the previous frame in video encoding. In the wavelet transformation, the probabilities are also passed through the hierarchy. Many of these methods are implemented in open-source and proprietary tools, particularly LZW and its variants. Some algorithms are patented in

5670-647: The purpose of defining what documents IETF standards can link to. RFC 2026 belongs to a set of RFCs collectively known as BCP 9 (Best Common Practice, an IETF policy). RFC 2026 was later updated by BCP 78 and 79 (among others). As of 2011 BCP 78 is RFC 5378 (Rights Contributors Provide to the IETF Trust), and BCP 79 consists of RFC 3979 (Intellectual Property Rights in IETF Technology) and a clarification in RFC 4879. The changes are intended to be compatible with

5751-485: The sense that the standard is either unowned or owned by a collective body, it can still be publicly shared and not tightly guarded. The typical example of "open source" that has become a standard is the personal computer originated by IBM and now referred to as Wintel , the combination of the Microsoft operating system and Intel microprocessor. There are three others that are most widely accepted as "open" which include

5832-513: The size of random data that contain no redundancy . Different algorithms exist that are designed either with a specific type of input data in mind or with specific assumptions about what kinds of redundancy the uncompressed data are likely to contain. Lossless data compression is used in many applications. For example, it is used in the ZIP file format and in the GNU tool gzip . It is also often used as

5913-470: The size of some file, the expected length of a compressed file (averaged over all possible files of length N) must necessarily be greater than N. So if we know nothing about the properties of the data we are compressing, we might as well not compress it at all. A lossless compression algorithm is useful only when we are more likely to compress certain types of files than others; then the algorithm could be designed to compress those types of data better. Thus,

5994-426: The specific characteristics of images (such as the common phenomenon of contiguous 2-D areas of similar tones, and the fact that color images usually have a preponderance of a limited range of colors out of those representable in the color space). As mentioned previously, lossless sound compression is a somewhat specialized area. Lossless sound compression algorithms can take advantage of the repeating patterns shown by

6075-542: The spool file represents advanced graphics effects such as 3D images, glow effects, and gradients as Windows Presentation Foundation primitives, which printer drivers could offload their rasterization to the printer in order to reduce computational load if the printer is capable of rasterizing those primitives. Like PDF , XPS is a page description language using fixed-layout document format designed to preserve document fidelity, providing device-independent document appearance. PDF uses Carousel Object Syntax (COS syntax) to form

6156-702: The technology as they implement it. This occurred with the Wintel architecture as others were able to start imitating the software. Less open standards exist when a particular firm has much power (not ownership) over the standard, which can occur when a firm's platform "wins" in standard setting or the market makes one platform most popular. On August 12, 2012, the Institute of Electrical and Electronics Engineers (IEEE), Internet Society (ISOC), World Wide Web Consortium (W3C), Internet Engineering Task Force (IETF) and Internet Architecture Board (IAB), jointly affirmed

6237-437: The type of data they were designed for, to consistently compress such files to a shorter form is that the files the algorithms are designed to act on all have some form of easily modeled redundancy that the algorithm is designed to remove, and thus belong to the subset of files that that algorithm can make shorter, whereas other files would not get compressed or even get bigger. Algorithms are generally quite specifically tuned to

6318-667: The use of Open Standards, and is applicable to sovereign entities, central public administration services (including decentralized services and public institutes), regional public administration services and the public sector. In it, Open Standards are defined thus: a) Its adoption is fruit off an open decision process accessible to all interested parties; b) The specifications document must have been freely published, allowing its copy, distribution and use without restrictions; c) The specifications document cannot cover undocumented actions of processes; d) The applicable intellectual property rights, including patents, have been made available in

6399-472: The wave-like nature of the data ‍ — ‍ essentially using autoregressive models to predict the "next" value and encoding the (possibly small) difference between the expected value and the actual data. If the difference between the predicted and the actual data (called the error ) tends to be small, then certain difference values (like 0, +1, −1 etc. on sample values) become very frequent, which can be exploited by encoding them in few output bits. It

6480-452: The years of companies achieving "perfect compression" where an arbitrary number N of random bits can always be compressed to N  − 1 bits, these kinds of claims can be safely discarded without even looking at any further details regarding the purported compression scheme. Such an algorithm contradicts fundamental laws of mathematics because, if it existed, it could be applied repeatedly to losslessly reduce any file to length 1. On

6561-415: Was released under a royalty-free copyright license, allowing its free distribution. On September 13, 2011, Monotype Imaging announced it had licensed its XPS-to-PCL 6 and XPS-to-PostScript vector conversion filters to Microsoft for use in the next version of Windows. In 2003, Global Graphics was chosen by Microsoft to provide consultancy and proof of concept development services on XPS and worked with

#243756