To highlight the saliency object clearly from the foreground, we propose a saliency detection method based on global contrast with cluster. Due to the fact that background pixels usually have similar patches, we use c...
详细信息
Systematic polar codes are proposed by Arikan and are shown to have better BER performance than non-systematic polar codes. From a recursive decomposition of the generator matrix of polar codes, Arikan showed that the...
详细信息
Systematic polar codes are proposed by Arikan and are shown to have better BER performance than non-systematic polar codes. From a recursive decomposition of the generator matrix of polar codes, Arikan showed that the encoding complexity of systematic polar codes is also O(N log N) where N is the code block length. But the recursive process involves some additional calculations in transforming the problem instances back and forth. In this paper, by using the sparsity property of the generator matrix, we propose an encoding process which has the same complexity as non-systematic polar codes in the presence of an additional memory array. Without the additional memory elements, the number of additions of the proposed encoding process increases compared with non-systematic polar codes. We also provide an analysis to quantify this additional increase of the complexity.
As one of typical paravirtualization hypervisors, Xen has received widespread attentions especially its scaling capability under some kinds of workload. In this paper, we focus on the problem that the most CPU resourc...
详细信息
As one of typical paravirtualization hypervisors, Xen has received widespread attentions especially its scaling capability under some kinds of workload. In this paper, we focus on the problem that the most CPU resources are occupied by frequent interrupt from the NIC(Network Interface Card) and it will cause bottleneck of the system for Xen. To alleviate this problem, this paper proposes an adaptive interrupt latency scheduling mechanism based on XEN, which use the polling or interrupt method in accordance with the queue length of virtual buffer without supplementing any additional processing unit. Also, the method can guarantee different quality of service to some extent by means of the definition of the two types of priority virtual buffers. Simulation results show that the mechanism can reduce CPU overhead significantly and improve system performance effectively.
In this paper, we investigate a typical clustering technology, namely, Gaussian mixture model (GMM)-based approach, for user interest prediction in social networks. The establishment of the model follows the following...
详细信息
In this paper, we investigate a typical clustering technology, namely, Gaussian mixture model (GMM)-based approach, for user interest prediction in social networks. The establishment of the model follows the following process: collect dataset from 4613 users and more than 16 million messages from Sina Weibo, obtain each user's interest eigenvalue sequence and establish GMM model to clustering users. In theory and experiment, this approach is feasible. The GMM-based approach considers the prediction accuracy and consuming time. A series of experiments are conducted to validate the feasibility and efficiency of the proposed solution and whether it can achieve a higher accuracy of prediction compared with other approaches, such as SVM and K-means. Further experiments show that GMM-based approach could produce higher prediction accuracy of 93.9%, thus leveraging computation complexity.
In this paper, we proposed a hybrid image data hiding method used for watermarking applications in order to make sure the hidden dual watermarks survive after the image manipulation and enhancement processes. To achie...
详细信息
With the rapid growth of data volume, knowledge acquisition for big data has become a new challenge. To address this issue, the hierarchical decision table is defined and implemented in this work. The properties of di...
详细信息
ISBN:
(纸本)9781467372220
With the rapid growth of data volume, knowledge acquisition for big data has become a new challenge. To address this issue, the hierarchical decision table is defined and implemented in this work. The properties of different hierarchical decision tables are discussed under the different granularity of conditional attributes. A novel knowledge acquisition algorithm for big data using MapReduce is proposed. Experimental results demonstrate that the proposed algorithm is able to deal with big data and mine hierarchical decision rules under the different granularity.
Hadoop/MapReduce has emerged as a de facto programming framework to explore cloud-computing *** has many configuration parameters,some of which are crucial to the performance of MapReduce *** practice,these parameters...
详细信息
ISBN:
(纸本)9783319271392
Hadoop/MapReduce has emerged as a de facto programming framework to explore cloud-computing *** has many configuration parameters,some of which are crucial to the performance of MapReduce *** practice,these parameters are usually set to default or inappropriate values.
Differential Evolution (DE) algorithm is a kind of intelligent algorithm based on natural evolution over the past few decades, which shows better optimization performance on some classical benchmark problems. However,...
详细信息
As the third-generation neural network technology, pulse coupled neural network (PCNN) had used in many fields successfully, but it hindered its popularize that so many parameters of the PCNN need to be set up. This p...
详细信息
We propose a model for a class of web services which are powered by relational databases and annotated by social commitment. Our model can be viewed as an extension of WSDL specification where schemas of service opera...
详细信息
暂无评论