Programming in Haskell

Total Page:16

File Type:pdf, Size:1020Kb

Programming in Haskell Haskell Communities and Activities Report http://www.haskell.org/communities/ Tenth Edition – June 12, 2006 Andres Löh (ed.) Lloyd Allison Tiago Miguel Laureano Alves Krasimir Angelov Dmitry Astapov Alistair Bayley Jean-Philippe Bernardy Clifford Beshers Edwin Brady Björn Bringert Chris Brown Manuel Chakravarty Olaf Chitil Alain Crémieux Iavor Diatchki Atze Dijkstra Robert Dockins Frederik Eaton Shae Erisson Jan van Eijck Martin Erwig Sander Evers Markus Forsberg Simon Foster Benjamin Franksen Leif Frenzel André Furtado John Goerzen Dimitry Golubovsky Murray Gross Walter Gussmann Jurriaan Hage Thomas Hallgren Keith Hanna Robert van Herk Ralf Hinze Paul Hudak Liyang Hu Graham Hutton Johan Jeuring Paul Johnson Isaac Jones Oleg Kiselyov Marnix Klooster Lemmih Huiqing Li Andres Löh Rita Loogen Salvador Lucas Christoph Lüth Ketil Malde Christian Maeder Simon Marlow Paolo Martini Conor McBride Serge Mechveliani Neil Mitchell William Garret Mitchener Andy Adams-Moran J. Garrett Morris Rickard Nilsson Sven Panne Ross Paterson Jens Petersen Simon Peyton-Jones Bernie Pope Claus Reinke Frank Rosemeier David Roundy Alberto Ruiz David Sabel Tom Shackell Uwe Schmidt Martijn Schrage Alexandra Silva Axel Simon Anthony Sloane Dominic Steinitz Donald Bruce Stewart Martin Sulzmann Doaitse Swierstra Wouter Swierstra Audrey Tang Henning Thielemann Peter Thiemann Simon Thompson Phil Trinder Arjan van IJzendoorn Miguel Vilaca Joost Visser Malcolm Wallace Stefan Wehr Ashley Yakeley Bulat Ziganshin Preface This is the tenth edition of the Haskell Communities and Activities Report (HCAR) – a col- lection of entries about everything that is going on and related to Haskell in some way that appears twice a year. Perhaps the release of the tenth edition is a good time to have a look back at the beginning. At the Haskell Workshop 2001, during the traditional discussion on “The Future of Haskell”, Claus Reinke pointed out that it is very difficult to keep track of all the developments within the Haskell community: there are many people working on and with Haskell, they are located in very different places and are working on several different fields. He was asking for a collection of up-to-date information about releases of compilers, tools, and application, but also of ongoing work in a single place for everyone to look up. Everyone agreed with Claus, but probably nothing would have happened if he himself had not volunteered to start the project. Already in November 2001, the first edition of the HCAR appeared. It had 20 contributors and the PostScript/PDF version consisted of 22 pages. Four and a half years later, one can compare the current edition with the first and will notice that the basic structure has remained unchanged, but the size has nearly tripled (62 pages) and the number of contributors has almost reached a hundred (93 contributors). This demonstrates that the original concept was a good one, and that the HCAR is successful. I would therefore like to thank Claus for his work on the first five editions, Arthur van Leeuwen, the editor of the sixth edition, but most of all the countless contributors that have filled the report with content over the years. It is you that really make the report happen, and also a joy to work on, allowing me to read lots of interesting submissions while assembling the report. I am very happy to see that the HCAR has quite some “competition” these days: the Haskell Weekly News (→ 1.4) gather Haskell-relevant information on a regular basis, the mailing lists are as active as they always are, the #haskell IRC channel (→ 1.3) is a direct contact to other people interested in Haskell and a reliable source of information about current work, the Haskell Sequence (→ 1.4.1) is a news portal for the Haskell world, the Haskell Planet (unfortunately without an entry) collects blogs by Haskellers, the Haskell Wiki has been integrated with the main haskell.org (→ 1.1) site, and I am sure I forgot a few other ways to get at information about Haskell communities and activities. All the media mentioned above have different strengths and weaknesses, and therefore serve and reach different groups of people. It is good to see that there is so much communication in the Haskell world. If you miss a project in this HCAR, then simply contribute to the next – either by writing an entry yourself, or by making the project leader aware of the HCAR! Please mark the final weeks of October in your calendar, because that is when the entries for the November edition will be collected. As always, feedback is very welcome [email protected]. Now, I wish you pleasant reading! Andres Löh, University of Bonn, Germany 2 Contents 1 General 7 1.1 HaskellWiki and haskell.org ........................................ 7 1.2 haskell.org and Google Summer of Code 2006 .............................. 7 1.3 #haskell .................................................. 8 1.4 Haskell Weekly News ............................................ 8 1.4.1 The Haskell Sequence ........................................... 8 1.5 The Monad.Reader ............................................. 8 1.6 Books and tutorials ............................................ 8 1.6.1 “Hitchhickers Guide to Haskell” tutorial ................................. 8 1.6.2 New textbook – Programming in Haskell ................................. 9 1.6.3 Haskell Tutorial WikiBook ......................................... 9 2 Implementations 10 2.1 The Glasgow Haskell Compiler ...................................... 10 2.2 Hugs ..................................................... 11 2.3 nhc98 .................................................... 11 2.4 yhc ...................................................... 11 3 Language 12 3.1 Variations of Haskell ............................................ 12 3.1.1 Haskell on handheld devices ........................................ 12 3.1.2 Vital: Visual Interactive Programming .................................. 12 3.1.3 Pivotal: Visual Interactive Programming ................................. 12 3.1.4 House (formerly hOp) ........................................... 12 3.1.5 Camila .................................................... 13 3.1.6 HASP .................................................... 13 3.2 Non-sequential Programming ....................................... 13 3.2.1 Data Parallel Haskell ............................................ 13 3.2.2 GpH – Glasgow Parallel Haskell ...................................... 13 3.2.3 GdH – Glasgow Distributed Haskell ................................... 14 3.2.4 Eden ..................................................... 15 3.3 Type System/Program Analysis ...................................... 16 3.3.1 Epigram ................................................... 16 3.3.2 Chameleon project ............................................. 16 3.3.3 XHaskell project .............................................. 17 3.3.4 Constraint Based Type Inferencing at Utrecht .............................. 17 3.3.5 EHC, ‘Essential Haskell’ Compiler .................................... 18 3.4 Generic Programming ........................................... 18 4 Libraries 20 4.1 Packaging and Distribution ........................................ 20 4.1.1 Hackage and Cabal ............................................. 20 4.2 General libraries .............................................. 20 4.2.1 Hacanon-light ................................................ 20 4.2.2 HODE .................................................... 20 4.2.3 PFP – Probabilistic Functional Programming Library for Haskell ................... 20 4.2.4 Hmm: Haskell Metamath module ..................................... 21 4.2.5 GSLHaskell ................................................. 21 4.2.6 An Index Aware Linear Algebra Library ................................. 21 4.2.7 Ivor ..................................................... 22 4.2.8 magic-haskell ................................................ 22 4.2.9 MissingH .................................................. 22 3 4.2.10 MissingPy .................................................. 23 4.3 Parsing and transforming ......................................... 23 4.3.1 Utrecht Parsing Library and Attribute Grammar System ....................... 23 4.3.2 Strafunski .................................................. 23 4.4 System .................................................... 24 4.4.1 hs-plugins .................................................. 24 4.4.2 ldap-haskell ................................................. 24 4.4.3 Package “time” (formerly TimeLib) ................................... 24 4.4.4 The libpcap Binding ............................................ 24 4.4.5 Streams ................................................... 24 4.5 Databases and data storage ........................................ 25 4.5.1 CoddFish .................................................. 25 4.5.2 Takusen ................................................... 25 4.5.3 HaskellDB .................................................. 25 4.6 Data types and data structures ...................................... 26 4.6.1 Standard Collection Libraries (formerly Hierarchical Libraries Collections) .............. 26 4.6.2 The revamped monad transformer library ................................ 26 4.6.3 Data.ByteString (formerly FPS (fast packed strings)) ......................... 26 4.6.4 Edison .................................................... 26 4.6.5 Numeric prelude .............................................. 27 4.6.6 2-3 Finger Search Trees
Recommended publications
  • Forcepoint DLP Supported File Formats and Size Limits
    Forcepoint DLP Supported File Formats and Size Limits Supported File Formats and Size Limits | Forcepoint DLP | v8.8.1 This article provides a list of the file formats that can be analyzed by Forcepoint DLP, file formats from which content and meta data can be extracted, and the file size limits for network, endpoint, and discovery functions. See: ● Supported File Formats ● File Size Limits © 2021 Forcepoint LLC Supported File Formats Supported File Formats and Size Limits | Forcepoint DLP | v8.8.1 The following tables lists the file formats supported by Forcepoint DLP. File formats are in alphabetical order by format group. ● Archive For mats, page 3 ● Backup Formats, page 7 ● Business Intelligence (BI) and Analysis Formats, page 8 ● Computer-Aided Design Formats, page 9 ● Cryptography Formats, page 12 ● Database Formats, page 14 ● Desktop publishing formats, page 16 ● eBook/Audio book formats, page 17 ● Executable formats, page 18 ● Font formats, page 20 ● Graphics formats - general, page 21 ● Graphics formats - vector graphics, page 26 ● Library formats, page 29 ● Log formats, page 30 ● Mail formats, page 31 ● Multimedia formats, page 32 ● Object formats, page 37 ● Presentation formats, page 38 ● Project management formats, page 40 ● Spreadsheet formats, page 41 ● Text and markup formats, page 43 ● Word processing formats, page 45 ● Miscellaneous formats, page 53 Supported file formats are added and updated frequently. Key to support tables Symbol Description Y The format is supported N The format is not supported P Partial metadata
    [Show full text]
  • Rule Base with Frequent Bit Pattern and Enhanced K-Medoid Algorithm for the Evaluation of Lossless Data Compression
    Volume 3, No. 1, Jan-Feb 2012 ISSN No. 0976-5697 International Journal of Advanced Research in Computer Science RESEARCH PAPER Available Online at www.ijarcs.info Rule Base with Frequent Bit Pattern and Enhanced k-Medoid Algorithm for the Evaluation of Lossless Data Compression. Nishad P.M.* Dr. N. Nalayini Ph.D Scholar, Department Of Computer Science Associate professor, Department of computer science NGM NGM College, Pollachi, India College Pollachi, Coimbatore, India [email protected] [email protected] Abstract: This paper presents a study of various lossless compression algorithms; to test the performance and the ability of compression of each algorithm based on ten different parameters. For evaluation the compression ratios of each algorithm on different parameters are processed. To classify the algorithms based on the compression ratio, rule base is constructed to mine with frequent bit pattern to analyze the variations in various compression algorithms. Also, enhanced K- Medoid clustering is used to cluster the various data compression algorithms based on various parameters. The cluster falls dissentingly high to low after the enhancement. The framed rule base consists of 1,048,576 rules, which is used to evaluate the compression algorithm. Two hundred and eleven Compression algorithms are used for this study. The experimental result shows only few algorithm satisfies the range “High” for more number of parameters. Keywords: Lossless compression, parameters, compression ratio, rule mining, frequent bit pattern, K–Medoid, clustering. I. INTRODUCTION the maximum shows the peek compression ratio of algorithms on various parameters, for example 19.43 is the Data compression is a method of encoding rules that minimum compression ratio and the 76.84 is the maximum allows substantial reduction in the total number of bits to compression ratio for the parameter EXE shown in table-1 store or transmit a file.
    [Show full text]
  • Sys-Manage Copyright2 User Manual
    Sys-Manage User Manual CopyRight2 CopyRight2 User Manual (C) 2001-2021 by Sys-Manage Copyright © 2012 by Sys-Manage. All rights reserved. This publication is protected by Copyright and written permission should be obtained from the publisher prior any prohibited reproduction, storage in retrieval system, or transmission in any form or by any means, electronic, mechanical, photocopying, recording, or likewise. Sys-Manage Informatica SL Phone: +1 (408) 345-5199 Phone: +1 (360) 227-5673 Phone: +44 (0) 8455273028 Phone: +49-(0)69-99999-3099 Phone : +34-810 10 15 34 Mail: [email protected] Web: http://www.Sys-Manage.com YouTube: www.YouTube.com/SysManage Twitter: www.twitter.com/SysManage Facebook: www.facebook.com/pages/Sys-Manage/153504204665791 Use of trademarks: Microsoft, Windows, Windows NT, XP, Windows Vista, Windows7, Windows8 and the Windows logo are ® trademarks of Microsoft Corporation in the United States, other countries, or both. All other company, product, or service names may be trademarks of others and are the property of their respective owners. Page 2 / 212 Document Version 1.52 02-15-2021 CopyRight2 User Manual (C) 2001-2021 by Sys-Manage ABSTRACT ............................................................................................................................................................ 8 REQUIREMENTS ................................................................................................................................................. 9 USAGE SCENARIOS .........................................................................................................................................
    [Show full text]
  • Open Rar Free
    Open rar free click here to download 7-Zip is free software with open source. The most of the code is under the GNU LGPL license. Some parts of the code are under the BSD 3- clause License. WinRAR, free and safe download. WinRAR latest WinRAR is a file compression program that can be used to open, create and decompress RAR, ZIP and. Open any RAR file in seconds, for free! New update: Now in addition to RAR, it handles dozens of popular archives, like 7Z, Zip, TAR, LZH, etc. RAR Opener is a . Free RAR files opener, extractor utility. How to open, extract RAR format free, unzip. Work with WinRar archives extraction. Windows, Linux unrar software. Zip, unzip, rar files online. Extract files from archive online, no installation, safe and free. Unzip, unrar decompression in cloud. Uncompress, unzipping tool. Archive Extractor is a small and easy online tool that can extract over 70 types of compressed files, such as 7z, zipx, rar, tar, exe, dmg and much more. WinZip opens RAR files. Use WinZip, the world's most popular zip file utility, to open and extract content from RAR files and other compressed file formats. You cannot put RAR File Open Knife on a portable or flash drive and have it function correctly. However, there is an alternative tool called “RarZille Free Unrar. If you want to create RAR files, WinRAR is your best bet. However, if you just need to extract a RAR file, the free and open source 7-Zip app is a. UnRarX is a free WinRAR- style tool for Mac which allows you to unzip RAR files.
    [Show full text]
  • IDOL Connector Framework Server 12.2 Administration Guide
    Connector Framework Server Software Version 12.2 Administration Guide Document Release Date: February 2019 Software Release Date: February 2019 Administration Guide Legal notices Copyright notice © Copyright 2019 Micro Focus or one of its affiliates. The only warranties for products and services of Micro Focus and its affiliates and licensors (“Micro Focus”) are set forth in the express warranty statements accompanying such products and services. Nothing herein should be construed as constituting an additional warranty. Micro Focus shall not be liable for technical or editorial errors or omissions contained herein. The information contained herein is subject to change without notice. Documentation updates The title page of this document contains the following identifying information: l Software Version number, which indicates the software version. l Document Release Date, which changes each time the document is updated. l Software Release Date, which indicates the release date of this version of the software. You can check for more recent versions of a document through the MySupport portal. Many areas of the portal, including the one for documentation, require you to sign in with a Software Passport. If you need a Passport, you can create one when prompted to sign in. Additionally, if you subscribe to the appropriate product support service, you will receive new or updated editions of documentation. Contact your Micro Focus sales representative for details. Support Visit the MySupport portal to access contact information and details about the products, services, and support that Micro Focus offers. This portal also provides customer self-solve capabilities. It gives you a fast and efficient way to access interactive technical support tools needed to manage your business.
    [Show full text]
  • IDOL Keyview Viewing SDK 12.6 Programming Guide
    KeyView Software Version 12.6 Viewing SDK Programming Guide Document Release Date: June 2020 Software Release Date: June 2020 Viewing SDK Programming Guide Legal notices Copyright notice © Copyright 2016-2020 Micro Focus or one of its affiliates. The only warranties for products and services of Micro Focus and its affiliates and licensors (“Micro Focus”) are set forth in the express warranty statements accompanying such products and services. Nothing herein should be construed as constituting an additional warranty. Micro Focus shall not be liable for technical or editorial errors or omissions contained herein. The information contained herein is subject to change without notice. Documentation updates The title page of this document contains the following identifying information: l Software Version number, which indicates the software version. l Document Release Date, which changes each time the document is updated. l Software Release Date, which indicates the release date of this version of the software. To check for updated documentation, visit https://www.microfocus.com/support-and-services/documentation/. Support Visit the MySupport portal to access contact information and details about the products, services, and support that Micro Focus offers. This portal also provides customer self-solve capabilities. It gives you a fast and efficient way to access interactive technical support tools needed to manage your business. As a valued support customer, you can benefit by using the MySupport portal to: l Search for knowledge documents of interest l Access product documentation l View software vulnerability alerts l Enter into discussions with other software customers l Download software patches l Manage software licenses, downloads, and support contracts l Submit and track service requests l Contact customer support l View information about all services that Support offers Many areas of the portal require you to sign in.
    [Show full text]
  • Data Compression Explained
    Data Compression Explained http://mattmahoney.net/dc/dce.html Data Compression Explained Matt Mahoney Copyright (C) 2010, 2011, Dell, Inc . You are permitted to copy and distribute material from this book provided (1) any material you distribute includes this license, (2) the material is not modified, and (3) you do not charge a fee or require any other considerations for copies or for any works that incorporate material from this book. These restrictions do not apply to normal "fair use", defined as cited quotations totaling less than one page. This book may be downloaded without charge from http://mattmahoney.net /dc/dce.html . Last update: Oct. 30, 2011. e-reader translations by Alejo Sanchez, Oct. 29, 2011: mobi (Kindle) and epub (other readers). Romanian translation by Alexander Ovsov, Aug. 3, 2011. About this Book This book is for the reader who wants to understand how data compression works, or who wants to write data compression software. Prior programming ability and some math skills will be needed. Specific topics include: 1. Information theory No universal compression Coding is bounded Modeling is not computable Compression is an artificial intelligence problem 2. Benchmarks Calgary corpus results 3. Coding Huffman arithmetic asymmetric binary numeric codes ( unary , Rice, Golomb , extra bit ) archive formats ( error detection , encryption ) 4. Modeling Fixed order : bytewise bitwise , indirect Variable order : DMC , PPM , CTW Context mixing : linear mixing , logistic mixing , SSE , indirect SSE , match , PAQ , ZPAQ , Crinkler 5. Transforms RLE LZ77 ( LZSS , deflate , LZMA , LZX , ROLZ, LZP , snappy , deduplication ) LZW and dictionary encoding Symbol ranking BWT ( context sorting , inverse , bzip2 , BBB , MSufSort v2 and v3 , Itoh-Tanaka , DivSufSort , Bijective ) Predictive filtering ( delta coding , color transform , linear filtering ) Specialized transforms ( E8E9 , precomp ) 1 of 110 10/29/2011 9:17 PM Data Compression Explained http://mattmahoney.net/dc/dce.html Huffman pre-coding 6.
    [Show full text]
  • Forcepoint Supported File Formats and Size Limits
    Forcepoint DLP Supported File Formats and Size Limits Supported File Formats and Size Limits | Forcepoint DLP | v8.8 This article provides a list of the file formats that can be analyzed by Forcepoint DLP, file formats from which content and meta data can be extracted, and the file size limits for network, endpoint, and discovery functions. See: ● Supported File Formats ● File Size Limits © 2020 Forcepoint LLC Supported File Formats Supported File Formats and Size Limits | Forcepoint DLP | v8.8 The following tables lists the file formats supported by Forcepoint DLP. File formats are in alphabetical order by format group. ● Archive For mats, page 3 ● Backup Formats, page 7 ● Business Intelligence (BI) and Analysis Formats, page 8 ● Computer-Aided Design Formats, page 9 ● Cryptography Formats, page 12 ● Database Formats, page 14 ● Desktop publishing formats, page 16 ● eBook/Audio book formats, page 17 ● Executable formats, page 18 ● Font formats, page 20 ● Graphics formats - general, page 21 ● Graphics formats - vector graphics, page 26 ● Library formats, page 29 ● Log formats, page 30 ● Mail formats, page 31 ● Multimedia formats, page 32 ● Object formats, page 37 ● Presentation formats, page 38 ● Project management formats, page 40 ● Spreadsheet formats, page 41 ● Text and markup formats, page 43 ● Word processing formats, page 45 ● Miscellaneous formats, page 53 Supported file formats are added and updated frequently. Key to support tables Symbol Description Y The format is supported N The format is not supported P Partial metadata is
    [Show full text]
  • Haskell Communities and Activities Report
    Haskell Communities and Activities Report http://www.haskell.org/communities/ Ninth Edition – November 20, 2005 Andres Löh (ed.) Lloyd Allison Tiago Miguel Laureano Alves Krasimir Angelov Alistair Bayley Jean-Philippe Bernardy Björn Bringert Niklas Broberg Paul Callaghan Manuel Chakravarty Olaf Chitil Koen Claessen Duncan Coutts Alain Crémieux Iavor Diatchki Atze Dijkstra Robert Dockins Shae Erisson Jan van Eijck Martin Erwig Sander Evers Markus Forsberg Simon Foster Benjamin Franksen Leif Frenzel André Furtado John Goerzen Dimitry Golubovsky Murray Gross Walter Gussmann Jurriaan Hage Sven Moritz Hallberg Thomas Hallgren Keith Hanna Bastiaan Heeren Robert van Herk Ralf Hinze Anders Höckersten Paul Hudak John Hughes Graham Hutton Johan Jeuring Paul Johnson Isaac Jones Oleg Kiselyov Marnix Klooster Graham Klyne Daan Leijen Lemmih Huiqing Li Andres Löh Rita Loogen Salvador Lucas Christoph Lüth Ketil Malde Christian Maeder Simon Marlow Conor McBride John Meacham Serge Mechveliani Neil Mitchell William Garret Mitchener Andy Adams-Moran J. Garrett Morris Rickard Nilsson Sven Panne Ross Paterson Jens Petersen John Peterson Simon Peyton-Jones Jorge Sousa Pinto Bernie Pope Claus Reinke Frank Rosemeier David Roundy David Sabel Tom Shackell Uwe Schmidt Martijn Schrage Anthony Sloane Dominic Steinitz Donald Bruce Stewart Martin Sulzmann Doaitse Swierstra Wouter Swierstra Autrijus Tang Henning Thielemann Peter Thiemann Simon Thompson Phil Trinder Arjan van IJzendoorn Tuomo Valkonen Joost Visser Malcolm Wallace Stefan Wehr Joel Wright Ashley Yakeley Bulat Ziganshin Preface Finally, here is the 9th edition of the Haskell Communities and Activities Report (HCAR), almost three weeks after the submission deadline. This delay is entirely my own fault. In fact, I have to thank the many contributors to this report even more than usually: never before did I have to ask and push so little; several entries (and quite a few new entries) landed in my inbox before or on the deadline.
    [Show full text]
  • PROGRAMAS DE SOFTWARE POCO CONOCIDOS PEAZIP Es Un
    LAURA MILENA CORREA GARZÓN (407973) CAMILA AGUDELO RIVERA (407984) NICOLÁS MARTÍNEZ CORTÉS (407050) PROGRAMAS DE SOFTWARE POCO CONOCIDOS PEAZIP Es un archivo libre y gestor de archivos, basado en la tecnología sólida y probada Fuente Abierto de 7-Zip para el manejo de los principales formatos de archivo, y otras grandes herramientas de código abierto (como FreeArc, PAQ, UPX ...) para soportar los formatos de archivos adicionales y características, con el fin de proporcionar una herramienta de uso múltiple postal con una interfaz gráfica unificada que, a diferencia de la mayoría de otros archivadores de archivo clásicos, como por ejemplo WinZip y WinRAR, es portátil y de forma nativa multi-plataforma. PeaZip está localizada en 29 idiomas y es capaz de manejar todos los formatos de archivo más populares (130 + tipos de archivo), el apoyo a una amplia gama de avanzada de archivos y funciones de gestión de archivos (búsqueda, favoritos, visor de miniaturas, hash, encontrar archivos duplicados, archivos de conversión), especialmente centrada en la seguridad (cifrado de alta seguridad, autenticación de dos factores, encargado de la contraseña encriptada, borrado seguro). El rasgo distintivo de PeaZip es el innovador y fácil de usar compresión / extracción de la interfaz, más similar a las interfaces de grabadoras de CD en lugar de un compresor de archivos clásico. Este diseño hace muy fácil de ver (y actualizar) los elementos establecidos para la compresión y la extracción, la integración de un componente de audio completo gestor de archivos. Además, las tareas creadas en la interfaz gráfica de usuario puede ser fácilmente guardado como secuencias de comandos de proceso por lotes, con el fin de automatizar las operaciones de copia de seguridad, o para el ajuste, o para aprender objetivo, reduciendo la brecha entre la facilidad de uso de aplicaciones de interfaz gráfica y el poder y la flexibilidad de la consola.
    [Show full text]
  • IDOL Keyview Viewing SDK 12.2 Programming Guide
    KeyView Software Version 12.2 Viewing SDK Programming Guide Document Release Date: February 2019 Software Release Date: February 2019 Viewing SDK Programming Guide Legal notices Copyright notice © Copyright 2016-2019 Micro Focus or one of its affiliates. The only warranties for products and services of Micro Focus and its affiliates and licensors (“Micro Focus”) are set forth in the express warranty statements accompanying such products and services. Nothing herein should be construed as constituting an additional warranty. Micro Focus shall not be liable for technical or editorial errors or omissions contained herein. The information contained herein is subject to change without notice. Documentation updates The title page of this document contains the following identifying information: l Software Version number, which indicates the software version. l Document Release Date, which changes each time the document is updated. l Software Release Date, which indicates the release date of this version of the software. You can check for more recent versions of a document through the MySupport portal. Many areas of the portal, including the one for documentation, require you to sign in with a Software Passport. If you need a Passport, you can create one when prompted to sign in. Additionally, if you subscribe to the appropriate product support service, you will receive new or updated editions of documentation. Contact your Micro Focus sales representative for details. Support Visit the MySupport portal to access contact information and details about the products, services, and support that Micro Focus offers. This portal also provides customer self-solve capabilities. It gives you a fast and efficient way to access interactive technical support tools needed to manage your business.
    [Show full text]
  • A Unique Perspective on Data Coding and Decoding
    Entropy 2011, 13, 53-63; doi:10.3390/e13010053 OPEN ACCESS entropy ISSN 1099-4300 www.mdpi.com/journal/entropy Communication A Unique Perspective on Data Coding and Decoding Wen-Yan Wang College of Electronic Engineering, Guangxi Normal University, Yucai Road 15, Guilin 541004, China; E-Mail: [email protected] Received: 25 November 2010; in revised form: 17 December 2010 / Accepted: 18 December 2010 / Published: 27 December 2010 Abstract: The concept of a loss-less data compression coding method is proposed, and a detailed description of each of its steps follows. Using the Calgary Corpus and Wikipedia data as the experimental samples and compared with existing algorithms, like PAQ or PPMstr, the new coding method could not only compress the source data, but also further re-compress the data produced by the other compression algorithms. The final files are smaller, and by comparison with the original compression ratio, at least 1% redundancy could be eliminated. The new method is simple and easy to realize. Its theoretical foundation is currently under study. The corresponding Matlab source code is provided in the Appendix. Keywords: loss-less compression; information theory; universal information PACS Codes: 70 1. Overview Data compression is the art of reducing the number of bits needed to store or transmit data. Compression can be either lossless or lossy. Lossless compressed data can be decompressed to exactly its original value. An example is Morse code, in which each letter of the alphabet is coded as a sequence of dots and dashes. The most common letters in English, like E and T, have the shortest codes, while the least common ones like J, Q, X, and Z are assigned the longest codes [1].
    [Show full text]