The Java language has rapidly become widespread and it is being used to implement a broad range of applications, including applications with high resource requirements. For this reason, it is important to evaluate the suitability of the Java environment to execute such applications. This paper presents an evaluation of the effects of memory management in the context of memory intensive Java app...

In web access analysis of a large-scale website the behaviour of visitors accessing the website is examined. An example instance of a pattern is if a visitor accesses the same parts of the website every seven days; we will call such types of patterns balanced patterns. We define balanced patterns using standard deviation and average. We propose a new approach for pruning such patterns. In compa...

In this paper we consider the externa//nverse pattern match/ng problem. Given a text T of length n over an ordered alphabet ,U and a number m <_ n, the goal is to find a pattern ~-~MAX ~ ~rn which is not a subword of T and which maximizes the sum of Hamming distances between ~MAX and all subwords of T of length m. We present an optimal O(nloga)-time (where a = 1/71) algorithm for the external i...

Guidelines for the Use of the "OAM" Acronym in the IETF Abstract At first glance, the acronym "OAM" seems to be well-known and well-understood. Looking at the acronym a bit more closely reveals a set of recurring problems that are revisited time and again. This document provides a definition of the acronym "OAM" (Operations, Administration, and Maintenance) for use in all future IETF documents ...

A compressed full-text self-index occupies space close to that of the compressed text and simultaneously allows fast pattern matching and random access to the underlying text. Among the best compressed self-indexes, in theory and in practice, are several members of the FM-index family. In this paper, we describe new FM-index variants that combine nice theoretical properties, simple implementati...

In the Parallel Dictionary Matching problem a set of patterns D is xed at the beginning, and the following Query(T) operation has to be quickly supported: given an arbitrary text T 1; t], for each text position i retrieve the longest pattern in D that is a preex of T i; t]. In this paper, we present a simple and space-eecient CRCW PRAM algorithm which takes optimal work to answer Query(T) in th...

Mining frequent web access patterns from large data (web log) is one significant application of sequential pattern mining. Web access patterns are set of frequent sub sequences that are useful to know user behaviour in real time in order to make dynamic decisions. Techniques for extracting web access patterns from data available in two flavours: apriori based and non apriori based (tree based)....

This research describes an ontology design pattern for dynamically conceptualizing, establishing, tracking, and updating relative relationships and dependencies between entities (real or representational) of a physical, temporal, and/or importance scope. We present a Relative Relationship (RR) Pattern, associated axioms, an implementation of current geometric scale translation research, a detai...

Sequential pattern mining, since its introduction has received considerable attention among the researchers with broad applications. The sequential pattern algorithms generally face problems when mining long sequential patterns or while using very low support threshold. One possible solution of such problems is by mining the closed sequential patterns, which is a condensed representation of seq...