Relay attacks pose a serious security threat to wireless systems, such as, contactless payment keyless entry or smart access control systems. Distance bounding protocols, which allow an entity not only authenticate another but also determine whether it is physically close by, effectively mitigate relay attacks. However, secure implementation of distance especially the time critical challenge-re...

We present novel parallel algorithms for collision detection and separation distance computation for rigid and deformable models that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data parallelism to perform fast hierarchy construction, updating, and traversal using tight-fitting bounding volumes such as oriented bounding boxes (OBB) and rectangular swep...

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...

We produce the first example of bounding total variation distance to stationarity and estimating mixing times via orthogonal polynomials diagonalization of discrete reversible Markov chains, the Karlin-McGregor approach.

As Alice inserts her card, Bob sends a message to his accomplice, Carol, who is about to pay $2 000 for a expensive diamond ring at honest Dave’s jewellery shop. Carol inserts a counterfeit card into Dave’s terminal. This card is wired to a laptop in her backpack, which communicates with Bob’s laptop using mobile phones. The data to and from Dave’s terminal is relayed to the restaurant’s counte...

Worst-case execution time (WCET) analysis is critical for hard real-time systems to ensure that different tasks can meet their respective deadlines. While significant progress has been made for WCET analysis of instruction caches, the data cache timing analysis, especially for setassociative data caches, is rather limited. This paper proposes an approach to safely and tightly bounding data cach...

Let (A;B;C) be a triple of matrices representing a time-invariant linear system _ x(t) = Ax(t) +Bu(t) y(t) = Cx(t) under similarity equivalence, corresponding to a realization of a prescribed transfer function matrix. In this paper we measure the distance between a irreducible realization, that is to say a controllable and observable triple of matrices (A;B;C) and the nearest reducible one that...

3D model retrieval techniques can be classified as histogram-based, view-based and graph-based approaches. We propose a hybrid shape descriptor which combines the global and local radial distance features by utilizing the histogram-based and view-based approaches respectively. We define an area-weighted global radial distance with respect to the center of the bounding sphere of the model and en...