Concurrency bugs widely exist in concurrent programs and have caused severe failures in the real world. Researchers have made significant progress in detecting concurrency bugs, which improves software reliability. In...
详细信息
Concurrency bugs widely exist in concurrent programs and have caused severe failures in the real world. Researchers have made significant progress in detecting concurrency bugs, which improves software reliability. In this paper, we survey the most up-to-date and well-known concurrency bug detectors. We categorize the existing detectors based on the types of concurrency bugs. Consequently, we analyze data race detectors, atomicity violation detectors, order violation detectors, and deadlock detectors, respectively. We also discuss some other techniques which are mostly related to concurrency bug detection, including schedule bounding techniques, interleaving optimizing techniques, path expanding techniques, and deterministic replay techniques. Additionally, we statistically analyze the reviewed detectors and get some interesting findings, for instance, nearly 86% of previous detectors focus on data races and atomicity violations, and dynamic approaches are popular(74%). We also discuss the limitations of previous detectors, finding that 91% of previous detectors suffer from false negatives and 64% of previous detectors suffer from runtime overhead. Based on the reviewed detectors and statistical analysis, we conclude some future research directions, including accuracy, performance,applicability, and integrality.
OpenFlow switches in SDN use Multiple Flow Tables (MFTs) for fine-grained flow control. Commodity switches integrate hardware storage resources such as SRAM and TCAM to store flow tables to achieve high-speed lookups....
OpenFlow switches in SDN use Multiple Flow Tables (MFTs) for fine-grained flow control. Commodity switches integrate hardware storage resources such as SRAM and TCAM to store flow tables to achieve high-speed lookups. Many increased flow tables are rapidly exhausting these hardware storage resources, which makes the switches have to balance high-speed search and massive storage. The rule-caching scheme is a popular method to solve this problem, which caches the most commonly used rules into hardware storage resources. The existing rule-caching schemes are based on single hardware storage resources, and they cannot flexibly adjust the caching strategy according to the traffic characteristics. Simultaneously, the deployed commodity switches face the problem of difficulty in changing the size of SRAM and TCAM. This paper innovatively proposes the MixedCache scheme, which makes full use of the hardware storage resources in the switch according to the skewed characteristics of network traffic. MixedCache stores the large flows in SRAM by exact match and stores the small flows in the TCAM by wildcard match. MixedCache does not need to change the size of the deployed switch hardware storage resources, but makes full use of existing resources. Compared with the rule-caching scheme based on the exact match, the cache hit rate can increase by up to 15.61%. Compared with the rule-caching scheme based on the wildcard match, the cache hit rate can increase by up to 29.69%.
In crowd counting, regression-based method shows better performance in extreme density scenes by introduces a density map. However, the regression-based method fails to locate the positions of each head, which signifi...
详细信息
ISBN:
(数字)9781728146447
ISBN:
(纸本)9781728146454
In crowd counting, regression-based method shows better performance in extreme density scenes by introduces a density map. However, the regression-based method fails to locate the positions of each head, which significantly restricts its applications. Detection-based method counts each head with their accurate locations but works only in middle or low-level density scenes. In this paper, a joint learning method, named Density-attentive Head Detector (DAHD) is developed to overcome their respective shortcomings via a multi-task training procedure. Specifically, to guarantee the sensitivity of the detector to small or partially occluded heads, we carefully equip the detector with a density map which learned from regression module. Moreover, a novel Dilated Feature Pyramid Network (DFPN) is introduced to our method to enlarge the receptive field of convolutional kernel, bringing confirmative additional benefits to identify small heads. Experiments on the popular ShanghaiTech and Mall datasets confirm the improved performance of DAHD compared with the current detection-based approaches, and a comparable performance to regression-based approaches in term of counting.
Multi-view shape descriptors obtained from various 2D images are commonly adopted in 3D shape retrieval. One major challenge is that significant shape information are discarded during 2D view rendering through project...
详细信息
ISBN:
(数字)9781728148038
ISBN:
(纸本)9781728148045
Multi-view shape descriptors obtained from various 2D images are commonly adopted in 3D shape retrieval. One major challenge is that significant shape information are discarded during 2D view rendering through projection. In this paper, we propose a convolutional neural network based method, CenterNet, to enhance each individual 2D view using its neighboring ones. By exploiting cross-view correlations, CenterNet learns how adjacent views can be maximally incorporated for an enhanced 2D representation to effectively describe shapes. We observe that a very small amount of, e.g., six, enhanced 2D views, are already sufficient for a panoramic shape description. Thus, by simply aggregating features from six enhanced 2D views, we arrive at a highly compact yet discriminative shape descriptor. The proposed shape descriptor significantly outperforms state-of-the-art 3D shape retrieval methods on the ModelNet and ShapeNetCore55 benchmarks, and also exhibits robustness against object occlusion.
Class incremental learning needs to deal with a dynamic environment where data class appears incrementally, it is a challenge to learn new knowledge while preserving what has already been learned. On the other hand, d...
详细信息
ISBN:
(纸本)9781728111421;9781728111414
Class incremental learning needs to deal with a dynamic environment where data class appears incrementally, it is a challenge to learn new knowledge while preserving what has already been learned. On the other hand, due to the limited storage of the online scenario, algorithm is usually obstructed to frequently scan or simply store all historical data, it is another challenge to reduce the historical data storage for algorithm. Few existing work have addressed above challenges simultaneously. In this paper, we propose Fisher Discriminant Analysis Random Forest (FDARF), which consists of two parts, GHS (Generate Hierarchical Split) and RRS (Random Reform Subtree), that cooperatively operate. GHS combines FDA (Fisher Discriminant Analysis) with tree hierarchy to learn a hierarchical split of data space that provides strong ability for classification. The statistics in leaves (i.e. historical data) can be described by covariance matrix and further optimized by matrix sketching algorithm to reduce storage; for every tree initialized by GHS, RRS randomly reforms certain state subtree, which creates diversity that can be ensemble for ensuring effectiveness of class incremental learning. Extensive experiments on diverse datasets validate that FDARF can well adapt to the online class incremental learning.
In the software development, it is common to find that several bug reports are related to many common code files, i.e., similar bugs. Similar bug recommendation is a meaningful task that could assist developers in bug...
详细信息
ISBN:
(纸本)9781538665664;9781538665657
In the software development, it is common to find that several bug reports are related to many common code files, i.e., similar bugs. Similar bug recommendation is a meaningful task that could assist developers in bug triaging and fixing. If developers can focus on fewer code files, they can fix similar bugs in less time with higher quality. Therefore, building a similar bug recommendation system is a meaningful task that can improve development efficiency. As the state of the art, Yang et al.'s work presented an approach that combines TF-IDF method with Word Embedding model and achieved a good result. To further improve the performance of their approach, in this paper, we propose a novel approach using Document Embedding model. In our preliminary evaluation, we conduct the experiment on the datasets of J dt, Birt and Eclipse platform. And the results show that our approach outperforms Yang et ale `s, with 2.67-9.50% of improvement.
In the software development, it is not uncommon to find that several bug reports are related to many common code files, i.e., similar bugs. Similar bug recommendation is a meaningful task which can assist developers i...
详细信息
ISBN:
(纸本)9781728119717;9781728119700
In the software development, it is not uncommon to find that several bug reports are related to many common code files, i.e., similar bugs. Similar bug recommendation is a meaningful task which can assist developers in bug triaging and fixing. As the state of the art, Yang et al.'s work presented an approach that combines TF-IDF method with word embedding model and achieved a good result. To further improve the performance of their approach, in this paper, we propose a novel approach using Document Embedding model. In our preliminary evaluation, we conduct the experiment on 13,090 bug reports from the Eclipse platform and the results show that our approach outperforms Yang et al.'s, with 7.89-8.96% of improvement.
Social coding sites like GitHub has enabled developers to easily contribute their comments on multiple issues and switch their discussion between issues, i.e., multi-discussing. Discussing multiple issues simultaneous...
详细信息
ISBN:
(纸本)9781728119717;9781728119700
Social coding sites like GitHub has enabled developers to easily contribute their comments on multiple issues and switch their discussion between issues, i.e., multi-discussing. Discussing multiple issues simultaneously may enhance the work efficiency of developers. However, multi-discussing also relies on developers' rationally allocating their time and focus, which may bring different influence to the resolution of issues. Therefore, investigating how multi-discussing affects the issue resolution is a meaningful research question which can help developers understand the benefits and limitations when they switch their discussion between issues. In this paper, we present a preliminary study of the impact of multi-discussing on issue resolution in GitHub projects, by using quantitative methods. First, we collect and analyzed data from 631 GitHub projects to explore how multi-discussing affects the average resolution latency of project issues. Further, we develop method for measuring the rate and breadth of a developers' discussion switching behavior, and we use regression modeling to study how discussion-switching affects the single issue resolution latency. We find that multi-discussing is a common behavior of developers in GitHub projects. Also, multi-discussing is associated with shorter average issue resolution latency of project. However, during a single issue resolution, more participants' discussion-switching tend to bring longer issue resolution latency. Our study motivates the need for further research on the multi-discussing.
Emerging blockchain systems have been widely adopted in sharing economy, such as e-commerce, to allow mutually distrustful parties to transact fairly without trusted parties. Most blockchain systems, however, lack tra...
详细信息
Emerging blockchain systems have been widely adopted in sharing economy, such as e-commerce, to allow mutually distrustful parties to transact fairly without trusted parties. Most blockchain systems, however, lack transactional privacy protection. All transactions, including trading relationship between pseudonyms and content transacted, are exposed on the blockchain. Although many existing privacy protection methods on the blockchain have been proposed, it is difficult to find a trade-off between keeping speed and protecting privacy of transactions. To address this limitation, we propose a novel privacy-preserving method RZKPB that does not store financial transactions in clear on the blockchain, thus retaining transactional privacy from the public's view. Meanwhile, these transactions are as proofs to solve disputes between trading partners. RZKPB ensures fairness and privacy of transactions between participants without adding a new trusted party and breaking the verifying protocol on the blockchain. We take the e-commerce as an example in sharing economy to introduce RZKPB in our paper. Our experimental results show that compared with existing privacy-preserving methods based on the blockchain, RZKPB is more efficient under different settings.
暂无评论