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

A Survey of Integrating Generative Artificial Intelligence and 6G Mobile Services: Architectures, Solutions, Technologies and Outlooks

引用

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Liu, Yi-Jing Du, Hongyang Xu, Xinyi Zhang, Ruichen Feng, Gang Cao, Bin Niyato, Dusit Kim, Dong In Jamalipour, Abbas Letaief, Khaled B. Tafazolli, Rahim University of Electronic Science and Technology of China National Key Lab on Wireless Communications Chengdu China University of Hong Kong Department of Electrical and Electronic Engineering Pok Fu Lam Hong Kong Nanyang Technological University College of Computing and Data Science Singapore Singapore Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing China Sungkyunkwan University Department of Electrical and Computer Engineering Suwon Korea Republic of University of Sydney School of Electrical and Computer Engineering Sydney Australia Hong Kong University of Science and Technology Department of Electronic and Computer Engineering Hong Kong Hong Kong University of Surrey Institute for Communication Systems School of Computer Science and Electronic Engineering United Kingdom

Generative artificial intelligence (GenAI) is rapidly driving a new phase of artificial intelligence revolution, marked by various applications such as ChatGPT, Sora and DeepSeek. With powerful capabilities in content generation, personalization and user interaction, GenAI can drive significant enhancements in various mobile services to satisfy individual user preferences. Meanwhile, mobile services offer substantial support for accessibility, functionality and intelligence of GenAI applications. However, current research on integrating GenAI and mobile services remains nascent, lacking necessary theoretical and technical support. In this survey, we break down a new vision to guide research on integrating GenAI and mobile services, aiming to improve 6G intelligence levels and enable 6G mobile networks to support the integration of GenAI and mobile services effectively. We begin by examining the necessity of integrating GenAI with 6G mobile services and exploring potential learning architectures of GenAI models within mobile networks. Next, we analyze potential solutions from two perspectives: how 6G mobile networks empower GenAI and how GenAI enables mobile services. We subsequently explore a promising use case, along with essential features and techniques, to facilitate the integration of GenAI and mobile services. Finally, we discuss future research directions, aiming at realizing intelligent 6G networks. © 2015 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Survey on Near-Space Information Networks: Channel Modeling, Transmission, and Networking Perspectives

引用

IEEE Communications Surveys and Tutorials 2025年

作者： Cao, Xianbin Su, Xiaoning Yang, Peng Gao, Yue Wu, Dapeng Oliver Quek, Tony Q. S. Beihang University School of Electronic Information Engineering Beijing100191 China Beihang University School of Electronic Information Engineering China Pengcheng Laboratory China State Key Laboratory of CNS/ATM Beijing100191 China Fudan University School of Computer Science Shanghai200433 China City University of Hong Kong Department of Computer Science Kowloon Hong Kong Singapore University of Technology and Design Information Systems Technology and Design Pillar 487372 Singapore

Near-space information networks (NSINs) composed of high-altitude platforms (HAPs) and high-and low-altitude unmanned aerial vehicles (UAVs) are a new regime for providing quick, robust, and cost-efficient sensing and communication services. Precipitated by innovations and breakthroughs in manufacturing, materials, communications, electronics, and control techniques, NSINs have been envisioned as an essential component of the emerging sixth-generation of mobile communication systems. This article reveals some critical issues needing to be tackled in NSINs through conducting experiments and discusses the latest advances in NSINs in the research areas of channel modeling, transmission, and networking from a forward-looking, comparative, and technical evolutionary perspective. In this article, we highlight the characteristics of NSINs and present the promising use cases of NSINs. The impact of airborne platforms’ unstable movements on the phase delays of onboard antenna arrays with diverse structures is mathematically analyzed. The recent advances in HAP and UAV channel modeling are elaborated on, along with the significant differences between HAP and UAV channel modeling. The promising techniques and communication protocols of the physical (PHY) layer, medium access control (MAC) layer, network layer, and transport layer of NSINs for achieving efficient transmission over NSINs are reviewed. A comprehensive review of the networking techniques of NSINs in network deployment, handoff management, and network management aspects is provided. Besides, experiments have been conducted using practical NSINs to verify the performance of some techniques. Finally, we outline some open issues and promising directions for NSINs deserved for future study and discuss the corresponding challenges. © 2025 IEEE. All rights reserved.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Applying Explanatory Artificial Intelligence Using LIME to Analyze Arabic Online Handwriting Recognition Models

Applying Explanatory Artificial Intelligence Using LIME to A...

引用

International Conference on Information Networking

作者： Hasanien Ali Talib Alothman Wafa Lejmi Safa Ameur Mohamed Ali Mahjoub ISITCom - Higher Institute of Computer Science and Communication Sousse Tunisia LATIS - Laboratory of Advanced Technology and Intelligent Systems National Engineering School of Sousse (ENISo) University of Sousse Sousse Tunisia Mechatronics Engineering Department University of Mosul Mosul Iraq

ISBN: (数字)9798331506940

ISBN: (纸本)9798331506957

This study applies interpretable artificial intelligence (XAI) techniques in an unprecedented way to improve transparency in online Arabic handwriting recognition models. By using the LIME (Local Model-Independent Explanations) technique to analyze and interpret a convolutional neural network (CNN) model trained on the ADAB dataset. LIME highlights the key features that the model relies on in handwriting recognition. This research demonstrates the effectiveness of the LIME technique in uncovering the factors that the model relies on in an unconventional way and provides detailed explanations of how the decisions are made, which enhances transparency and increases users’ confidence in these models. The results provide useful information for improving the performance of handwriting recognition systems and a beginning for applying XAI techniques on a larger scale, including using more complex datasets and additional interpretation techniques to gain a deeper understanding of how models work with different handwriting styles. This study paves the way for the use of interpretable techniques in the field of Arabic handwriting recognition.

关键词： Deep learning Handwriting recognition Analytical models Explainable AI Shape Decision making Predictive models Prediction algorithms Data models Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic Control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Distributed Event-Triggered Bandit Convex Optimization With Time-Varying Constraints

引用

IEEE Transactions on Control of Network systems 2025年

作者： Zhang, Kunpeng Yi, Xinlei Wen, Guanghui Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Ministry of Education Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Shanghai201210 China Southeast University School of Automation Nanjing210096 China University of Groningen Engineering and Technology Institute Groningen Faculty of Science and Engineering GroningenAG 9747 Netherlands KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm10044 Sweden KTH Royal Institute of Technology Digital Futures Stockholm10044 Sweden

This paper considers the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms solving this problem require that each agent broadcasts its decision to its neighbors at each iteration. However, communication resources are often limited. To better utilize communication resources, we propose a distributed event-triggered online primal-dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and non-increasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results. © 2014 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Vehicular Road Crack Detection with Deep Learning: A New Online Benchmark for Comprehensive Evaluation of Existing Algorithms

arXiv

引用

arXiv 2025年

作者： Ma, Nachuan Song, Zhengfei Hu, Qiang Liu, Chuang-Wei Han, Yu Zhang, Yanting Fan, Rui Xie, Lihua College of Electronics & Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems the State Key Laboratory of Intelligent Autonomous Systems Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai201804 China School of Computer Science and Technology Donghua University Shanghai201620 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore

In the emerging field of urban digital twins (UDTs), advancing intelligent road inspection (IRI) vehicles with automatic road crack detection systems is essential for maintaining civil infrastructure. Over the past decade, deep learning-based road crack detection methods have been developed to detect cracks more efficiently, accurately, and objectively, with the goal of replacing manual visual inspection. Nonetheless, there is a lack of systematic reviews on state-of-the-art (SoTA) deep learning techniques, especially data-fusion and label-efficient algorithms for this task. This paper thoroughly reviews the SoTA deep learning-based algorithms, including (1) supervised, (2) unsupervised, (3) semi-supervised, and (4) weakly-supervised methods developed for road crack detection. Also, we create a dataset called UDTIRI-Crack, comprising 2, 500 high-quality images from seven public annotated sources, as the first extensive online benchmark in this field. Comprehensive experiments are conducted to compare the detection performance, computational efficiency, and generalizability of public SoTA deep learning-based algorithms for road crack detection. In addition, the feasibility of foundation models and large language models (LLMs) for road crack detection is explored. Afterwards, the existing challenges and future development trends of deep learning-based road crack detection algorithms are discussed. We believe this review can serve as practical guidance for developing intelligent road detection vehicles with the next-generation road condition assessment systems. The released benchmark UDTIRI-Crack is available at https://***/submission/. © 2025, CC BY.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

A semi-supervised multi-task assisted method for ultrasound medical image segmentation

引用

Neurocomputing 2025年 639卷

作者： Li, Honghe Yang, Jinzhu Qu, Mingjun Feng, Yong Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University Liaoning Shenyang110819 China School of Computer Science and Engineering Northeastern University Liaoning Shenyang110819 China National Frontiers Science Center for Industrial Intelligence and Systems Optimization Liaoning Shenyang110819 China

The accurate segmentation of the left ventricle in echocardiography is critical for assessing cardiac function, but challenges such as blurred boundaries, high morphological variability, and limited annotated data hinder the performance of traditional methods. Recent advances in semi-supervised learning show promise in leveraging unlabeled data, yet existing techniques often rely on network or data-level perturbation, which may not fully exploit spatial and positional information essential for precise segmentation. To address these challenges, we propose a novel multi-task assisted semi-supervised segmentation framework. Our method combines segmentation, landmark detection, and image reconstruction into a unified model with a shared encoder and dual decoders. A feature cross-fusion module based on a cross-attention mechanism integrates features across tasks to enhance spatial and positional awareness. We have also introduced a contrastive learning mechanism to refine the segmentation boundaries, especially in areas where the edges are blurred. In addition, we utilize multi-scale supervision to better adapt the model to targets of different scales. The framework employs an exponential moving average student–teacher model to effectively utilize unlabeled data for training. Experiments on CAMUS and EchoNet-Dynamic datasets demonstrate that the proposed method achieves state-of-the-art performance, delivering near fully-supervised results with only 10%–20% labeled data. This highlights its potential for high-quality segmentation in low-annotation scenarios, outperforming existing semi-supervised learning methods. © 2025

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Adaptive UAV-Assisted Hierarchical Federated Learning: Optimizing Energy, Latency, and Resilience for Dynamic Smart IoT Networks

arXiv

引用

arXiv 2025年

作者： Yang, Xiaohong Liwang, Minghui Fu, Liqun Su, Yuhan Hosseinalipour, Seyyedali Wang, Xianbin Hong, Yiguang School of Informatics Xiamen University Fujian China Department of Control Science and Engineering The National Key Laboratory of Autonomous Intelligent Unmanned Systems China Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Tongji University Shanghai China School of Electronic Science and Engineering Xiamen University Xiamen China Department of Electrical Engineering University at Buffalo-SUNY BuffaloNY United States Department of Electrical and Computer Engineering Western University ON Canada

Hierarchical Federated Learning (HFL) introduces intermediate aggregation layers, addressing the limitations of conventional Federated Learning (FL) in geographically dispersed environments with limited communication infrastructure. An application of HFL is in smart IoT systems, such as remote monitoring, disaster response, and battlefield operations, where cellular connectivity is often unreliable or unavailable. In these scenarios, UAVs serve as mobile aggregators, providing connectivity to the terrestrial IoT devices. This paper studies an HFL architecture for energy-constrained UAVs in smart IoT systems, pioneering a solution to minimize global training cost increased caused by UAV disconnection. In light of this, we formulate a joint optimization problem involving learning configuration, bandwidth allocation, and device-to-UAV association, and perform global aggregation in time before UAV drops disconnect and redeployment of UAVs. The problem explicitly accounts for the dynamic nature of IoT devices and their interruptible communications and is unveiled to be NP-hard. To address this, we decompose it into three subproblems. First, we optimize the learning configuration and bandwidth allocation using an augmented Lagrangian function to reduce training costs. Second, we propose a device fitness score, integrating data heterogeneity (via Kullback-Leibler divergence), device-to-UAV distances, and IoT device resources, and develop a twin-delayed deep deterministic policy gradient (TD3)-based algorithm for dynamic device-to-UAV assignment. Third, We introduce a low-complexity two-stage greedy strategy for finding the location of UAVs redeployment and selecting the appropriate global aggregator UAV. Experiments on real-world datasets demonstrate significant cost reductions and robust performance under communication interruptions. © 2025, CC BY-NC-ND.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

cVTS: A Constrained Voronoi Tree Search Method for High Dimensional Analog Circuit Synthesis 23

cVTS: A Constrained Voronoi Tree Search Method for High Dime...

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Aidong Zhao Xianan Wang Zixiao Lin Zhaori Bi Xudong Li Changhao Yan Fan Yang Li Shang Dian Zhou Xuan Zeng State Key Laboratory of Integrated Chips and Systems Microelectronics Department Fudan University Shanghai China Department of Electrical Engineering University of Texas at Dallas USA Department of Electrical and Computer Engineering University of California at San Diego USA School of Data Science Fudan University Shanghai China School of Computer Science Fudan University Shanghai China

ISBN: (纸本)9798350323481

A constrained Voronoi tree-based domain decomposition method for high-dimensional Bayesian optimization is proposed to solve large scale analog circuit synthesis problems, which can be formulated as high-dimensional heterogeneous black-box optimization. Hierarchical Voronoi tree progressively breaks down the design space into partitions with implicit performance boundaries such that promising regions are efficiently explored. Fast exploitation is ensured in Voronoi nest via local Bayesian optimization with a few observations. A slice-enhanced Gibbs sampling method is proposed to sample acquisition function cMES in irregular polyhedrons with design constraints. Compared with state-of-the-art methods, cVTS achieves significant speed up without loss of accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient Hybrid Multi-Population Genetic Algorithm for Multi-UAV Task Assignment in Consumer Electronics Applications

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Bai, Xiaoshan Jiang, Haoyu Li, Chao Ullah, Inam Dabel, Maryam M. Al Bashir, Ali Kashif Wu, Zongze Sam, Shuzhi Shenzhen University College of Mechatronics and Control Engineering National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Shenzhen University College of Mechatronics and Control Engineering Shenzhen518060 China Shenzhen University Shenzhen City Joint Laboratory of Autonomous Unmanned Systems and Intelligent Manipulation Shenzhen518060 China Tashkent State University of Economics Department of Artificial Intelligence Tashkent100066 Uzbekistan University of Hafr Al Batin Department of Computer Science and Engineering College of Computer Science and Engineering Saudi Arabia Manchester Metropolitan University Manchester United Kingdom Shenzhen518060 China National University of Singapore Department of Electrical and Computer Engineering Singapore117576 Singapore

In recent years, as people’s living standards have improved and consumption concepts have been transformed, the demand for purchasing consumer electronics online has continued to grow, further stimulating the development of the logistics industry. Consequently, how to deliver consumer electronics to households at minimal cost has become a crucial factor that limits the development of the consumer technology industry. To tackle this problem, this paper studies the task assignment problem for multiple initially dispersed UAVs to deliver products to target locations while minimizing their total operation time. Each UAV can continuously provide delivery services to multiple target locations within its limited loading capacity and operation time. To solve this problem, we propose several hybrid multipopulation genetic algorithms. First, a novel crossover operator for the genetic algorithms is designed, through which a single parent chromosome can generate offspring individually. Second, two mutation mechanisms are performed to increase gene diversity. Third, multiple local search strategies are employed to enhance the populations’ fitness during each iteration of evolution. An improved 2-opt local search strategy is applied to optimize individual chromosomes when their similarity with the current best chromosome falls below a prescribed threshold. Alternatively, local search strategies are utilized for 1-opt, 2h-opt and interchange processes. Combining local search strategies, genetic operators, and the multi-population mechanism leads to several hybrid multi-population genetic algorithms. Numerical simulations and experimental tests demonstrate that the hybrid multi-population genetic algorithm, integrated with the improved 2-opt and 1-opt local search strategies, exhibits superior performance among the designed hybrid genetic algorithms, the minimum marginal cost algorithm (MMA), and the existing popular Co-evolutionary Multi-population Genetic Algorithm (CMGA). In exp

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：