Log files are the primary source of information when the past operation of a computing system needs to be determined. Keeping correct and accurate log files is important for after-the-fact forensics, as well as for system administration, maintenance, and auditing. Therefore, a line of research has emerged on how to cryptographically protect the integrity of log files even against intruders who ...

ed Log Lines Categorize Bins Figure 3. High-level overview of our approach for abstracting execution logs to execution events. Table III. Log lines used as a running example to explain our approach. 1. Start check out 2. Paid for, item=bag, quality=1, amount=100 3. Paid for, item=book, quality=3, amount=150 4. Check out, total amount is 250 5. Check out done Copyright q 2008 John Wiley & Sons, ...

In this note we investigate the generalized massive gravity in asymptotically AdS3 spacetime by combining the two mass terms of topological massive gravity and new massive gravity theory. We study the linearized excitations around the AdS3 background and find that at a specific value of a certain combination of the two mass parameters (chiral line), one of the massive graviton solutions becomes...

In this note we investigate the generalized massive gravity in asymptotically AdS3 spacetime by combining the two mass terms of topological massive gravity and new massive gravity theory. We study the linearized excitations around the AdS3 background and find that at a specific value of a certain combination of the two mass parameters (chiral line), one of the massive graviton solutions becomes...

A 2-cover is a multiset of subsets of [n] := {1, 2, . . . , n} such that each element of [n] lies in exactly two of the subsets. A 2-cover is called proper if all of the subsets of distinct, and is called restricted if any two of them intersect in at most one element. In this paper we find asymptotic enumerations for the number of line graphs on n-labelled vertices and for 2-covers. We find tha...

In this paper we consider the problem of computing the weak visibility polygon of any query line segment pq (or WVP(pq)) inside a given polygon P . Our first non-trivial algorithm runs in simple polygons and needs O(n log n) time and O(n) space in the preprocessing phase to report WVP(pq) of any query line segment pq in time O(log n + |WVP(pq)|). We also give an algorithm to compute the weak vi...

We address the All-Pairs Shortest Paths (APSP) problem for a number of unweighted, undirected geometric intersection graphs. We present a general reduction of the problem to static, offline intersection searching (specifically detection). As a consequence, we can solve APSP for intersection graphs of n arbitrary disks in O ( n logn ) time, axis-aligned line segments in O ( n log log n ) time, a...

We give an algorithm for bichromatic line segment intersection counting that runs in O(n √ log n) time under the word RAM model via a reduction to dynamic predecessor search, offline point location, and offline dynamic ranking. This algorithm is the first to solve bichromatic line segment intersection counting in o(n log n) time.

Kolpakov and Kucherov proposed a variant of the Lempel-Ziv factorization, called the reversed Lempel-Ziv (RLZ) factorization (Theoretical Computer Science, 410(51):5365–5373, 2009). In this paper, we present an on-line algorithm that computes the RLZ factorization of a given string w of length n in O(n log n) time using O(n log σ) bits of space, where σ ≤ n is the alphabet size. Also, we introd...