We consider unidirectional data streams with restricted access, such as read-only and write-only streams. For read-write streams, we also introduce a new complexity measure called expansion, the ratio between the space used on the stream and the input size. We give tight bounds for the complexity of reversing a stream of length n in several of the possible models. In the read-only and write-onl...

Let S be a planar n-point set. A triangulation for S is a maximal plane straight-line graph with vertex set S. The Voronoi diagram for S is the subdivision of the plane into cells such that each cell has the same nearest neighbors in S. Classically, both structures can be computed in O(n logn) time and O(n) space. We study the situation when the available workspace is limited: given a parameter...

Revisiting Penal Substitution Kevin D. Kennedy Assistant Professor of Theology Southwestern Baptist Theological Seminary 2001 W. Seminary Drive Fort Worth, Texas 76115 Jesus paid it all, all to Him I owe; Sin had left a crimson stain, He washed it white as snow. Evangelicals, in their preaching as well as their worship, have recognized that the cross of Christ is central to the life of the beli...

This paper presents a novel extension to the process tree model to support cancelation behavior, and proposes a novel process discovery technique to discover sound, fitting models with cancelation features. The proposed discovery technique relies on a generic error oracle function, and allows us to discover complex combinations of multiple, possibly nested cancelation regions based on observed ...

This paper addresses the problem of discovering a sound Workflow net (WFN) from sample event traces representing the behavior of a process. A current challenging problem deals with discovering a suitable model from incomplete logs since it is not possible to ensure that a log contains all executions of a process. A method that allows building WFN from logs including a reduced number of traces i...

The executability of rewriting logic makes it a compelling environment for language design and experimentation; the ability to interpret programs directly in the language semantics develops assurance that definitions are correct and that language features work well together. However, this executability raises new questions about language semantics that don’t necessarily make sense with non-exec...

The torrents of event data generated by today’s systems are an important enabler for process mining. However, at the same time, the size and variability of the resulting event logs are challenging for today’s process mining techniques. This paper focuses on “conformance checking in the large” and presents a novel decomposition technique that partitions larger processes into sets of subprocesses...

This paper discusses few approaches for mining erasable itemsets. In this paper, author decomposes the original problem into two smaller sub problems: First, Computing the gain of itemset and second is, Searching for erasable itemsets. The existing solutions based on horizontal data layout to this problem make repeated scans of database. Extensive studies proposed different strategies for effic...