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

Enhanced Practical Byzantine Fault Tolerance for Service Function Chain Deployment: Advancing Big Data Intelligence in Control Systems

引用

Computers, Materials and Continua 2025年第3期83卷 4393-4409页

作者： Peiying Zhang Yihong Yu Jing Liu Chong Lv Lizhuang Tan Yulin Zhang Qingdao Institute of Software College of Computer Science and Technology China University of Petroleum (East China) Qingdao 266580 China Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software Qingdao 266580 China Library of Shanghai Lixin University of Accounting and Finance Shanghai 201209 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan 250014 China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan 250014 China Key Laboratory of Ethnic Language Intelligent Analysis and Security Governance of MOE Minzu University of China Beijing 100081 China Key Laboratory of Intelligent Game Yangtze River Delta Research Institute of NPU Taicang 215400 China Key Laboratory of Education Informatization for Nationalities (Yunnan Normal University) Ministry of Education Kunming 650092 China

As Internet of Things (IoT) technologies continue to evolve at an unprecedented pace, intelligent big data control and information systems have become critical enablers for organizational digital transformation, facilitating data-driven decision making, fostering innovation ecosystems, and maintaining operational stability. In this study, we propose an advanced deployment algorithm for Service Function Chaining (SFC) that leverages an enhanced Practical Byzantine Fault Tolerance (PBFT) mechanism. The main goal is to tackle the issues of security and resource efficiency in SFC implementation across diverse network settings. By integrating blockchain technology and Deep Reinforcement Learning (DRL), our algorithm not only optimizes resource utilization and quality of service but also ensures robust security during SFC deployment. Specifically, the enhanced PBFT consensus mechanism (VRPBFT) significantly reduces consensus latency and improves Byzantine node detection through the introduction of a Verifiable Random Function (VRF) and a node reputation grading model. Experimental results demonstrate that compared to traditional PBFT, the proposed VRPBFT algorithm reduces consensus latency by approximately 30% and decreases the proportion of Byzantine nodes by 40% after 100 rounds of consensus. Furthermore, the DRL-based SFC deployment algorithm (SDRL) exhibits rapid convergence during training, with improvements in long-term average revenue, request acceptance rate, and revenue/cost ratio of 17%, 14.49%, and 20.35%, respectively, over existing algorithms. Additionally, the CPU resource utilization of the SDRL algorithm reaches up to 42%, which is 27.96% higher than other algorithms. These findings indicate that the proposed algorithm substantially enhances resource utilization efficiency, service quality, and security in SFC deployment.

关键词： Big data intelligent transformation heterogeneous networks service function chain blockchain deep reinforcement learning trusted deployment

来源：评论

学校读者我要写书评

暂无评论

DFMC:Feature-Driven Data-Free Knowledge Distillation

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Zhang, Zherui Xu, Rongtao Wang, Changwei Xu, Wenhao Chen, Shunpeng Xu, Shibiao Xu, Guangyuan Guo, Li Beijing University of Posts and Telecommunications School of Artificial Intelligence Beijing100876 China Chinese Academy of Sciences State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Beijing100190 China Qilu University of Technology Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250316 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan250014 China

Data-Free Knowledge Distillation (DFKD) enables knowledge transfer from teacher networks without access to the real dataset. However, generator-based DFKD methods often suffer from insufficient diversity or low-confidence in synthetic images, negatively impacting student network performance. This paper introduces DFMC, a generative feature-driven framework to mitigate the inherent limitations of DFKD. We propose exploiting semantic description between generative feature domains to guide augmentation strategies, avoiding random abstract inputs caused by inconsistent semantic quality. Then, by applying noise to the generative features, we produce contrastive learning pairs indirectly, limiting the sampling range of the feature domain to encourage the student network to learn domain-invariant features. Finally, we guide the student network to deeply mimic the teacher’s layer-wise implicit classification behavior for the augmented synthetic images. Extensive experiments across various datasets and downstream tasks demonstrate the effectiveness of DFMC, achieving significant improvements while preventing student networks from overfitting to semantic ambiguous images. © 1991-2012 IEEE.

关键词： Knowledge transfer

来源：评论

学校读者我要写书评

暂无评论

Focus on Local: Finding Reliable Discriminative Regions for Visual Place Recognition

arXiv

引用

arXiv 2025年

作者： Wang, Changwei Chen, Shunpeng Song, Yukun Xu, Rongtao Zhang, Zherui Zhang, Jiguang Yang, Haoran Zhang, Yu Fu, Kexue Du, Shide Xu, Zhiwei Gao, Longxiang Guo, Li Xu, Shibiao Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences China School of Artificial Intelligence Beijing University of Posts and Telecommunications China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science China MAIS Institute of Automation Chinese Academy of Sciences China Tongji University China College of Computer and Data Science Fuzhou University China Shandong University China

Visual Place Recognition (VPR) is aimed at predicting the location of a query image by referencing a database of geotagged images. For VPR task, often fewer discriminative local regions in an image produce important effects while mundane background regions do not contribute or even cause perceptual aliasing because of easy overlap. However, existing methods lack precisely modeling and full exploitation of these discriminative regions. In this paper, we propose the Focus on Local (FoL) approach to stimulate the performance of image retrieval and re-ranking in VPR simultaneously by mining and exploiting reliable discriminative local regions in images and introducing pseudo-correlation supervision. First, we design two losses, Extraction-Aggregation Spatial Alignment Loss (SAL) and Foreground-Background Contrast Enhancement Loss (CEL), to explicitly model reliable discriminative local regions and use them to guide the generation of global representations and efficient re-ranking. Second, we introduce a weakly-supervised local feature training strategy based on pseudo-correspondences obtained from aggregating global features to alleviate the lack of local correspondences ground truth for the VPR task. Third, we suggest an efficient re-ranking pipeline that is efficiently and precisely based on discriminative region guidance. Finally, experimental results show that our FoL achieves the state-of-the-art on multiple VPR benchmarks in both image retrieval and re-ranking stages and also significantly outperforms existing two-stage VPR methods in terms of computational efficiency. Copyright © 2025, The Authors. All rights reserved.

关键词： Photointerpretation

来源：评论

学校读者我要写书评

暂无评论

MRLATO: An Adaptive Task Offloading Mechanism Based on Meta Reinforcement Learning in Edge computing Environment

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Zhang, Peiying Liu, Jiamin Guizani, Maher Wang, Jian Kumar, Neeraj Tan, Lizhuang Qingdao Institute of Software College of Computer Science and Technology Qingdao266580 China Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software Qingdao266580 China Ministry of Education Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Jinan250014 China University of Texas Arlington Computer Science and Engineering Department TX United States College of Science Qingdao266580 China Thapar University Department of Computer Science and Engineering Patiala147004 India Jinan250014 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan250014 China

Traditional cloud computing models struggle to meet the requirements of latency-sensitive applications when processing large amounts of data. As a solution, Multi-access Edge computing (MEC) extends computing resources to the edge of the network to reduce processing delays and improve user experience. However, in dynamically changing edge computing environments, effective decision making on whether to offload tasks to edge servers remains a core challenge. For this purpose, we propose MRLATO, an adaptive task offloading mechanism based on Meta Reinforcement Learning (MRL), which exploits a large amount of a priori knowledge of different tasks to achieve fast adaptation. The task offloading process is modelled as multiple Markov Decision Processes (MDPs) and solved using a Sequence to Sequence (Seq2Seq) neural network integrating multi-head attention and recursive task sequencing. It is shown by the experimental results that the proposed method has the lowest latency in all experimental settings and the convergence efficiency is improved by 14.06% compared to the traditional Deep Reinforcement Learning (DRL) algorithm. This research fully demonstrates the significant benefits of the deep integration of MRL with the edge computing domain, providing new optimisation ideas for task offloading decisions. © 1967-2012 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

A Triangular Stable Node network based on Self-supervised Learning for personalized prediction

A Triangular Stable Node Network based on Self-supervised Le...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Qing Liu Qian Gao Jun Fan Zhiqiang Zhang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China China Telecom Digital Intelligence Techonology Co Ltd Jinan China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

In recent years, research has illuminated the potency of implicit data processing in enhancing user preferences. Nevertheless, barriers remain in breaking through the constraints of implicit information. This study aims to bridge this gap by firstly constructing a triangular stable node network model, tailored to manage implicit information with precision. Recognizing the challenge of pinpointing novel structures within large-scale graphs, we propose SLTSNN— a triangular stable node network based on self-supervised learning for personalized prediction. SLTSNN innovates by maximizing mutual information between graph-level and patch-level representations, while augmenting graph representations through extended enhanced representations. Additionally, it incorporates triangular data associations and introduces a triangular allocation attention network, which emphasizes strongly correlated preference features among similar users. Furthermore, SLTSNN employs contrastive learning to maximize mutual information between graph vectors and hidden representations, distinguishing between high-order global and local representations. The model’s effectiveness in enhancing user preferences and capturing new graph structures is evidenced by its performance on hit rate and normalized discounted cumulative gain metrics across three datasets.

关键词： Measurement Bridges Contrastive learning Signal processing Data processing Vectors Space exploration Resource management Speech processing Mutual information

来源：评论

学校读者我要写书评

暂无评论

A Robust key Exchange and Tamper-Resistant Protocol for HAN and NAN networks in Smart Grids

引用

IEEE Internet of Things Journal 2025年

作者： Ayub, Muhammad Faizan Li, Xiong Mahmood, Khalid Shamshad, Salman Das, Ashok Kumar Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan The University of Lahore Department of Software Engineering Lahore54590 Pakistan International Institute of Information Technology Center for Security Theory and Algorithmic Research Hyderabad500 032 India Korea University College of Informatics Department of Computer Science and Engineering Anam-ro Seoul145 Korea Republic of Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China

Smart Grids (SG) rely on Home Area networks (HAN) and Neighborhood Area networks (NAN) to ensure efficient power distribution, real-time monitoring, and seamless communication between smart devices. Despite these advantages, the use of public communication channels in HAN and NAN networks introduces critical challenges, such as vulnerability to impersonation, physical tampering, and scalability issues in resource-constrained environments. These issues compromise the stability, reliability, and security of SG environments. Existing protocols often fail to adequately address these challenges, particularly in ensuring resistance to physical tampering of supply lines and impersonation attacks. Additionally, they struggle to minimize the computation, communication, and energy costs associated with securing a resource-constrained SG environment. Therefore, we propose a robust key exchange and tamper-resistant protocol for HAN and NAN networks to address these limitations. The proposed protocol leverages the Physical Unclonable Function (PUF) mechanism to offer physical tampering resistance to smart meters. We validate our protocol formally using the Random or Real (RoR) model, which confirms its security robustness. Additionally, our informal security analysis highlights the protocol's resilience against impersonation, physical tampering attacks, etc. We analyze and compare the performance of the proposed protocol, which further demonstrates our protocol's effectiveness and security compared to competing protocols. Moreover, the proposed protocol achieves resource efficiency with 45.99% and 58.85% substantial reductions in computation overhead and energy overhead, respectively, compared to competing protocols. These results showcase the protocol's enhanced security and practicality for resource-constrained SG environments. © 2014 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

Provably Secure Efficient key-Exchange Protocol for Intelligent Supply Line Surveillance in Smart Grids

引用

IEEE Internet of Things Journal 2025年

作者： Ayub, Muhammad Faizan Li, Xiong Mahmood, Khalid Alenazi, Mohammed J.F. Das, Ashok Kumar Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu12599 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan Department of Computer Engineering Riyadh11451 Saudi Arabia International Institute of Information Technology Center for Security Theory and Algorithmic Research Hyderabad500 032 India Korea University College of Informatics Department of Computer Science and Engineering Anam-ro Seoul145 Korea Republic of Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security China Shandong Fundamental Research Center for Computer Science Jinan 250353 China

Intelligent supply line surveillance is critical for modern smart grids. Smart sensors and gateway nodes are strategically deployed along supply lines to achieve intelligent surveillance. They collect data continuously and transmit it to the control centre in real-time. It enables real-time monitoring, fault detection, and efficient energy management across distribution networks. This advanced surveillance system ensures continuous monitoring of supply lines, detecting anomalies, and optimizing operations to maintain the stability and reliability of the smart grid. However, the reliance of all participating nodes on public communication channels to transmit supply line surveillance data exposes these systems to critical cyber attacks. These cyber attacks include impersonation, physical tampering, ephemeral secret leakage, and desynchronization attacks. To address these issues, existing key-exchange protocols often fail to ensure robust security while imposing high computation and communication overheads, limiting their practicality for resource-constrained environments. Therefore, we propose a secure and efficient key exchange and tamper-resistant authentication protocol using Elliptic Curve Cryptography (ECC) and Physical Unclonable Functions (PUFs). The PUF mechanism provides robust resistance against physical tampering and cloning attacks, ensuring enhanced physical security for supply line devices. We validate the security robustness of the devised protocol using the Random or Real (ROR) model. Furthermore, informal security analysis demonstrates the protocol's robustness in rigorously resisting various attacks, including physical tampering, impersonation, ephemeral secret leakage and desynchronization. Moreover, we determine the performance evaluation that reveals the protocol's superior efficiency compared to competing protocols, achieving significant reductions of 28.64% in computation overhead and 9.96% in communication overhead. © 2014 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

Federated Semantic Learning for Privacy-preserving Cross-domain Recommendation

arXiv

引用

arXiv 2025年

作者： Lu, Ziang Guo, Lei Yu, Xu Cheng, Zhiyong Han, Xiaohui Zhu, Lei Shandong Normal University Shandong Jinan250358 China Shandong Qingdao266580 China Hefei University of Technology Anhui Hefei230009 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology Shandong Academy of Sciences Shandong Jinan250014 China Tongji University Shanghai Jinan200092 China

In the evolving landscape of recommender systems, the challenge of effectively conducting privacy-preserving Cross-Domain Recommendation (CDR), especially under strict non-overlapping constraints, has emerged as a key focus. Despite extensive research has made significant progress, several limitations still exist: 1) Previous semantic-based methods fail to deeply exploit rich textual information, since they quantize the text into codes, losing its original rich semantics. 2) The current solution solely relies on the text-modality, while the synergistic effects with the ID-modality are ignored. 3) Existing studies do not consider the impact of irrelevant semantic features, leading to inaccurate semantic representation. To address these challenges, we introduce federated semantic learning and devise FFMSR as our solution. For Limitation 1, we locally learn items’ semantic encodings from their original texts by a multi-layer semantic encoder, and then cluster them on the server to facilitate the transfer of semantic knowledge between domains. To tackle Limitation 2, we integrate both ID and Text modalities on the clients, and utilize them to learn different aspects of items. To handle Limitation 3, a Fast Fourier Transform (FFT)-based filter and a gating mechanism are developed to alleviate the impact of irrelevant semantic information in the local model. We conduct extensive experiments on two real-world datasets, and the results demonstrate the superiority of our FFMSR method over other SOTA methods. Our source codes are publicly available at: https://***/Sapphire-star/FFMSR. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

DHD: Double Hard Decision Decoding Scheme for NAND Flash Memory

DHD: Double Hard Decision Decoding Scheme for NAND Flash Mem...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Lanlan Cui Yichuan Wang Renzhi Xiao Miao Li Xiaoxue Liu Xinhong Hei School of Computer Science and Engineering XI'AN University of Technology Xi'an China Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an China School of Software Engineering Jiangxi University of Science and Technology Nanchang China School of Information Engineering Zhongnan University of Economics and Law Wuhan China

ISBN: (数字)9783982674100

ISBN: (纸本)9798331534646

With the advancement of NAND flash technology, the increased storage density leads to intensified interference, which in turn raises the error rate during data retrieval. To ensure data reliability, low-density parity-check (LDPC) codes are extensively employed for error correction in NAND flash memory. Although LDPC soft decision decoding offers high error correction capability, it comes with a significant latency. Conversely, hard-decision decoding, although faster, lacks sufficient error correction strength. Consequently, flash memory typically initiates with hard-decision decoding and resorts to multiple soft decision decoding upon failure. To minimize decoding latency, this paper proposes a decoding mechanism based on the double hard decision, called DHD. This DHD scheme improves the Log-Likelihood Ratio (LLR) in the hard decision process. After the first hard decision fails, the read reference voltage (RRV) is adjusted to perform the second hard decision decoding. If the second hard decision also fails, soft decision decoding is then employed. Experimental results demonstrate that when the Raw Bit Error Rate (RBER) is $8.5 \times 10^{-3}$ , DHD reduces the Frame Error Rate (FER) by 86.4% compared to the traditional method.

关键词： Lead acid batteries Europe Voltage Interference Decoding Error correction Error correction codes Reliability Flash memories Iterative decoding

来源：评论

学校读者我要写书评

暂无评论

Maximizing Area Coverage in Privacy-Preserving Worker Recruitment: A Prior Knowledge-Enhanced Geo-indistinguishable Approach

引用

IEEE Transactions on information Forensics and security 2025年 20卷 5138-5151页

作者： Zhang, Pengfei Cheng, Xiang Zhang, Zhikun Zhu, Youwen Zhang, Ji Anhui University of Science and Technology State Key Laboratory of Digital Intelligent Technology for Unmanned Coal Mining the School of Computer Science and Engineering Anhui University of Science and Technology Huainan 232001 China Yunnan University of Finance and Economics Yunnan Key Laboratory of Service Computing Yunnan 650221 China Qilu University of Technology (Shandong Academy of Sciences) Key Laboratory of Equipment Data Security and Guarantee Technology Ministry of Education Key Laboratory of Computing Power Network and Information Security Ministry of Education China Beijing University of Posts and Telecommunications China Zhejiang University China Nanjing University of Aeronautics and Astronautics China University of Southern Queensland China

Worker recruitment for area coverage maximization, typically requires participants to upload location information, which can deter potential participation without proper protection. While existing studies resort to geo-indistinguishability to address this concern, they primarily focus on either specific task locations (Target Coverage) or operate under pre-defined recruitment quotas for an interested region (Area Coverage). These focuses not only yield suboptimal area coverage when scaled but also fail to leverage valuable prior knowledge in the form of participants’ noisy historical registered locations, to enhance both location obfuscation and worker identification processes. To address these limitations, we present WILTON, which optimizes area coverage under geo-indistinguishability by recruiting the minimum number of participants through the strategic utilization of noisy prior knowledge. In WILTON, to generate obfuscated locations, we propose a probabilistic and weight-aware input perturbation mechanism, which groups and weights prior locations rather than using only personal prior locations. To privately identify the recruited workers, we design a grid-based worker identification method, which provides a worst-case performance guarantee of ratio (Formula Presented) to the optimum. We provide a theoretical analysis of the privacy, utility, and complexity guarantees of WILTON. Experimental results over two real-world datasets and one synthetic dataset show that WILTON surpasses the state-of-the-arts by at least 8% in area coverage improvement. © 2005-2012 IEEE.

关键词： Geo-indistinguishability Prior Knowledge Spatial Crowdsourcing Worker Recruitment

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：