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

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

来源：评论

学校读者我要写书评

暂无评论

Through-Wall Mobile Charging: Theory, Methodology, and Implementation

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 4971-4986页

作者： Sun, Yu Lin, Chi Yang, Wei Dai, Haipeng Ren, Jiankang Wang, Lei Wu, Guowei Dalian University of Technology School of Software Technology Dalian116024 China Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province Dalian116621 China Nanjing University State Key Laboratory for Novel Software Technology Jiangsu Nanjing210023 China Dalian University of Technology School of Computer Science and Technology Dalian116024 China

Wireless Power Transfer (WPT) has revolutionized the field of Wireless Rechargeable Sensor networks (WRSNs), enabling sustainable operation of sensor nodes. Traditional mobile charging methods often require sensors to be within line-of-sight or physically accessed by the mobile charger, which may potentially lead to user safety or privacy concerns. Addressing this concern, this work is the first to introduce and validate the feasibility of Through-Wall charging. We formulate the Wireless charging thrOugh Walls (WOW) problem to simultaneously enhance user safety and maximize charging utility. Our approach leverages fundamental principles of electromagnetics to construct an accurate charging model for Magnetic Resonance Coupling-based WPT systems. Additionally, we thoroughly analyze the impact of wall obstruction and provide a generalized framework for through-wall charging. By employing discretization techniques and approximation algorithms, we derive a near-optimal solution to the WOW problem. Extensive simulations and test-bed experiments demonstrate that our proposed approach reduces the reliance on physical access to devices, simplifies deployment in complex environments, and thereby optimizes the travel paths of mobile chargers and enhances the overall performance and lifetime of WRSNs. Compared to conventional methods, our method benefits from more reasonable scheduling order and path construction, achieving an average energy efficiency improvement of 27.8%. © 2002-2012 IEEE.

关键词： Wireless charging

来源：评论

学校读者我要写书评

暂无评论

Accurate 3D Wireless Charging

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 4733-4746页

作者： Yang, Wei Lin, Chi Sun, Yu Dai, Haipeng Ren, Jiankang Wang, Lei Wu, Guowei Dalian University of Technology Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province DUT School of Software Technology DUT-RU International School of Information Science and Engineering Dalian China Nanjing University State Key Laboratory for Novel Software Technology Jiangsu Nanjing210023 China Dalian University of Technology School of Computer Science and Technology Dalian116024 China

Wireless Rechargeable Sensor networks (WRSNs) have become an important research issue as they can overcome the energy bottleneck problem of wireless sensor networks. However, existing 2D charging methods suffer from significant errors in 3D scenarios, which leads to a huge gap between theoretical results and practical applications, hindering the widespread adoption of WRSNs. In this paper, we address the chargIng utility maximizatioN problem In 3D environmenT (INIT) and provide a general solution suitable for any type of transceiver antenna. Specifically, we first establish an accurate 3D charging model to quantify the received power of sensors in 3D environments. Secondly, we design an angle-distance discretization scheme to determine appropriate charging spots for the Mobile Charger (MC). Then, we transform the mobile charging problem into a submodular function maximization problem and propose an approximation algorithm with guaranteed performance to solve it. Finally, our method has been extensively evaluated through experiments and simulations and has demonstrated considerable advantages over other comparison algorithms in real-world 3D environments. On average, it has achieved an impressive 34.8% improvement in charging utility and a remarkable 56.1% reduction in the number of dead sensors. © 2002-2012 IEEE.

关键词： Charging stations

来源：评论

学校读者我要写书评

暂无评论

Fairness-Aware Budgeted Edge Server Placement for Connected Autonomous Vehicles

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 4762-4776页

作者： Wu, Jintao Xu, Xiaolong Cui, Guangming Zhang, Yiwen Qi, Lianyong Dou, Wanchun Cai, Zhipeng Nanjing University of Information Science & Technology Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services School of Software Nanjing210044 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanjing University of Information Science & Technology Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services School of Software China Nanjing University State Key Laboratory for Novel Software Technology China Anhui University School of Computer Science and Technology Anhui230031 China College of Computer Science and Technology Qingdao266580 China Nanjing University State Key Laboratory for Novel Software Technology Nanjing210023 China Georgia State University Department of Computer Science United States

Mobile edge computing (MEC) considerably enhances the capabilities and performance of connected autonomous vehicles (CAVs) by deploying edge servers (ESs) on roadside units (RSUs) near CAVs, thereby ensuring low-latency services. Given the constrained and costly nature of ES resources (computing, storage, and bandwidth), equitable ES utilization is critical for CAV operations. However, fairness considerations are often overlooked in current budgeted edge server placement (ESP) strategies, potentially worsening resource imbalances and compromising user experience. This paper investigates the fairness-aware budgeted edge server placement (FESP) problem within RSUs, proving its NP-hardness. To address FESP, we first propose FESP-O, an integer programming-based optimal approach for small-scale problems, followed by FESP-APX, an approximation approach for large-scale scenarios that provides near-optimal solutions. We analyze the time complexity and approximation ratio of our proposed algorithms and validate their efficacy through experiments on real-world datasets. Extensive experimental results demonstrate significant performance improvements over baseline and state-of-the-art methods, indicating practical suitability and efficiency. © 2002-2012 IEEE.

关键词： Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

VmPTP: Precise Time Protocol for Inter-VM Communication in Embedded Virtualized Systems

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2025年第3期44卷 897-910页

作者： Zhao, Sirong Xie, Guoqi Ma, Wenhong Ren, Wei Li, Kenli Hunan University Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan Changsha410082 China Huawei Technology Co. Ltd. Central Software Institute Guangdong Shenzhen518129 China

System virtualization techniques are gradually applied to embedded systems with the performance improvement of embedded devices;however, there is a large time offset (i.e., deviation) of hundreds of ms between virtual machines (VMs) due to the drift of the virtualization abstraction layer and the jitter phenomenon. It is urgent to significantly reduce this offset by time synchronization techniques. Unfortunately, the current mainstream time synchronization software (e.g., Chrony and LinuxPTP) cannot be used in the embedded virtualized system connected by the fieldbus, such as controller area network (CAN);meanwhile, drift correction-based time synchronization techniques dedicated to CAN bus cannot be utilized for virtualized systems. In this study, we design a general vmPTP, which is a precise time protocol (PTP) for inter-VM communication in embedded virtualized systems based on Linux kernel-based VM (KVM). This is the first time synchronization work focused on embedded virtualized systems. We implement two vmPTP versions based on VirtIO and inter-VM shared memory (IVSHMEM) according to the four message (i.e., packet) exchanges of PTP. We propose an asymmetry compensation strategy to solve the problem of asymmetric rate of I/O operations in the message exchange process, which optimizes the offset computation. We further produce a convergence stopping approach which can continuously converge the offset until the offset is within the given bound and stop. We conduct experimental evaluations on both X86-64 and ARM64 architectures. For two versions of vmPTP, the experimental results show that: 1) the offsets are always within 1μ s on two architectures;2) the offsets are less than that of LinuxPTP and Chrony;and 3) the vmPTP's CPU and memory utilization on the X86-64 architecture are merely 0.3% and 0.1%, respectively, whereas those on the ARM64 architecture are 3.8% and 0.1%, respectively. We experiment with vmPTP in real-time application and the result demonstrates th

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

Feature Augmented Meta-Learning on Domain Generalization for Evolving Malware Classification 24th

Feature Augmented Meta-Learning on Domain Generalization fo...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Wang, Fangwei Chen, Yinhe Song, Ruixin Li, Qingru Wang, Changguang Key Laboratory of Network and Information Security of Hebei Province College of Computer and Cyber Security Hebei Normal University Shijiazhuang050024 China College of Computer Science and Technology Guizhou University Guiyang550025 China

ISBN: (纸本)9789819615278

The proliferation of malware has resulted in substantial harm to various sectors and economies. Various deep learning-based malware classification methods have been suggested as a means of mitigating malware threats. These methods typically operate under the assumption of independent and identically distributed training and test data. However, this assumption becomes invalid with the evolving malware family. While domain adaptation models offer a potential solution to this issue, their implementation is hindered by the difficulty of collecting new malware variants. In order to address the previously mentioned problem, we suggest an image-based technique for categorizing malware families utilizing domain generalization. Initially, malware is transformed into gray-scale images that depict byte patterns of the malware. Subsequently, these gray-scale images are fed into a model incorporating convolutional block attention to extract features. Furthermore, data augmentation is implemented at the feature level to broaden the distribution of the source domain and enhance the model’s generalization capabilities. Finally, meta-learning is utilized as a training approach to effectively extract domain-invariant representations. A series of experiments are conducted on the BIG2015 and BenchMFC-G1P1P2. The proposed method demonstrates a higher accuracy rate of 88.66% on the BIG2015 and 80.25% on the BenchMFC-G1P1P2, which is better than the existing methods. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Domain Generalization Domain Shift Feature Argumentation Malware Classification

来源：评论

学校读者我要写书评

暂无评论

Potential mechanisms of non-coding RNA regulation in Alzheimer's disease

引用

Neural Regeneration Research 2026年第1期21卷 265-280页

作者： Yue Sun Xinping Pang Xudong Huang Dinglu Liu Jingyue Huang Pengtao Zheng Yanyu Wei Chaoyang Pang College of Computer Science Sichuan Normal UniversityChengduSichuan ProvinceChina School of Science Xi’an Jiaotong-Liverpool UniversitySuzhouJiangsu ProvinceChina Neurochemistry Laboratory Department of PsychiatryMassachusetts General Hospital and Harvard Medical SchoolCharlestownMAUSA National Key Laboratory of Science and Technology on Vacuum Electronics School of Electronic Science and EngineeringUniversity of Electronic Science and Technology of ChinaChengduSichuan ProvinceChina

Alzheimer's disease,a progressively degenerative neurological disorder,is the most common cause of dementia in the *** its precise etiology remains unclear,researchers have identified diverse pathological characteristics and molecular pathways associated with its *** in scientific research have increasingly highlighted the crucial role of non-coding RNAs in the progression of Alzheimer's *** non-coding RNAs regulate several biological processes critical to the advancement of the disease,offering promising potential as therapeutic targets and diagnostic ***,this review aims to investigate the underlying mechanisms of Alzheimer's disease onset,with a particular focus on microRNAs,long non-coding RNAs,and circular RNAs associated with the *** review elucidates the potential pathogenic processes of Alzheimer's disease and provides a detailed description of the synthesis mechanisms of the three aforementioned non-coding *** comprehensively summarizes the various non-coding RNAs that have been identified to play key regulatory roles in Alzheimer's disease,as well as how these noncoding RNAs influence the disease's progression by regulating gene expression and protein *** example,miR-9 targets the UBE4B gene,promoting autophagy-mediated degradation of Tau protein,thereby reducing Tau accumulation and delaying Alzheimer's disease ***,the long non-coding RNA BACE1-AS stabilizes BACE1 mRNA,promoting the generation of amyloid-βand accelerating Alzheimer's disease ***,circular RNAs play significant roles in regulating neuroinflammatory *** integrating insights from these regulatory mechanisms,there is potential to discover new therapeutic targets and potential biomarkers for early detection and management of Alzheimer's *** review aims to enhance the understanding of the relationship between Alzheimer's disease and non-coding RNAs,potentially pav

关键词： Alzheimer's disease biomarkers circular RNA long non-coding RNA microRNA ncRNA regulation neurodegeneration non-coding RNA pathogenesis therapeutic targets

来源：评论

学校读者我要写书评

暂无评论

TEF: Causality-Aware Taxonomy Expansion via Front-Door Criterion 31

TEF: Causality-Aware Taxonomy Expansion via Front-Door Crite...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Meng, Yuan Zhai, Songlin Zhang, Yuxin Hu, Zhongjian Qi, Guilin School of Computer Science and Engineering Southeast University Jiangsu Province China Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Southeast University Ministry of Education China

ISBN: (纸本)9798891761964

Taxonomy expansion is a primary method for enriching taxonomies, involves appending a large number of additional nodes (i.e., queries) to an existing taxonomy (i.e., seed), with the crucial step being the identification of the appropriate anchor (parent node) for each query by incorporating the structural information of the seed. Despite advancements, existing research still faces an inherent challenge of spurious query-anchor matching, often due to various interference factors (e.g., the consistency of sibling nodes), resulting in biased identifications. To address the bias in taxonomy expansion caused by unobserved factors, we introduce the Structural Causal Model (SCM), known for its bias elimination capabilities, to prevent these factors from confounding the task through backdoor paths. Specifically, we employ the Front-Door Criterion, which guides the decomposition of the expansion process into a parser module and a connector. This enables the proposed causal-aware Taxonomy Expansion model to isolate confounding effects and reveal the true causal relationship between the query and the anchor. Extensive experiments on three benchmarks validate the effectiveness of TEF, with a notable 6.1% accuracy improvement over the state-of-the-art on the SemEval16-Environment dataset. © 2025 Association for Computational Linguistics.

关键词： Expansion

来源：评论

学校读者我要写书评

暂无评论

Efficient and fine-grained access control with fully-hidden policies for cloud-enabled IoT

引用

Digital Communications and networks 2025年第2期11卷 473-481页

作者： Li, Qi Liu, Gaozhan Zhang, Qianqian Han, Lidong Chen, Wei Li, Rui Xiong, Jinbo School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Key Laboratory of Cryptography of Zhejiang Province Hangzhou Normal University Hangzhou311121 China Tongda College of Nanjing University of Posts and Telecommunications Yangzhou225127 China Henan Key Laboratory of Network Cryptography Technology Zhengzhou450001 China School of Computer Science and Technology Xidian University Xi'an710071 China State Key Laboratory of Tibetan Intelligent Information Processing and Application Qinghai Normal University Xining810008 China Faculty of Software Fujian Normal University Fuzhou350108 China

Ciphertext-Policy Attribute-Based Encryption (CP-ABE) enables fine-grained access control on ciphertexts, making it a promising approach for managing data stored in the cloud-enabled Internet of Things. But existing schemes often suffer from privacy breaches due to explicit attachment of access policies or partial hiding of critical attribute content. Additionally, resource-constrained IoT devices, especially those adopting wireless communication, frequently encounter affordability issues regarding decryption costs. In this paper, we propose an efficient and fine-grained access control scheme with fully hidden policies (named FHAC). FHAC conceals all attributes in the policy and utilizes bloom filters to efficiently locate them. A test phase before decryption is applied to assist authorized users in finding matches between their attributes and the access policy. Dictionary attacks are thwarted by providing unauthorized users with invalid values. The heavy computational overhead of both the test phase and most of the decryption phase is outsourced to two cloud servers. Additionally, users can verify the correctness of multiple outsourced decryption results simultaneously. Security analysis and performance comparisons demonstrate FHAC's effectiveness in protecting policy privacy and achieving efficient decryption. © 2024 Chongqing University of Posts and Telecommunications

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

Disentangled Noisy Correspondence Learning

引用

IEEE Transactions on Image Processing 2025年 34卷 2602-2615页

作者： Dang, Zhuohang Luo, Minnan Wang, Jihong Jia, Chengyou Han, Haochen Wan, Herun Dai, Guang Chang, Xiaojun Wang, Jingdong Xi’an Jiaotong University School of Computer Science and Technology Ministry of Education Key Laboratory of Intelligent Networks and Network Security Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Shaanxi Xi’an710049 China SGIT AI Laboratory Xi’an710048 China State Grid Corporation of China State Grid Shaanxi Electric Power Company Ltd. Xi’an710048 China University of Science and Technology of China School of Information Science and Technology Hefei230026 China Abu Dhabi United Arab Emirates Baidu Inc. Beijing100085 China

Cross-modal retrieval is crucial in understanding latent correspondences across modalities. However, existing methods implicitly assume well-matched training data, which is impractical as real-world data inevitably involves imperfect alignments, i.e., noisy correspondences. Although some works explore similarity-based strategies to address such noise, they suffer from sub-optimal similarity predictions influenced by modality-exclusive information (MEI), e.g., background noise in images and abstract definitions in texts. This issue arises as MEI is not shared across modalities, thus aligning it in training can markedly mislead similarity predictions. Moreover, although intuitive, directly applying previous cross-modal disentanglement methods suffers from limited noise tolerance and disentanglement efficacy. Inspired by the robustness of information bottlenecks against noise, we introduce DisNCL, a novel information-theoretic framework for feature Disentanglement in Noisy Correspondence Learning, to adaptively balance the extraction of modality-invariant information (MII) and MEI with certifiable optimal cross-modal disentanglement efficacy. DisNCL then enhances similarity predictions in modality-invariant subspace, thereby greatly boosting similarity-based alleviation strategy for noisy correspondences. Furthermore, DisNCL introduces soft matching targets to model noisy many-to-many relationships inherent in multi-modal inputs for noise-robust and accurate cross-modal alignment. Extensive experiments confirm DisNCL’s efficacy by 2% average recall improvement. Mutual information estimation and visualization results show that DisNCL learns meaningful MII/MEI subspaces, validating our theoretical analyses. © 1992-2012 IEEE.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：