The DIRECT approach for 3-D Time-of-Flight (TOF) PET reconstruction performs all iterative predictor-corrector operations directly in image space. A computational bottleneck here is the convolution with the long TOF (...
详细信息
The DIRECT approach for 3-D Time-of-Flight (TOF) PET reconstruction performs all iterative predictor-corrector operations directly in image space. A computational bottleneck here is the convolution with the long TOF (resolution) kernels. Accelerating this convolution operation using GPUs is very important especially for spatially variant resolution kernels, which cannot be efficiently implemented in the Fourier domain. The main challenge here is the memory cache performance at non-axis aligned directions. We devised a scheme that first re-samples the image into an axis-aligned orientation offering good memory coherence for the convolution operations. In order to maintain good accuracy, we carefully design the resampling and new convolution kernels to combine into the original TOF kernel. This paper demonstrates the validity, accuracy, and high speed-performance of our scheme for a comprehensive set of orientation angles. Future work will apply these cascaded kernels within a GPU-accelerated version of DIRECT.
With the introduction of mobile Ad hoc networks (MANETs), nodes are able to participate in a dynamic network which lacks an underlying infrastructure. Before two nodes agree to interact, they must trust that each will...
详细信息
With the introduction of mobile Ad hoc networks (MANETs), nodes are able to participate in a dynamic network which lacks an underlying infrastructure. Before two nodes agree to interact, they must trust that each will satisfy the security and privacy requirements of the other. In this paper, using the cognition inspired method from the brain informatics (BI), we present a novel approach to improving the search efficiency and scalability of MANETs by clustering nodes based on cognitive trust mechanism. The trust relationship is formed by evaluating the level of trust using Bayesian statistic analysis, and clusters can be formed and maintained autonomously by nodes with only partial knowledge. Simulation experiments show that each node can form and join proper clusters, which improve the interaction performance of the entire network. The essence of the underlying reason is analyzed through the theory of complex networks, revealing great scalability of this method.
Steganography is an important research direction of information security, which mainly research how to embed secret information into carriers, in order to achieve the objectives of secure communication. In this paper,...
详细信息
The advent of GPGPU technologies has allowed for sensible speed-ups in many high-dimension, memory-intensive computational problems. In this paper we demonstrate the effectiveness of such techniques by describing two ...
详细信息
This paper describes a supervised reinforcement learning-based model for discrete environment domains. The model was tested within the domain of backgammon game. Our results show that a supervised actor-critic based l...
详细信息
Scalar product protocol and privacy preserving add to multiply protocol (PPAtMP) are two significant basic secure multiparty computation protocols. In this paper, we claim that the two protocols are equivalent to each...
详细信息
Currently, Java has been gradually applied in embedded real-time area with the improvement by the Real-Time Specification for Java (RTSJ). Accordingly, a hardware Java execution engine for embedded real-time applicati...
详细信息
This paper proposes the virtual honeynet collaboration system (VHS) to improve the designs and concepts of the honeynet architectures. Using virtualization technologies (VTs) as a development platform, the proposed ap...
详细信息
As computational clusters rapidly grow in both size and complexity, system reliability and, in particular, application resilience have become increasingly important factors to consider in maintaining efficiency and pr...
详细信息
ISBN:
(纸本)9781605589428
As computational clusters rapidly grow in both size and complexity, system reliability and, in particular, application resilience have become increasingly important factors to consider in maintaining efficiency and providing improved computational performance over predecessor systems. One commonly used mechanism for providing application fault tolerance in parallel systems is the use of checkpointing. By making use of a multi-cluster simulator, we study the impact of sub-optimal checkpoint intervals on overall application efficiency. By using a model of a 1926 node cluster and workload statistics from Los Alamos National Laboratory to parameterize the simulator, we find that dramatically over-estimating the AMTTI has a fairly minor impact on application efficiency while potentially having a much more severe impact on user-centric performance metrics such a queueing delay. We compare and contrast these results with the trends predicted by an analytical model. Copyright 2010 ACM.
More and more network applications have appeared in recent years. Government, university, industry and individual Internet users and network services need more bandwidth and various network applications. Many new netw...
详细信息
暂无评论