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

Block-gram:Mining knowledgeable features for efficiently smart contract vulnerability detection

Digital Communications and networks 2025年第1期11卷 1-12页

作者： Xueshuo Xie Haolong Wang Zhaolong Jian Yaozheng Fang Zichun Wang Tao Li Tianjin Key Laboratory of Network and Data Security Technology TianjinChina College of Computer Science Nankai UniversityTianjinChina Key Laboratory of Blockchain and Cyberspace Governance of Zhejiang Province China State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesChina

Smart contracts are widely used on the blockchain to implement complex transactions,such as decentralized applications on *** vulnerability detection of large-scale smart contracts is critical,as attacks on smart contracts often cause huge economic *** it is difficult to repair and update smart contracts,it is necessary to find the vulnerabilities before they are ***,code analysis,which requires traversal paths,and learning methods,which require many features to be trained,are too time-consuming to detect large-scale on-chain ***-based methods will obtain detection models from a feature space compared to code analysis methods such as symbol *** the existing features lack the interpretability of the detection results and training model,even worse,the large-scale feature space also affects the efficiency of *** paper focuses on improving the detection efficiency by reducing the dimension of the features,combined with expert *** this paper,a feature extraction model Block-gram is proposed to form low-dimensional knowledge-based features from ***,the metadata is separated and the runtime code is converted into a sequence of opcodes,which are divided into segments based on some instructions(jumps,etc.).Then,scalable Block-gram features,including 4-dimensional block features and 8-dimensional attribute features,are mined for the learning-based model ***,feature contributions are calculated from SHAP values to measure the relationship between our features and the results of the detection *** addition,six types of vulnerability labels are made on a dataset containing 33,885 contracts,and these knowledge-based features are evaluated using seven state-of-the-art learning algorithms,which show that the average detection latency speeds up 25×to 650×,compared with the features extracted by N-gram,and also can enhance the interpretability of the detection model.

关键词： Smart contract Bytecode&opcode Knowledgeable features Vulnerability detection Feature contribution

来源：评论

学校读者我要写书评

暂无评论

Large Language Model-Based Event Relation Extraction with Rationales 31

Large Language Model-Based Event Relation Extraction with Ra...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Hu, Zhilei Li, Zixuan Jin, Xiaolong Bai, Long Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of SciencesSchool of Computer Science and Technology University of Chinese Academy of Sciences

ISBN: (纸本)9798891761964

Event Relation Extraction (ERE) aims to extract various types of relations between different events within texts. Although Large Language Models (LLMs) have demonstrated impressive capabilities in many natural language processing tasks, existing ERE methods based on LLMs still face three key challenges: (1) Time Inefficiency: The existing pairwise method of combining events and determining their relations is time-consuming for LLMs. (2) Low Coverage: When dealing with numerous events in a document, the limited generation length of fine-tuned LLMs restricts the coverage of their extraction results. (3) Lack of Rationale: Essential rationales concerning the results that could enhance the reasoning ability of the model are overlooked. To address these challenges, we propose LLMERE, an LLM-based approach with rationales for the ERE task. LLMERE transforms ERE into a question-and-answer task that may have multiple answers. By extracting all events related to a specified event at once, LLMERE reduces time complexity from O(n2) to O(n), compared to the pairwise method. Subsequently, LLMERE enhances the coverage of extraction results by employing a partitioning strategy that highlights only a portion of the events in the document at a time. In addition to the extracted results, LLMERE is also required to generate corresponding rationales/reasons behind them, in terms of event coreference information or transitive chains of event relations. Experimental results on three widely used datasets show that LLMERE achieves significant improvements over baseline methods. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Inductive Link Prediction in N-ary Knowledge Graphs 31

Inductive Link Prediction in N-ary Knowledge Graphs

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Wei, Jiyao Guan, Saiping Jin, Xiaolong Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9798891761964

N-ary Knowledge Graphs (NKGs), where a fact can involve more than two entities, have gained increasing attention. Link Prediction in NKGs (LPN) aims to predict missing elements in facts to facilitate the completion of NKGs. Current LPN methods implicitly operate under a closed-world assumption, meaning that the sets of entities and roles are fixed. These methods focus on predicting missing elements within facts composed of entities and roles seen during training. However, in reality, new facts involving unseen entities and roles frequently emerge, requiring completing these facts. Thus, this paper proposes a new task, Inductive Link Prediction in NKGs (ILPN), which aims to predict missing elements in facts involving unseen entities and roles in emerging NKGs. To address this task, we propose a Meta-learning-based Nary knowledge Inductive Reasoner (MetaNIR), which employs a graph neural network with meta-learning mechanisms to embed unseen entities and roles adaptively. The obtained embeddings are used to predict missing elements in facts involving unseen elements. Since no existing dataset supports this task, three datasets are constructed to evaluate the effectiveness of MetaNIR. Extensive experimental results demonstrate that MetaNIR consistently outperforms representative models across all datasets. © 2025 Association for Computational Linguistics.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Machine learning empowered UAV-based beamforming design in ISAC systems

引用

science China(Information sciences) 2025年第5期68卷 285-286页

作者： Xiangyang DUAN Xiaoqi ZHANG Shuqiang XIA Zhongbin WANG Yihua MA Weijie YUAN State Key Laboratory of Mobile Network and Mobile Multimedia Technology Wireless and Computing Research InstituteZTE Corporation School of Electrical and Data Engineering University of Technology Sydney School of Automation and Intelligent Manufacturing Southern University of Science and Technology

Integrated sensing and communication (ISAC) has been proposed as an enabling technology for the realization of the next-generation wireless system,which focuses on performing wireless communication and sensing *** the various potential ISAC-based applications,unmanned aerial vehicle (UAV)-based ISAC plays a significant part in unlocking the potential of future next-generation wireless communication,facilitating low-latency data transmission in high-mobility *** by recent advancements,a variety of effective techniques have been investigated to optimize beamforming design in ISAC *** instance,the authors in [1] introduced an extended Kalman filtering (EKF)-based method tailored for millimeter wave (mmWave) ISAC ***,Ref.[2]proposed an extended interacting multiple model (IMM)-EKF framework designed for vehicular networks with intricate roadway *** these advancements,the aforementioned methods typically employ a separate scheme for channel prediction and beam alignment,which introduces additional signaling overhead in real-world ***,there is a demand for an end-to-end beamforming design approach specifically for UAV-based ISAC systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Edge-Cloud Cooperation-Driven Intelligent Sustainability Evaluation Strategy Based on IoT and CPS for Energy-Intensive Manufacturing Industries

引用

IEEE Internet of Things Journal 2025年第9期12卷 12287-12297页

作者： Ma, Shuaiyin Huang, Yuming Chen, Yanping Xiao, Qinge Xu, Jun Leng, Jiewu Xi’an University of Posts and Telecommunications Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an Key Laboratory of Big Data and Intelligent Computing School of Computer Science and Technology Xi’an710121 China Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China Xidian University Advanced Manufacturing Technology Innovation Center Guangzhou Institute of Technology Guangzhou510555 China Guangdong University of Technology Guangdong Provincial Key Laboratory of Computer Integrated Manufacturing System State Key Laboratory of Precision Electronic Manufacturing Technology and Equipment Guangzhou510006 China

The advancement of the Industry 5.0 in information technology has led to increased interest in integrating edge-cloud cooperation with Internet of Things (IoT) and cyber-physical system (CPS) designs. This integration effectively reduces service delays and provides real-time analysis feedback to physical spaces, attracting attention from both academia and industry. These advanced technologies enhance production system intelligence, their alignment with circular economy principles for promoting sustainability has been overlooked. To address this gap, this article proposes an intelligent sustainability evaluation strategy driven by edge-cloud cooperation, IoT, and CPS. The proposed approach aims to enhance production sustainability and intelligence through circular economy perspectives. It introduces improved gray relation analysis and deep clustering network techniques to extract meaningful insights from diverse indicators within the evaluation system. By analyzing relationships between different equipment and workshops, it provides an analytical method that enhances production efficiency while reducing energy consumption and resource waste. To further validate the proposed method, an illustrative example using a partner company’s production data demonstrates its accuracy. © 2014 IEEE.

关键词： Circular economy

来源：评论

学校读者我要写书评

暂无评论

NeuVSA: A Unified and Efficient Accelerator for Neural Vector Search 31

NeuVSA: A Unified and Efficient Accelerator for Neural Vecto...

引用

31st IEEE International Symposium on High Performance Computer Architecture, HPCA 2025

作者： Yuan, Ziming Dai, Lei Li, Wen Zhang, Jie Liang, Shengwen Wang, Ying Liu, Cheng Li, Huawei Li, Xiaowei Guo, Jiafeng Wang, Peng Chen, Renhai Zhang, Gong Shanxi University School of Computer and Information Technology China Peking University School of Computer Science China Institute of Computing Technology CAS State Key Lab of Processors China University of Chinese Academy of Sciences China Zhongguancun National Laboratory Beijing China Institute of Computing Technology CAS Key Lab of Network Data Science and Technology China Huawei Technologies Co. Ltd. China

ISBN: (纸本)9798331506476

Neural Vector Search (NVS) has exhibited superior search quality over traditional key-based strategies for information retrieval tasks. An effective NVS architecture requires high recall, low latency, and high throughput to enhance user experience and cost-efficiency. However, implementing NVS on existing neural network accelerators and vector search accelerators is sub-optimal due to the separation between the embedding stage and vector search stage at both algorithm and architecture levels. Fortunately, we unveil that Product Quantization (PQ) opens up an opportunity to break separation. However, existing PQ algorithms and accelerators still focus on either the embedding stage or the vector search stage, rather than both simultaneously. Simply combining existing solutions still follows the beaten track of separation and suffers from insufficient parallelization, frequent data access conflicts, and the absence of scheduling, thus failing to reach optimal recall, latency, and throughput. To this end, we propose a unified and efficient NVS accelerator dubbed NeuVSA based on algorithm and architecture co-design philosophy. Specifically, on the algorithm level, we propose a learned PQ-based unified NVS algorithm that consolidates two separate stages into the same computing and memory access paradigm. It integrates an end-to-end joint training strategy to learn the optimal codebook and index for enhanced recall and reduced PQ complexity, thus achieving smoother acceleration. On the architecture level, we customize a homogeneous NVS accelerator based on the unified NVS algorithm. Each sub-accelerator is optimized to exploit all parallelism exposed by unified NVS, incorporating a structured index assignment strategy and an elastic on-chip buffer to alleviate buffer conflicts for reduced latency. All sub-accelerators are coordinated using a hardware-aware scheduling strategy for boosted throughput. Experimental results show that the joint training strategy improves recall

关键词： network embeddings

来源：评论

学校读者我要写书评

暂无评论

Differentially Private Federated Stochastic Primal-Dual Learning for Internet of Vehicles

引用

IEEE Internet of Things Journal 2025年第11期12卷 17034-17050页

作者： Li, Yiwei Wang, Shuai Chang, Tsung-Hui Xiamen University of Technology Fujian Key Laboratory of Communication Network and Information Processing Xiamen361024 China University of Electronic Science and Technology of China National Key Laboratory of Wireless Communications Chengdu611731 China The Chinese University of Hong Kong Shenzhen School of Science and Engineering Shenzhen Research Institute of Big Data Shenzhen518172 China

Federated learning (FL) has the potential to empower Internet-of-Vehicles (IoV) networks by enabling smart vehicles (SVs) to participate in the learning process under the orchestration of a vehicular service provider while keeping data locally. In this paper, we propose a novel federated stochastic primal-dual algorithm with differential privacy (FedSPD-DP) to ensure robust privacy protection for FL based IoV (FL-IoV) systems. The FedSPD-DP algorithm leverages multiple steps of local stochastic gradient descent (SGD) and partial client participation (PCP) to improve communication efficiency while incorporating differential privacy (DP) to ensure privacy protection. Our theoretical analysis explores the impact of these strategies on learning performance. Specifically, we demonstrate that the data sampling strategy and PCP enhance data privacy, while a larger number of local SGD steps may increase privacy leakage, revealing a non-trivial tradeoff between communication efficiency and privacy protection. Extensive experiments on real-world data validate the effectiveness of the proposed algorithm, showing superior performance compared to state-of-the-art FL algorithms, and confirming the analytical results and properties. © 2014 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

CroPrompt: Cross-task Interactive Prompting for Zero-shot Spoken Language Understanding

CroPrompt: Cross-task Interactive Prompting for Zero-shot Sp...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, IcasSP 2025

作者： Qin, Libo Wei, Fuxuan Chen, Qiguang Zhou, Jingxuan Huang, Shijue Si, Jiasheng Lu, Wenpeng Che, Wanxiang School of Computer Science and Engineering Central South University China Key Laboratory of Data Intelligence and Advanced Computing in Provincial Universities Soochow University China Research Center for Social Computing and Information Retrieval Harbin Institute of Technology China Harbin Institute of Technology Shenzhen China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology Shandong Academy of Sciences China

ISBN: (纸本)9798350368741

Slot filling and intent detection are two highly correlated tasks in spoken language understanding (SLU). Recent SLU research attempts to explore zero-shot prompting techniques in large language models to alleviate the data scarcity problem. Nevertheless, the existing prompting work ignores the cross-task interaction information for SLU, which leads to sub-optimal performance. To solve this problem, we present the pioneering work of Cross-task Interactive Prompting (CroPrompt) for SLU, which enables the model to interactively leverage the information exchange across the correlated tasks in SLU. Additionally, we further introduce a multi-task self-consistency mechanism to mitigate the error propagation caused by the intent information injection. We conduct extensive experiments on the standard SLU benchmark and the results reveal that CroPrompt consistently outperforms the existing prompting approaches. In addition, the multi-task self-consistency mechanism can effectively ease the error propagation issue, thereby enhancing the performance. We hope this work can inspire more research on cross-task prompting for SLU. © 2025 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Surface-Continuous Scene Representation for Light Field Depth Estimation via Planarity Prior

引用

IEEE Transactions on Circuits and Systems for Video technology 2025年第5期35卷 5051-5066页

作者： Chen, Rongshan Sheng, Hao Yang, Da Cui, Zhenglong Cong, Ruixuan Beihang University State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beijing100191 China Beihang University Key Laboratory of Data Science and Intelligent Computing Hangzhou International Innovation Institute Zhejiang Hangzhou311115 China Macao Polytechnic University Faculty of Applied Sciences China

Light field (LF) imaging captures both spatial and angular information of the real world, enabling precise depth estimation. However, images are merely discrete expressions of scenes. Limited by imaging technology, LF camera cannot capture the infinite rays emitted by scenes, leading to the discrete information storage (e.g. pixel). Consequently, previous deep learning methods have encountered challenges in accurately extracting depth information from LF images. In this paper, we investigate a surface-continuous scene representation using planarity prior and design PlaneNet, a Plane-based network that successfully generates highly detailed depth maps for real scenes. Specifically, inspired by the plane assumption that real-world scenes generally yield piecewise smooth surfaces, we refine it to the pixel level for continuous surface approximation, which can overcome the limitations of discrete representation. Rather than explicitly parameterizing planes as multiple coefficients, we propose a novel plane regular sampling operator (PRSO), enabling the network to fit smooth depth surfaces easily. To explore the role of our theory at the feature level, we also introduce PRSO into the intermediate layers of PlaneNet. Experiments show that our method achieves state-of-the-art performance on both synthetic and real-world LF scenes, ranking 1st (MSE) on the HCI 4D Light Field benchmark. Furthermore, we explore the utilization of our representation in multiple LF depth estimation networks, and experiments demonstrate improved performance when surface-continuous representation is applied. © 1991-2012 IEEE.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Successive Interference Cancellation-Enabled Timely Status Update in Linear Multi-Hop Wireless networks

引用

IEEE Transactions on Mobile computing 2025年第6期24卷 5298-5311页

作者： Han, Xinhui Pan, Haoyuan Wang, Zhaorui Li, Jianqiang Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China Future Network of Intelligence Institute School of Science and Engineering Shenzhen518172 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology College of Computer Science and Software Engineering Shenzhen518060 China

We investigate the timely status update in linear multi-hop wireless networks, where a source tries to deliver status update packets to a destination through a sequence of half-duplex relays. Timeliness is measured by the age of information (AoI) metric. Maintaining a low AoI at the destination typically necessitates frequent transmission of update packets from the source. However, high packet transmission frequency in multi-hop scenarios can result in mutual wireless interference at intermediate relays. Specifically, when an intermediate relay receives wireless signals of a new packet from its previous node, simultaneous transmission of an old packet by its subsequent node to the next hop may cause wireless signals to interfere at the intermediate relay, conventionally leading to packet collision. A key motivation to solve this issue is that the intermediate relay has previously received the old packet (which can thus be forwarded to the subsequent node for further relaying). Hence, successive interference cancellation (SIC) can be employed to mitigate interference of the old packet and recover the new packet. This paper designs an SIC-enabled packet relaying scheme tailored to low AoI. Initially focusing on a three-hop network, we subsequently extend our approach to general multi-hop networks. We model the multi-hop relaying scheme using a Markov chain to derive the theoretical average AoI. Theoretical and simulation results indicate that the SIC-enabled packet relaying scheme significantly reduces the average AoI compared to the non-SIC approaches, owing to an increased packet transmission frequency at the source and the effectiveness of SIC techniques at the relays. © 2002-2012 IEEE.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：