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

Communication-Efficient Personalized Distributed Learning with Data and Node Heterogeneity

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Tian, Zhuojun Zhang, Zhaoyang Li, Yiwei Bennis, Mehdi Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China University of Oulu Center for Wireless Communications Oulu90014 Finland State Key Laboratory of Industrial Control Technology Hangzhou310027 China Zhejiang Provincial Key Laboratory of Multimodal Communication Networks and Intelligent Information Processing Hangzhou310027 China Xiamen University of Technology Fujian Key Laboratory of Communication Network and Information Processing Xiamen361024 China

To jointly tackle the challenges of data and node heterogeneity in decentralized learning, we propose a distributed strong lottery ticket hypothesis (DSLTH), based on which a communication-efficient personalized learning algorithm is developed. In the proposed method, each local model is represented as the ‌Hadamard product of global real-valued parameters and a personalized binary mask for pruning. The local model is learned by updating and fusing the personalized binary masks while the real-valued parameters are fixed among different agents. To further reduce the complexity of hardware implementation, we incorporate a group sparse regularization term in the loss function, enabling the learned local model to achieve structured sparsity. Then, a binary mask aggregation algorithm is designed by introducing an intermediate aggregation tensor and adding a personalized fine-tuning step in each iteration, which constrains model updates towards the local data distribution. The proposed method effectively leverages the relativity among agents while meeting personalized requirements in heterogeneous node conditions. We also provide a theoretical proof for the DSLTH, establishing it as the foundation of the proposed method. Numerical simulations confirm the validity of the DSLTH and demonstrate the effectiveness of the proposed algorithm. © 2015 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Single-Loop Deadbeat Predictive control Framework for Uncertain SPMSM Drives With Disturbance Observation

引用

IEEE Transactions on Transportation Electrification 2025年

作者： Jiang, Fuxi Wang, Siqi Guo, Yuhao Cheng, Zhe Ye, Jie Cheng, Shanmei Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Wuhan430074 China Huazhong University of Science and Technology School of Optical and Electronic Information Wuhan430074 China

To mitigate the detrimental effects of parameter perturbations and external load torque on the accuracy of speed and current tracking control in surface-mounted permanent magnet synchronous motor (SPMSM) drive systems, while avoiding the complexities inherent in traditional speed-current series control architectures, this paper presents a single-loop deadbeat predictive control (SDPC) framework that incorporates online disturbance observation. The control input voltage vector is directly computed using an SDPC controller in conjunction with a set of discrete-time disturbance observers (DDOBs). This proposed methodology offers two notable advantages over existing research: (i) it substantially reduces the number of adjustable controller parameters, requiring only the tuning of the observer bandwidth and the speed scaling gain, which enhances its practicality for engineering applications;and (ii) the disturbance estimation and compensation mechanism utilizing DDOBs significantly improves the robustness of the SPMSM system. Furthermore, the SDPC framework ensures that the system maintains satisfactory transient and steady-state tracking performance in response to reference signals. Experimental comparisons validate both the effectiveness and superiority of the proposed method. © 2015 IEEE.

关键词： Permanent magnets

来源：评论

学校读者我要写书评

暂无评论

Event-triggered Nonlinear control with Reset Dynamics

引用

IEEE Transactions on Automatic control 2025年

作者： Zhu, Lijun Chen, Zhiyong The Ministry of Education Key Laboratory of Imaging Processing and Intelligence Control China Huazhong University of Science and Technology School of Artificial Intelligence and Automation Wuhan430074 China The University of Newcastle School of Engineering CallaghanNSW2308 Australia

In this paper, we propose an improved event-triggered control law based on Lyapunov function method for a class of nonlinear systems by integrating a monotonically decreasing dynamics with a reset mechanism at each sampling instance. It is rigorously guaranteed that the sampling interval can be increased compared to a recently designed Lyapunov-function based event-triggered control law when adopted at each step while the advantages compared with other existing event-triggered control laws are maintained. Then, the improved event-triggered law is applied in the adaptive control scheme. Finally, it is verified by numerical examples that the sampling efficiency is improved when the design parameter is appropriately chosen. © 1963-2012 IEEE.

关键词： Lyapunov functions

来源：评论

学校读者我要写书评

暂无评论

Identify influential nodes in directed networks: A neighborhood entropy-based method

引用

Chaos, Solitons and Fractals 2025年 197卷

作者： Dong, Ang Feng, Ru Qiu, Lipeng Wu, Yali Ren, Yuanguang Zhou, Aoran Department of Information and Control Engineering Xi'an University of Technology Xi'an710048 China Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an University of Technology Xi'an710048 China State Key Laboratory of Metal Extrusion and Forging Equipment Technology China National Heavy Machinery Research Institute Co. Ltd Xi'an710016 China

The identification of influential nodes in complex networks is prominent and actively researched topic, with applications across various fields. Despite the emergence of numerous methods, many of these are inadequate for directed networks due to the asymmetry of information flow. To address this challenge, we propose a Neighborhood Entropy-based Method (NEM) for identifying key nodes in directed networks. Inspired by Shannon entropy, the k-orders in-degree entropy and k-orders out-degree entropy of nodes are defined to capture the neighborhood information of the node. A tunable parameter α is introduced to balance the contribution of in-neighbors and out-neighbors on neighbor influence ability, while a decay factor φk is set to adjust the influence of different order neighbors on the node. The importance of a node can be eventually evaluated by the influence capability of its in-neighbors and itself. To assess the effectiveness of NEM, we benchmark it against six existing methods on six real network datasets. The results demonstrate the high correctness of NEM, with its low time complexity enabling efficient application to large-scale directed networks. © 2025 Elsevier Ltd

关键词： k-nearest neighbors

来源：评论

学校读者我要写书评

暂无评论

An Automatic Deep-Radiomics Framework for Prostate Cancer Diagnosis and Stratification in Patients with Serum Prostate-Specific Antigen of 4.0–10.0 ng/mL: A Multicenter Retrospective Study

引用

Academic Radiology 2025年第5期32卷 2709-2722页

作者： Zheng, Bowen Mo, Futian Shi, Xiaoran Li, Wenhao Shen, Quanyou Zhang, Ling Liao, Zhongjian Fan, Cungeng Liu, Yanping Zhong, Junyuan Qin, Genggeng Tao, Jie Lv, Shidong Wei, Qiang Department of Urology Nanfang Hospital Southern Medical University Guangdong Guangzhou 510515 China Department of Urology Guangdong Provincial People's Hospital Southern Medical University Guangdong Guangzhou 510080 China School of Automation Guangdong University of Technology Guangdong Guangzhou 510006 China Guangdong Provincial Key Laboratory of Intelligent Decision and Cooperative Control Guangdong Guangzhou 510006 China Guangdong-Hong Kong Joint Laboratory for Intelligent Decision and Cooperative Control Guangdong Guangzhou 510006 China Department of Radiology Nanfang Hospital Southern Medical University Guangdong Guangzhou 510515 China Medical Imaging Department of Ganzhou People's Hospital Jiangxi Ganzhou 341000 China

Rationale and Objectives: To develop an automatic deep-radiomics framework that diagnoses and stratifies prostate cancer in patients with prostate-specific antigen (PSA) levels between 4 and 10 ng/mL. Materials and Methods: A total of 1124 patients with histological results and PSA levels between 4 and 10 ng/mL were enrolled from one public dataset and two local institutions. An nnUNet was trained for prostate masks, and a feature extraction module identified suspicious lesion masks. Radiomics features were extracted from the biparametric magnetic resonance imaging using these masks. Machine learning models were developed to diagnose prostate cancer (PCa), clinically significant PCa (csPCa), and high-risk csPCa based on radiomics and clinical features. The models were evaluated in both internal and external cohorts. The best model was further compared with PSA density (PSAD), free to total PSA (F/T PSA), and Prostate imaging Reporting and Data System (PI-RADS) scores in the external cohort. Results: The models based on both radiomics and clinical features outperformed those based on radiomics or clinical features alone. The top-performing models achieved areas under the curve of 0.80, 0.88, and 0.83 on internal testing, and 0.79, 0.80, and 0.82 on external testing for diagnosing PCa, csPCa, and high-risk csPCa. Our deep-radiomics model surpassed PSAD, F/T PSA, and PI-RADS scores in an external cohort. Decision curve analysis indicated that our model offers greater net benefit than these methods. Conclusion: The deep-radiomics model automatically segments prostate and suspicious lesions, diagnoses, and stages of PCa in patients with PSA levels between 4 and 10 ng/mL. Our method addresses the shortcomings of manual segmentation and inconsistency, delivering outstanding performance. It provides multilevel predictions to assist clinical decision-making and benefit patients with gray zone PSA. © 2024 The Association of University Radiologists

关键词： Artificial intelligence Automatic analysis BpMRI Prostate cancer Radiomics

来源：评论

学校读者我要写书评

暂无评论

ExpTopo: Explicit Topological Modeling for Bronchus Segmentation

ExpTopo: Explicit Topological Modeling for Bronchus Segmenta...

引用

IEEE International Symposium on Biomedical imaging

作者： Mingyue Zhao Xiaolan Qiu S.Kevin Zhou Division of Life Sciences and Medicine School of Biomedical Engineering University of Science and Technology of China (USTC) China Center for Medical Imaging Robotics Analytic Computing & Learning (MIRACLE) Suzhou Institute for Advance Research USTC China Suzhou Key Laboratory of Microwave Imaging Processing and Application Technology Suzhou Aerospace Information Research Institute China Key Laboratory of Precision and Intelligent Chemistry University of Science and Technology of China (USTC) China Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology China

ISBN: (数字)9798331520526

ISBN: (纸本)9798331520533

Airway extraction is paramount in the early diagnosis and treatment of respiratory diseases. As a tree-like structure, both topological-aware learning and voxel-wise classification are equally crucial for the airway. However, existing methods demonstrate insufficient topological learning, emphasizing only the supervision of individual key topological points. Consequently, this paper proposes a Explicit Topological Modeling (ExpTopo) approach to aid airway segmentation. It explicitly introduces topological metric space learning based on semantic segmentation, enhancing the model's structural perception by implementing global skeleton-level sparse topological learning (STL) and local voxel-level dense topological perception (DTP). Extensive experimental results demonstrate that the algorithm achieves competitive performance at both the topological and voxel levels. Code will be available in https://***/MorineZ/ExpTopo.

关键词： Codes Atmospheric modeling Semantic segmentation Pulmonary diseases Biological system modeling Extraterrestrial measurements Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Distributed Fixed-Time Algorithms for Time-Varying Constrained Optimization Problems

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年

作者： He, Xing Li, Yue Zhang, Meng Huang, Tingwen Southwest University Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Chongqing400715 China Shenzhen University of Advanced Technology Faculty of Computer Science and Control Engineering Shenzhen518055 China

In this paper, the distributed form of the zeroing neural network for solving time-varying optimal problems is put forward. Compared with traditional centralized algorithms, distributed algorithms possess better privacy and scalability. This paper initially proposes a centralized time-varying optimisation algorithm with fixed-time convergence and certain robustness, which is based on the integration-enhanced zeroing neural network. Subsequently, the algorithm is enhanced, and two distributed algorithms are designed separately. Both of these two algorithms have a fixed convergence time and certain robustness. Additionally, this paper utilizes the penalty function approach to handle time-varying optimization problems with inequality constraints, thereby making the algorithm more widely applicable. The effectiveness of the algorithm is verified through several numerical examples, and the applicability of the algorithm is demonstrated by solving the package-level state-of-charge balancing problem. © 2020 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Memristor-Based Circuit of Sequential Associative Memory with Memory Interactions and Stimulus Similarity Effect

引用

IEEE Transactions on Cognitive and Developmental Systems 2025年

作者： Xiong, Dongdong Wang, Xiaoping Jiang, Yiming Yang, Chao Jiang, Man Lai, Jingang Zeng, Zhigang Huazhong University of Science and Technology School of Artificial Intelligence and Automation Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan430074 China Hubei Key Laboratory of Braininspired Intelligent Systems Wuhan430074 China Huazhong University of Science and Technology Institute of Artificial Intelligence School of Artificial Intelligence and Automation Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan430074 China Guangxi University of Science and Technology School of Computer Science and Technology Liuzhou545006 China Huazhong University of Science and Technology Department of Physiology School of Basic Medicine and Tongji Medical College Wuhan430030 China

Most proposed memristor-based circuits of associative memory consider various mechanisms in only one associative memory. Few works on circuit design of sequential associative memory have been reported. In this paper, a memristor-based circuit of sequential associative memory with memory interactions and stimulus similarity effect is designed. Two associative memories, the prior associative memory (PAM) and the later associative memory (LAM), are formed successively. The PAM modifies the rate of the formation of the LAM, and the LAM, in turn, affects the strength of the PAM, which are two interactions in sequential associative memory, called transfer and retroaction. In addition, the magnitudes of transfer and retroaction are determined by the similarity of the conditioned stimuli. The above functions are realized by the ring input processing module, memory module, transfer module and retroaction module. It has been identified in circuit analysis that the proposed circuit is power efficient and has good robustness. Furthermore, the proposed circuit has promising applications for fire rescue robots. © 2016 IEEE.

关键词： Associative storage

来源：评论

学校读者我要写书评

暂无评论

Finite-time sliding-mode control for semi-Markov systems with delayed impulses

引用

IEEE/CAA Journal of Automatica Sinica 2025年

作者： Ren, Fangmin Wang, Xiaoping Li, Yangmin Zeng, Zhigang The School of Artificial Intelligence and Automation The Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Hubei Key Laboratory of Braininspired Intelligent Systems Huazhong University of Science and Technology Wuhan430074 China The Department of Industrial and Systems Engineering The Hong Kong Polytechnic University Hong Kong999077 Hong Kong

来源：评论

学校读者我要写书评

暂无评论

Mixture-of-Experts for Open Set Domain Adaptation: A Dual-Space Detection Approach

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年

作者： Du, Zhenbang An, Jiayu Tu, Yunlu Hong, Jiahao Wu, Dongrui Key Laboratory of the Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China

Open Set Domain Adaptation (OSDA) copes with the distribution and label shifts between the source and target domains simultaneously, performing accurate classification for known classes while identifying unknown class samples in the target domain. Most existing OSDA approaches, depending on the final image feature space of deep models, require manually-tuned thresholds, and may easily misclassify unknown samples as known classes. Mixture-of-Experts (MoE) could be a remedy. Within an MoE, different experts handle distinct input features, producing unique expert routing patterns for various classes in a routing feature space. As a result, unknown class samples may display different expert routing patterns to known classes. This paper proposes Dual-Space Detection, which exploits the inconsistencies between the image feature space and the routing feature space to detect unknown class samples without any threshold. A Graph Router is further introduced to better make use of the spatial information among the image patches. Experiments on three datasets validated the effectiveness and superiority of our approach. © 2020 IEEE.

关键词： Mixture-of-Experts Open Set Domain Adaptation Routing Feature

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：