Cloud computing provides a new paradigm for resource utilization and sharing. However, the reliability problems, like system failures, often happen in cloud systems and bring enormous loss. Trace-oriented monitoring i...
详细信息
Cloud computing provides a new paradigm for resource utilization and sharing. However, the reliability problems, like system failures, often happen in cloud systems and bring enormous loss. Trace-oriented monitoring is an important runtime method to improve the reliability of cloud systems. In this paper, we propose to bring runtime verification into trace-oriented monitoring, to facilitate the specification of monitoring requirements and to improve the efficiency of monitoring cloud systems. Based on a data set collected from a cloud storage system in a real environment, we validate our approach by monitoring the critical properties of the storage system. The preliminary experimental results indicate the promise of our approach.
Non-negative matrix factorization (NMF) reconstructs the original samples in a lower dimensional space and has been widely used in pattern recognition and data mining because it usually yields sparse representation. S...
详细信息
ISBN:
(纸本)9781479938414
Non-negative matrix factorization (NMF) reconstructs the original samples in a lower dimensional space and has been widely used in pattern recognition and data mining because it usually yields sparse representation. Since NMF leads to unsatisfactory reconstruction for the datasets that contain translations of large magnitude, it is required to develop translation NMF (TNMF) to first remove the translation and then conduct a decomposition. However, existing multiplicative update rule based algorithm for TNMF is not efficient enough. In this paper, we reformulate TNMF and show that it can be efficiently solved by using the state-of-the-art solvers such as NeNMF. Experimental results on face image datasets confirm both efficiency and effectiveness of the reformulated TNMF.
General purpose GPU's (GPGPU) appearance made it possible that heterogeneous computing can be used by human beings. And it's also produce a reform for GPU's general purpose computing and parallel computing...
详细信息
Link partition clusters edges of a complex network to discover its overlapping communities. Due to Its effectiveness, link partition has attracted much attentions from the network science community. However, since lin...
详细信息
Link partition clusters edges of a complex network to discover its overlapping communities. Due to Its effectiveness, link partition has attracted much attentions from the network science community. However, since link partition assigns each edge of a network to unique community, it cannot detect the disjoint communities. To overcome this deficiency, this paper proposes a link partition on asymmetric weighted graph (LPAWG) method for detecting overlapping communities. Particularly, LPAWG divides each edge into two parts to distinguish the roles of connected nodes. This strategy biases edges to a specific node and helps assigning each node to its affiliated community. Since LPAWG introduces more edges than those in the original network, it cannot efficiently detect communities from some networks with relative large amount of edges. We therefore aggregate the line graph of LPAWG to shrink its scale. Experimental results of community detection on both synthetic datasets and the realworld networks show the effectiveness of LPAWG comparing with the representative methods.
Image defogging (IDF) removes influences of fogs from an image to improve its quality. Since defogged images can significantly boost the performance of subsequent processing, IDF has attracted many attentions from the...
详细信息
Image defogging (IDF) removes influences of fogs from an image to improve its quality. Since defogged images can significantly boost the performance of subsequent processing, IDF has attracted many attentions from the computer vision community. However, existing IDF algorithms are built on the assumption that light is scattered once by a grain. Since such assumption is violated if images are contaminated by dense haze or heavy fog, traditional IDF algorithms often fail in this situation. In this paper, we propose a hybrid image defogging (HIDF) algorithm to overcome this deficiency. In particular, HIDF applies the single scattering physics model (SSPM) to pixels dominated by single scattering of light, and applies the multiple scattering physics model (MSPM) to remaining pixels. To distinguish two types of pixels, HIDF utilizes the optical thickness of corresponding pixels. If optical thickness is smaller than a threshold that determines whether the single scattering or the multiple scattering dominates, HIDF applies the SSPM, and HIDF applies the MSPM otherwise. Experimental results on several popular foggy images demonstrate that HIDF competes with the state-of-the-art algorithms, and show the promise of HIDF for defogging heavily foggy images.
As one of the most dangerous and common software vulnerabilities, null dereference often leads to program crashes. In this chapter we propose a human computation method to detect null dereference in a "frog and b...
详细信息
With the popularization of multi-core processors, transaction memory, as a concurrent control mechanism with easy programing and high scalability, has attracted more and more attention. As a result, the reliability pr...
详细信息
Reverse skyline is useful for supporting many applications, such as marketing decision, environmental monitoring. Since the uncertainty of data is inherent in many scenarios, there is a need for processing probabilist...
详细信息
We present an approach under the framework of abstract interpretation to analyze list-manipulating programs by combining shape and numerical abstractions. The analysis automatically divides a list into non-overlapping...
详细信息
ISBN:
(纸本)9781450316569
We present an approach under the framework of abstract interpretation to analyze list-manipulating programs by combining shape and numerical abstractions. The analysis automatically divides a list into non-overlapping list segments according to the reachability property of pointer variables to list nodes. The list nodes in each segment are abstracted by a bit-vector wherein each bit corresponds to a pointer variable and indicates whether the nodes can be reached by that pointer variable. Moreover, for each bit-vector, we introduce an auxiliary integer variable, namely a counter variable, to record the number of nodes in the segment abstracted by that bit-vector. On this basis, we leverage the power of numerical abstractions to discover numerical relations among counter variables, so as to infer relational length properties among list segments. Our approach stands out in its ability to find intricate properties that involve both shape and numerical information, which are important for checking program properties such as memory safety and termination. A prototype is implemented and preliminary experimental results are encouraging. Copyright 2013 ACM.
The Internetware" paradigm is fundamentally changing the traditional way of software development. More and more software projects are developed, maintained and shared on the Internet. However, a large quantity of...
详细信息
ISBN:
(纸本)9781450323697
The Internetware" paradigm is fundamentally changing the traditional way of software development. More and more software projects are developed, maintained and shared on the Internet. However, a large quantity of heterogeneous software resources have not been organized in a reasonable and efficient way. Software feature is an ideal material to characterize software resources. The effectiveness of feature- related tasks will be greatly improved, if a multi-grained feature repository is available. In this paper, we propose a novel approach for organizing, analyzing and recommend- ing software features. Firstly, we construct a Hierarchical rEpository of Software feAture (HESA). Then, we mine the hidden affnities among the features and recommend relevant and high-quality features to stakeholders based on HESA. Finally, we conduct a user study to evaluate our approach quantitatively. The results show that HESA can organize software features in a more reasonable way compared to the traditional and the state-of-the-art approaches. The result of feature recommendation is effective and interesting. Categories and Subject Descriptors D.2.9 [Software Engineering]: Mining Software Reposi- tory;H.3.3 [Information Storage and retrieval]: Fea- ture Model, Clustering, Query formulation General Terms Algorithms, Human Factors.
暂无评论