作者:
Zhang, LeiNing, HaoranTang, JiaxinChen, ZhenxiangZhong, YapingHan, YahongTianjin University
College of Intelligence and Computing the Tianjin Key Laboratory of Advanced Network Technology and Application Tianjin300050 China
Key Laboratory of Computing Power Network and Information Security Ministry of Education China University of Jinan
Shandong Provincial Key Laboratory of Ubiquitous Intelligent Computing the School of Information Science and Engineering Jinan250022 China Wuhan Sports University
Sports Big-data Research Center Wuhan430079 China Tianjin University
College of Intelligence and Computing the Tianjin Key Laboratory of Machine Learning Tianjin300350 China
The inherent complexity of Wi-Fi signals makes video-aided Wi-Fi 3D pose estimation difficult. The challenges include the limited generalizability of the task across diverse environments, its significant signal hetero...
详细信息
3D Region-of-Interest (RoI) Captioning involves translating a model's understanding of specific objects within a complex 3D scene into descriptive captions. Recent advancements in Large Language Models (LLMs) have...
详细信息
Context: Reliable and effective similarity analysis for the smart contracts facilitates the maintenance and quality assurance of the smart contract ecosystem. However, existing signature-based methods and code represe...
详细信息
Context: Reliable and effective similarity analysis for the smart contracts facilitates the maintenance and quality assurance of the smart contract ecosystem. However, existing signature-based methods and code representation learning-based methods suffer from limitations such as heavy-weight program analysis payloads or suboptimal contract encodings. Objective: This paper aims to design a fully unsupervised language model for better capturing the syntactic and semantic richness of Solidity code, and utilizes it for advancing the effectiveness of smart contract similarity analysis. Methods: Inspired by the impressive semantic learning capability of pre-trained language models (PLMs), we propose SolBERT, a PLM specifically tailored for enhancing Solidity smart contracts similarity detection. To ensure it produces high-quality encodings, SolBERT leverages BERT-style pre-training with the masked language modeling (MLM) and token type prediction (TTP) tasks applied on code-structure-aware token sequences derived from the contracts’ abstract syntax trees (ASTs) through structure-retaining tree linearization and light-weight normalization to learn a base model. On this basis, self-supervised contrastive fine-tuning and unsupervised whitening operations are further performed to optimize contract encoding generation. Results: Experiments are conducted on three contract similarity-related tasks, including contract clone detection, bug detection, and code clustering. The results indicate that SolBERT significantly outperforms state-of-the-art approaches with average absolute gains of 21.33% and 21.50% in terms of F1, and 17.78% and 26.60% in terms of accuracy for the clone detection and bug detection tasks, respectively;and an average absolute gain of 17.97% for code clustering task. When applying both contrastive fine-tuning and whitening optimizations, SolBERT also shows superior performance than the case of lacking any of them. Conclusion: The proposed approach, SolBERT, ca
This paper aims to explore a reliable target recognition technique for unmanned aerial vehicle (UAV) clusters, and proposes a lightweight collaborative target recognition methods based on multiple viewpoints. In the p...
详细信息
The optimal transport problem seeks to minimize the total transportation cost between two distributions, thus providing a measure of distance between them. In this work, we study the optimal transport of the eigenspec...
详细信息
The pursuit of quality improvements and accountability in the food supply chains, especially how they relate to food-related outcomes, such as hunger, has become increasingly vital, necessitating a comprehensive appro...
With the proliferation of cloud services and the continuous growth in enterprises' demand for dynamic multi-dimensional resources, the implementation of effective strategy for time-varying workload scheduling has ...
详细信息
Multifunctional therapeutic peptides(MFTP) hold immense potential in diverse therapeutic contexts, yet their prediction and identification remain challenging due to the limitations of traditional methodologies, such a...
Multifunctional therapeutic peptides(MFTP) hold immense potential in diverse therapeutic contexts, yet their prediction and identification remain challenging due to the limitations of traditional methodologies, such as extensive training durations, limited sample sizes, and inadequate generalization capabilities. To address these issues, we present AMHF-TP, an advanced method for MFTP recognition that utilizes attention mechanisms and multi-granularity hierarchical features to enhance performance. The AMHF-TP is composed of four key components: a migration learning module that leverages pretrained models to extract atomic compositional features of MFTP sequences; a convolutional neural network and selfattention module that refine feature extraction from amino acid sequences and their secondary structures; a hypergraph module that constructs a hypergraph for complex similarity representation between MFTP sequences; and a hierarchical feature extraction module that integrates multimodal peptide sequence features. Compared with leading methods,the proposed AMHF-TP demonstrates superior precision, accuracy, and coverage, underscoring its effectiveness and robustness in MFTP recognition. The comparative analysis of separate hierarchical models and the combined model, as well as with five contemporary models, reveals AMHF-TP's exceptional performance and stability in recognition tasks.
As a particular area of quantum security multiparty computation, quantum secure multiparty summation plays a critical role in modern cryptography. It is widely known that most of the existing quantum summation protoco...
详细信息
As a particular area of quantum security multiparty computation, quantum secure multiparty summation plays a critical role in modern cryptography. It is widely known that most of the existing quantum summation protocols are based on an honest or semi-honest third party (TP). However, the introduced TP makes the protocol difficult to implement in practice, as it may face a single-point-of-failure attack on TP. Although some TP-free protocols are proposed to mitigate this risk, the increased cost of communication reduces its efficiency. To address these issues, a novel quantum-secure multiparty summation protocol based on a cooperative random number distribution mechanism (QMS-CRM) is proposed in this paper for the first time. During it, this mechanism is designed using Shamir’s secret sharing scheme. Furthermore, this approach eliminates the requirement for random number exchange between participants without the help of TP, enhancing the efficiency of the protocol. The security analysis demonstrates that the proposed protocol can resist both external attacks and collusion attacks by up to $n - 2$ participants. Finally, we simulated the protocol on the IBM Quantum Cloud platform, confirming its feasibility.
The graph isomorphism problem remains a fundamental challenge in computer science, driving the search for efficient decision algorithms. Due to its ambiguous computational complexity, heuristic approaches such as simu...
详细信息
暂无评论