This paper presents a method with which 3D images of tire track and footprint impressions at crime scenes can be captured with high fidelity, while capturing high resolution 2D color texture images simultaneously. The resulting device is portable, easy to use, is non-destructive of the evidence, and saves time at crime scenes. The same technique can also be used in the laboratory to create 3D d...

Due to the amount of data nowadays, automatic detection, classification and visualization of features is necessary for a thorough inspection of flow data sets. Pattern matching using vector valued templates has already been applied successfully for the detection of features. In this paper, the approach is extended to automatically compute feature based segmentations of flow data sets. Different...

In this paper, we extend Jones’ result—that cons-free programming with kth-order data and a callby-value strategy characterises EXPTIME—to a more general setting, including pattern-matching and non-deterministic choice. We show that the addition of non-determinism is unexpectedly powerful in the higher-order setting. Nevertheless, we can obtain a non-deterministic parallel to Jones’ hierarchy r...

Reduction rules in interaction nets are constrained to pattern match exactly one argument at a time. Consequently, a programmer has to introduce auxiliary rules to perform more sophisticated matches. In this paper, we describe the design and implementation of a system for interaction nets which allows nested pattern matching on interaction rules. We achieve a system that provides convenient way...

Context and lattice orbifolds have been discussed by M. Zickwolff [1,2], B. Ganter and D. Borchmann[3,4]. Preordering the folding automorphisms by set inclusion of their orbits gives rise to further development. The minimal elements of this preorder have a prime group order and any group element can be dissolved into the product of group elements whose group order is a prime power. This contrib...

Interpretation

We investigate the problem of deterministic pattern matching in multiple streams. In this model, one symbol arrives at a time and is associated with one of s streaming texts. The task at each time step is to report if there is a new match between a fixed pattern of length m and a newly updated stream. As is usual in the streaming context, the goal is to use as little space as possible while sti...

We show how, given a straight-line program with g rules for a binary string B of length n, in O ( gn ) time we can build a (2nH0(B)+ o(n))-bit index such that, given m and c, in O(1) time we can determine whether there is a substring of B with length m containing exactly c copies of 1. If we use O(n log n) bits for the index, then we can list all such substrings using O(m) time per substring.