in this paper, the security of a distance bounding protocol is analyzed which has been recently proposed by jannati and falahati (so-called jf). we prove that an adversary can recover key bits of jf protocol with probability of “1” while the complexity of attack is “2n” runs of protocol. in addition, we propose an improved protocol and prove that the improved protocol is resistant to mafia frau...

Point cloud data with high accuracy and density is an important source for the depiction of real ground objects, there a broad research prospect using point directly 3D object detection recognition deep learning methods. However, many models in previous ignored structure information sampling randomness. To overcome this limitation, we proposed innovative model, namely, minimum bounding box over...

Oriented bounding box (OBB) hierarchies can be used instead of based on axis-aligned boxes (AABB), providing tighter fitting to the underlying geometric structures and resulting in improved interference tests, such as ray-geometry intersections. In this paper, we present a method for fast, parallel transformation an existing volume hierarchy (BVH), AABBs, into oriented boxes. To end, parallelis...

We address the model checking problem of omega-regular linear-time properties for shared memory concurrent programs modeled as multi-pushdown systems. We consider here boolean programs with a finite number of threads and recursive procedures. It is well-known that the model checking problem is undecidable for this class of programs. In this paper, we investigate the decidability and the complex...