Distance bounding is often proposed as a countermeasure to relay attacks and distance fraud in RFID proximity identification systems. Although several distance-bounding protocols have been proposed the security of these proposals are dependent on the underlying communication channel. Conventional communication channels have been shown to be inappropriate for implementing distance bounding, as t...

In this paper a new model-based optimizing controller for a set of nonlinear systems is proposed. The nonlinear model set is based on a convex combination of two bounding linear models. An optimal control sequence is computed for each of the two bounding models. The proposed control algorithm is based on a convex combination of the two control sequences. A novel feature in these two optimizatio...

The management of geometric objects is a prime example of an application where efficiency is the bottleneck; this bottleneck cannot be eliminated without using suitable access structures. The most popular approach for handling complex spatial objects in spatial access methods is to use their minimum bounding boxes as a geometric key. Obviously , the rough approximation by bounding boxes provide...

The attractors of Iterated Function Systems in Euclidean space IFS fractals have been the subject of great interest for their ability to visually model a wide range of natural phenomena. Indeed computer-generated plants are often modeled using 3D IFS fractals, and thus their extent in virtual space is a fundamental question, whether for collision detection or ray tracing. A great variety of alg...

In this paper we present an algorithm for 3-D orthogonal drawing of arbitrary degree n-vertex m-edge multigraphs with O(m 2 = p n) bounding box volume and 6 bends per edge route. This is the smallest known bound on the bounding box volume of 3-D orthogonal multigraph drawings. We continue the study of the tradeoo between bounding box volume and the number of bends in orthogonal graph drawings t...

In this paper, we present a new approach to conservative bounding of displaced Bézier patches. These surfaces are expected to be a common use case for tessellation in interactive and real-time rendering. Our algorithm combines efficient normal bounding techniques, min-max mipmap hierarchies and oriented bounding boxes. This results in substantially faster convergence for the bounding volumes of...

A novel tracking algorithm that can track a highly non-rigid target robustly is proposed using a new bounding box representation called the Double Bounding Box (DBB). In the DBB, a target is described by the combination of the Inner Bounding Box (IBB) and the Outer Bounding Box (OBB). Then our objective of visual tracking is changed to find the IBB and OBB instead of a single bounding box, wher...

As our world gets more networked, ever increasing amounts of information are being stored in LDAP directories. While LDAP directories have considerable exibility in the modeling and retrieval of information for network applications, the notion of schema they provide for enabling consistent and coherent representation of directory information is rather weak. In this paper, we propose an expressi...

Most contemporary object detection approaches assume each object instance in the training data to be uniquely represented by a single bounding box. In this paper, we go beyond this conventional view by allowing an object instance to be described by multiple bounding boxes. The new bounding box annotations are determined based on the alignment of an object instance with the other training instan...

This paper presents an algorithm of hybrid collision detection. Firstly, the algorithm establishes sphere and OBB level bounding box for every model in virtual scene and then uses intersect test of sphere bounding box to exclude not intersect model. Between two model of maybe the intersection, it uses not intersect part of intersect test excluding model of OBB bounding box, reducing PSO searchi...