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

Intelligent integrated sensing and communication:a survey

Science China(Information Sciences) 2025年第3期68卷 5-46页

作者： Jifa ZHANG Weidang LU Chengwen XING Nan ZHAO Naofal AL-DHAHIR George K.KARAGIANNIDIS Xiaoniu YANG School of Information and Communication Engineering Dalian University of Technology College of Information Engineering Zhejiang University of Technology School of Information and Electronics Beijing Institute of Technology Department of Electrical and Computer Engineering The University of Texas at Dallas Department of Electrical and Computer Engineering Aristotle University of Thessaloniki

Integrated sensing and communication (ISAC) is a promising technique to increase spectral efficiency and support various emerging applications by sharing the spectrum and hardware between these functionalities. However, the traditional ISAC schemes are highly dependent on the accurate mathematical model and suffer from the challenges of high complexity and poor performance in practical scenarios. Recently, artificial intelligence (AI) has emerged as a viable technique to address these issues due to its powerful learning capabilities, satisfactory generalization capability, fast inference speed, and high adaptability for dynamic environments, facilitating a system design shift from model-driven to data-driven. Intelligent ISAC, which integrates AI into ISAC, has been a hot topic that has attracted many researchers to investigate. In this paper, we provide a comprehensive overview of intelligent ISAC, including its motivation, typical applications, recent trends, and challenges. In particular, we first introduce the basic principle of ISAC, followed by its key techniques. Then, an overview of AI and a comparison between model-based and AI-based methods for ISAC are provided. Furthermore, the typical applications of AI in ISAC and the recent trends for AI-enabled ISAC are reviewed. Finally, the future research issues and challenges of intelligent ISAC are discussed.

关键词： artificial intelligence deep learning deep reinforcement learning federated learning generative artificial intelligence integrated sensing and communication machine learning transfer learning

来源：评论

学校读者我要写书评

暂无评论

Knowledge distillation on spatial-temporal graph convolutional network for traffic prediction

引用

International Journal of computers and Applications 2025年第1期47卷 45-56页

作者： Izadi, Mohammad Safayani, Mehran Mirzaei, Abdolreza Department of Electrical and Computer Engineering Isfahan University of Technology Isfahan Iran

Efficient real-time traffic prediction is crucial for reducing transportation time. To predict traffic conditions, we employ a spatio-temporal graph neural network (ST-GNN) to model our real-time traffic data as temporal graphs. Despite its capabilities, it often encounters challenges in delivering efficient real-time predictions for real-world traffic data. Recognizing the significance of timely prediction due to the dynamic nature of real-time data, we employ knowledge distillation (KD) as a solution to enhance the execution time of ST-GNNs for traffic prediction. In this paper, We introduce a cost function designed to train a network with fewer parameters (the student) using distilled data from a complex network (the teacher) while maintaining its accuracy close to that of the teacher. We use knowledge distillation, incorporating spatial-temporal correlations from the teacher network to enable the student to learn the complex patterns perceived by the teacher. However, a challenge arises in determining the student network architecture rather than considering it inadvertently. To address this challenge, we propose an algorithm that utilizes the cost function to calculate pruning scores, addressing small network architecture search issues, and jointly fine-tunes the network resulting from each pruning stage using KD. Ultimately, we evaluate our proposed ideas on two real-world datasets, PeMSD7 and PeMSD8. The results indicate that our method can maintain the student's accuracy close to that of the teacher, even with the retention of only (Formula presented.) of network parameters. © 2024 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

On Shaping Gain of Multidimensional Constellation in Linear and Nonlinear Optical Fiber Channel

引用

IEEE Journal on Selected Areas in Communications 2025年第5期43卷 1455-1468页

作者： Chen, Bin Liang, Zhiwei Lei, Yi Deng, JingXin Li, Shen Liga, Gabriele Hefei University of Technology School of Computer Science and Information Engineering Hefei China Chalmers University of Technology Department of Electrical Engineering Gothenburg Sweden Department of Electrical and Computer Engineering Québec Canada Eindhoven University of Technology Department of Electrical Engineering Eindhoven Netherlands

Utilizing the multi-dimensional (MD) space for constellation shaping has been proven to be an effective approach for achieving shaping gains. Despite there exists a variety of MD modulation formats tailored for specific optical transmission scenarios, there remains a notable absence of a dependable comparison method for efficiently and promptly re-evaluating their performance in arbitrary transmission systems. In this paper, we introduce an analytical nonlinear interference (NLI) power model-based shaping gain estimation method to enable a fast performance evaluation of various MD modulation formats in coherent dual-polarization (DP) optical transmission system. In order to extend the applicability of this method to a broader set of modulation formats, we extend the established NLI model to take the 4D joint distribution into account and thus able to analyze the complex interactions of non-iid signaling in DP systems. With the help of the NLI model, we conduct a comprehensive analysis of the state-of-the-art modulation formats and investigate their actual shaping gains in two types of optical fiber communication scenarios (multi-span and single-span). The numerical simulation shows that for arbitrary modulation formats, the NLI power and relative shaping gains in terms of signal-to-noise ratio can be more accurately estimated by capturing the statistics of MD symbols. Furthermore, the proposed method further validates the effectiveness of the reported NLI-tolerant modulation format in the literature, which reveals that the linear shaping gains and modulation-dependent NLI should be jointly considered for nonlinearity mitigation. © 1983-2012 IEEE.

关键词： Optical fibers

来源：评论

学校读者我要写书评

暂无评论

Wide field of view large aperture meta-doublet eyepiece

引用

Light(Science & Applications) 2025年第1期14卷 167-176页

作者： Anna Wirth-Singh Johannes E.Fröch Fan Yang Louis Martin Hanyu Zheng Hualiang Zhang Quentin T.Tanguy Zhihao Zhou Luocheng Huang Demis DJohn Biljana Stamenic Juejun Hu Tian Gu Arka Majumdar Department of Physics University of WashingtonSeattleWAUSA Department of Electrical and Computer Engineering University of WashingtonSeattleWAUSA Department of Materials Science and Engineering Massachusetts Institute of TechnologyCambridgeMAUSA Department of Electrical and Computer Engineering University of MassachusettsLowellMAUSA Department of Electrical and Computer Engineering University of CaliforniaSanta BarbaraCAUSA

Wide field of view and light weight optics are critical for advanced eyewear,with applications in augmented/virtual reality and night *** refractive lenses are often stacked to correct aberrations at a wide field of view,leading to limited performance and increased size and *** particular,simultaneously achieving a wide field of view and large aperture for light collection is desirable but challenging to realize in a compact ***,we demonstrate a wide field of view(greater than 60°)meta-optic doublet eyepiece with an entrance aperture of 2.1 *** the design wavelength of 633 nm,the meta-optic doublet achieves comparable performance to a refractive lens-based eyepiece *** meta-doublet eyepiece illustrates the potential for meta-optics to play an important role in the development of high-quality monochrome near-eye displays and night vision systems.

关键词： optics refractive illustrate

来源：评论

学校读者我要写书评

暂无评论

Enhanced Acceleration for Generalized Nonconvex Low-Rank Matrix Learning

引用

Chinese Journal of Electronics 2025年第1期34卷 98-113页

作者： Hengmin Zhang Jian Yang Wenli Du Bob Zhang Zhiyuan Zha Bihan Wen School of Electrical and Electronic Engineering Nanyang Technological University School of Computer Science and Engineering Nanjing University of Science and Technology School of Information Science and Engineering East China University of Science and Technology Department of Electrical and Computer Engineering University of Macau

Matrix minimization techniques that employ the nuclear norm have gained recognition for their applicability in tasks like image inpainting, clustering, classification, and reconstruction. However, they come with inherent biases and computational burdens, especially when used to relax the rank function, making them less effective and efficient in real-world scenarios. To address these challenges, our research focuses on generalized nonconvex rank regularization problems in robust matrix completion, low-rank representation, and robust matrix regression. We introduce innovative approaches for effective and efficient low-rank matrix learning, grounded in generalized nonconvex rank relaxations inspired by various substitutes for the ?0-norm relaxed functions. These relaxations allow us to more accurately capture low-rank structures. Our optimization strategy employs a nonconvex and multi-variable alternating direction method of multipliers, backed by rigorous theoretical analysis for complexity and *** algorithm iteratively updates blocks of variables, ensuring efficient convergence. Additionally, we incorporate the randomized singular value decomposition technique and/or other acceleration strategies to enhance the computational efficiency of our approach, particularly for large-scale constrained minimization problems. In conclusion, our experimental results across a variety of image vision-related application tasks unequivocally demonstrate the superiority of our proposed methodologies in terms of both efficacy and efficiency when compared to most other related learning methods.

关键词： Learning systems Image recognition Minimization Computational efficiency Complexity theory Matrix decomposition Optimization Image reconstruction Singular value decomposition Convergence

来源：评论

学校读者我要写书评

暂无评论

Clustered Reinforcement Learning

引用

Frontiers of computer Science 2025年第4期19卷 43-57页

作者： Xiao MA Shen-Yi ZHAO Zhao-Heng YIN Wu-Jun LI National Key Laboratory for Novel Software Technology Department of Computer Science and TechnologyNanjing UniversityNanjing 210023China Department of Electrical Engineering and Computer Sciences University of CaliforniaBerkeleyCA 94720-1770USA

Exploration strategy design is a challenging problem in reinforcement learning(RL),especially when the environment contains a large state space or sparse *** exploration,the agent tries to discover unexplored(novel)areas or high reward(quality)*** existing methods perform exploration by only utilizing the novelty of *** novelty and quality in the neighboring area of the current state have not been well utilized to simultaneously guide the agent’s *** address this problem,this paper proposes a novel RL framework,called clustered reinforcement learning(CRL),for efficient exploration in *** adopts clustering to divide the collected states into several clusters,based on which a bonus reward reflecting both novelty and quality in the neighboring area(cluster)of the current state is given to the *** leverages these bonus rewards to guide the agent to perform efficient ***,CRL can be combined with existing exploration strategies to improve their performance,as the bonus rewards employed by these existing exploration strategies solely capture the novelty of *** on four continuous control tasks and six hard-exploration Atari-2600 games show that our method can outperform other state-of-the-art methods to achieve the best performance.

关键词： deep reinforcement learning exploration count-based method clustering K-means

来源：评论

学校读者我要写书评

暂无评论

Binary Error-Correcting Codes With Minimal Noiseless Feedback

引用

IEEE Transactions on Information Theory 2025年第5期71卷 3424-3446页

作者： Gupta, Meghal Guruswami, Venkatesan Yun Zhang, Rachel Department of Electrical and Computer Engineering BerkeleyCA94720 United States Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science CambridgeMA02139 United States

In the setting of error-correcting codes with feedback, Alice wishes to communicate a k-bit message x to Bob by sending a sequence of bits over a channel while noiselessly receiving feedback from Bob. It has been long known (Berlekamp, 1964) that in this model, Bob can still correctly determine x even if ≈ 1/3 of Alice’s bits are flipped adversarially. This improves upon the classical setting without feedback, where recovery is not possible for error fractions exceeding 1/4 . In the corresponding setting of erasures rather than bit flips, feedback improves the error resilience from 1/2 -Ε to 1 - Ε for any Ε > 0 . The original feedback setting assumes that after transmitting each bit, Alice knows (via feedback) what bit Bob received. In this work, our focus in on the limited feedback model, where Bob is only allowed to send a few bits at a small number of pre-designated points in the protocol. For any desired Ε > 0 , we construct a coding scheme that tolerates a 1/3 -Ε fraction of bit flips (respectively a 1 −Ε fraction of erasures) relying only on OΕ (log k) bits of feedback from Bob sent in a fixed OΕ (1) number of rounds. We complement this with a matching lower bound showing that Ω (log k) bits of feedback are necessary to recover from an error fraction exceeding 1/4 (respectively 1/2 for erasures), and for schemes resilient to a 1/3 -Ε fraction of bit flips (respectively a 1 −Ε fraction of erasures), the number of rounds must grow as Ε → 0 © 1963-2012 IEEE.

关键词： Binary codes

来源：评论

学校读者我要写书评

暂无评论

Halo reduction multi-exposure image fusion technique

引用

Multimedia Tools and Applications 2025年第13期84卷 12347-12370页

作者： Sharif, Rizwan Amin, Benish Sukhia, Komal Nain Department of Electrical Engineering Institute of Space Technology Islamabad Pakistan Department of Computer Science Institute of Space Technology Islamabad Pakistan

Multi-exposure image fusion (MEF) involves combining images captured at different exposure levels to create a single, well-exposed fused image. MEF has a wide range of applications, including low light, low contrast, night photography, medical imaging, and remote sensing. However, MEF methods often face issues like artifacts, halos around edges, color inconsistencies, noise amplification, and difficulty in preserving fine details. Moreover, assessing the quality of fused images objectively is complex due to the subjective nature of human perception. Solving the challenges is essential to developing efficient MEF techniques that produce high-quality results across various scenarios. The proposed technique introduces an approach to handling halo artifacts and implementing MEF. The Dense Scale-Invariant Feature Transform (DSIFT) is used to capture vital information about image brightness, texture, and edges from source images. Three weight maps are computed from the local mean, signal strength, and the global gradient for initial weight estimation. The local mean represents the brightness of specific image areas, signal strength preserves essential details like textures and edges while reducing image noise, and global gradient helps identify regions with significant pixel value shifts across multiple exposure images. The weight maps are then combined using a weighted average and a Gaussian smoothing filter is applied to reduce inherent noise and discontinuities in the original weights. Subsequently, pyramid decomposition is performed to generate a fused image. The efficiency of the proposed method is extensively tested on challenging multi-exposure image sequences. The results of the proposed approach demonstrate its superiority in both subjective evaluation and objective metrics like the MEF-Structural Similarity Index (MEF-SSIM), Natural Image Quality Evaluator (NIQE) and Gradient based performance measure (QAB/f). © The Author(s), under exclusive licence to Springer

关键词： Image fusion

来源：评论

学校读者我要写书评

暂无评论

Tightening QC Relaxations of AC Optimal Power Flow Through Improved Linear Convex Envelopes

引用

IEEE Transactions on Power Systems 2025年第2期40卷 1465-1480页

作者： Narimani, Mohammad Rasoul Molzahn, Daniel K. Davis, Katherine R. Crow, Mariesa L. Department of Electrical and Computer Engineering NorthridgeCA91330 United States Georgia Institute of Technology School of Electrical and Computer Engineering AtlantaGA30332 United States Texas A&M University Electrical and Computer Engineering Department College StationTX77840 United States Missouri University of Science and Technology Electrical and Computer Engineering Department RollaMO65409 United States

AC optimal power flow (AC OPF) is a fundamental problem in power system operations. Accurately modeling the network physics via the AC power flow equations makes AC OPF a challenging nonconvex problem. To search for global optima, recent research has developed various convex relaxations that bound the optimal objective values of AC OPF problems. The QC relaxation convexifies the AC OPF problem by enclosing the non-convex terms within convex envelopes. The QC relaxation's accuracy strongly depends on the tightness of these envelopes. This paper proposes two improvements for tightening QC relaxations of OPF problems. We first consider a particular nonlinear function whose projections are the nonlinear expressions appearing in the polar representation of the power flow equations. We construct a polytope-shaped convex envelope around this nonlinear function and derive convex expressions for the nonlinear terms using its projections. Second, we use sine and cosine expression properties, along with changes in their curvature, to tighten this convex envelope. We also propose a coordinate transformation to tighten the envelope by rotating power flow equations based on individual bus-specific angles. We compare these enhancements to a state-of-the-art QC relaxation method using PGLib-OPF test cases, revealing improved optimality gaps in 68% of the cases. © 1969-2012 IEEE.

关键词： Load flow optimization

来源：评论

学校读者我要写书评

暂无评论

Multi-agent Path Planning Based on Conflict-Based Search (CBS) Variations for Heterogeneous Robots

引用

Journal of Intelligent and Robotic Systems: Theory and Applications 2025年第1期111卷 1-12页

作者： Bai, Yifan Kotpalliwar, Shruti Kanellakis, Christoforos Nikolakopoulos, George Department of Computer Science Electrical and Space Engineering Luleå University of Technology Luleå797187 Sweden

This article introduces a novel Multi-agent path planning scheme based on Conflict Based Search (CBS) for heterogeneous holonomic and non-holonomic agents, designated as Heterogeneous CBS (HCBS). The proposed methodology employs a hybrid A∗ algorithm for non-holonomic car-like robots and a conventional A∗ algorithm for holonomic robots. Following this, a body conflict detection strategy is utilized to construct the conflict tree, bridging the initial path planning with the resolution of conflicts among agents. Moreover, we present two variants of HCBS: the Enhanced Conflict-Based Search (EHCBS) and the Depth-First Conflict-Based Search (DFHCBS). We evaluate the efficacy of our proposed algorithms—HCBS, EHCBS, and DFHCBS—against a standard prioritized planning algorithm, focusing on success rates and computational efficiency in environments with varying numbers of agents and obstacles. The empirical results demonstrate that EHCBS exhibits superior computational efficiency in small, dense environments, while DFHCBS performs well in larger-scale environments. This highlights the adaptability of our proposed approaches in various settings, proving the computational advantage of EHCBS and DFHCBS over traditional methods. © The Author(s) 2025.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：