To maximize the reliability of erasure coded objects in cloud storage, the optimal allocation is a challenging problem constrained with the node heterogeneities and erasure coding budgets. We model the optimal problem...
详细信息
ISBN:
(纸本)9781479932153
To maximize the reliability of erasure coded objects in cloud storage, the optimal allocation is a challenging problem constrained with the node heterogeneities and erasure coding budgets. We model the optimal problem from a combinatorial view under multiple constraints and propose an efficient search algorithm to find the most reliable allocation. The experiments are evaluated and analyzed including the optimal reliability, redundancy reduction and allocation pattern.
In recent years there is growing interest to the opinion mining applications in numerous areas of information and social science. In this paper we investigate main problems in opinion mining and sentiment analysis sys...
详细信息
In recent years there is growing interest to the opinion mining applications in numerous areas of information and social science. In this paper we investigate main problems in opinion mining and sentiment analysis systems development. We review examples of difficulties in process of opinion extraction and introduce essential multidimensionality of opinion mining. We carried out a series of experiments with different sentiment analyzers and classified main reasons of incorrect sentiment recognition.
Scale Invariance Feature Transform (SIFT) is quite suitable for image matching because of its invariance to image scaling, rotation and slight changes in illumination or viewpoint. However, due to high computation com...
详细信息
Scale Invariance Feature Transform (SIFT) is quite suitable for image matching because of its invariance to image scaling, rotation and slight changes in illumination or viewpoint. However, due to high computation complexity it's technically challenging to deploy SIFT in real time application situations. To address this problem, we propose CLSIFT, an OpenCL based highly speeded up and performance portable SIFT solution. Important optimization techniques employed in CLSIFT such as: (1) For less global memory traffic, independent logical functions are merged into the same kernel to reuse data. (2) loop buffers are introduced in for data and intermediate results reusing. (3)Task queue used to schedule threads in the same branch to remove branch divergences. (4) Data partition is based on the statics patterns for workload balance among workgroups. (5) Overlap of CPU time and better parallel strategies are used too. With all mentioned efforts, CLSIFT processes lena. jpg at 74.2 FPS and 43.4FPS respectively on NVidia and AMD GPUS, much higher than CPU's nearly 10 FPS and the known fastest SIFTGPU's 39.8 FPS and 13FPS. Moreover in a quantitative comparison approach we analyze those successful strategies beating SIFTGPU, a famous existing GPU implementation. Additionally, we observe and conclude that NVidia GPU achieves better occupancy and performance due to some factors. Finally, we summarize some techniques and empirical guiding principles that may be shared by other applications on GPU.
Model estimation is important for robotic grasping. Since in order to make a decision about how to grasp the object, the robot should know where the target is and what it looks like. In this paper we propose a method ...
详细信息
In this paper, we present a novel method for recognizing human actions in videos. The method applies the human pose based features to describe actions and models the conditional probability relationship between featur...
详细信息
To ensure high reliability and storage efficiency, erasure codes are preferred in storage systems. With the prevalent of distributed storage systems such as clouds storage, how to design a scalab.e and efficient erasu...
详细信息
ISBN:
(纸本)9781479932153
To ensure high reliability and storage efficiency, erasure codes are preferred in storage systems. With the prevalent of distributed storage systems such as clouds storage, how to design a scalab.e and efficient erasure-resilient code is challenging. We propose a scalab.e binary linear code to keep up with data growth which has the following properties. Given the group size k and the code block length n, the proposed code corrects any two bit erasures among the n bits. The redundancy overhead of the code is 2/(k + 2), and each data bit affects exactly 2 parity bits. As results of these properties, if a data bit is changed or added, only two parity bits need to be updated;and the recovery of an erasured bit requires accessing at most k other bits and the recovery of two erasured bits requires at most 2k other bits. We give the construction algorithm by the order expansion of regular graphs;moreover, we optimize the failure resilience during the construction procedure. Compared with existing codes, our proposed code has notable benefits in storage scalab.lity, redundancy overhead and I/O bandwidth. The deployment of the proposed code in distributed storage systems can be simple and practical.
This paper presents a new method to analyze system behavior. A software system is modeled by a Petri net, and then the Petri net is sliced into several parts based on T-invariant. It has been shown that the behavior o...
详细信息
Most software transactional memories employ optimistic concurrency control. A pessimistic semantics, however, is not without its benefits: its programming model is often much simpler to reason about and supports the e...
详细信息
A Web service specification can be quite complex, including multiple operations and various kinds of message exchange patterns. In this work, we focus on the problem of restructuring a Web service, which contains a pr...
详细信息
To enhance classification performance by making use of easily availab.e unlab.lled data to overcome the scarcity of lab.lled data, this paper proposes an Embedded Co-Adaboost algorithm that integrates multi-view learn...
详细信息
暂无评论