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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

From light sensing to adaptive learning:hafnium diselenide reconfigurable memcapacitive devices in neuromorphic computing

引用

Light(Science & Applications) 2025年第1期14卷 215-226页

作者： Bashayr Alqahtani Hanrui Li Abdul Momin Syed Nazek El-Atab Electrical and Computer Engineering Program Computer Electrical Mathematical Science and Engineering DivisionKing Abdullah University of Science and Technology(KAUST)ThuwalSaudi Arabia Electrical Engineering Department College of EngineeringPrincess Nourah Bint Abdulrahman University(PNU)RiyadhSaudi Arabia

Advancements in neuromorphic computing have given an impetus to the development of systems with adaptive behavior,dynamic responses,and energy efficiency *** charge-based or emerging memory technologies such as memristors have been developed to emulate synaptic plasticity,replicating the key functionality of neurons—integrating diverse presynaptic inputs to fire electrical impulses—has remained *** this study,we developed reconfigurable metal-oxide-semiconductor capacitors(MOSCaps)based on hafnium diselenide(HfSe2).The proposed devices exhibit(1)optoelectronic synaptic features and perform separate stimulus-associated learning,indicating considerable adaptive neuron emulation,(2)dual light-enabled charge-trapping and memcapacitive behavior within the same MOSCap device,whose threshold voltage and capacitance vary based on the light intensity across the visible spectrum,(3)memcapacitor volatility tuning based on the biasing conditions,enabling the transition from volatile light sensing to non-volatile optical data *** reconfigurability and multifunctionality of MOSCap were used to integrate the device into a leaky integrate-and-fire neuron model within a spiking neural network to dynamically adjust firing patterns based on light stimuli and detect exoplanets through variations in light intensity.

关键词： integrate volatile integrating

来源：评论

学校读者我要写书评

暂无评论

Derandomizing Codes for the Adversarial Wiretap Channel of Type II

引用

IEEE Transactions on Information Theory 2025年第6期71卷 4686-4707页

作者： Ruzomberka, Eric Nikbakht, Homa Brinton, Christopher G. Love, David J. Poor, H. Vincent Air Force Institute of Technology Department of Electrical and Computer Engineering United States Princeton University Department of Electrical and Computer Engineering United States Purdue University Elmore Family School of Electrical and Computer Engineering West Lafayette United States

The adversarial wiretap channel of type II (AWTC-II) is a communication channel that can a) read a fraction of the transmitted symbols up to a given bound and b) induce both errors and erasures in a fraction of the symbols up to given bounds. The channel is controlled by an adversary who can freely choose the locations of the symbol reads, errors and erasures via a process with unbounded computational power. The AWTC-II is an extension of Ozarow’s and Wyner’s wiretap channel of type II to the adversarial channel setting. The semantic-secrecy (SS) capacity of the AWTC-II is partially known, where the best-known lower bound is non-constructive and proven via a random coding argument that uses a large number (that is, exponential in blocklength n) of random bits to describe the random code. In this work, we establish a new derandomization result in which we match the best-known lower bound via a non-constructive random code that uses only O(n2) random bits. Unlike fully random codes, our derandomized code admits an efficient encoding algorithm and benefits from some linear structure. Our derandomization result is a novel application of random pseudolinear codes – a class of non-linear codes first proposed for applications outside the AWTC-II setting, which have k-wise independent codewords where k is a design parameter. As the key technical tool in our analysis, we provide a novel concentration inequality for sums of random variables with limited independence, as well as a soft-covering lemma similar to that of Goldfeld, Cuff and Permuter that holds for random codes with k-wise independent codewords. © 1963-2012 IEEE.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Optimal Placement of Manual and Automatic Switches in Power Distribution Systems Using a Machine Learning Proxy

引用

IEEE Transactions on Industry Applications 2025年第3期61卷 5015-5025页

作者： Ebrahimi, Mehrdad Rastegar, Mohammad Karami, Kiana Shiraz University School of Electrical and Computer Engineering PA Shiraz71946-44469 Iran Department of Electrical Engineering and Electrical Engineering Technology Harrisburg United States

Fault management involves actions to restore interrupted customers as quickly as possible after a fault occurrence, which is facilitated by optimal switch placement. However, the switch optimization problem requires significant computational effort because of the nonlinearity and the large search space. Hence, the problem may be interactable for large-scale power distribution systems. This paper proposes a machine learning-based proxy to determine the optimal number and location of switches in real-world power distribution systems, including manual and automatic switches. The objective function comprises equipment costs and reliability indices, including the system average interruption frequency index (SAIFI), the system average interruption duration index (SAIDI), and the energy not supplied (ENS) index. The proposed model is a stacked ensemble model, in which convolutional neural network (CNN)-based models serve as base learners to capture complex and spatial information from their input data. The input data for the base learners are optimally selected by explainable artificial intelligence (XAI) tools from a large feature set of candidate installation points. The metamodel combines the base learners' predictions to determine the optimal points for installing switches and is a fully connected artificial neural network. This paper uses the Bayesian optimization algorithm to optimally construct the stacked ensemble model. We validate the proposed model alongside state-of-the-art learning-based and mathematics-based models using a real power distribution system. The simulation results demonstrate that the proposed model outperforms the state-of-the-art models in terms of computational complexity and optimality. © 2025 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

A Spin Photonic Topological Metasurface Based On A Kagome Lattice For Use In Leaky-wave Antenna Application

引用

IEEE Access 2025年 13卷 89811-89818页

作者： Abtahi, Sayyed Ahmad Maddahali, Mohsen Bakhtafrouz, Ahmad Isfahan University of Technology Department of Electrical and Computer Engineering Isfahan84156-83111 Iran

The emerging field of topological metasurfaces offers unique advantages, particularly in robustness against backscattering in low-profile structures. The lattice configuration of these structures significantly influences the ability to achieve sharp turns in the propagation path. One of the most studied lattices in condensed matter physics is the kagome lattice, characterized by its hexagonal Brillouin zone, which displays a Dirac cone in its dispersion diagram. Previous research on kagome lattices in photonic topological insulators has primarily focused on valley types of insulators. This article introduces a spin topological metasurface based on the kagome lattice and its unit cell, enabling a broad range of sharp turns and propagation paths. The unit cell is compared to its hexagonal and 60-degree rhombic counterparts, and a parametric study of its dimensions is conducted. As a result of this research, a new X-band leaky-wave antenna designed in the kagome lattice with an armchair arrangement interface has been developed. This antenna provides two forward and two backward beams, each pair achieving an approximately 50-degree scan within the 8.8 to 11.1 GHz bandwidth. © 2013 IEEE.

关键词： Crystal lattices

来源：评论

学校读者我要写书评

暂无评论

Extended Sequential Function Chart

引用

IEEE Access 2025年 13卷 85585-85596页

作者： Gniewek, L. Markiewicz, M. Rzeszow University of Technology Department of Electrical and Computer Engineering Rzeszow35-959 Poland

Sequential Function Chart (SFC) is one of the PLC programming languages defined in the IEC-61131 standard. SFC has been increasingly used in practical applications because even small controllers can now be programmed in this graphical language. Representing the sequential-parallel control algorithm in the form of a diagram makes the program transparent, and the possibility of using Petri net analysis tools allows for formal verification of the program’s correctness. Unfortunately, in SFC, the graph nodes take only binary values, which limits, for example, the possibility of modeling resources that are produced or consumed during the production process. It also makes the use of signals from analog sensors challenging, thanks to which it is possible to observe the progress of the supervised tasks. Hence, this paper proposes an extension of SFC (eSFC), which introduces nodes that model quantitative resources and variables storing analog signals. In addition, a formal model of eSFC and its algebraic interpretation are proposed, ensuring the unambiguity of the eSFC operation. © 2013 IEEE.

关键词： Photomapping

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：