Byte codes are a practical alternative to the traditional bit-oriented compression approaches when large alphabets are being used, and trade away a small amount of compression effectiveness for a relatively large gain in decoding efficiency. Byte codes also have the advantage of being searchable using standard string matching techniques. Here we describe methods for searching in byte-coded comp...

We present a pattern matching approach to the problem of misuse detection in a computer system, which is formalized as the problem of multiple approximate pattern matching. This permits very fast searching of potential attacks. We study the probability of matching of the model and its relation to the filtering efficiency of potential attacks within large audit trails. Experimental results show ...

Searching the Internet effectively necessitates the use of contemporary software programs commonly known as "search engines" to locate desired and meaningful information. Knowing how to effectively and efficiently utilize such search engines is critical for effective and efficient knowledge-seeking activities by the practitioner. Three categories of search engines are described in this article ...