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

arXiv 2025年

作者： Li, Bolin Cai, Peiyuan Zuo, Gewei Zhu, Lijun Ding, Han School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430072 China Key Laboratory of Imaging Processing and Intelligence Control China State Key Laboratory of Intelligent Manufacturing Equipment and Technology Huazhong University of Science and Technology China

In this study, we address the challenge of disturbance estimation in legged robots by introducing a novel continuous-time online feedback-based disturbance observer that leverages measurable variables. The distinct feature of our observer is the integration of dynamic gains and comparison functions, which guarantees predefined convergence of the disturbance estimation error, including ultimately uniformly bounded, asymptotic, and exponential convergence, among various types. The properties of dynamic gains and the sufficient conditions for comparison functions are detailed to guide engineers in designing desired convergence behaviors. Notably, the observer functions effectively without the need for upper bound information of the disturbance or its derivative, enhancing its engineering applicability. An experimental example corroborates the theoretical advancements achieved. Copyright © 2025, The Authors. All rights reserved.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

Enabling Stateful TCP Performance Profiling with key Event Capturing

引用

IEEE Transactions on Network and Service Management 2025年

作者： Geng, Ruopeng Lu, Jianyuan Fang, Chongrong Zhang, Shaokai Zhao, Jiangu Zong, Zhigang Lyu, Biao Zhu, Shunmin Cheng, Peng Chen, Jiming Zhejiang University State Key Laboratory of Industrial Control Technology Hangzhou310027 China Alibaba Group Hangzhou310052 China Ministry of Education of China Key Laboratory of System Control and Information Processing China Shanghai Jiao Tong University Shanghai Engineering Research Center of Intelligent Control and Management Department of Automation Shanghai China Zhejiang University College of Control Science and Engineering Hangzhou310027 China

TCP ensures reliable transmission through its stateful implementation and remains crucial today. TCP performance profiling is essential for tasks like diagnosing network performance problems, optimizing transmission performance, and developing new TCP variants, etc. Existing profiling methods lack enough attention to TCP state transition to provide detailed insights on TCP performance. Thus, we build TcpSight, a tool focusing on TCP state transition throughout connection lifetimes. TcpSight conducts stateful analysis by capturing key events using an efficient per-connection lock-free data management mechanism. Besides, TcpSight enhances profiling by integrating application layer information collected from the TCP stack. With the profiling results, users can identify the culprit of TCP performance degradation, and evaluate the performance of TCP algorithms. We design optional modules and filtering mechanisms to reduce TcpSights overhead. Our evaluation presents that TcpSight incurs an additional CPU consumption of about 16.6% (without filtering) and 10.6% (with filtering) when the server's load is 55.7%, and generates storage consumption about 1.88 KB per connection on average. We also give application cases of TcpSight and the deployment experiences in Alibaba Cloud. TcpSight helps in revealing meaningful findings and insights into exploiting TCP in the production deployment. © 2004-2012 IEEE.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Joint Masked Reconstruction and Contrastive Learning for Mining Interactions Between Proteins

arXiv

引用

arXiv 2025年

作者： Li, Jiang Wang, Xiaoping School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Institute of Artificial Intelligence Huazhong University of Science and Technology Wuhan430074 China Hubei Key Laboratory of Brain-Inspired Intelligent Systems Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Ministry of Education Wuhan430074 China

Protein-protein interaction (PPI) prediction is an instrumental means in elucidating the mechanisms underlying cellular operations, holding significant practical implications for the realms of pharmaceutical development and clinical treatment. Presently, the majority of research methods primarily concentrate on the analysis of amino acid sequences, while investigations predicated on protein structures remain in the nascent stages of exploration. Despite the emergence of several structure-based algorithms in recent years, these are still confronted with inherent challenges: (1) the extraction of intrinsic structural information of proteins typically necessitates the expenditure of substantial computational resources;(2) these models are overly reliant on seen protein data, struggling to effectively unearth interaction cues between unknown proteins. To further propel advancements in this domain, this paper introduces a novel PPI prediction method jointing masked reconstruction and contrastive learning, termed JmcPPI. This methodology dissects the PPI prediction task into two distinct phases: during the residue structure encoding phase, JmcPPI devises two feature reconstruction tasks and employs graph attention mechanism to capture structural information between residues;during the protein interaction inference phase, JmcPPI perturbs the original PPI graph and employs a multi-graph contrastive learning strategy to thoroughly mine extrinsic interaction information of novel proteins. Extensive experiments conducted on three widely utilized PPI datasets demonstrate that JmcPPI surpasses existing optimal baseline models across various data partition schemes. The associated code can be accessed via https://***/lijfrankopen/JmcPPI. Copyright © 2025, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Prescribed Performance control of Two-Time-Scale Systems and Its Application

引用

International Journal of Robust and Nonlinear control 2025年

作者： Zeng, Ze-Hong Wang, Yan-Wu Liu, Xiao-Kang Yang, Wu School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Ministry of Education Wuhan China School of Electrical Engineering Guangxi University Nanning China

This article explores the prescribed performance control design for linear two-time-scale systems (TTSSs). Due to ill-conditioning and high dimensionality, existing prescribed performance control methods for single-time-scale systems are unsuitable for TTSSs. Moreover, current TTSS methodologies focus on steady-state performance, often neglecting transient dynamics. To address these challenges, we first apply the Chang transformation to decouple the fast and slow states. Next, we use a state transformation to convert the state equation into block form to eliminate the requirement of a full row-rank input matrix. Finally, the backstepping method is utilized to design the prescribed performance control. The effectiveness and advantages of the proposed control strategy are demonstrated through two examples: a numerical simulation and a hardware-in-the-loop experiment involving an electronic circuit system. © 2025 John Wiley & Sons Ltd.

关键词： backstepping control prescribed performance control two-time-scale system underactuated system

来源：评论

学校读者我要写书评

暂无评论

A Parallel Read-Write Circuit With Fast Amplitude-Adaptive Matching Scheme to Memristor Crossbar Array

引用

IEEE Transactions on Circuits and Systems I: Regular Papers 2025年

作者： Jiang, Ningye Jiang, Mingxuan Huang, Haoen Yang, Le Huang, Yi Zeng, Zhigang Huazhong University of Science and Technology School of Artificial Intelligence and Automation Key Laboratory of Image Information Processing and Intelligent Control Ministry of Education of China Wuhan430074 China Wuhan Institute of Technology School of Electrical and Information Engineering Wuhan430205 China University of Massachusetts Amherst Department of Electrical and Computer Engineering AmherstMA01003 United States

Memristor crossbar array (MCA) is a computing-in-memory (CIM) module for computational acceleration. However, conventional read-write (R-W) circuits for MCA rely heavily on external components and have shortcoming in long writing times. To address these issues, we propose a parallel R-W circuit with a fast amplitude-adaptive matching (AAM) scheme. The fast AAM scheme is designed to accelerate time of writing memristors in MCA by adaptively adjusting the writing voltage to match an optimal amplitude. The architecture of parallel R-W circuit are outlined with the implementation of R-W processes. The design principles of parallel R-W unit, fast AAM unit, and associated control logic are described for analyzing their functions within the circuit. By integrating the parallel R-W circuit with MCA, a computing block is leveraged in a neural network for classification tasks. The experimental results demonstrate that the neural network with multiple computing blocks maintains high accuracy across various datasets (over 80%). Furthermore, the proposed AAM scheme achieves an average 54% reduction in writing time compared to that one without AAM scheme. Compared to the pulse-width scheme, the parallel R-W circuit exhibits an average 3.05× speedup in adjusting a 5×5 MCA, and the speedup efficiency is higher as the increases of MCA size. © 2025 IEEE.

关键词： Memristors

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Surrogate-Assisted Multiobjective Gene Selection for Cell Classification from Large-Scale Single-Cell RNA Sequencing Data

引用

IEEE Transactions on Evolutionary Computation 2025年第3期29卷 601-615页

作者： Lin, Jianqing He, Cheng Jiang, Hanjing Huang, Yabing Jin, Yaochu Huazhong University of Science and Technology Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Wuhan430074 China Huazhong University of Science and Technology State Key Laboratory of Advanced Electromagnetic Technology School of Electrical and Electronic Engineering Wuhan430074 China Renmin Hospital Department of Pathology Wuhan University Wuhan430060 China Westlake University Trustworth and General Artificial Intelligence Laboratory School of Engineering Hangzhou310030 China

Accurate cell classification is crucial but expensive for large-scale single-cell RNA sequencing (scRNA-seq) analysis. Gene selection (GS) emerges as a pivotal technique in identifying gene subsets of scRNA-seq for classification accuracy improvement and gene scale reduction. Nevertheless, the rising scale of scRNA-seq data presents challenges to existing GS methods regarding performance and computational time. Thus, we propose a surrogate-assisted evolutionary algorithm for multiobjective GS to address these deficiencies. An innovative two-phase initialization method is proposed to select sparse solutions to provide preliminary insights into gene contributions. Then, a binary competitive swarm optimizer is proposed for effective global search, where a local search method is embedded to eliminate irrelevant genes for efficiency consideration. Additionally, a surrogate model is adopted to forecast classification accuracy efficiently and substitutes part of the computationally expensive classification process. Experiments are conducted on eight large-scale scRNA-seq datasets with more than 20,000 genes. The effectiveness of the proposed GS method for scRNA-seq cell classification compared with eight state-of-the-art methods is validated. Gene expression analysis results of selected genes further validated the significance of the genes selected by the proposed method in the classification of scRNA-seq data. © 1997-2012 IEEE.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

Teeth YOLACT: An Instance Segmentation Model Based on Impacted Tooth Panoramic X-Ray images

引用

Computers, Materials and Continua 2025年第3期83卷 4815-4834页

作者： Tao Zhou Yaxing Wang Huiling Lu Wenwen Chai Yunfeng Pan Zhe Zhang School of Computer Science and Engineering North Minzu University Yinchuan 750021 China Key Laboratory of Image and Graphics Intelligent Processing of State Ethnic Affairs Commission North Minzu University Yinchuan 750021 China School of Medical Information & Engineering Ningxia Medical University Yinchuan 750004 China

The instance segmentation of impacted teeth in the oral panoramic X-ray images is hotly researched. However, due to the complex structure, low contrast, and complex background of teeth in panoramic X-ray images, the task of instance segmentation is technically tricky. In this study, the contrast between impacted Teeth and periodontal tissues such as gingiva, periodontal membrane, and alveolar bone is low, resulting in fuzzy boundaries of impacted teeth. A model based on Teeth YOLACT is proposed to provide a more efficient and accurate solution for the segmentation of impacted teeth in oral panoramic X-ray films. Firstly, a Multi-scale Res-Transformer Module (MRTM) is designed. In the module, depthwise separable convolutions with different receptive fields are used to enhance the sensitivity of the model to lesion size. Additionally, the Vision Transformer is integrated to improve the model’s ability to perceive global features. Secondly, the Context Interaction-awareness Module (CIaM) is designed to fuse deep and shallow features. The deep semantic features guide the shallow spatial features. Then, the shallow spatial features are embedded into the deep semantic features, and the cross-weighted attention mechanism is used to aggregate the deep and shallow features efficiently, and richer context information is obtained. Thirdly, the Edge-preserving perception Module (E2PM) is designed to enhance the teeth edge features. The first-order differential operator is used to get the tooth edge weight, and the perception ability of tooth edge features is improved. The shallow spatial feature is fused by linear mapping, weight concatenation, and matrix multiplication operations to preserve the tooth edge information. Finally, comparison experiments and ablation experiments are conducted on the oral panoramic X-ray image datasets. The results show that the APdet, APseg, ARdet, ARseg, mAPdet, and mAPseg indicators of the proposed model are 89.9%, 91.9%, 77.4%, 77.6%, 72.8%, an

关键词： The oral panoramic X-ray instance segmentation impacted teeth vision transformer the edge-preserving

来源：评论

学校读者我要写书评

暂无评论

Autonomous Path Planning via Sand Cat Swarm Optimization With Multi-Strategy Mechanism for Unmanned Aerial Vehicles in Dynamic Environment

引用

IEEE Internet of Things Journal 2025年

作者： Deng, Wu Feng, Jiayi Zhao, Huimin Civil Aviation University of China College of Electronic Information and Automation Tianjin300300 China Civil Aviation University of China Tianjin Key Lab Intelligent Signal and Image Processing Tianjin300300 China State Key Laboratory of Rail Transit Vehicle System of Southwest Jiaotong University Chengdu610031 China

Unmanned Aerial Vehicles (UAVs) face critical challenges in path planning in dynamic environment. Sand Cat Swarm Optimization (SCSO) algorithm has demonstrated promise in addressing complex optimization challenges. However, SCSO is limited by slow convergence, susceptibility to local optima, and insufficient adaptability. To overcome these shortcomings, an enhanced SCSO with the spiral search, Livy flight, tent chaotic mapping, and adaptive sparrow alert mechanism, namely TSLS-SCSO is developed to propose an autonomous path planning method for UAVs in dynamic environment. In TSLS-SCSO, a new population initialization strategy with tent chaotic mapping is designed to achieve a large dynamic range and coverage capability. Then a new spiral search strategy is designed to broaden the search range in the search phase. And a new Livy flight strategy is employed to enrich the diversity of population in the attacking prey phase. A new sparrow alert mechanism with integrating the sand cat group with the sparrow alert is designed to obtain faster convergence speed and accuracy. The experiment results on CEC 2017 and CEC 2022 show that the TSLS-SCSO obtains higher accuracy and more stable solutions and exhibits better competitiveness. Furthermore, the proposed UAV path planning method successfully found effective paths with an obstacle avoidance effectiveness of 95.5%. The obtained results validate the effectiveness and competitiveness of TSLS-SCSO in UAV path planning in the dynamic environment. © 2014 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：