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

An intelligent impulsive noise mitigation with deep learning method

International Journal of Mechanical System Dynamics 2024年第3期4卷 346-360页

作者： Guo Yang Yuwen Qian Zikun Wang Xiangwei Zhou Wen Wu The School of Electronic and Optical Engineering Nanjing University of Science and TechnologyNanjingChina The Division of Electrical and Computer Engineering Louisiana State UniversityBaton RougeLouisianaUSA

To enable message transmission among sensors and equipment,power line communication(PLC)is a widely adopted smart ***,due to the occurrence of impulsive noise(IN),reliable transmissions over PLC channels in the smart grid are ***,in this paper,we propose an adaptive noise mitigation scheme to clip the IN with the sliding window-based method,where the altitude of the received signal in the current time slots is obtained by computing the average altitude of signals in the previous and next time *** detect the states of IN and dynamically estimate the power threshold of signals for the IN mitigation scheme,we develop an intelligent algorithm based on the long short-term memory *** prevent the useful signals from being eliminated as IN signals,we propose the accelerated proximal gradient method(APGM)based on tone reservation to reduce the peak-to-average power ratio(PAPR)for the transmitting signals with low computational *** addition,the closed-form expression of the bit error rate(BER)is derived for the proposed sliding window-based IN mitigation scheme according to the probability density function of the *** results demonstrate that the proposed IN mitigation scheme achieves a better BER performance than the conventional IN mitigation *** addition,the APGM aided by IN mitigation can further improve BER performance due to the PAPR reduction.

关键词： impulsive noise deep learning smart grid

来源：评论

学校读者我要写书评

暂无评论

Hybrid NOMA Based MIMO Offloading for Mobile Edge Computing in 6G Networks

引用

China Communications 2022年第10期19卷 12-20页

作者： Yunus Dursun Fang Fang Zhiguo Ding School of Electrical and Electronic Engineering University of ManchesterManchesterUK Department of Electrical and Computer Engineering and the Department of Computer Science Western UniversityLondonCanada

Non-orthogonal multiple access (NOMA), multiple-input multiple-output (MIMO) and mobile edge computing (MEC) are prominent technologies to meet high data rate demand in the sixth generation (6G) communication networks. In this paper, we aim to minimize the transmission delay in the MIMO-MEC in order to improve the spectral efficiency, energy efficiency, and data rate of MEC offloading. Dinkelbach transform and generalized singular value decomposition (GSVD) method are used to solve the delay minimization problem. Analytical results are provided to evaluate the performance of the proposed Hybrid-NOMA-MIMO-MEC system. Simulation results reveal that the H-NOMA-MIMO-MEC system can achieve better delay performance and lower energy consumption compared to OMA.

关键词： NOMA MEC MIMO Generalized sin-gular value decomposition sixth generation networks(6G) delay minimization

来源：评论

学校读者我要写书评

暂无评论

Deploying On-Device AIGC Inference Services in 6G via Optimal MEC-Device Offloading

IEEE Networking Letters

引用

IEEE Networking Letters 2024年第4期6卷 232-236页

作者： Zhou, Changshi Liu, Weiqi Han, Tao Ansari, Nirwan New Jersey Institute of Technology Department of Electrical and Computer Engineering NewarkNJ07102 United States Auburn University at Montgomery Department of Computer Science and Computer Information Systems MontgomeryAL36117 United States

From AI-assisted art creation to large language model (LLM)-powered ChatGPT, AI-generated contents and services are becoming a transforming force. It calls for the telecom industry to embrace the prospects of AIGC services and face the unique challenges posed by incorporating generative model services into the AI-native 6G wireless network paradigm. We propose enabling AIGC inference services on mobile devices by optimizing MEC-device computing offloading, through which AIGC task latency is minimized by reinforcement learning based policy agent in a computing resource constrained and bandwidth limited wireless environment. Simulation results are presented to demonstrate the performance advantage. © 2019 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

An Efficient Federated Learning Framework for IoT Intrusion Detection 100

An Efficient Federated Learning Framework for IoT Intrusion ...

引用

100th IEEE Vehicular Technology Conference, VTC 2024-Fall

作者： Chen, Yushen Fang, Fang Wang, Boyu Zhang, Lan Western University Department of Computer Science London Canada Western University Department of Electrical and Computer Engineering London Canada Clemson University Department of Electrical and Computer Engineering Clemson United States

ISBN: (纸本)9798331517786

The exponential growth of the Internet of Things (IoT) ecosystems has raised significant cybersecurity concerns. Deep learning (DL)-based methods have shown promising performance in detecting potential cyber threats in IoT networks. However, as these methods often involve data centralization, they can pose serious data privacy issues for IoT users and increase the communication burden of local networks. Federated learning (FL), as a distributed learning paradigm, enables privacy-preserving training of IoT intrusion detection models by requiring only model updates from IoT devices. However, the resource-constrained nature of IoT devices can significantly decrease FL training efficiencies, such as increased training latency and delayed convergence speed. Moreover, the data heterogeneous issues of IoT devices can also impact the accuracy and robustness of the trained model. To address these challenges, we propose an efficient FL framework, FedKD-Prox, based on federated proximal (FedProx) and knowledge distillation (KD). To improve the prediction accuracy within a limited time budget, the proposed framework aims to efficiently exploit the computation capability of the IoT trainers, reduce the communication overhead of FL, and alleviate the impact of heterogeneous data issues. The simulation results show that FedKD-Prox achieves higher accuracy and improves the robustness of the trained intrusion detection model. © 2024 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Multi-branch Differential Bidirectional Fusion Network for RGB-T Semantic Segmentation

IEEE Transactions on Intelligent Vehicles

引用

IEEE Transactions on Intelligent Vehicles 2024年 1-11页

作者： Liang, Wenli Shan, Caifeng Yang, Yuanjian Han, Jungong College of Electrical Engineering and Automation Shandong University of Science and Technology Qingdao China Department of Computer Science University of Sheffield U.K

Semantic segmentation plays an important role in computer perception tasks. Integrating the rich details of RGB images with the illumination robustness of thermal infrared (TIR) images is a promising approach for achieving reliable semantic scene understanding. Current approaches for RGB-Thermal semantic segmentation often overlook the unique characteristics exhibited by each modality at different encoding layers and underutilize the complementary information between the two modalities during decoding. To acquire complementary cross-modality encoding and decoding features, we propose a multi-branch differential bidirectional fusion network known as MDBFNet. Firstly, it models the dependencies between the modality-specific characteristics and the different encoding layers, and designs a TIR-led detail enhancement module (TDE) and an RGB-led semantic enhancement module (RSE) to guide distinguishable fusion for different layer features. Secondly, a three-branch fusion decoder with three supervision (TFDS) is proposed to thoroughly explore the complementary decoding features between two modalities. Experiments on MFNet and PST900 datasets show that our method surpasses state-of-the-art methods by a clear margin. IEEE

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A 28.8-mW Accelerator IC for Dark Channel Prior-Based Blind Image Deblurring

引用

IEEE Journal of Solid-State Circuits 2024年第6期59卷 1899-1911页

作者： Chen, Po-Shao Chen, Yen-Lung Lee, Yu-Chi Fu, Zih-Sing Yang, Chia-Hsiang Graduate Institute of Electronics Engineering National Taiwan University Taipei10617 Taiwan University of Michigan Department of Electrical Engineering and Computer Science Ann ArborMI48109 United States Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science CambridgeMA02139 United States National Taiwan University Department of Electrical Engineering Graduate Institute of Electronics Engineering Taipei10617 Taiwan

This work presents an accelerator that performs blind deblurring based on the dark channel prior. The alternating minimization algorithm is leveraged for latent image and blur kernel estimation. A 2-D Laplace equation solver is embedded to reduce the latency by 56% for boundary wrapping. For latent image estimation, gradient data locality is employed to reduce the latency by 57%. A sorting engine is designed to reduce the latency in data access by 96% for calculating the dark channel. A pipelined mixed-radix 1-D fast Fourier transform (FFT) engine is used for efficient latent image estimation and blur kernel estimation. By employing image size approximation, 85% of additions and 97% of multiplications for FFT can further be saved. In the blur kernel estimator, a 2-D convolution engine with a parallel architecture is implemented, reducing the latency by 79%. The accelerator supports blur kernels of 25times 25 and 49times 49 pixels for blurred images of 129times 129 and 257times 257 pixels, respectively. Fabricated in 40-nm CMOS, the accelerator's core area is 3.98 mm2. The chip dissipates 28.8 mW at 65 MHz from a 0.65-V supply. It can estimate a blur kernel of 25times 25 pixels for an image patch with 129times 129 pixels for deblurring a full-HD image in 1.7 s, achieving a 2562times shorter latency than a high-end CPU. Compared with the state-of-the-art design, the chip achieves a four times higher normalized area efficiency and a 7.5times higher normalized energy efficiency. © 1966-2012 IEEE.

关键词： CMOS integrated circuits

来源：评论

学校读者我要写书评

暂无评论

PIDSNeRF: pose interpolation depth supervision neural radiance fields for view synthesis from challenging input

引用

Multimedia Tools and Applications 2024年 1-21页

作者： Wang, Jianxin Shao, Haijian Deng, Xing Jiang, Yingtao School of Computer Jiangsu University of Science and Technology Jiangsu Zhenjiang212003 China Department of Electrical and Computer Engineering University of Nevada Las VegasNV89154 United States

Recently, Neural Radiance Fields(NeRF) have shown remarkable performance in the task of novel view synthesis through multi-view. The present study introduces an advanced optimization framework, termed Pose Interpolation Depth Supervision Neural Radiance Fields (PIDSNeRF), designed to address the challenges encountered by NeRF in novel view synthesis. These challenges manifest as artifacts, texture details loss, and geometric inconsistencies, particularly in scenes characterized by different lighting conditions, Textureless regions, and sparse images as inputs. The principle of PIDSNeRF involves interpolating virtual camera positions in the 3D space domain based on known cameras, Subsequently, the sparse point clouds formed during camera pose estimation is re-projected onto these virtual poses, employing an inverse angle weighting strategy, thereby generating depth-supervised rays. Furthermore, we propose a depth diffusion method that spreads depth-supervised rays along the pixel plane, forming Gaussian functions with different variances based on the diffusion distances. Finally, depth supervision during volume rendering is achieved by optimizing the Kullback-Leibler(KL) divergence between the weight distribution of sampled points along each ray and the probability density function of the corresponding Gaussian function along that ray. The above process enables a more comprehensive optimization of multi-resolution grid features that align with the sampled points along the rays. The experiments on the DTU, LLFF, and DL3DV-10K datasets demonstrate, PIDSNeRF can synthesize complete novel views within minutes, and the various metrics of the synthesized images achieve the best performance. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Probability density function

来源：评论

学校读者我要写书评

暂无评论

Hybrid Fuzzy Data Aggregation and Optimization-Based Routing for Energy Efficiency in Heterogeneous Wireless Sensor Networks

引用

Informatica (Slovenia) 2024年第20期48卷 95-106页

作者： Alhijaj, Asaad A. Marzook, Ali K. Hussein, Dheyaa Mezaal Alkenani, Jawad Department of Computer Information Systems College of Computer Science and Information Technology University of Basrah Basrah Iraq University of Basrah College of Engineering Department of Electrical Engineering Basrah Iraq University of Technology Office of the President of the University Baghdad Iraq Department of Computer Science Shatt Al-Arab University College Basra Iraq

Wireless sensor networks (WSNs) are networks with many sensor nodes that are utilized for various purposes, including the military and medical. In hazardous circumstances, precise data aggregation and routing are essential, and the energy consumption of the sensors needs to be closely controlled. Nonetheless, there is a significant chance of redundant data because of external factors and nearby sensors. A multitude of information can be found in large datasets, some of it unnecessary and others useful. This redundancy negatively impacts performance in terms of redundant transmission and computing costs. However, data aggregation might help a network get rid of unnecessary data. In this work, we present a hybrid protocol called fuzzy data aggregation with fuzzy spider monkey optimization routing protocol (FDA-FSMORP) that represents an intelligent approach to collecting sensor data in HWSNs considering energy consumption. The results indicated that the suggested method beat in minimizing data latency our approach reduced energy consumption by 73% using energy more effectively when compared to our simulated outcomes. © 2024 Slovene Society Informatika. All rights reserved.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

A Half-Bridge/Dual Stacked-Switches Structured AC/DC Electrolytic Capacitor-Less Bidirectional Converter With Soft-Switching for High-Voltage EV Charger

引用

IEEE Transactions on Power Electronics 2025年第8期40卷 10912-10930页

作者： Derakhshan, Siamak Lam, John York University Department of Electrical Engineering and Computer Science TorontoONM3J 1P3 Canada

This article presents a half-bridge (HB)/dual stacked switches, fully soft-switched bidirectional electrolytic capacitor-less ac/dc resonant converter, tailored for high-voltage (HV) electric vehicle (EV) systems. The proposed converter integrates a closed-loop power factor correction (PFC)mechanism based on the dq model of the input LCL filter, ensuring high-quality sinusoidal input current and reduced total harmonic distortion in both ac/dc conversion and dc/ac inversion modes. The front-end HB PFC circuit operates in continuous conduction mode with soft-switching operation, which eliminates the high peak current issue that happens in the switches in discontinuous conduction mode. Moreover, the dual stacked switches configuration of the proposed converter reduces the voltage stress on the switches to half of the dc-link and output voltage. A dedicated duty ratio-based closed-loop control system in both primary and secondary sides of the dual-stacked-switches resonant converter drastically reduces the double-line frequency voltage ripple, thereby eliminating the need for bulky electrolytic storage capacitors. Output voltage regulation in ac/dc conversion mode is achieved through variable frequency modulation, and soft-switching is maintained for all switches for all the operating condition in both modes. The performance of the proposed bidirectional converter is validated through a 1 kW, 120 V rms/750 V dc proof-of-concept prototype. © 1986-2012 IEEE.

关键词： Capacitor bank

来源：评论

学校读者我要写书评

暂无评论

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain 35

Coordinated Motion Planning: Multi-Agent Path Finding in a D...

引用

35th International Symposium on Algorithms and Computation, ISAAC 2024

作者： Fekete, Sándor P. Kosfeld, Ramin Kramer, Peter Neutzner, Jonas Rieck, Christian Scheffer, Christian Department of Computer Science TU Braunschweig Germany Department of Electrical Engineering and Computer Science Bochum University of Applied Sciences Germany

ISBN: (纸本)9783959773546

We study Multi-Agent Path Finding for arrangements of labeled agents in the interior of a simply connected domain: Given a unique start and target position for each agent, the goal is to find a sequence of parallel, collision-free agent motions that minimizes the overall time (the makespan) until all agents have reached their respective targets. A natural case is that of a simply connected polygonal domain with axis-parallel boundaries and integer coordinates, i.e., a simple polyomino, which amounts to a simply connected union of lattice unit squares or cells. We focus on the particularly challenging setting of densely packed agents, i.e., one per cell, which strongly restricts the mobility of agents, and requires intricate coordination of motion. We provide a variety of novel results for this problem, including (1) a characterization of polyominoes in which a reconfiguration plan is guaranteed to exist;(2) a characterization of shape parameters that induce worst-case bounds on the makespan;(3) a suite of algorithms to achieve asymptotically worst-case optimal performance with respect to the achievable stretch for cases with severely limited maneuverability. This corresponds to bounding the ratio between obtained makespan and the lower bound provided by the max-min distance between the start and target position of any agent and our shape parameters. Our results extend findings by Demaine et al. [13, 14] who investigated the problem for solid rectangular domains, and in the closely related field of Permutation Routing, as presented by Alpert et al. [6] for convex pieces of grid graphs. © Sándor P. Fekete, Ramin Kosfeld, Peter Kramer, Jonas Neutzner, Christian Rieck, and Christian Scheffer.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：