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

Sensing With Random Communication Signals

IEEE Network 2025年

作者： Lu, Shihang Liu, Fan Xiong, Yifeng Du, Zhen Cui, Yuanhao Li, Shuangyang Yuan, Weijie Yang, Jie Jin, Shi Southeast University National Mobile Communications Research Laboratory Nanjing210096 China Beijing University of Posts and Telecommunications School of Information and Communication Engineering Beijing100876 China Nanjing University of Information Science and Technology School of Electronic and Information Engineering Nanjing210044 China Technical University of Berlin Faculty of Electrical Engineering and Computer Science Berlin10587 Germany Shenzhen518055 China Frontiers Science Center for Mobile Information Communication and Security China Southeast University MOE Key Laboratory of Measurement and Control of Complex Systems of Engineering Nanjing211189 China

Communication-centric Integrated Sensing and Communication (ISAC) has been recognized as a promising methodology to implement wireless sensing functionality over existing network architectures, due to its cost-effectiveness and backward compatibility to legacy cellular systems. However, the inherent randomness of the communication signal may incur huge fluctuations in sensing capabilities, leading to unfavorable detection and estimation performance. To address this issue, we elaborate on random ISAC signal processing methods in this article, aiming at improving the sensing performance without unduly deteriorating the communication functionality. Specifically, we commence by discussing the fundamentals of sensing with random communication signals, including the performance metrics and optimal ranging waveforms. Building on these concepts, we then present a general framework for random ISAC signal transmission, followed by an in-depth exploration of time-domain pulse shaping, frequency-domain constellation shaping, and spatial-domain precoding methods. We provide a comprehensive overview of each of these topics, including models, results, and design guidelines. Finally, we conclude this article by identifying several promising research directions for random ISAC signal transmission. © 2025 IEEE.

关键词： Mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Load peak-valley shape clustering and drift analysis for improving temporal pattern representation

引用

Sustainable Energy, Grids and Networks 2025年 43卷

作者： Ma, Yiwei Shen, Yimeng Tang, Xianlun Yan, Dong School of Automation Chongqing University of Posts and Telecommunications Chongqing400065 China Department of Electrical Engineering School of Automation and Industrial Internet Chongqing University of Posts and Telecommunications Chongqing400065 China Chongqing Key Laboratory of Complex Systems and Bionic Control Chongqing University of Posts and Telecommunications Chongqing400065 China

Load shape pattern clustering is an important foundation for developing appropriate tariff design and load management to achieve more economical and reliable benefits. However, the existing load shape pattern clustering methods mainly focus on the whole load shape and various clustering algorithms, which do not consider the peak-valley shape features and distribution drift issue of the load shapes. Therefore, peak-valley shape pattern clustering and drift measurement of daily load shapes are proposed to solve this problem. To accurately reveal the peak-valley electricity consumption behaviors, load peak-valley shape models and a hybrid distance measurement are proposed to obtain more representative temporal patterns that have more compact peak-valley shape distributions. Moreover, two measurement models for power drift and time drift are proposed to analyze the significant drift problem between daily load peak-valley shape patterns. The results showed that the proposed method outperformed other methods, as it not only achieved the best clustering effectiveness scores, such as DBI, WAS, CHI, SC, and DI scores of 0.5537, 0.2633, 502.3634, 0.8872, and 1.4730, respectively, but also accurately obtained the time drift values between different modes, such as the maximum backward shift of the two peak times by 90 and 150 minutes, and the maximum backward shift of the valley time by 45 and 60 minutes, respectively. © 2025 Elsevier Ltd

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Disturbance rejection control for Raymond mill grinding system based on disturbance observer

引用

Journal of Central South University 2017年第9期24卷 2019-2027页

作者：牛丹陈夕松杨俊周杏鹏 Key Laboratory of Measurement and Control of Complex Systems of Engineering of Ministry of Education School of AutomationSoutheast UniversityNanjing 210096China

In the Raymond mill grinding processes,high-accuracy control for the current of Raymond mill is vital to enhance the product quality and production efficiency as well as cut down the consumption of spare ***,strong external disturbances,such as variations of ore hardness and ore size,always *** is not easy to make the current of Raymond mill constant due to these strong *** control strategies have been proposed to control the grinding ***,most of them(such as PID and MPC)reject disturbances merely through feedback regulation and do not deal with the disturbances directly,which may lead to poor control performance when strong disturbances *** improve disturbance rejection performance,a control scheme based on PI and disturbance observer is proposed in this *** scheme combines a feedforward compensation part based on disturbance observer and a feedback regulation part using *** test results illustrate that the proposed method can obtain remarkable superiority in disturbance rejection compared with PI method in the Raymond mill grinding processes.

关键词： disturbance observer proportional integral-disturbance observer （PI-DOB） disturbance rejection Raymond mill grinding process

来源：评论

学校读者我要写书评

暂无评论

Distributed multi-timescale algorithm for nonconvex optimization problem: A control perspective

引用

Neural Networks 2025年 186卷 107257页

作者： Shi, Xiasheng Liu, Jian Sun, Changyin School of Artificial Intelligence Anhui University Hefei230106 China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan430074 China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan430074 China School of Automation Southeast University Nanjing210096 China

The distributed nonconvex constrained optimization problem with equality and inequality constraints is researched in this paper, where the objective function and the function for constraints are all nonconvex. To solve this problem from a control perspective, a virtual reference-based convex penalty function is added to the augmented Lagrangian function. Then, based on the primal–dual technique, a two-timescale distributed approach is designed based on the consensus scheme. The slower subsystem aims to ensure the optimality, and the faster subsystem intends to guarantee the stability. Finally, three cases are presented to illustrate the approach's effectiveness. © 2025 Elsevier Ltd

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Utilizing semantically enhanced self-supervised graph convolution and multi-head attention fusion for herb recommendation

引用

Artificial Intelligence in Medicine 2025年 164卷 103112-103112页

作者： Tang, Xianlun Tang, Yuze Liu, Xinran Zhang, Haochuan Dang, Xiaoyuan Wang, Ying Xu, Zihui Chongqing Key Laboratory of Complex Systems and Autonomous Control Chongqing University of Posts and Telecommunications Chongqing400065 China School of Intelligent Engineering Chongqing College of Mobile Communication Chongqing401520 China Big Data and Internet of Things School Chongqing Vocational Institute of Engineering Chongqing402260 China Xinqiao Hospital Army Medical University Chongqing400037 China

Traditional Chinese herbal medicine has long been recognized as an effective natural therapy. Recently, the development of recommendation systems for herbs has garnered widespread academic attention, as these systems significantly impact the application of traditional Chinese medicine. However, existing herb recommendation systems are limited by data sparsity, insufficient correlation between prescriptions, and inadequate representation of symptoms and herb characteristics. To address these issues, this paper introduces an approach to herb recommendation based on semantically enhanced self-supervised graph convolution and multi-head attention fusion (BSGAM). This method involves efficient embedding of entities following fine-tuning of BERT;leveraging the attributes of herbs to optimize feature representation through a residual graph convolution network and self-supervised learning;and ultimately employing a multi-head attention mechanism for feature integration and recommendation. Experiments conducted on a publicly available traditional Chinese medicine prescription dataset demonstrate that our method achieves improvements of 6.80%, 7.46%, and 6.60% in F1-Score@5, F1-Score@10, and F1-Score@20, respectively, compared to baseline methods. These results confirm the effectiveness of our approach in enhancing the accuracy of herb recommendations. © 2025 Elsevier B.V.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Efficient surrogate-based optimization method and application based on collaborative improvement aggregation strategy

引用

Kongzhi yu Juece/control and Decision 2025年第6期40卷 1975-1984页

作者： Xiao, Tian-Li Wu, Feng Lin, Cheng-Long School of Management Science and Engineering Anhui University of Technology Ma’anshan243002 China Key Laboratory of Multidisciplinary Management and Control of Complex Systems of Anhui Higher Education Institutes Anhui University of Technology Ma’anshan243002 China School of Economics and Management Anhui Polytechnic University Wuhu241000 China School of Economics and Management Nanjing University of Science and Technology Nanjing210094 China

To address the problem that greedy characteristics lead to slow convergence and low accuracy problems of surrogate-based optimization solutions in the later stage, a collaborative improvement aggregation strategy is proposed, which is extended to an efficient surrogate-based optimization method for expensive black-box problems. The proposed strategy integrates probability improvement and mean improvement criteria using Chebyshev decomposition and achieves a balance between global exploration and local search capabilities through random weight coefficients. In addition, the differences between surrogate-based optimization and surrogate-assisted optimization methods are analyzed from the perspective of candidate point sets, further exploring the role of randomness in optimization design. The experimental results show that this method can effectively improve the convergence accuracy of the optimized solution in black-box problems. Compared with similar techniques, the proposed method has higher convergence accuracy and stronger robustness of optimized solutions. © 2025 Northeast University. All rights reserved.

关键词： Tabu search

来源：评论

学校读者我要写书评

暂无评论

Hand Gesture Recognition from an Open-Set Perspective

引用

IEEE Transactions on Multimedia 2025年

作者： Zhou, Jun Xu, Chi Cheng, Li China University of Geosciences School of Automation Wuhan430074 China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems China Ministry of Education Engineering Research Center of Intelligent Technology for Geo-Exploration Wuhan430074 China University of Alberta Vision and Learning Laboratory Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada

Existing hand gesture recognition methods predominantly rely on a close-set assumption, which in essence limits the viewpoints, gesture categories, and hand shapes at test time to closely resemble those seen during training. This requirement is however rarely met in practice, as images are often captured from unconstrained viewpoints, with novel gestures and unseen hand shapes that can differ significantly from the training data. This motivates us to investigate an open-set hand gesture recognition problem, where hand gestures are still recognizable from unconstrained viewpoints, and novel gesture classes and hand shapes can be incrementally learned with just a few examples. To address this, we propose a viewpoint influence elimination network that extracts view-independent features, significantly improving performance in scenarios with unconstrained viewpoints. Moreover, a joint-weighted classification scheme is introduced to augment the cosine similarity metric for evaluating few-shot incremental learning of novel gestures and shapes. Finally, as existing hand gesture recognition datasets primarily adhere to the close-set assumption, a new hand gesture recognition dataset, OHG, is introduced in this paper, that includes a wide range of viewpoints, diverse gesture classes, and distinct hand shapes. Experimental hand gesture recognition results demonstrate the superior performance of our approach in both unconstrained viewpoint and few-shot incremental learning scenarios. The source code and the OHG dataset are to be made available at https://***/zhoujun-7/OSHGR. © 1999-2012 IEEE.

关键词： Palmprint recognition

来源：评论

学校读者我要写书评

暂无评论

Task Assignment Scheme Designed for Online Urban Sensing Based on Sparse Mobile Crowdsensing

引用

IEEE Internet of Things Journal 2025年第11期12卷 17791-17806页

作者： Hongjian Zeng Yonghua Xiong Jinhua She Anjun Yu School of Automation China University of Geosciences Wuhan China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan China School of Engineering Tokyo University of Technology Hachioji Tokyo Japan Operation Management Department Jiangxi Ganyue Expressway Company Ltd. Nanchang Jiangxi China

Sparse mobile crowdsensing (SMCS) achieves urban-scale environmental sensing by assigning tasks to workers in specific subareas and inferring global data from the collected information. However, the effectiveness of SMCS is often limited because many studies overlook workers’ mobility and data collection time during subarea selection, as well as the time constraints of the sensing cycle in task assignment. This may affect the task completion timeliness and data quality. To address these issues, we develop a subarea evaluation method based on deep reinforcement learning, considering both the temporal effectiveness of sensing tasks and the importance of subarea selection for data inference. Using the subarea evaluation values derived from this method, we establish an online urban sensing task assignment model which is subject to constraints of sensing cycle time and cost budget. This model aims to find the task assignment result that minimizes data inference error by maximizing the comprehensive utility value. Considering the characteristics of the task assignment model, we propose an evolutionary algorithm named OTA-EA, which is based on an improved genetic algorithm. Its enhanced evolutionary operators can avoid generating infeasible solutions while maintaining robust search and optimization performance. Lastly, we conduct experimental evaluations of these methods on the real-world datasets. The results demonstrate that our subarea evaluation method can significantly reduce the data inference error, and our evolutionary task assignment algorithm can achieve better task assignment results than the baseline algorithms.

关键词： Sensors Costs Time factors Data collection Crowdsensing Evolutionary computation Data integrity Optimization Inference algorithms Mobile computing

来源：评论

学校读者我要写书评

暂无评论

Improved Rao-Blackwellized particle filter for simultaneous robot localization and person-tracking with single mobile sensor

引用

控制理论与应用（英文版） 2011年第4期9卷 472-478页

作者： Kun QIAN Xudong MA Xianzhong DAI Fang FANG Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of Education Nanjing Jiangsu 210096 China

A probabilistic algorithm is proposed for the problem of simultaneous robot localization and peopletracking （SLAP） using single onboard sensor in situations with sensor noise and global uncertainties over the observer＇s pose. By the decomposition of the joint distribution according to the Rao-Blackwell theorem, posteriors of the robot pose are sequentially estimated over time by a smoothed laser perception model and an improved resampling scheme with evolution strategies; the conditional distribution of the person＇s position is estimated using unscented Kalman filter （UKF） to deal with the nonlinear dynamic of human motion. Experiments conducted in a real indoor service robot scenario validate the favorable performance of the positional accuracy as well as the improved computational efficiency.

关键词： Mobile robot localization People tracking Rao-Blackwellized particle filter Unscented Kalman filter Service robot

来源：评论

学校读者我要写书评

暂无评论

Distributed Asymptotic Consensus in Directed Networks of Nonaffine systems With Nonvanishing Disturbance

引用

IEEE/CAA Journal of Automatica Sinica 2021年第6期8卷 1133-1140页

作者： Qingling Wang Changyin Sun School of Automation Southeast UniversityNanjing 210096 Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of EducationNanjing 210096China

In this paper the distributed asymptotic consensus problem is addressed for a group of high-order nonaffine agents with uncertain dynamics,nonvanishing disturbances and unknown control directions under directed networks.A class of auxiliary variables are first introduced which forms second-order filters and induces all measurable signals of agents’*** view of this property,a distributed robust integral of the sign of the error(DRISE)design combined with the Nussbaum-type function is presented that guarantees not only the desired asymptotic consensus,but also the uniform boundedness of all closed-loop *** with the traditional sliding mode control(SMC)technique,the main feature of our approach is that the integral operation in the proposed control algorithm is designed to be adopted in a continuous manner and ensures less chattering *** results for a group of Duffing-Holmes chaotic systems are employed to verify our theoretical analysis.

关键词： Asymptotic consensus nonaffine systems nonvanishing disturbance Nussbaum-type functions unknown control directions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：