物件導向軟體之架構(Object-Oriented Software Construction)探討

The state of the art in data compression is arithmetic coding, not the better-known Huffman method. Arithmetic coding gives greater compression, is faster for adaptive models, and clearly separates the model from the channel encoding.

/pdf/arithmetic-coding-for-data-compression-3eqc4smaaa.pdf

Arithmetic coding for data compression

We survey the current techniques to cope with the problem of string matching that allows errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining the problem and its relevance, its statistical behavior, its history and current developments, and the central ideas of the algorithms and their complexities. We present a number of experiments to compare the performance of the different algorithms and show which are the best choices. We conclude with some directions for future work and open problems.

/pdf/a-guided-tour-to-approximate-string-matching-22fowlmq5b.pdf

A guided tour to approximate string matching

An edited volume containing data structures and algorithms for information retrieved including a disk with examples written in C. For programmers and students interested in parsing text, automated indexing, its the first collection in book form of the basic data structures and algorithms that are critical to the storage and retrieval of documents.

https://hornad.fei.tuke.sk/~genci/Vyucba/OOBDS/Archiv/Podklady/TExtoveIS&IR/Information%20Retrieval%20Data%20Structures%20&%20Algorithms.PDF

Information Retrieval: Data Structures and Algorithms

Program analysis utilizes static techniques for computing reliable information about the dynamic behavior of programs. Applications include compilers (for code improvement), software validation (for detecting errors) and transformations between data representation (for solving problems such as Y2K). This book is unique in providing an overview of the four major approaches to program analysis: data flow analysis, constraint-based analysis, abstract interpretation, and type and effect systems. The presentation illustrates the extensive similarities between the approaches, helping readers to choose the best one to utilize.

Principles of program analysis

C Programming in the Berkeley Unix Environment

Flow grammars provide a new mechanism for modeling control flow in flow analyzers and code optimizers. Existing methods for representing control flow are inadequate in terms of both their generality and their accuracy. Flow grammars overcome these deficiencies and are well-suited to the specification and solution of data flow analysis problems.

/pdf/flow-grammars-a-flow-analysis-methodology-jrci3ijvos.pdf

Flow Grammars - a Flow Analysis Methodology

SUMMARY Java programmers cannot but be aware of the advent of C#, the NET network environment, and a host of new supporting technologies, such as web services Before taking the big step of moving all development to a new environment, programmers will want to know what are the advantages of C# as a language over Java, and whether the new and interesting features of C# and NET can be incorporated into existing Java software This paper surveys the advantages of C# and then presents and evaluates experience with connecting it to Java in a variety of ways The rst way provides evidence that Java can be linked to C# at the native code level, albeit through C++ wrappers The second is a means for retaining the useful applet feature of Java in the serverside architecture of web services written in C# The third is by providing a common XML-based class for the development of GUIs, which can be incorporated into Java or C# An added advantage of this system, called Views, is that it can run independently of the resource-intensive development environment that would otherwise be needed for using C# A major advantage of the methods described in this paper is that in all cases the Java program is not aected by the fact that it is interfacing with C# The paper concludes that there are many common shared technologies that bring Java and C# close together, and that innovative ways of using others can open up opportunities not hitherto imagined

/pdf/experience-in-integrating-java-with-c-and-net-22dqo20woy.pdf

Experience in integrating Java with C# and .NET

Partial redundancy elimination (PRE) techniques play an important role in optimizing compilers. Many optimizations, such as elimination of redundant expressions, communication optimizations, and load-reuse optimizations, employ PRE as an underlying technique for improving the efficiency of a program.

/pdf/partial-redundancy-elimination-with-predication-techniques-4zjdcmyq8e.pdf

Partial Redundancy Elimination with Predication Techniques

From the very inception of design patterns, there was the anticipation that some of them would be superceded by new language features. Yet published implementations of classic patterns do not generally live up to this promise. The occurrence of generics, delegates, nested classes, reflection and built-in iteration is confined to a few patterns in a few published compendiums in a few languages. In this paper we trace the interplay between languages and patterns over the past decade and investigate how relevant language features really are for pattern implementation. We back our conclusions with a detailed look at the visitor pattern, examining the impact of C# developed in the past few years. We conclude that efficiency should play a large role in the choice of design pattern implementation, since some new features still bring with them runtime overheads.

R. Nigel Horspool

Papers

C Programming in the Berkeley Unix Environment

Flow Grammars - a Flow Analysis Methodology

Experience in integrating Java with C# and .NET

Partial Redundancy Elimination with Predication Techniques

On the Efficiency of Design Patterns Implemented in C# 3.0