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

Variational Bayesian Learning based Joint Localization and Path Loss Exponent with Distance-dependent Noise in Wireless Sensor Network

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Yunfei Luo, Yiting Tan, Weiqiang Li, Chunguo Ma, Shaodan Yang, Guanghua The Department of Electrical Engineering Anhui Polytechnic University Wuhu China The School of Computer Science and Cyber Engineering Guangzhou University Guangzhou China The School of Information Science and Engineering Southeast University Nanjing China Purple Mountain Laboratories Nanjing China The State Key Laboratory of Internet of Things for Smart City The Department of Electrical and Computer Engineering University of Macau Taipa China The School of Intelligent Systems Science and Engineering Jinan University Zhuhai519070 China

This paper focuses on the challenge of jointly optimizing location and path loss exponent (PLE) in distance-dependent noise. Departing from the conventional independent noise model used in localization and path loss exponent estimation problems, we consider a more realistic model incorporating distance-dependent noise variance, as revealed in recent theoretical analyses and experimental results. The distance-dependent noise introduces a complex noise model with unknown noise power and PLE, resulting in an exceptionally challenging non-convex and nonlinear optimization problem. In this study, we address a joint localization and path loss exponent estimation problem encompassing distance-dependent noise, unknown parameters, and uncertainties in sensor node locations. To surmount the intractable nonlinear and non-convex objective function inherent in the problem, we introduce a variational Bayesian learning-based framework that enables the joint optimization of localization, path loss exponent, and reference noise parameters by leveraging an effective approximation to the true posterior distribution. Furthermore, the proposed joint learning algorithm provides an iterative closed-form solution and exhibits superior performance in terms of computational complexity compared to existing algorithms. computer simulation results demonstrate that the proposed algorithm approaches the performance of the Bayesian Cramer-Rao bound (BCRB), achieves localization performance comparable to the (maximum likelihood-Gaussian message passing) ML-GMP algorithm in some cases, and outperforms the other comparison algorithm in all cases. Copyright © 2024, The Authors. All rights reserved.

关键词： Sensor nodes

Variational Bayesian Learning Based Localization and Channel Reconstruction in RIS-aided systems

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Yunfei Luo, Yiting Wu, Xianda Shi, Zheng Ma, Shaodan Yang, Guanghua The Department of Electrical Engineering Anhui Polytechnic University Wuhu City China The School of Electronics and Information Engineering South China Normal University Foshan528000 China The School of Intelligent Systems Science and Engineering Jinan University Zhuhai519070 China The State Key Laboratory of Internet of Things for Smart City the Department of Electrical and Computer Engineering University of Macau Taipa China

The emerging immersive and autonomous services have posed stringent requirements on both communications and localization. By considering the great potential of reconfigurable intelligent surface (RIS), this paper focuses on the joint channel estimation and localization for RIS-aided wireless systems. As opposed to existing works that treat channel estimation and localization independently, this paper exploits the intrinsic coupling and nonlinear relationships between the channel parameters and user location for enhancement of both localization and channel reconstruction. By noticing the non-convex, nonlinear objective function and the sparser angle pattern, a variational Bayesian learning-based framework is developed to jointly estimate the channel parameters and user location through leveraging an effective approximation of the posterior distribution. The proposed framework is capable of unifying near-field and far-field scenarios owing to exploitation of sparsity of the angular domain. Since the joint channel and location estimation problem has a closed-form solution in each iteration, our proposed iterative algorithm performs better than the conventional particle swarm optimization (PSO) and maximum likelihood (ML) based ones in terms of computational complexity. Simulations demonstrate that the proposed algorithm almost reaches the Bayesian Cramer-Rao bound (BCRB) and achieves a superior estimation accuracy by comparing to the PSO and the ML algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Maximum likelihood estimation

DDPS: Dynamic Differential Pricing-based Edge Offloading System with Energy Harvesting Devices

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xue, Hai Xia, Yun Xiong, Neal N. Zhang, Di Pei, Songwen School of Optical- Electrical and Computer Engineering University of Shanghai for Science and Technology Shanghai200093 China Department of Computer Science and Mathematics Sul Ross State University AlpineTX79830 United States School of Electrical and Information Engineering Zhengzhou University the Henan International Joint Laboratory of Intelligent Health Information System the National Telemedicine Center National Engineering Laboratory for Internet Medical Systems and Applications Zhengzhou450001 China

Mobile edge computing (MEC) paves the way to alleviate the burden of energy and computation of mobile users (MUs) by offloading tasks to the network edge. To enhance the MEC server utilization by optimizing its resource allocation, a well-designed pricing strategy is indispensable. In this paper, we consider the edge offloading scenario with energy harvesting devices, and propose a dynamic differential pricing system (DDPS), which determines the price per unit time according to the usage of computing resources to improve the edge server utilization. Firstly, we propose an offloading decision algorithm to decide whether to conduct the offloading operation and how much data to be offloaded if conducted, the algorithm determines offloading operation by balancing the energy harvested with the energy consumed. Secondly, for the offloading case, we formulate the game between the MUs and the server as a Stackelberg game, and propose a differential pricing algorithm to determine the optimal computing resources required by MUs. Furthermore, the proposed algorithm also reallocates computing resources for delay-sensitive devices while server resources are surplus after the initial allocation, aiming to make full use of the server computing resources. Extensive simulations are conducted to demonstrate the effectiveness of the proposed DDPS scheme. Copyright © 2024, The Authors. All rights reserved.

关键词： Resource allocation

Fault Localization and State Estimation of Power Grid under Parallel Cyber-Physical Attacks

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Ren, Junhao Zhao, Kai Zhang, Guangxiao Liu, Xinghua Zhai, Chao Xiao, Gaoxi School of Electrical and Electronic Engineering Nanyang Technological University Singapore639798 Singapore Institute of Catastrophe Risk Management Nanyang Technological University Singapore639798 Singapore Future Resilient Systems Singapore-ETH Centre Singapore138602 Singapore School of Electrical Engineering Xi’an University of Technology Xi’an710048 China Wuhan430074 China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems The Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan430074 China

Parallel cyber-physical attacks (PCPA) refer to those attacks on power grids by disturbing/cutting off physical transmission lines and meanwhile blocking transmission of measurement data to dwarf or delay the system protection and recovery actions. Such fierce hostile attacks impose critical threats to the modern power grids when there is a fusion of power grids and telecommunication technologies. In this paper, we investigate the fault diagnosis problem of faulty transmission lines under a broader spectrum of PCPA for a linearized (or DC) power flow model. The physical attack mechanism of PCPA includes not only disconnection but also admittance value modification on transmission lines, for example, by invading distributed flexible AC transmission system (D-FACTS). To tackle the problem, we first recover the information of voltage phase angles within the attacked area. Using the information of voltage phase angle and power injection of buses, a graph attention network-based fault localization (GAT-FL) algorithm is proposed to find the locations of the physical attacks. By capitalizing on the feature extraction capability of the GAT on graph data, the fault localization algorithm outperforms the existing results when under cyber attacks, e.g., denial of service (DoS) attacks. A line state identification algorithm is then developed to identify the states of the transmission lines within the attacked area. Specifically, the algorithm restores the power injection of buses within the attacked area and then identities the state of all the transmission lines within the attacked area by solving a linear programming (LP) problem. Experimental simulations are conducted on IEEE 30/118 bus standard test cases to demonstrate the effectiveness of the proposed fault diagnosis algorithms. Copyright © 2025, The Authors. All rights reserved.

关键词： Cyber attacks

Local Neighbor Propagation on Graphs for Robust Feature Matching

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Guo, Hanlin Xiao, Guobao Su, Lumei Zhou, Jiaxing Wang, Dahan Xiamen Key Laboratory of Frontier Electric Power Equipment and Intelligent Control School of Electrical Engineering and Automation Xiamen University of Technology China Fujian Key Laboratory of Sensing and Computing for Smart Cities School of Information Science and Engineering Xiamen University China College of Computer and Control Engineering Minjiang University China Fujian Key Laboratory of Pattern Recognition and Image Understanding School of Computer and Information Engineering Xiamen University of Technology China

Establishing reliable correspondences between two sets of feature points is a critical preprocessing step in many computer vision and pattern recognition tasks. In this paper, we propose a novel robust Local Neighbor Propagation on Graphs based feature matching (LNPG) method, to obtain good correspondences for feature matching. LNPG starts from a novel neighborhood graph construction strategy. The strategy leverages the spatial consistency constraint to generate a series of neighborhood sets, and employs the residual information to preserve the local neighborhood relationships of potential inliers (i.e., true matches). Subsequently, LNPG incorporates local neighbor propagation into the graph to enhance connections between data in different neighborhoods, by using the path-based similarity measurement and the adaptive graph partition. In addition, LNPG includes a novel consistency-filtering-based clustering algorithm for robust feature matching. This clustering algorithm introduces a reliable neighborhood consistency measure function and an effective cluster merging criterion for cluster detection and cluster merging during the clustering process, respectively. Overall, LNPG not only effectively distinguishes inliers from outliers, but also reliably classifies inliers into different transformation models between pairs of images. Experiments on publicly available datasets with different types of image transformations show the superiority of our LNPG in comparison with other state-of-the-art methods. © 2023, The Authors. All rights reserved.

关键词： Clustering algorithms

Federated Cubic Regularized Newton Learning with Sparsification-amplified Differential Privacy

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Huo, Wei Liu, Changxin Ding, Kemi Johansson, Karl Henrik Shi, Ling Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures StockholmSE-10044 Sweden School of System Design and Intelligent Manufacturing Southern University of Science and Technology Shenzhen518055 China

This paper investigates the use of the cubic-regularized Newton method within a federated learning framework while addressing two major concerns that commonly arise in federated learning: privacy leakage and communication bottleneck. We introduce a federated learning algorithm called Differentially Private Federated Cubic Regularized Newton (DP-FCRN). By leveraging second-order techniques, our algorithm achieves lower iteration complexity compared to first-order methods. We also incorporate noise perturbation during local computations to ensure privacy. Furthermore, we employ sparsification in uplink transmission, which not only reduces the communication costs but also amplifies the privacy guarantee. Specifically, this approach reduces the necessary noise intensity without compromising privacy protection. We analyze the convergence properties of our algorithm and establish the privacy guarantee. Finally, we validate the effectiveness of the proposed algorithm through experiments on a benchmark dataset. © 2024, CC BY.

关键词： Federated learning

Design of a Capsule Robot System for Gastric Hemorrhage Detection using Luminol 20

学校读者我要写书评

暂无评论

Design of a Capsule Robot System for Gastric Hemorrhage Dete...

20th IEEE International Conference on Mechatronics and Automation, ICMA 2023

作者： Mao, Yuchen Guo, Jian Guo, Shuxiang Fu, Qiang Tianjin University of Technology Tianjin Key Laboratory for Control Theory & Application Complicated Systems Intelligent Robot Laboratory School of Electrical Engineering and Automation Binshui Xidao Extension 391 Tianjin300384 China Shenzhen Institute of Advanced Biomedical Robot Co. Ltd No.12 Ganli Sixth Road Jihua Street Longgang District Shenzhen518100 China Key Laboratory of Convergence Medical Engineering System and Healthcare Technology The Ministry of Industry and Information Technology School of Life Science Beijing Institute of Technology No.5 Zhongguancun South Street Beijing100081 China

ISBN: (纸本)9798350320831

Gastric hemorrhage in upper gastrointestinal bleeding is an obvious indicator of deteriorating gastric disease. This paper proposes a capsule robot system for detecting bleeding in the stomach. The patient ingests a capsule robot containing luminol reagent, which detects bleeding in the stomach via chemiluminescence. The MCU receives the optical sensor signal, and the data is transmitted via radio frequency. The external lower computer receives and forwards the data to the upper computer for processing and display. The data is used to determine the presence and amount of stomach bleeding. Chemiluminescence is an excellent sensor, requiring no external energy supply, and demonstrating excellent sensitivity and selectivity. Combining chemical and electronic sensors presents opportunities for further development. Capsule robot detection reduces the discomfort and risk of secondary injury associated with traditional endoscopy. This paper establishes an experimental platform using porcine blood to simulate human blood, demonstrating the feasibility of the system. © 2023 IEEE.

关键词： Chemiluminescence

Multimodal Joint Prediction of Traffic Spatial-Temporal Data with Graph Sparse Attention Mechanism and Bidirectional Temporal Convolutional Network

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Dongran Yan, Jiangnan Polat, Kemal Alhudhaif, Adi Li, Jun Guangdong Provincial Key Laboratory of Intelligent Transportation System School of Intelligent Systems Engineering Sun Yat-sen University Shenzhen518107 China Department of Electrical and Electronics Engineering Faculty of Engineering Bolu Abant Izzet Baysal University Bolu Turkey Department of Computer Science College of Computer Engineering and Sciences Prince Sattam bin Abdulaziz University Al-Kharj11942 Saudi Arabia

Traffic flow prediction plays a crucial role in the management and operation of urban transportation systems. While extensive research has been conducted on predictions for individual transportation modes, there is relatively limited research on joint prediction across different transportation modes. Furthermore, existing multimodal traffic joint modeling methods often lack flexibility in spatial-temporal feature extraction. To address these issues, we propose a method called Graph Sparse Attention Mechanism with Bidirectional Temporal Convolutional Network (GSABT) for multimodal traffic spatial-temporal joint prediction. First, we use a multimodal graph multiplied by self-attention weights to capture spatial local features, and then employ the Top-U sparse attention mechanism to obtain spatial global features. Second, we utilize a bidirectional temporal convolutional network to enhance the temporal feature correlation between the output and input data, and extract inter-modal and intra-modal temporal features through the share-unique module. Finally, we have designed a multimodal joint prediction framework that can be flexibly extended to both spatial and temporal dimensions. Extensive experiments conducted on three real datasets indicate that the proposed model consistently achieves state-of-the-art predictive performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Urban transportation

Distributed online generalized Nash Equilibrium learning in multi-cluster games: A delay-tolerant algorithm

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Bingqian Wen, Guanghui Fang, Xiao Huang, Tingwen Chen, Guanrong Laboratory of Security Operation and Control for Intelligent Autonomous Systems Department of Systems Science School of Mathematics Southeast University Nanjing211189 China Science Program Texas A&M University at Qatar Doha Qatar Department of Electrical Engineering City University of Hong Kong Hong Kong

This paper addresses the problem of distributed online generalized Nash equilibrium (GNE) learning for multicluster games with delayed feedback information. Specifically, each agent in the game is assumed to be informed a sequence of local cost functions and constraint functions, which are known to the agent with time-varying delays subsequent to decision-making at each round. The objective of each agent within a cluster is to collaboratively optimize the cluster's cost function, subject to time-varying coupled inequality constraints and local feasible set constraints over time. Additionally, it is assumed that each agent is required to estimate the decisions of all other agents through interactions with its neighbors, rather than directly accessing the decisions of all agents, i.e., each agent needs to make decision under partial-decision information. To solve such a challenging problem, a novel distributed online delay-tolerant GNE learning algorithm is developed based upon the primaldual algorithm with an aggregation gradient mechanism. The system-wise regret and the constraint violation are formulated to measure the performance of the algorithm, demonstrating sublinear growth with respect to time under certain conditions. Finally, numerical results are presented to verify the effectiveness of the proposed algorithm. Copyright © 2024, The Authors. All rights reserved.

关键词： Learning algorithms