Pedant In a Box

May 2004
Mix;May2004, Vol. 28 Issue 6, p102
Discusses the workability of Huffman Coding software, a member of the entropy coding family of algorithms. Employment of simple concept with a wide range of applications in data storage and transmission; Application of statistical symbol substitution; Usage of lexicon symbols.


Related Articles

  • A Completeness Optimized Algorithm for Closed Model Clone Detection. Zhengping Liang; Yiqun Cheng; Jiajia Tan; Jianyong Chen // Journal of Software (1796217X);Aug2014, Vol. 9 Issue 8, p2125 

    The detection of model clone has been an active research area in recent years. The closed clone instances contain all the information of model clones so they can ensure the completeness of detection results essentially. In order to improve the degree of completeness in clone detection, a novel...

  • Ontology-based Active Repository System. Yang Tao // Information Technology Journal;2013, Vol. 12 Issue 11, p2138 

    Component-Based Software Development (CBSD) is becoming increasingly more important in software engineering research and software development; however, it encounters many problems regarding its application. Here, based on the active repository system CodeBroker, the authors introduce a new...

  • A Dynamic-Static Combined Code Layout Reorganization Approach for Dynamic Binary Translation. Haibing Guan; Erzhou Zhu; Kai Chen; Ruhui Ma; Yunchao He; Haipeng Deng; Hongbo Yang // Journal of Software (1796217X);Dec2011, Vol. 6 Issue 12, p2341 

    Dynamic binary translation (DBT) has attracted much attention as a powerful technique for the runtime adaptation of software among different ISAs. It offers unprecedented flexibility in the control and modification of a program during the runtime. However, its inherent high overhead has...

  • INCREASING THE EFFICIENCY OF BIT-COUNTING. El-Qawasmeh, E.; Strauss, M.; Mack, M.; Berkovich, S. // International Journal of Computers & Applications;2007, Vol. 29 Issue 1, p51 

    The operation of bit counting, that is, determining the number of "1's" in a string of hits, is of significant importance for a number of computer applications such as coding theory, information retrieval, genetic algorithms, and file comparison. The growing importance of this operation has led...

  • Exemplar: A Source Code Search Engine for Finding Highly Relevant Applications. McMillan, Collin; Grechanik, Mark; Poshyvanyk, Denys; Fu, Chen; Xie, Qing // IEEE Transactions on Software Engineering;May2012, Vol. 38 Issue 5, p1069 

    A fundamental problem of finding software applications that are highly relevant to development tasks is the mismatch between the high-level intent reflected in the descriptions of these tasks and low-level implementation details of applications. To reduce this mismatch we created an approach...

  • Visualizing the software system towards identifying the topic from source code using semantic clustering. Sharma, Kanchan; Brar, Amanpreet Singh // International Journal of Advanced Computer Research;Mar2014, Vol. 4 Issue 14, p350 

    In software re-engineering, domain knowledge are valuable source of information for developers. Here, we describe how the coding standards are helpful for the identification of domain while writing the source code. Internal comments and logical identifier names in source code are the key source...

  • Surfacing code in the dark: an instant clone search approach. Park, Jin-woo; Lee, Mu-Woong; Roh, Jong-Won; Hwang, Seung-won; Kim, Sunghun // Knowledge & Information Systems;Dec2014, Vol. 41 Issue 3, p727 

    In this paper, we study how to 'surface' code for instant reference. A traditional mode of surfacing code has been treating code as text and applying keyword search techniques. However, many prior work observes the limitation of such approach: (1) semantic description of code is limited to...

  • On complexity of quantum communication processes. Watanabe, Noboru // AIP Conference Proceedings;Dec2012, Vol. 1508 Issue 1, p334 

    In several complicated systems, it is important to study (1) the dynamics of state change and (2) the complexity of states of systems. Information Dynamics (ID) introduced by Ohya is a general idea constructing a theory by synthesizing the research schemes of (1) and (2) under a frame of the ID....

  • The Distributed Task Scheduling Based on Realcoded Immune Algorithm. Lu Guiming; Zhang Yunzhe // Proceedings of the International Symposium on Computer Science &;Aug2010, Vol. 2 Issue 1, p101 

    Task scheduling is a NP puzzle. Its algorithm is an important research direction. This paper proposes a task scheduling algorithm based on real-coded immune algorithm by studying and analyzing task scheduling models and immune algorithms existed. This paper discusses the coding method, the...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics