A pull request(PR) is an event in Git where a contributor asks project maintainers to review code he/she wants to merge into a project. The PR mechanism greatly improves the efficiency of distributed software developm...
详细信息
A pull request(PR) is an event in Git where a contributor asks project maintainers to review code he/she wants to merge into a project. The PR mechanism greatly improves the efficiency of distributed software development in the opensource community. Nevertheless, the massive number of PRs in an open-source software(OSS) project increases the workload of developers. To reduce the burden on developers, many previous studies have investigated factors that affect the chance of PRs getting accepted and built prediction models based on these factors. However, most prediction models are built on the data after PRs are submitted for a while(e.g., comments on PRs), making them not useful in practice. Because integrators still need to spend a large amount of effort on inspecting PRs. In this study, we propose an approach named E-PRedictor(earlier PR predictor) to predict whether a PR will be merged when it is created. E-PRedictor combines three dimensions of manual statistic features(i.e., contributor profile, specific pull request, and project profile) and deep semantic features generated by BERT models based on the description and code changes of PRs. To evaluate the performance of E-PRedictor, we collect475192 PRs from 49 popular open-source projects on GitHub. The experiment results show that our proposed approach can effectively predict whether a PR will be merged or not. E-PRedictor outperforms the baseline models(e.g., Random Forest and VDCNN) built on manual features significantly. In terms of F1@Merge, F1@Reject, and AUC(area under the receiver operating characteristic curve), the performance of E-PRedictor is 90.1%, 60.5%, and 85.4%, respectively.
Wearing a helmet is one of the effective measures to protect workers' safety. To address the challenges of severe occlusion, multi-scale, and small target issues in helmet detection, this paper proposes a helmet d...
详细信息
Wearing a helmet is one of the effective measures to protect workers' safety. To address the challenges of severe occlusion, multi-scale, and small target issues in helmet detection, this paper proposes a helmet detection algorithm based on deformable attention transformers. The main contributions of this paper are as follows. A compact end-to-end network architecture for safety helmet detection based on transformers is proposed. It cancels the computationally intensive transformer encoder module in the existing detection transformer(DETR) and uses the transformer decoder module directly on the output of feature extraction for query decoding, which effectively improves the efficiency of helmet detection. A novel feature extraction network named Swin transformer with deformable attention module(DSwin transformer) is proposed. By sparse cross-window attention, it enhances the contextual awareness of multi-scale features extracted by Swin transformer, and keeps high computational efficiency simultaneously. The proposed method generates the query reference points and query embeddings based on the joint prediction probabilities, and selects an appropriate number of decoding feature maps and sparse sampling points for query decoding, which further enhance the inference capability and processing speed. On the benchmark safety-helmet-wearing-dataset(SHWD), the proposed method achieves the average detection accuracy mAP@0.5 of 95.4% with 133.35G floating-point operations per second(FLOPs) and 20 frames per second(FPS), the state-of-the-art method for safety helmet detection.
Sharding is a promising technique to tackle the critical weakness of scalability in blockchain-based unmanned aerial vehicle(UAV)search and rescue(SAR)*** breaking up the blockchain network into smaller partitions cal...
详细信息
Sharding is a promising technique to tackle the critical weakness of scalability in blockchain-based unmanned aerial vehicle(UAV)search and rescue(SAR)*** breaking up the blockchain network into smaller partitions called shards that run independently and in parallel,shardingbased UAV systems can support a large number of search and rescue UAVs with improved scalability,thereby enhancing the rescue ***,the lack of adaptability and interoperability still hinder the application of sharded blockchain in UAV SAR *** refers to making adjustments to the blockchain towards real-time surrounding situations,while interoperability refers to making cross-shard interactions at the mission *** address the above challenges,we propose a blockchain UAV system for SAR missions based on dynamic sharding *** from the benefits in scalability brought by sharding,our system improves adaptability by dynamically creating configurable and mission-exclusive shards,and improves interoperability by supporting calls between smart contracts that are deployed on different *** implement a prototype of our system based on Quorum,give an analysis of the improved adaptability and interoperability,and conduct experiments to evaluate the *** results show our system can achieve the above goals and overcome the weakness of blockchain-based UAV systems in SAR scenarios.
Vulnerabilities are disclosed with corresponding patches so that users can remediate them in time. However, there are instances where patches are not released with the disclosed vulnerabilities, causing hidden dangers...
详细信息
ISBN:
(纸本)9798350330663
Vulnerabilities are disclosed with corresponding patches so that users can remediate them in time. However, there are instances where patches are not released with the disclosed vulnerabilities, causing hidden dangers, especially if dependent software remains uninformed about the affected code repository. Hence, it is crucial to automatically locate security patches for disclosed vulnerabilities among a multitude of commits. Despite the promising performance of existing learning-based localization approaches, they still suffer from the following limitations: (1) They cannot perform well in data scarcity scenarios. Most neural models require extensive datasets to capture the semantic correlations between the vulnerability description and code commits, while the number of disclosed vulnerabilities with patches is limited. (2) They struggle to capture the deep semantic correlations between the vulnerability description and code commits due to inherent differences in semantics and characters between code changes and commit messages. It is difficult to use one model to capture the semantic correlations between vulnerability descriptions and code commits. To mitigate these two limitations, in this paper, we propose a novel security patch localization approach named Prom VPat, which utilizes the dual prompt tuning channel to capture the semantic correlation between vulnerability descriptions and commits, especially in data scarcity (i.e., few-shot) scenarios. We first input the commit message and code changes with the vulnerability description into the prompt generator to generate two new inputs with prompt templates. Then, we adopt a pre-trained language model (i.e., PLM) as the encoder, utilize the prompt tuning method to fine-tune the encoder, and generate two correlation probabilities as the semantic features. In addition, we extract 26 handcrafted features from the vulnerability descriptions and the code commits. Finally, we utilize the attention mechanism to fuse the
Accurately diagnosing Alzheimer's disease is essential for improving elderly ***,accurate prediction of the mini-mental state examination score also can measure cognition impairment and track the progression of Al...
详细信息
Accurately diagnosing Alzheimer's disease is essential for improving elderly ***,accurate prediction of the mini-mental state examination score also can measure cognition impairment and track the progression of Alzheimer's ***,most of the existing methods perform Alzheimer's disease diagnosis and mini-mental state examination score prediction separately and ignore the relation between these two *** address this challenging problem,we propose a novel multi-task learning method,which uses feature interaction to explore the relationship between Alzheimer's disease diagnosis and minimental state examination score *** our proposed method,features from each task branch are firstly decoupled into candidate and non-candidate parts for ***,we propose feature sharing module to obtain shared features from candidate features and return shared features to task branches,which can promote the learning of each *** validate the effectiveness of our proposed method on multiple *** Alzheimer's disease neuroimaging initiative 1 dataset,the accuracy in diagnosis task and the root mean squared error in prediction task of our proposed method is 87.86%and 2.5,*** results show that our proposed method outperforms most state-of-the-art *** proposed method enables accurate Alzheimer's disease diagnosis and mini-mental state examination score ***,it can be used as a reference for the clinical diagnosis of Alzheimer's disease,and can also help doctors and patients track disease progression in a timely manner.
In the context of the publication of the "Thirteenth Five-Year Plan for Educational Informationization," and China’s entry into the era of education informatization, the integration of information technolog...
详细信息
Under the background of China Education Modernization 2035 and Education 4.0, promoting the integration and innovation of intelligent technology and basic education evaluation is the necessary path for education evalu...
详细信息
In a world brimming with new products continually, novel waste types are ubiquitous. This makes current image-based garbage classification systems difficult to perform well due to the long-tailed effects of distributi...
详细信息
Community detection algorithms play an important role in revealing and analyzing complex network structures. However, when these algorithms are put into practice, privacy concerns often arise, especially when communit...
详细信息
Community detection algorithms play an important role in revealing and analyzing complex network structures. However, when these algorithms are put into practice, privacy concerns often arise, especially when community nodes wish to safeguard their identities from exposure. This interaction between network analysis and privacy issues leads to what we refer to as the "community hiding problem." In the context of concealing specific target communities, popular methods primarily focus on preventing community detection algorithms from accurately identifying the entire original community, resulting in partial concealment. This study formally addresses the challenge of achieving complete concealment of target communities. We introduce key metrics such as escape scores, dispersion scores, and hiding scores to precisely define the problem. Additionally, we design a metric, denoted as M-value, to evaluate the effectiveness of concealing target communities from multiple perspectives. To tackle this challenge, we employ a genetic algorithm that leverages previous knowledge to maximize the concealment of the target community while minimizing changes to link connections. We validate our approach through extensive experiments with various real-world datasets, demonstrating that our algorithm outperforms several state-of-the-art baseline algorithms across multiple metrics. Visual representations of our method confirm its ability to effectively hide target communities while minimally affecting the broader network's community structure, strengthening the inherent effectiveness of our community hiding approach. Furthermore, we assess the adaptability of our modified network with different community detection algorithms, consistently demonstrating effective concealment even when these algorithms are extended. This emphasizes the robustness and generality of our proposed approach in various algorithmic scenarios.
The secured access is studied in this paper for the network of the image remote *** sensor in this network encounters the information security when uploading information of the images wirelessly from the sensor to the...
详细信息
The secured access is studied in this paper for the network of the image remote *** sensor in this network encounters the information security when uploading information of the images wirelessly from the sensor to the central collection *** order to enhance the sensing quality for the remote uploading,the passive reflection surface technique is *** one eavesdropper that exists nearby this sensor is keeping on accessing the same networks,he may receive the same image from this *** goal in this paper is to improve the SNR of legitimate collection unit while cut down the SNR of the eavesdropper as much as possible by adaptively adjust the uploading power from this sensor to enhance the security of the remote sensing *** order to achieve this goal,the secured energy efficiency performance is theoretically analyzed with respect to the number of the passive reflection elements by calculating the instantaneous performance over the channel fading *** on this theoretical result,the secured access is formulated as a mathematical optimization problem by adjusting the sensor uploading power as the unknown variables with the objective of the energy efficiency maximization while satisfying any required maximum data rate of the eavesdropper ***,the analytical expression is theoretically derived for the optimum uploading *** simulations verify the design approach.
暂无评论