We propose a learning method with feature selection for Locality-Sensitive Hashing. Locality-Sensitive Hashing converts feature vectors into bit arrays. These bit arrays can be used to perform similarity searches and personal authentication. The proposed method uses bit arrays longer than those used in the end for similarity and other searches and by learning selects the bits that will be used....

This paper will focus on improving the performance of orthogonal frequency division multiplexing (OFDM) in Rayleigh fading environments. The proposed technique will use a previously published method that has been shown to improve OFDM performance in independent fading, based on ordered sub-carrier selection. Then, a simple non-iterative method for finding the optimal bit-loading allocation was ...

Abstract This paper addressed the energy-efficient resource management problem of an amplify-and-forward relay-assisted bidirectional relay system under a quality-of-service (QoS) constraint. The objective is to develop holistic algorithm for joint implementation selection, power adaptation and bit-rate optimal energy efficiency (EE). A three-stage approach proposed solve problem. At stage 1 (s...

In order to solve the bit front rake angle parameter selection problem of under different coal rock, it is proposed in polycrystalline diamond compact no core bit as the research object, and established a bit compact two-dimensional stress model of cutting teeth. The result shows that the front rake angle is the factor of cutting force and the drilling efficiency. Application of Solid Works sim...

An optimized memory organization has been designed for the hierarchical coding of wavelet subbands. A better economy in time and resources can be accomplished by changing the RAM access pattern and using multiple location access at each clock instant. The bit-planes are distributed along the z-direction and the x − y plane contains 256 × 256 number of memory elements. The memory plane selection...

It is well known that unconditionally secure bit commitment is impossible even in the quantum world. In this paper a weak variant of quantum bit commitment, introduced independently by Aharonov et al. [2] and Hardy and Kent [8] is investigated. In this variant, the parties require some nonzero probability of detecting a cheating, i.e. if Bob, who commits a bit b to Alice, changes his mind durin...