Fast searching of the nearest neigbors in unordered point clouds is a very common task. This article presents a new parallel method tested on graph layout algorithm. Graphs in computer science are widely used in social network analysis, computer networks, transportation networks, and many other areas. In general, they can visualize relationships between objects. However, fast drawing of graphs […]

Natural or man-made disasters can cause huge losses of human life and property. One of the effective and widely used response and mitigation strategies for these disasters is traffic evacuation. Evacuation destination choice is critical in evacuation traffic planning and management. In this paper, we propose a partially random destination allocation strategy for evacuation management. […]

Due to their unique physical properties, physically unclonable functions (PUF) have been proposed widely as versatile cryptographic primitives. It is desirable that silicon PUF circuits should be lightweight, i.e., have low-hardware resource requirements. However, it is also of primary importance that such demands of low hardware overhead should not compromise the security aspects of PUF […]

With the advancement in high performance applications and building of low cost computing resources, resource allocation to tasks in Grid Computing has became one of the most critical job. If resource allocation is done properly, it can lead to high performance throughput. This paper analyzes the Windows based Grid toolkit – SCADY (Scalable and Dynamic) […]