检索结果-内蒙古大学图书馆

Proceedings of the 33rd USENIX Conference on Security Symposium

作者： Siyue Feng Yueming Wu Wenjie Xue Sikui Pan Deqing Zou Yang Liu Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab and School of Cyber Science and Engineering Huazhong University of Science and Technology China Nanyang Technological University Singapore National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab and School of Cyber Science and Engineering Huazhong University of Science and Technology China and Jinyinhu Laboratory China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab and School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9781939133441

With the continuous development of software open-sourcing, the reuse of open-source software has led to a significant increase in the occurrence of recurring vulnerabilities. These vulnerabilities often arise through the practice of copying and pasting existing vulnerabilities. Many methods have been proposed for detecting recurring vulnerabilities, but they often struggle to ensure both high efficiency and consideration of semantic information about vulnerabilities and patches. In this paper, we introduce FIRE, a scalable method for large-scale recurring vulnerability detection. It utilizes multi-stage filtering and differential taint paths to achieve precise clone vulnerability scanning at an extensive scale. In our evaluation across ten open-source software projects, FIRE demonstrates a precision of 90.0% in detecting 298 recurring vulnerabilities out of 385 ground truth instance. This surpasses the performance of existing advanced recurring vulnerability detection tools, detecting 31.4% more vulnerabilities than VUDDY and 47.0% more than MOVERY. When detecting vulnerabilities in large-scale software, FIRE outperforms MOVERY by saving about twice the time, enabling the scanning of recurring vulnerabilities on an ultra-large scale.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Community-Aware Heterogeneous Graph Contrastive Learning 19th

Community-Aware Heterogeneous Graph Contrastive Learning

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Li, Xinying Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Recently, heterogeneous graph contrastive learning, which can mine supervision signals from the data, has attracted widespread attention. However, most existing methods employ random data augmentation strategies to construct contrastive views, which may destroy the semantic information in heterogeneous graphs. Moreover, they often select positive and negative samples based solely on node-level proximity and overlook hard samples that are difficult to distinguish from anchors. To solve the above problems, we propose a Community-Aware Heterogeneous Graph Contrastive Learning model called CAHGCL. In particular, we design an adaptive data augmentation strategy to construct views, including feature augmentation and topology augmentation. To improve the quality of samples, we propose a dynamic sample weighting strategy based on node similarity and community information, capable of identifying both hard positive samples and hard negative samples. Finally, we introduce community-level contrast to improve community cohesion. Extensive experiments and analyses demonstrate that CAHGCL consistently outperforms state-of-the-art baselines on three datasets. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Community Evolution Tracking Based on High-Order Neighbor Consideration and Node Change Identification 19th

Community Evolution Tracking Based on High-Order Neighbor C...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Zhang, Yunan Wang, Chaohui Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Community evolution tracking is widely used in complex network analysis, which analyzes and identifies how communities evolve over time based on dynamic community detection. However, the current incremental dynamic community detection method has the phenomenon of ’concept drift’, which leads to inaccurate tracking of community evolution. Although some studies on dynamic community detection have proposed to perform global community detection on the network by timing or when the error information accumulates to a certain extent, this method will lead to a sudden change in community division, which will interrupt the evolution sequence of some communities and bring great difficulties to the continuous tracking of community evolution. In addition, the current community evolution tracking methods match the communities of two adjacent snapshots, and it is difficult to capture the fine-grained evolution process within the community. This paper proposes a community evolution tracking algorithm based on high-order neighbor consideration and node change identification. Firstly, based on an incremental update strategy that considers high-order neighbors, we adaptively expand the scope of incremental updates to reduce the accumulation of error information. Secondly, through the node change identification strategy to mine fine-grained community evolution events. Experiments show that our method can effectively track the evolution of communities in dynamic networks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Community evolution Complex network Dynamic network Evolution tracking

来源：评论

学校读者我要写书评

暂无评论

MSPL: Multi-modal Statistical Prompt Learning for New Energy Equipment Defect Recognition

引用

IEEE Internet of Things Journal 2025年第11期12卷 16438-16450页

作者： Wang, Zhenwei Wang, Pengfei Han, Guangjie Zhou, Chengjie Lin, Qing Zhang, Jianxin Fan, Guangjie Zhang, Qiang Dalian University of Technology School of Computer Science and Technology Dalian116024 China Dalian116024 China Shenyang Huayan Electric Technology Co Ltd Shenyang110180 China Hohai University Key Laboratory of Maritime Intelligent Network Information Technology Ministry of Education China Deputy Director of the Yantai Big Data Center and Senior Engineer Yantai264003 China Dalian Minzu University School of Computer Science and Engineering Dalian116600 China

Monitoring renewable energy devices is crucial for the timely detection of faults and the improvement of system stability, making it a key component of the Internet of Things (IoT) ecosystem. However, existing intelligent algorithms and IoT methods rely on edge devices with limited computational capacity, which requires balancing real-time performance and accuracy. Additionally, most methods require initial training on large-scale data using cloud platforms or high-performance servers, leading to high initial costs. To address these challenges, we propose Multi-modal Statistical Prompt Learning (MSPL) for new energy equipment defect recognition on IoT edge devices. This method enables rapid learning with only a few samples, avoiding the need for large-scale centralized training. Specifically, MSPL uses the pre-trained Contrastive Language-Image Pre-training model as its backbone, leveraging text-based conceptual information to enhance the understanding of visual inputs. A Statistical Query (SQ) module is implemented at the end of the backbone to extract distinctive features from the outputs, integrating these features with soft prompts to customize them for the defect recognition task. Since the learnable parameters are limited to soft prompts added at the end of the backbone, MSPL restricts gradient backpropagation to this point. This improves parameter and memory efficiency, making it more suitable for scenarios with limited computational capacity on IoT edge devices. Experimental results of MSPL on two renewable energy equipment defect datasets and edge devices indicate that it meets real-time processing requirements while maintaining high accuracy, outperforming other methods. © 2025 IEEE.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

D-FGNAE: Decentralized Federated Graph Normalized AutoEncoder 19th

D-FGNAE: Decentralized Federated Graph Normalized AutoEncode...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Liang, Yuting Cai, Weixin Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Graphs widely exist in real-world, and Graph Neural Networks (GNNs) have exhibited exceptional efficacy in graph learning in diverse fields. With the strengthening of data privacy protection worldwide in recent years, Federated graph neural networks (FedGNNs) have gained increasing attention in academia and industry owing to their ability to train the model in a collaborative manner while complying with the privacy protection regulations. However, in federated learning, the non-independent and identically distributed (non-IID) problem of local data possessed by multiple participants can significantly undermine model accuracy. We propose a new Decentralized Federated Graph Normalized AutoEncoder (D-FGNAE). First, the model is designed as a decentralized federated learning framework with dynamically assigned tripartite roles. This design eliminates the fixed server role found in traditional federated learning, enhances system fault tolerance, avoids single points of failure, and protects model privacy. Second, the splitting and correcting of calculation by layer in the model, along with the special design of the normalization layer, effectively tackle the non-IID problem in both the structural and attribute aspects. Experimental results on real-world networks demonstrate the effectiveness of D-FGNAE, which can achieve nearly the same accuracy as the centralized model. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

UGCM-LU: A Unified Stream and Batch Graph computing Model with Local Update for Community Detection 19th

UGCM-LU: A Unified Stream and Batch Graph Computing Model w...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Li, Hong Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Unified stream and batch computing (USBC) aims to incorporate stream and batch computation into a unified framework, thereby enabling the development of a one-stop solution for stream and batch data processing and enhancing the generalization of the framework. However, research on unified graph computing models (UGCMs) faces several challenges. First, existing UGCMs need to consider all graph information in the cache during the incremental update phase, thus leading to decreased execution efficiency. Second, existing UGCMs use fixed bytes to store nodes without considering the actual space occupied by nodes resulting in wasted memory when dealing with large graphs. This paper proposes a UGCM with Local Updates for community detection (UGCM-LU). We first implement a local update strategy to consider partial information of the graph to achieve incremental updates. Secondly, we also designed a byte-compression-based module to store graph data according to the space occupied by nodes. The experimental results show the effectiveness and efficiency of the model in real-world and artificial networks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Lutetium alloys

来源：评论

学校读者我要写书评

暂无评论

MASS FLOW DETECTION TECHNOLOGY FOR SEED AND FERTILISER PARTICLES AND ITS APPLICATION IN UAV-BASED SPREADING

引用

INMATEH - Agricultural Engineering 2025年第1期75卷 584-599页

作者： Wang, Yanshuang Song, Cancan Gao, Yongqi Lan, Yubin Wang, Guobin Ming, Rui College of Agricultural Engineering and Food Science Shandong University of Technology Zibo China Shandong University of Technology Sub-center of National Center for International Collaboration Research on Precision Agricultural Aviation Pesticide Spraying Technology Zibo China Research of Institute of Ecological Unmanned Farm Shandong University of Technology Zibo China School of Computer and Big Data Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Fuzhou China

The processes of sowing and fertiliser application represent a significant aspect of agricultural production. In order to achieve efficient and precise seeding and fertiliser application, mass flow detection of seed and fertiliser particles can facilitate real-time monitoring and precise decision-making for intelligent seeding and fertiliser application. However, the diversity of seed and fertiliser particle types and particle flow modes presents a challenge for existing detection methods, particularly in meeting the varying operational requirements, especially for particle mass flow detection in low-altitude and high-speed sowing operations of agricultural drones. In such cases, the overlap and flow rate will have a significant impact on the detection results due to the large displacement and the continuous high-throughput dense phase of the particle flow. This paper provides a summary of the existing seed and fertiliser particle mass flow detection techniques and their underlying working principles. It compares the direct detection based on mass with the indirect detection methods based on velocity and concentration, and analyses their respective advantages, disadvantages and applicability. It also explores the possibility of optimising the existing detection methods for the specific needs of agricultural UAVs and considers the potential introduction of cutting-edge science and technology in order to develop an efficient, accurate and convenient detection system to meet the growing market demand. © (2025), (INMA Bucharest). All Rights Reserved.

关键词： Precision agriculture

来源：评论

学校读者我要写书评

暂无评论

SolBERT: Advancing solidity smart contract similarity analysis via self-supervised pre-training and contrastive fine-tuning

引用

Information and Software Technology 2025年 184卷

作者： Tian, Zhenzhou Teng, Yudong Ke, Xianqun Chen, Yanping Chen, Lingwei School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China Department of Computer Science and Engineering Wright State University DaytonOH45435 United States

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

关键词： Reliability analysis

来源：评论

学校读者我要写书评

暂无评论

An Encoder-Decoder Model Based On Spiking Neural Networks For Address Event Representation Object Recognition

引用

IEEE Transactions on Cognitive and Developmental Systems 2025年

作者： Du, Sichun Zhu, Haodi Zhang, Yang Hong, Qinghui Hunan University College of Computer Science and Electronic Engineering Changsha418002 China Shenzhen University Computer Vision Institute School of Computer Science and Software Engineering National Engineering Laboratory for Big Data System Computing Technology Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China

Address event representation (AER) object recognition task has attracted extensive attention in neuromorphic vision processing. The spike-based and event-driven computation inherent in the spiking neural network (SNN) provides an energy-saving solution for AER object recognition. However, SNN with spike timing dependent plasticity (STDP) learning rule has not achieved satisfying AER object recognition performance. This work proposes an SNN-based encoder-decoder model to improve the recognition performance of AER objects. An STDP-based locally connected spiking neural network (LC-SNN) is proposed as an encoder to extract rich spatiotemporal features from AER event flows more flexibly. After the encoder extracts and learns primary features, we propose a fully connected spiking neural network (FC-SNN) based on the reward-modulated spike-timing-dependent plasticity (R-STDP) learning rule as a decoder to learn higher-level features for classification. In addition, we improved the winner-take-all (WTA) mechanisms and R-STDP learning rule in the decoder based on the reward and punish decision, enabling the network to perform better. The experiments are performed on the N-MNIST, MNIST-DVS, and the DVS Gesture datasets, improving the accuracy of the best existing plasticity-based SNN by 0.19%, 0.27% and 1.35%, respectively. © 2016 IEEE.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

A unified multi-granulation hierarchy structure: Construction, Selection, Fusion and Reduction

引用

Information Fusion 2025年 123卷

作者： Zhang, Xiaoxia Zhang, Jiangtao Wang, Guoyin Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing400065 China National Center for Applied Mathematics in Chongqing Chongqing Normal University Chongqing401331 China

Granular computing is a new method that can simulate human brain thinking to solve complex problems, and it has gradually become an important theory for addressing uncertainty issues. The core of granular computing lies in its use of hierarchical, classification, or clustering methods to process uncertain information. However, the broad applicability of this approach has led to its blurred theoretical boundaries, with varying definitions of "granules" and computational paradigms across studies based on differing requirements. Currently, the absence of a unified granular computing model prevents the consistent handling of uncertain information under a standardized scale and paradigm. This paper attempts to fill this gap from a unified perspective by providing a multi-granulation hierarchical structure within a unified framework. Based on this, different studies can adaptively select appropriate granular layers according to their specific time constraints or precision requirements. Here, we adopt quantum genetic algorithms (QG) for optimal granular layer selection. After the granular layers are selected, a fusion algorithm is developed to combine them into a super layer, preserving essential information for subsequent attribute reduction. The attribute reduction process is guided by conditional entropy, which further refines the feature set, enhancing the model's efficiency and accuracy. Experimental results on twelve public datasets and four real datasets both demonstrate the effectiveness of the proposed method, showing superior performance in terms of classification accuracy and feature reduction compared to seven existing approaches. This study establishes a unified framework for various granular computing models, offering new insights into the integration of granular computing models and adaptive optimization techniques for real-world data analysis applications. © 2025 Elsevier B.V.

关键词： Granular computing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：