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

arXiv 2025年

作者： Chen, Zheyi Huang, Sijin Min, Geyong Ning, Zhaolong Li, Jie Zhang, Yan College of Computer and Data Science Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Ministry of Education Fujian Key Laboratory of Network Fuzhou350002 China Computing and Intelligent Information Processing [Fuzhou University Fuzhou350116 China Department of Computer Science Faculty of Environment Science and Economy University of Exeter ExeterEX4 4QF United Kingdom School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China Department of Informatics University of Oslo Oslo0316 Norway

Mobile Edge Computing (MEC) offers low-latency and high-bandwidth support for Internet-of-Vehicles (IoV) applications. However, due to high vehicle mobility and finite communication coverage of base stations, it is hard to maintain uninterrupted and high-quality services without proper service migration among MEC servers. Existing solutions commonly rely on prior knowledge and rarely consider efficient resource allocation during the service migration process, making it hard to reach optimal performance in dynamic IoV environments. To address these important challenges, we propose SR-CL, a novel mobility-aware seamless Service migration and Resource allocation framework via Convex-optimization-enabled deep reinforcement Learning in multi-edge IoV systems. First, we decouple the Mixed Integer Nonlinear Programming (MINLP) problem of service migration and resource allocation into two sub-problems. Next, we design a new actor-critic-based asynchronous-update deep reinforcement learning method to handle service migration, where the delayed-update actor makes migration decisions and the one-step-update critic evaluates the decisions to guide the policy update. Notably, we theoretically derive the optimal resource allocation with convex optimization for each MEC server, thereby further improving system performance. Using the real-world datasets of vehicle trajectories and testbed, extensive experiments are conducted to verify the effectiveness of the proposed SR-CL. Compared to benchmark methods, the SR-CL achieves superior convergence and delay performance under various scenarios. Copyright © 2025, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

A Blockchain-Based Distributed Collaborative Sensing and Spectrum Access Approach for Consumer Electronics

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Peng, Yuhuai Li, Yuan Guo, Yu Zhang, Dawei Khan, Fazlullah Alturki, Ryan Alshawi, Bandar Northeastern University College of Computer Science and Engineering Shenyang110819 China Zhiyuan Research Institute Xihu District Hangzhou China Zhengzhou University School of Computer and Artificial Intelligence Henan Zhengzhou450001 China University of Nottingham Ningbo China School of Computer Science Faculty of Science and Engineering Zhejiang Ningbo315104 China KKR and KSR Institute of Technology and Sciences Department of Computer Science and Engineering Andhra Pradesh Guntur India Division of Research and Development Lovely Professional University Phagwara India University Centre of Research and Development Chandigarh University Mohali India Umm Al-Qura University Department of Software Engineering College of Computing Makkah Saudi Arabia Umm Al-Qura University College of Computing Department of Computer and Network Engineering Makkah Saudi Arabia

Cognitive radio (CR) provides key technical support for the seamless communication of consumer electronic (CE) devices through distributed cooperative sensing and spectrum access. However, its openness and dynamic nature introduce potential security risks and challenges. Due to the openness of wireless communication, spectrum sensing and access are vulnerable to malicious attacks, and resource-constrained devices cannot effectively implement artificial intelligence (AI)-driven encryption and access control strategies. To address these limitations, this study proposes a blockchain-based distributed collaborative sensing method for CE devices. In the proposed method, after sensing, the smart contracts verify node legitimacy using the ring signature method. The malicious users are rejected by the outlier detection method, which improves the collaborative anti-interference ability. In addition, by using a centralized training and distributed execution architecture, a secure spectrum sensing strategy based on multi-agent reinforcement learning is designed. The proposed strategy ensures that each node makes independent decisions, which enhances the adaptability of the CE ecosystem. The proposed method is verified by extensive simulations, and the results show that it can maintain spectrum awareness of more than 95.72% and an access success rate of 91.19% under malicious attacks. Moreover, communication overhead is significantly reduced by approximately 93.53%. © 1975-2011 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Path optimization method for the sign problem caused by the fermion determinant

引用

Physical Review D 2025年第9期111卷 094503-094503页

作者： Kazuki Hisayoshi Kouji Kashiwa Yusuke Namekawa Hayato Takase Department of Computer Science and Engineering Faculty of Information Engineering Fukuoka Institute of Technology Fukuoka 811-0295 Japan Education and Research Center for Artificial Intelligence and Data Innovation Hiroshima University Hiroshima 730-0053 Japan

The path optimization method with machine learning is applied to the one-dimensional massive lattice Thirring model, which has the sign problem caused by the fermion determinant. This study aims to investigate how the path optimization method works for the sign problem. We show that the path optimization method successfully reduces statistical errors and reproduces the analytic results. We also examine an approximation of the Jacobian calculation in the learning process and show that it gives consistent results with those without an approximation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities

arXiv

引用

arXiv 2024年

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Department of Computer Science University of Colorado Colorado Springs Colorado SpringsCO United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 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 China JinYinHu Laboratory Wuhan China

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter-Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulnerability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. Copyright © 2024, The Authors. All rights reserved.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities

On the Effectiveness of Function-Level Vulnerability Detecto...

引用

International Conference on Software Engineering (ICSE)

作者： Zhen Li Ning Wang Deqing Zou Yating Li Ruqian Zhang Shouhuai Xu Chao Zhang 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 School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Jin YinHu Laboratory Wuhan China Department of Computer Science University of Colorado Colorado Springs Colorado Springs Colorado USA Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9798400702174

ISBN: (纸本)9798350382143

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers; and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities.

关键词： Deep learning Detectors Open source software Software engineering

来源：评论

学校读者我要写书评

暂无评论

VC dimensions of group convolutional neural networks

arXiv

引用

arXiv 2022年

作者： Petersen, Philipp Christian Sepliarskaia, Anna University of Vienna Faculty of Mathematics and Research Network Data Science @ Uni Vienna Kolingasse 14-16 Wien1090 Austria

We study the generalization capacity of group convolutional neural networks. We identify precise estimates for the VC dimensions of simple sets of group convolutional neural networks. In particular, we find that for infinite groups and appropriately chosen convolutional kernels, already two-parameter families of convolutional neural networks have an infinite VC dimension, despite being invariant to the action of an infinite *** Codes 68T07, 68Q32, 68T05 © 2022, CC BY.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Retraction Note: A Systematic Survey on Implementation of Fuzzy Regression Models for Real Life Applications

引用

Archives of Computational Methods in Engineering 2025年 1-2页

作者： Khan, Mufala Kumar, Rakesh Aledaily, Arwa N. Kariri, Elham Viriyasitavat, Wattana Yadav, Kusum Dhiman, Gaurav Kaur, Amandeep Sharma, Ashutosh Vimal, S. Department of Mathematics Lovely Professional University Phagwara India College of Computer Science and Engineering University of Ha’il Hail Saudi Arabia College of Computer Science and Engineering Prince Sattam Bin Abdulaziz University Al‑Kharj Saudi Arabia Business Information Technology Division Department of Statistics Faculty of Commerce and Accountancy Chulalongkorn University Bangkok Thailand Department of Computer Science Government Bikram College of Commerce Patiala India Department of Electrical and Computer Engineering Lebanese American University Byblos Lebanon University Centre for Research and Development Department of Computer Science and Engineering Chandigarh University Gharuan India Department of Computer Science and Engineering Graphic Era Deemed to be University Dehradun India Chitkara University Institute of Engineering and Technology Chitkara University Rajpura India School of Computer Science University of Petroleum and Energy Studies Dehradun India Department of Artificial Intelligence and Data Science Ramco Institute of Technology Rajaplayam India

来源：评论

学校读者我要写书评

暂无评论

PrintListener: Uncovering the Vulnerability of Fingerprint Authentication via the Finger Friction Sound

arXiv

引用

arXiv 2024年

作者： Zhou, Man Su, Shuao Wang, Qian Li, Qi Zhou, Yuting Ma, Xiaojing Li, Zhengxiong School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Cyber Science and Engineering Wuhan University China Institute for Network Sciences and Cyberspace Tsinghua University China Department of Computer Science and Engineering University of Colorado Denver United States Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology China

Fingerprint authentication has been extensively employed in contemporary identity verification systems owing to its rapidity and cost-effectiveness. Due to its widespread use, fingerprint leakage may cause sensitive information theft, enormous economic and personnel losses, and even a potential compromise of national security. As a fingerprint that can coincidentally match a specific proportion of the overall fingerprint population, MasterPrint rings the alarm bells for the security of fingerprint authentication. In this paper, we propose a new side-channel attack on the minutiae-based Automatic Fingerprint Identification System (AFIS), called PrintListener, which leverages users’ fingertip swiping actions on the screen to extract fingerprint pattern features (the first-level features) and synthesizes a stronger targeted PatternMasterPrint with potential second-level features. The attack scenario of PrintListener is extensive and covert. It only needs to record users’ fingertip friction sound and can be launched by leveraging a large number of social media platforms. Extensive experimental results in real-world scenarios show that Printlistener can significantly improve the attack potency of MasterPrint. © 2024, CC0.

关键词： Friction

来源：评论

学校读者我要写书评

暂无评论

Unlabeled Imperfect Demonstrations in Adversarial Imitation Learning

arXiv

引用

arXiv 2023年

作者： Wang, Yunke Du, Bo Xu, Chang School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University Wuhan China School of Computer Science Faculty of Engineering The University of Sydney Australia

Adversarial imitation learning has become a widely used imitation learning framework. The discriminator is often trained by taking expert demonstrations and policy trajectories as examples respectively from two categories (positive vs. negative) and the policy is then expected to produce trajectories that are indistinguishable from the expert demonstrations. But in the real world, the collected expert demonstrations are more likely to be imperfect, where only an unknown fraction of the demonstrations are optimal. Instead of treating imperfect expert demonstrations as absolutely positive or negative, we investigate unlabeled imperfect expert demonstrations as they are. A positive-unlabeled adversarial imitation learning algorithm is developed to dynamically sample expert demonstrations that can well match the trajectories from the constantly optimized agent policy. The trajectories of an initial agent policy could be closer to those non-optimal expert demonstrations, but within the framework of adversarial imitation learning, agent policy will be optimized to cheat the discriminator and produce trajectories that are similar to those optimal expert demonstrations. Theoretical analysis shows that our method learns from the imperfect demonstrations via a self-paced way. Experimental results on MuJoCo and RoboSuite platforms demonstrate the effectiveness of our method from different aspects. Copyright © 2023, The Authors. All rights reserved.

关键词： Demonstrations

来源：评论

学校读者我要写书评

暂无评论

Automatic Deep Sparse Multi-Trial Vector-based Differential Evolution Clustering with Manifold Learning and Incremental Technique

TechRxiv

引用

TechRxiv 2023年

作者： Hadikhani, Parham Lai, Daphne Teck Ching Ong, Wee-Hong Nadimi-Shahraki, Mohammad H. The School of Digital Science Universiti Brunei Darussalam Brunei Faculty of Computer Engineering Big Data Research Center Najafabad Branch Islamic Azad University Najafabad Iran

Most deep clustering methods despite providing complex networks to learn better from data, use a shallow clustering method. These methods have difficulty in finding good clusters due to the lack of ability to handle between local search and global search to prevent premature convergence. In other words, they do not consider different aspects of the search and it causes them to get stuck in the local optimum. In addition, the majority of existing deep clustering approaches perform clustering with the knowledge of the number of clusters, which is not practical in most real scenarios where such information is not available. To address these problems, this paper presents a novel automatic deep sparse clustering approach based on an evolutionary algorithm called Multi-Trial Vector-based Differential Evolution (MTDE). Sparse auto-encoder is first applied to extract embedded features. Manifold learning is then adopted to obtain representation and extract the spatial structure of features. Afterward, MTDE clustering is performed without prior information on the number of clusters to find the optimal clustering solution. The proposed approach was evaluated on various datasets, including images and time-series. The results demonstrate that the proposed method improved MTDE by 18.94 % on average and compared to the most recent deep clustering algorithms, is consistently among the top three in the majority of datasets. © 2023, CC BY.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：