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

Age of information in physical-layer network coding enabled two-way relay networks

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Pan, Haoyuan Chan, Tse-Tin Leung, Victor C.M. Li, Jianqiang College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Computing The Hang Seng University of Hong Kong Hong Kong

This paper investigates the information freshness of two-way relay networks (TWRN) operated with physical-layer network coding (PNC). Information freshness is quantified by age of information (AoI), defined as the time elapsed since the generation time of the latest received information update. PNC reduces communication latency of TWRNs by turning superimposed electromagnetic waves into network-coded messages so that end users can send update packets to each other via the relay more frequently. Although sending update packets more frequently is potential to reduce AoI, how to deal with packet corruption has not been well investigated. Specifically, if old packets are corrupted in any hop of a TWRN, one needs to decide the old packets to be dropped or to be retransmitted, e.g., new packets have recent information, but may require more time to be delivered. We study the average AoI with and without automatic repeat request (ARQ) in PNC-enabled TWRNs. We first consider a non-ARQ scheme where old packets are always dropped when corrupted, referred to as once-lost-then-drop (OLTD), and a classical ARQ scheme with no packet lost, referred to as reliable packet transmission (RPT). Interestingly, our analysis shows that neither the non-ARQ scheme nor the pure ARQ scheme achieves good average AoI. We then put forth an uplink-lost-then-drop (ULTD) protocol that combines packet drop and ARQ. Experiments on software-defined radio indicate that ULTD significantly outperforms OLTD and RPT in terms of average AoI. Although this paper focuses on TWRNs, we believe the insight of ULTD applies generally to other two-hop networks. Our insight is that to achieve high information freshness, when packets are corrupted in the first hop, new packets should be generated and sent (i.e., old packets are discarded);when packets are corrupted in the second hop, old packets should be retransmitted until successful reception. Copyright © 2021, The Authors. All rights reserved.

关键词： Drops

Collaborative Multi-Agent Reinforcement Learning for Automated Feature Transformation with Graph-Driven Path Optimization

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Huang, Xiaohan Wang, Dongjie Ning, Zhiyuan Qiao, Ziyue Long, Qingqing Zhu, Haowei Du, Yi Wu, Min Zhou, Yuanchun Xiao, Meng Computer Network Information Center Chinese Academy of Sciences University of the Chinese Academy of Sciences China Computer Network Information Center Chinese Academy of Sciences China Department of Electrical Engineering and Computer Science University of Kansas United States School of Computing and Information Technology Great Bay University Dongguan China School of Software Tsinghua University China Institute for Infocomm Research Agency for Science Technology and Research Singapore

Feature transformation methods aim to find an optimal mathematical feature-feature crossing process that generates high-value features and improves the performance of downstream machine learning tasks. Existing frameworks, though designed to mitigate manual costs, often treat feature transformations as isolated operations, ignoring dynamic dependencies between transformation steps. To address the limitations, we propose TCTO, a collaborative multi-agent reinforcement learning framework that automates feature engineering through graph-driven path optimization. The framework’s core innovation lies in an evolving interaction graph that models features as nodes and transformations as edges. Through graph pruning and backtracking, it dynamically eliminates low-impact edges, reduces redundant operation, and enhances exploration stability. This graph also provides full traceability to empower TCTO to reuse high-utility subgraphs from historical transformations. To demonstrate the efficacy and adaptability of our approach, we conduct comprehensive experiments and case studies, which show superior performance across a range of datasets. Copyright © 2025, The Authors. All rights reserved.

关键词： Reinforcement learning

AFF-Dehazing: Attention-based feature fusion network for low-light image Dehazing

学校读者我要写书评

暂无评论

AFF-Dehazing: Attention-based feature fusion network for low...

作者： Zhou, Yu Chen, Zhihua Sheng, Bin Li, Ping Kim, Jinman Wu, Enhua Department of Computer Science and Engineering East China University of Science and Technology Shanghai China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China Department of Computing The Hong Kong Polytechnic University Kowloon Hong Kong School of Information Technologies The University of Sydney Sydney Australia State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Faculty of Science and Technology University of Macau China

Images captured in haze conditions, especially at nighttime with low light, often suffer from degraded visibility, contrasts, and vividness, which makes it difficult to carry out the following vision tasks. In this article, we propose an attention-based feature fusion network (AFF-Dehazing) for low-light image dehazing. Our method decomposes the low-light image dehazing into two task-independent streams containing four modules: image dehazing module, low-light feature extractor module, feature fusion module, and image restoration module. The basic block of these modules is the proposed attention-based residual dense block. Since the dual-branch are used, AFF-Dehazing can avoid learning the mixed degradation all-in-one and enhance the details of low-light haze images. Extensive experiments show that our method surpasses previous state-of-the-art image dehazing methods and low-light enhancement methods by a very large margin both quantitatively and qualitatively. © 2021 John Wiley & Sons, Ltd.

关键词： Image reconstruction

An Efficient Blockchain-based Privacy-Preserving Authentication Scheme in VANET

学校读者我要写书评

暂无评论

An Efficient Blockchain-based Privacy-Preserving Authenticat...

IEEE Conference on Vehicular Technology (VTC)

作者： Shiyuan Xu Xue Chen Weimin Kong Yibo Cao Yunhua He Ke Xiao School of Information Engineering North China University of Technology Beijing China Department of Computer Science The University of Hong Kong Pok Fu Lam Hong Kong Department of Computing The Hong Kong Polytechnic University Hung Hom Hong Kong College of Software Tianjin Normal University Tianjin China School of Cyberspace Security Beijing University of Posts and Telecommunications Beijing China

With emerging technology, the blockchain-based Vehicle Ad-hoc Network (VANET) can alleviate traffic congestion and optimize resource management to improve the transportation system's efficiency significantly. However, since the information transmitted in VANET is distributed in an open environment, security, and privacy are now critical issues. Recently, many authentication protocols based on Tamper-Proof Devices (TPD) have been proposed to solve the above-mentioned hindrances, and most of them rely on the ideal TPD with extreme security assumptions. Moreover, when the aggregate signature verification fails, these schemes can only completely discard the aggregate signature, which is impractical for VANET. In order to solve the above problems, we propose a more realistic TPD-based identity verification scheme with a privacy protection function for the blockchain-based VANET. Specifically, it uses an offline self-update method to periodically update the data in the TPD to resist side-channel attacks. Our performance analysis shows that the proposed scheme is superior to the existing schemes regarding security and average delay, so it is more suitable for the actual blockchain-based VANET environment.

关键词：

Artificial Intelligence-based Service Chains Scheduling for Medical Emergency in Healthcare

学校读者我要写书评

暂无评论

Artificial Intelligence-based Service Chains Scheduling for ...

International Conference on Contemporary computing and Informatics (IC3I)

作者： Mukesh Soni Maher Ali Rusho Haewon Byeon Azzah AlGhamdi Shaikh Abdul Hannan Parth Rameshchandra Dave Dr. D. Y. Patil Vidyapeeth Dr. D. Y. Patil School of Science & Technology Tathawade Pune Marashtra Department of Lockheed Martin Engineering Management University of Colorado Boulder Colorado Department of AI and Software & Medical Big Data Research Centre Inje University Gimhae Republic of Korea Computer Information Systems Department College of Computer Science and Information Technology Imam Abdalrhman Bin Faisal University Khobar Saudi Arabia Faculty of Computing and Information AlBaha University AlBaha Kingdom of Saudi Arabia Department of Computer Engineering L. D. College of Engineering Ahmedabad Gujarat India

ISBN: (数字)9798350350067

ISBN: (纸本)9798350350074

This study analyses the weekly scheduling challenge of health and medical information network service function chains to meet medical emergency categorization and grading needs. Emergency services are divided into four sorts by urgency and service area, with priorities and weights. The health and medical information network architecture, service model, and operation method are built accordingly. To reduce weighted completion time, a service function chain scheduling model is created. The function chain scheduling scheme is solved by matching game and Q -learning reinforcement learning algorithms for different issue scales. Finally, simulation studies demonstrate that this approach can accomplish graded medical emergency service, build health and medical information networks, and progress smart healthcare.

关键词： Schedules Job shop scheduling Service function chaining Hospitals Processor scheduling Reinforcement learning Games Emergency services Network function virtualization Standards

Conflict-Free Genetic Algorithm with Nash Equilibrium Seeking for Game-Based Battery Swapping Station Recommendation

学校读者我要写书评

暂无评论

Conflict-Free Genetic Algorithm with Nash Equilibrium Seekin...

IEEE International Conference on Systems, Man and Cybernetics

作者： Chang-Long Sun Xin-Xin Xu Chun-Hua Chen Jun Hong Zhenan He Dengxiu Yu Sam Kwong Zhi-Hui Zhan School of Computer Science and Engineering South China University of Technology Guangzhou China School of Computer Science and Technology Ocean University of China Qingdao China School of Software Engineering South China University of Technology Guangzhou China College of Computer Science Sichuan University Chengdu China School of Artificial Intelligence Northwestern Polytechnical University Xi'an China Department of Computing and Decision Science Lingnan University Hong Kong SAR College of Artificial Intelligence Nankai University Tianjin China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

The rapid growth of electric vehicles (EVs) has led to significant challenges in providing efficient and sustainable charging solutions. This paper addresses the battery swapping station (BSS) recommendation problem by proposing a novel conflict-free genetic algorithm (CFGA) integrated with a Nash equilibrium seeking (NES) approach to identify optimal Nash equilibrium (ONE) solutions to such a non-cooperative optimization problem. The CFGA employs specialized crossover and mutation operators to generate offspring that satisfy the constraints of the problem, ensuring that each EV decides a unique battery swap strategy without conflict. Firstly, an order crossover operator is proposed to preserve the order of genes in the chromosomes. Secondly, a replacement and exchange mutation operator is proposed to enhance mutation diversity. The resulting optimal solution is then used as the initial strategy for the NES, which iteratively converges to the ONE. The proposed CFGA with NES algorithm is evaluated under both small-scale and large-scale cases, demonstrating its effectiveness in achieving a balance between costs for EVs and utilization for BSSs. The study's findings have practical implications for the smart grid and EV integration, offering a robust method for optimizing EV infrastructure and operations.

关键词： Costs Scalability Ecosystems Nash equilibrium Electric vehicles Batteries Smart grids Optimization Cybernetics Genetic algorithms

Improving Critical Node Detection Using Neural Network-based Initialization in a Genetic Algorithm

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Chanjuan Ge, Shike Chen, Zhihan Pei, Wenbin Zhu, Enqiang Mei, Yi Ishibuchi, Hisao The School of Computer Science and Technology Dalian University of Technology 116024 China The Institute of Software Chinese Academy of Science Beijing100190 China The Institute of Computing Science and Technology Guangzhou University Guangzhou510006 China The School of Engineering and Computer Science Victoria University of Wellington Wellington6012 New Zealand The Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China

The Critical Node Problem (CNP) is concerned with identifying the critical nodes in a complex network. These nodes play a significant role in maintaining the connectivity of the network, and removing them can negatively impact network performance. CNP has been studied extensively due to its numerous real-world applications. Among the different versions of CNP, CNP-1a has gained the most popularity. The primary objective of CNP-1a is to minimize the pair-wise connectivity in the remaining network after deleting a limited number of nodes from a network. Due to the NP-hard nature of CNP-1a, many heuristic/metaheuristic algorithms have been proposed to solve this problem. However, most existing algorithms start with a random initialization, leading to a high cost of obtaining an optimal solution. To improve the efficiency of solving CNP-1a, a knowledge-guided genetic algorithm named K2GA has been proposed. Unlike the standard genetic algorithm framework, K2GA has two main components: a pretrained neural network to obtain prior knowledge on possible critical nodes, and a hybrid genetic algorithm with local search for finding an optimal set of critical nodes based on the knowledge given by the trained neural network. The local search process utilizes a cut node-based greedy strategy. The effectiveness of the proposed knowledge-guided genetic algorithm is verified by experiments on 26 real-world instances of complex networks. Experimental results show that K2GA outperforms the state-of-the-art algorithms regarding the best, median, and average objective values, and improves the best upper bounds on the best objective values for eight real-world instances. Copyright © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

A novel quantum visual secret sharing scheme

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Liu, Wenjie Xu, Yinsong Zhang, Maojun Chen, Junxiu Yang, Ching-Nung Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing210044 China School of Computer and Software Nanjing University of Information Science and Technology Nanjing210044 China School of Mathematics and Computing Science Guilin University of Electronic Technology Guilin541004 China Division Department of Computer Science and Information Engineering National Dong Hwa University Taiwan97441 Taiwan

Inspired by Naor et al.’s visual secret sharing (VSS) scheme, a novel n out of n quantum visual secret sharing (QVSS) scheme is proposed, which consists of two phases: sharing process and recovering process. In the first process, the color information of each pixel from the original secret image is encoded into an n-qubit superposition state by using the strategy of quantum expansion instead of classical pixel expansion, and then these n qubits are distributed as shares to n participants, respectively. During the recovering process, all participants cooperate to collect these n shares of each pixel together, then perform the corresponding measurement on them, and execute the n-qubit XOR operation to recover each pixel of the secret image. The proposed scheme has the advantage of single-pixel parallel processing that is not available in the existing analogous quantum schemes, and perfectly solves the problem that in the classic VSS schemes the recovered image has the loss in resolution. Moreover, its experiment implementation with IBM Q is conducted to demonstrate the practical feasibility. © 2023, CC BY.

关键词： Pixels

Multi-objective Optimization for Multi-UAV-assisted Mobile Edge computing

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sun, Geng Wang, Yixian Sun, Zemin Wu, Qingqing Kang, Jiawen Niyato, Dusit Leung, Victor C.M. College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China School of Automation Guangdong University of Technology Guangzhou510006 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering University of British Columbia VancouverBCV6T 1Z4 Canada

Recent developments in unmanned aerial vehicles (UAVs) and mobile edge computing (MEC) have provided users with flexible and resilient computing services. However, meeting the computing-intensive and latency-sensitive demands of users poses a significant challenge due to the limited resources of UAVs. To address this challenge, we present a multi-objective optimization approach for multi-UAV-assisted MEC systems. First, we formulate a multi-objective optimization problem aiming at minimizing the total task completion delay, reducing the total UAV energy consumption, and maximizing the total amount of offloaded tasks by jointly optimizing task offloading, computation resource allocation, and UAV trajectory control. Since the problem is a mixed-integer non-linear programming (MINLP) and NP-hard problem which is challenging, we propose a joint task offloading, computation resource allocation, and UAV trajectory control (JTORATC) approach to solve the problem. However, since the decision variables of task offloading, computation resource allocation, and UAV trajectory control are coupled with each other, the original problem is split into three sub-problems, i.e., task offloading, computation resource allocation, and UAV trajectory control, which are solved individually to obtain the corresponding decisions. Moreover, the sub-problem of task offloading is solved by using distributed splitting and threshold rounding methods, the sub-problem of computation resource allocation is solved by adopting the Karush-Kuhn-Tucker (KKT) method, and the sub-problem of UAV trajectory control is solved by employing the successive convex approximation (SCA) method. Simulation results show that the proposed JTORATC has superior performance compared to the other benchmark methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Unmanned aerial vehicles (UAV)