We consider the problem of estimating the central direction of arrival (DOA) of a coherently distributed source. In this paper, the integral steering vector of coherently distributed source is deduced to be a Schur-Ha...
详细信息
ISBN:
(纸本)9780769538594
We consider the problem of estimating the central direction of arrival (DOA) of a coherently distributed source. In this paper, the integral steering vector of coherently distributed source is deduced to be a Schur-Hadamard product comprising point source steering vector and a real vector. And then a blind estimator based on second order statistics is proposed to estimate the central DOA without adopting any prior knowledge about the shape of angular signal intensity. The proposed method can be calculated analytically from the known signal model, so a closed-form solution to the central DOA estimation can be derived without any peak-finding searching and eigenvalue decomposition or singular value decomposition. In addition, the proposed algorithm can provide a more precise central DOA estimation using the maximum number of the second order statistics equal to the number of sensors and can give effective estimation even at low SNR. Simulation results show that the proposed method exhibits the attributes, an improved accuracy and a better robustness.
Previous works have projected that the peak performance of FPGAs can outperform that of the general purpose processors. However no work actually compares the performance between FPGAs and CPUs using the standard bench...
详细信息
ISBN:
(纸本)9780769537160
Previous works have projected that the peak performance of FPGAs can outperform that of the general purpose processors. However no work actually compares the performance between FPGAs and CPUs using the standard benchmarks such as the UNPACK benchmark. We propose and implement an FPGA-based hardware design of the UNPACK benchmark, the key step of which is LU decomposition with pivoting. We introduce a fine-grained pipelined LU decomposition algorithm that enables optimum performance by exploiting fine-grained pipeline parallelism. A scalable linear array of processing elements (PEs), which is the core component of our hardware design, is proposed to implement this algorithm. To the best of our knowledge, this is the first reported FPGA-based pipelined implementation of LU decomposition with pivoting. A total of 19 PEs can be integrated into an Altera Stratix II EP2S130F1020C5 on our self-designed development board. Experimental results show that the speedup up to 6.14 can be achieved relative to a Pentium 4 processor for the UNPACK benchmark.
In distributed Virtual Environment (DVE) systems, a distributed server infrastructure is often used to reduce the latency between servers and clients. Under this infrastructure, mapping clients to proper servers is on...
详细信息
ISBN:
(纸本)9780769538594
In distributed Virtual Environment (DVE) systems, a distributed server infrastructure is often used to reduce the latency between servers and clients. Under this infrastructure, mapping clients to proper servers is one of the key issues for improving the interactivity and overall performance. Most traditional methods of mapping the clients to servers only consider the load balancing problem. However, there are two other important aspects that should be involved: the physical world integrity and the virtual world integrity. In this work, we propose a novel mapping algorithm which takes care of all three aspects at the same time. The algorithm converts the mapping problem into cutting stage and matching stage to get optimal result with polynomial complexity. The experimental results show that our algorithm improves the overall performance of DVE systems significantly.
The proceedings contain 15 papers. The topics discussed include: dynamic resource-critical workflow scheduling in heterogeneous environments;decentralized grid scheduling with evolutionary fuzzy systems;analyzing the ...
ISBN:
(纸本)3642046320
The proceedings contain 15 papers. The topics discussed include: dynamic resource-critical workflow scheduling in heterogeneous environments;decentralized grid scheduling with evolutionary fuzzy systems;analyzing the EGEE production grid workload: application to jobs submission optimization;the resource usage aware backfilling;the gain of overbooking;modeling parallel system workloads with temporal locality;scheduling restartable jobs with short test runs;effects of topology-aware allocation policies on scheduling performance;contention-aware scheduling with task duplication;job admission and resource allocation in distributed streaming systems;scalability analysis of job scheduling using virtual nodes;competitive two-level adaptive scheduling using resource augmentation;and job scheduling with lookahead group matchmaking for time/space sharing on multi-core parallel machines.
Presents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved with the conference event and publication of the proceedings record.
Presents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved with the conference event and publication of the proceedings record.
G-BLAST is an integrated software package for BLAST searches can be operating in heterogeneous distributed environment. G-BLAST means Grid-BLAST. G-BLAST provides two operating methods like NFS (Network File System) b...
详细信息
ISBN:
(纸本)9780769537573
G-BLAST is an integrated software package for BLAST searches can be operating in heterogeneous distributed environment. G-BLAST means Grid-BLAST. G-BLAST provides two operating methods like NFS (Network File System) based and SDT (Socket Data Transfer) based in inter-connected network. SDT based method is simple to installation/operating because it provides more platform independence than NFS based method. To improve the performance of BLAST searches using exists computing resources, G-BLAST employed 'database splicing' and 'query splicing' methods. By default, G-BLAST querying into each client node for one query with one spliced database. But, if there are extra clients G-BLAST splice the query into sub-queries as extra client's number. Each client should contain over one spliced database to join G-BLAST. The scheduler monitor the status and the databases of each client node, the query is executing in parallel with not working client nodes. BLAST results are stored into Java Beans data model using XML technique in the server node. By user request, the result can be exported in BLAST's default output, XML format and tabular format. Also, BLAST results can be stored into database as given schema.
A deniable authentication allows the receiver to identify the source of the received messages but cannot prove it to any third party. However, the deniability of the content, which is called restricted deniability in ...
详细信息
A deniable authentication allows the receiver to identify the source of the received messages but cannot prove it to any third party. However, the deniability of the content, which is called restricted deniability in this paper, is concerned in electronic voting and some other similar application. At present, most non-interactive deniable authentication protocols cannot resist weaken key-compromise impersonation (W-KCI) attack. To settle this problem, a non-interactive identity-based restricted deniable authentication protocol is proposed. It not only can resist W-KCI attack but also has the properties of communication flexibility. It meets the security requirements such as correctness, restricted deniability as well. Therefore, this protocol can be applied in electronic voting.
暂无评论