Bounding contours of physical objects are often fragmented by other occluding objects. Long-distance perceptual grouping seeks to join fragments belonging to the same object. Approaches to grouping based on invariants assume objects are in restricted classes, while those based on minimal energy continuations assume a shape for the missing contours and require this shape to drive the grouping pr...

For large, highly detailed models, Monte Carlo simulations may spend a large fraction of their run-time performing simple point location and distance to surface calculations for every geometric component in a model. In such cases, the use of bounding boxes (axis-aligned boxes that bound each geometric component) can improve particle tracking efficiency and decrease overall simulation run time s...

In this paper, we show that many formal and informal security results on distance-bounding (DB) protocols are incorrect/ incomplete. We identify that this inadequacy stems from the fact that the pseudorandom function (PRF) assumption alone, invoked in many security claims, is insufficient. To this end, we identify two distinct shortcomings of invoking the PRF assumption alone: one leads to dist...

In many scientific, engineering or multimedia applications, complex distance functions are used to measure similarity accurately. Furthermore, there often exist simpler lower-bounding distance functions, which can be computed much more efficiently. In this paper, we will show how these simple distance functions can be used to parallelize the density-based clustering algorithm DBSCAN. First, the...

Let K be the set of all oriented knots up to isotopy. There are several distance functions on K, such as the Gordian distance and the ♯-Gordian distance [9]. In general, given an ‘unknotting operation’, that is, a method to untie every knot, such as the ∆-unknotting operation introduced by S. Matveev [8] (see also [10]), one can define the corresponding distance function as the minimal number o...

Abstract According to their strength, the tracing properties of a code can be categorized as frameproof, separating, IPP and TA. It is known that, if minimum distance larger than certain threshold then TA property implies rest. Silverberg et al. ask there some kind capability left when falls below threshold. Under different assumptions, several papers have given negative answer question. In thi...

We show how to use affine arithmetic to represent a parametric curve with a strip tree. The required bounding rectangles for pieces of the curve are computed by exploiting the linear correlation information given by affine arithmetic. As an application, we show how to compute approximate distance fields for parametric curves.

This thesis studies several approaches to bounding the total variation distance of a Markov chain, focusing primarily on the strong stationary time approach. While strong stationary times have been used successfully with uniform walks on groups, non-uniform walks have proven harder to analyze. This project applied strong stationary techniques to simple non-uniform walks in the hope of finding s...

the present paper is devoted to a new critical state based plasticity model able to predict drained and undrained behaviour of granular material. it incorporates a bounding surface plasticity model describing in multilaminate framework to capitalize on advantages of this mathematical framework. most of the models developed using stress/strain invariants are not capable of identifying the parame...