Most existing hashing methods adopt some projection functions to project the original data into several dimensions of real values, and then each of these projected dimensions is quantized into one bit (zero or one) by...
详细信息
ISBN:
(纸本)9781627480031
Most existing hashing methods adopt some projection functions to project the original data into several dimensions of real values, and then each of these projected dimensions is quantized into one bit (zero or one) by thresholding. Typically, the variances of different projected dimensions are different for existing projection functions such as principal component analysis (PCA). Using the same number of bits for different projected dimensions is unreasonable because larger-variance dimensions will carry more information. Although this viewpoint has been widely accepted by many researchers, it is still not verified by either theory or experiment because no methods have been proposed to find a projection with equal variances for different dimensions. In this paper, we propose a novel method, called isotropic hashing (IsoHash), to learn projection functions which can produce projected dimensions with isotropic variances (equal variances). Experimental results on real data sets show that IsoHash can outperform its counterpart with different variances for different dimensions, which verifies the viewpoint that projections with isotropic variances will be better than those with anisotropic variances.
We propose a new cryptographic notion called accountable decryption by which, given a ciphertext, a decryptor proves both the correctness of his decryption and the plaintext authenticity to a public verifier. We defin...
详细信息
This paper describes a map matching program submitted to the ACM SIGSPATIAL Cup 2012. We first summarize existing map matching algorithms into three categories, and compare their performance thoroughly. In general, gl...
详细信息
Opportunistic routing emerged as a novel technique to cope with the problem of highly unpredictable and lossy wireless channels in urban wireless mesh networks. However, existing opportunistic routing protocols only c...
详细信息
Virtual machine (VM) based state machine approaches, i.e. VM replication, provide high availability without source code modifications, unfortunately, existing VM replication approaches suffer from excessive replicatio...
详细信息
Spectra attacks proposed recently are more data efficient than algebraic attacks against stream cipher. They are also time-and-space efficient. A measurement of the security of a stream cipher against spectra attacks ...
详细信息
Unsegmented network coding was incorporated into opportunistic routing to improve inefficient schedule of segmented network coding due to delayed feedback. However, most unsegmented network coding schemes fail to cons...
详细信息
ISBN:
(纸本)9781467304375;9781467304368
Unsegmented network coding was incorporated into opportunistic routing to improve inefficient schedule of segmented network coding due to delayed feedback. However, most unsegmented network coding schemes fail to constrain the size of decoding window. Large decoding window not only challenges limited computational ability and decoding memory in practical environments, but also introduces large decoding delay, which is undesirable in delay sensitive applications. In this paper, we prove that the possibility of unacceptably large decoding window is innegligible, and verify the necessity of handling decoding window. To solve the issue, we argue that the number of unknown packets injected into the network must be strictly constrained at the source. Based on the idea, we improve unsegmented network coding scheme for opportunistic routing. Simulation results shows that the solution is robust to losses. In addition, to achieve optimal throughput, the redundancy factor should be selected larger than the reciprocal of end-to-end delivery ratio.
Multi-socket Multi-core architectures with shared caches in each socket have become mainstream when a single multi-core chip cannot provide enough computing capacity for high performance computing. However, traditiona...
详细信息
ISBN:
(纸本)9781450313162
Multi-socket Multi-core architectures with shared caches in each socket have become mainstream when a single multi-core chip cannot provide enough computing capacity for high performance computing. However, traditional task-stealing schedulers tend to pollute the shared cache and incur severe cache misses due to their randomness in stealing. To address the problem, this paper proposes a Cache Aware Task-Stealing (CATS) scheduler, which uses the shared cache efficiently with an online profiling method and schedules tasks with shared data to the same socket. CATS adopts an online DAG partitioner based on the profiling information to ensure tasks with shared data can efficiently utilize the shared cache. One outstanding novelty of CATS is that it does not require any extra user-provided information. Experimental results show that CATS can improve the performance of memory-bound programs up to 74.4% compared with the traditional task-stealing scheduler. Copyright 2012 ACM.
Fatigue is the most important reason leading to traffic accidents. In order to ensure traffic safety, various methods based on electroencephalogram (EEG) are proposed. But most of them, either regression or classifica...
详细信息
In this paper, we propose a novel system to analyze vigilance level combining both video and Electrooculography (EOG) features. For one thing, the video features extracted from an infrared camera include percentage of...
详细信息
暂无评论