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

SSRN 2022年

作者： Deng, Hao Li, Chuandong Wang, Yinuo Wu, Hongjuan Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing400715 China

This work extends the finite-time stability (FTS) results to non-instantaneous impulsive time-varying systems on the basis of general impulsive systems via Lyapunov theory. The impacts of impulse numbers, impulse time sequences and impulse amplitudes on FTS and settling-time estimation are discussed. The effects of different types of impulses on settling-time are discussed when the impulse number is known or pre-given. The average impulsive interval is introduced to extend the above results to the case when the impulse number is unknown, and the derivative of Lyapunov function is allowed to be indefinite instead of being negative definite or semi-negative definite. Moreover, the theoretical results are applied to non-instantaneous impulsive neural networks. Finally, we provide two numerical examples to demonstrate the effectiveness and feasibility of the obtained results. © 2022, The Authors. All rights reserved.

关键词： Lyapunov functions

来源：评论

学校读者我要写书评

暂无评论

A Proportionate Maximum Total Complex Correntropy Algorithm for Sparse Systems

SSRN

引用

SSRN 2023年

作者： Huang, Sifan Qian, Guobing Wang, Xin Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing400715 China School of Cyber Science and Engineering Sichuan University Chengdu610065 China

While much attention has been paid to the practical application of adaptive filters, two significant problems that have a great impact on performance need to be solved. One is that the sparsity of the system, and the other is the additive interference noise is impulsive noise. With the purpose of solving these issues at the same time, by introducing the proportionate matrix, a proportionate maximum total complex correntropy algorithm based on the errors-in-variables (EIV) model is proposed in this paper. We derive the theoretical analysis of the steady-state weight error power on the premise of impulsive noise. Meanwhile, the performance comparison in system identification is discussed and the robustness of the proposed algorithm is illustrated. Finally, the simulation with the stereophonic acoustic echo cancellation (SAEC) is carried out, and the result validates that the proposed PMTCC algorithm has obvious advantages. © 2023, The Authors. All rights reserved.

关键词： Impulse noise

来源：评论

学校读者我要写书评

暂无评论

Robust variable normalization least mean p-power algorithm

引用

Science China(Information Sciences) 2020年第9期63卷 294-302页

作者： Kui XIONG Yu ZHANG Shiyuan WANG College of Electronic and Information Engineering Southwest University Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Faculty of Computer and Information Science Southwest University

Dear editor,Adaptive filtering algorithms have been widely applied in system identification, channel equalization, and echo cancellation over the past decades [1–3]. Generally, adaptive filtering algorithms can be ge... 详细信息

关键词： Least mean p-power algorithm variable normalization sigmoid function steady-state performance analysis noise robustness

来源：评论

学校读者我要写书评

暂无评论

Neurodynamics-based Iteratively Reweighted Convex Optimization for Sparse Signal Reconstruction 12

Neurodynamics-based Iteratively Reweighted Convex Optimizati...

引用

12th International Conference on Information Science and Technology, ICIST 2022

作者： Che, Hangjun Wang, Jun Cichocki, Andrzej College of Electronic and Information Engineering Southwest University Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Chongqing400715 China City University of Hong Kong Department of Computer Science and School of Data Science Hong Kong Hong Kong Skolkovo Institute of Science and Technology Moscow143026 Russia

ISBN: (数字)9781665485821

ISBN: (纸本)9781665485821

In this paper, sparse signal reconstruction is for-mulated a q-ratio minimization problem subjecting to linear underdetermined equations. In view of the nonconvexity of the objective function, the q-ratio formulation with q=2 is approximately reformulated as an iteratively reweighted convex optimization problem in the majorization-minimization frame-work. A neurodynamic optimization approach is introduced to solve the formulated problem iteratively. The experimental results on sparse signal reconstruction are discussed to demonstrate the performance of the proposed approach. © 2022 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Push-Pull Method for Decentralized Optimization via State Decomposition

arXiv

引用

arXiv 2023年

作者： Cheng, Huqiang Liao, Xiaofeng Li, Huaqing Zhao, You Key Laboratory of Dependable Services Computing in Cyber Physical Society Ministry of Education College of Computer Science Chongqing University Chongqing400044 China Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing400715 China

Distributed optimization is manifesting great potential in multiple fields, e.g., machine learning, control, and resource allocation. Existing decentralized optimization algorithms require sharing explicit state information among the agents, which raises the risk of private information leakage. To ensure privacy security, combining information security mechanisms, such as differential privacy and homomorphic encryption, with traditional decentralized optimization algorithms is a commonly used means. However, this would either sacrifice optimization accuracy or incur heavy computational burden. To overcome these shortcomings, we develop a novel privacy-preserving decentralized optimization algorithm, called PPSD, that combines gradient tracking with a state decomposition mechanism. Specifically, each agent decomposes its state associated with the gradient into two substates. One substate is used for interaction with neighboring agents, and the other substate containing private information acts only on the first substate and thus is entirely agnostic to other agents. For the strongly convex and smooth objective functions, PPSD attains a R-linear convergence rate. Moreover, the algorithm can preserve the agents’ private information from being leaked to honest-but-curious neighbors. Simulations further confirm the results. © 2023, CC BY.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Sparsity-constrained Graph Nonnegative Matrix Factorization for Clustering 11

Sparsity-constrained Graph Nonnegative Matrix Factorization ...

引用

11th International Conference on intelligent Control and Information processing, ICICIP 2021

作者： Chen, keyi Che, Hangjun Yang, Xuanhao Leung, Man-Fai Southwest University Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Chongqing400715 China Hong Kong Metropolitan University School of Science and Technology Hong Kong

ISBN: (纸本)9781665425155

Graph nonnegative matrix factorization (GNMF) is superior for mining the intrinsic geometric structure embedded in high-dimensional data. As the sparsity of the factorized matrices is crucial for clustering, the l0 norm is commonly used in the formulated optimization problem to enforce the sparseness which makes the problem NP-hard and discontinuous. In this paper, the sparse graph nonnegative matrix factorization (SGNMF) is formulated as a global optimization problem by using the sum of inverted Gaussian functions to approximate the l0 norm, the multiplicative update rules are developed to solve the problem with guaranteed convergence. The superior performance of the proposed approach is substantiated by clustering tests on four public datasets. © 2021 IEEE.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

A Distributed Fixed-Time Neurodynamic Algorithm and Its Application in Multi-Autonomous Underwater Vehicle Collaborative Escorting

引用

IEEE Transactions on Network Science and Engineering 2025年

作者： Zhang, Peng He, Xing Yu, Junzhi Southwest University Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Chongqing400715 China Peking University State Key Laboratory for Turbulence and Complex Systems Department of Advanced Manufacturing and Robotics College of Engineering Beijing100871 China Peking University Nanchang Innovation Institute Nanchang330224 China

In this paper, a distributed fixed-time neurodynamic algorithm (DFxTNA) is designed for solving distributed optimization problem with time-varying (TV) objective function and constraints. The DFxTNA consists of consensus part based on sliding-mode control technique and optimization part based on Hessian matrix and penalty function. In contrast to existing distributed TV algorithms, DFxTNA based on fixed-time sliding mode control can effectively improve the convergence performance of the algorithm and has better stability with the addition of TV disturbance. In addition, the consistency and fixed-time convergence of DFxTNA are proved by Lyapunov theory and fixed-time stability, respectively. The effectiveness of DFxTNA is verified by numerical experiments. Finally, a distributed TV optimization problem model is established for a multi-autonomous underwater vehicle (AUV) cooperative escort scenario, and DFxTNA is applied to solve the problem. Simulation results confirm the effectiveness and stability of DFxTNA in target tracking, formation control, and dynamic obstacle avoidance. © 2013 IEEE.

关键词： Lyapunov functions

来源：评论

学校读者我要写书评

暂无评论

Consensus of multi-agent systems with dynamic join characteristics under impulsive control

引用

Frontiers of Information Technology & Electronic Engineering 2021年第1期22卷 120-133页

作者： Xiang HU Zufan ZHANG Chuandong LI School of Communication and Information Engineering Chongqing University of Posts and TelecommunicationsChongqing 400065China Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information EngineeringSouthwest UniversityChongqing 400715China

We study how to achieve the state consensus of a whole multi-agent system after adding some new agent groups dynamically in the original multi-agent *** analyze the feasibility of dynamically adding agent groups under differen t forms of net work topologies that are currently common,and obtain four feasible schemes in theory,including one scheme that is the best in actual industrial ***,we carry out dynamic modeling of multi-agent systems for the best *** control theory and Lyapunov stability theory are used to analyze the conditions so that the whole multi-agent system with dynamic join characteristics can achieve state ***,we provide a numerical example to verify the practicality and validity of the theory.

关键词： Multi-agent system Network topology Impulsive input Dynamic join charac teristics State consensus

来源：评论

学校读者我要写书评

暂无评论

Metaheuristics for Index-Tracking with Cardinality Constraints 11

Metaheuristics for Index-Tracking with Cardinality Constrain...

引用

11th International Conference on Information Science and Technology, ICIST 2021

作者： Yuen, Man-Chung Ng, Sin-Chun Leung, Man-Fai Che, Hangjun Open University of Hong Kong School of Science and Technology Hong Kong Hong Kong Southwest University College of Electronic and Information Engineering Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Chongqing China

ISBN: (纸本)9781665412667

As one of the passive investment strategies, index-tracking aims to replicate market indexes to reproduce market performance. It is widely used for long-term investment. Full replication and partial index-tracking are common approaches for index-tracking problems. Although full replication tracks the chosen market index perfectly, the transaction cost is relatively high in practice. Therefore, partial index-tracking is desired that can reduce the transaction cost and avoid illiquid assets. The partial index-tracking approach selects the subset of a benchmark index and applies restrictions for the numbers of stocks with cardinality constraints. The constrained problem is converted into an unconstrained problem by adding the penalty term. This paper is concerned with the sparse index-tracking problem with cardinality constraints by various metaheuristics. Various metaheuristics are used to deal with the sparse index-tracking problem, and their performances are compared. Also, various penalty values are adopted to test the performance of the compared algorithm. © 2021 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Multimodal Associative Memory Based on Forgetting Memristor Bridge Synapse Circuit

SSRN

引用

SSRN 2023年

作者： Li, Ke Chen, Ling Li, Chuandong Qiu, Haoyang Liu, Chenchen Electronic Information and Engineering Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Southwest University 400715 China University of Maryland Baltimore County Computer Science and Electrical Engineering Department United States

Memristor is frequently used to construct synapses and memristor bridge synapse is a typical example of such a synapse. Unlike the traditional memristor bridge synapse, the forgetting memristor bridge synapse can express positive and negative weights, as well as dual weights for long-term and short-term memory. In this study, we constructed the forgetting memristor bridge synapse using the forgetting memristor SPICE model, and then simulated 1*1, 1*3, and 3*3 forgetting memristor bridge synapse networkswith neurons. We demonstrated the circuit and network’s functionality and effectiveness through simulation results and noise ***, we built the bipolar and gray-level BAM (BGBAM) network based on the forgetting memristor bridge. Owing to its dual weight characteristic, the BGBAM associative memory network uses time division multiplexing mode on the same architecture, which enables the realization of multi-modal associative memories between text, images, and audio. © 2023, The Authors. All rights reserved.

关键词： Memristors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：