This paper presents a fully parallelized and scalable RNS Montgomery multiplier over binary *** generalizing the RNS Montgomery Multiplication (RNS MM) and pseudo-Mersenne-like numbers, we are able to obtain a conside...
详细信息
This paper presents a fully parallelized and scalable RNS Montgomery multiplier over binary *** generalizing the RNS Montgomery Multiplication (RNS MM) and pseudo-Mersenne-like numbers, we are able to obtain a considerably high speed in our FPGA implementation experiments with acceptable circuit area and modest critical path ***, this design can be easily scalable by adjusting a variety of field sizes and field polynomials.
In order to solve the efficiency problem about the data-intensive query join in cloud computing environment, a Shrink-Semis Join for Cloud Computing(SSJFCC) method for data-intensive was proposed. This paper firstly a...
详细信息
In order to solve the efficiency problem about the data-intensive query join in cloud computing environment, a Shrink-Semis Join for Cloud Computing(SSJFCC) method for data-intensive was proposed. This paper firstly analyzed and compared the bottlenecks of existing query join algorithm in the cloud computing environment. Secondly, aiming to shrink semi-results data from join process, five algorithms of SSJFCC method were designed. Finally, the improvement method had been implemented based on Hadoop framework. Experiments show that this method significantly reduced the network transmission data quantity and join computing time-consuming, and improved the data-intensive query efficiency.
This paper deals with the recently investigated physical field model in wireless sensor network without additional infrastructure for location estimation, i.e. passive localization, in the form of partial differential...
详细信息
This paper deals with the recently investigated physical field model in wireless sensor network without additional infrastructure for location estimation, i.e. passive localization, in the form of partial differential equation (PDE) by employing the temperature distribution in the field. This novel framework can be defined into two steps. In the first step, the estimation algorithm of sensor node localization problem using finite element method (FEM) has been employed to obtain the solution based on physical phenomena (e.g., temperature) governed by discretizing the 1-D heat equation. In the second step, under consideration of uncertainty both occurring in the system and arising from noisy measurements, a refinement technique, i.e. Kalman filter, is incorporated to improve the accuracy of error analysis by reconstruction and prediction of temperature distribution. The computational results illustrate that the significant effect and better accuracy using elegant finite element approach and Kalman filter technique by means of simulation results.
A fast inverted index based algorithm is introduced for multi-class action recognition. At first, we compute the shape-motion features of the automatically localized actor. Secondly, a binary state tree is built by hi...
详细信息
ISBN:
(纸本)9781479923427
A fast inverted index based algorithm is introduced for multi-class action recognition. At first, we compute the shape-motion features of the automatically localized actor. Secondly, a binary state tree is built by hierarchically clustering of the extracted features, and the action states are the cluster centers. Then videos are represented as sequences of states by searching the state binary tree. With the labeled state sequences, we create the inverted index tables. During testing, the state and the state transition scores are computed by querying the inverted index tables. With the learned weight, we compute an action recognition score vector. The recognized action class is the index of the maximum score element. Our key contribution is that we propose a fast inverted index based multi-class action recognition approach. Experiments on several challenging data sets confirm the performance of this approach.
This paper discusses the use of Self-organizing map (SOM) for color-space image compression. Two types of compressions, i.e., color and space compressions, are carried out by SOM. The feasibility of the proposed compr...
详细信息
This paper discusses the use of Self-organizing map (SOM) for color-space image compression. Two types of compressions, i.e., color and space compressions, are carried out by SOM. The feasibility of the proposed compression method is verified by computer simulation. By applying both color and space compression, higher compression is achieved. In addition, the proposed compression system is implemented in hardware using a hardware SOM. The system is designed by using VHDL, and operation of the system is verified by FPGA implementation. Experimental result shows that the maximum clock frequency of this system is 26 MHz, and a single image is compressed with 25.2 ms, which yields 39.7 fps.
Feature level fusion is one of the most important techniques, used to improve the performance of a face recognition system. This paper presents an approach of fusion of directional spatial discriminant features for fa...
详细信息
Feature level fusion is one of the most important techniques, used to improve the performance of a face recognition system. This paper presents an approach of fusion of directional spatial discriminant features for face recognition. The key idea of the proposed method is to fuse the facial features lie along the horizontal, vertical and diagonal directions. So that this fused feature vector can contain more discriminant information than the individual facial feature lie along single direction. However due to fusion the size of fused feature vector is become larger which may increase complexity of the classifier. To optimize this lower dimensional discriminant features are again extracted from this large fused feature vector. In our experiment, we apply G-2DFLD method on the original images to extract the discriminant features. Then original images are converted into diagonal images and another set of discriminant features, representing the diagonal information, are extracted by using the G-2DFLD method. The original and diagonal features vectors are then fused to form a large feature vector. The dimension of this large fused feature vector is then reduced by PCA method and this resultant reduced feature vector is used for classification and recognition by Radial Basis Function-Neural Networks (RBF-NN). Experiments on the AT&T (formally known as ORL database) face database indicate the competitive performance of the proposed method, as compared to some existing subspaces-based methods. Click here and insert your abstract text.
Conservation of the energy available in each sensor node and increasing network lifetime are most important design issues for a wireless sensor network(WSN). Many routing algorithms have been developed in this regar...
详细信息
Conservation of the energy available in each sensor node and increasing network lifetime are most important design issues for a wireless sensor network(WSN). Many routing algorithms have been developed in this regard. Out of all these, clustering algorithms have gained a lot of importance in increasing the network lifetime thereby the efficiency of the nodes in it. Clustering provides an effective way for prolonging the lifetime of WSN. This paper elaborately compares the two renowned routing protocols namely, LEACH and EAMMH supported by simulations scenarios, and analysis of the results against known metrics with energy and network lifetime being major among them.
Most multicast data origin authentication schemes work under the fixed parameters without taking the problem of changeable network environment into ***,the network conditions will obviously influence the efficiency of...
详细信息
Most multicast data origin authentication schemes work under the fixed parameters without taking the problem of changeable network environment into ***,the network conditions will obviously influence the efficiency of a protocol such as the time delay and the overhead considering the packet loss rate or something *** adjusting the parameters adaptively to achieve the ideal state with the dynamic network is *** achieve a high authentication rate and adapt to the changeable and unstable network environment,we proposed a multicast data origin authentication protocol which is adaptive depending on the packet error rates as well as the time delay,and is robust against the packet loss and *** model can estimate a more appropriate packet error rate and make the time delay lower according to the feedback values got from the receivers using the Markov chain so that it can be ***’s more,the IDA (Information Dispersal Algorithm) and the Merkle HASH tree are also combined to resist the packet loss or *** strategy is especially efficient in terms of not only the adaptation of dynamic network but also the shortcut of overhead and delay,because the reliable intelligent algorithm is included in and only the necessary parts are involved in to authenticate.
Since the cost of RFID tags reducing constantly, the scale of its applications enlarges in industries and extends to various fields in our daily work and life. However, due to the openness of RFID, it owns a high atta...
详细信息
Since the cost of RFID tags reducing constantly, the scale of its applications enlarges in industries and extends to various fields in our daily work and life. However, due to the openness of RFID, it owns a high attack risk when applied. This paper presents a model based on AES and ECC, which can protect users' privacy and implement access controls. This model takes advantage of both the virtues of a symmetric encryption algorithm and asymmetric encryption algorithm, encrypting AES key with ECC and empowering the client to encrypt system's ECC public key by using an ECC private key.
Learning to rank became a hot research topic in recent years and utilizing relational information in list-wise algorithms was discovered to be valuable and was widely adopted in various algorithms. These algorithms...
详细信息
暂无评论