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

Some characteristics of logistic map over the finite field

Science China(information Sciences) 2019年第3期62卷 199-201页

作者： Bo YANG Xiaofeng LIAO Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University

Dear editor,Chaotic maps have good characteristics, which include randomness, sensitivity to the initial value,and unpredictability. Hence, there have been many attempts to discuss the dynamic behavior of chaotic maps... 详细信息

关键词： Some characteristics of logistic map over the finite field

来源：评论

学校读者我要写书评

暂无评论

Physical-layer secrecy outage of spectrum sharing CR systems over fading channels

引用

Science China(information Sciences) 2016年第10期59卷 112-120页

作者： Hequn LIU Hui ZHAO Hong JIANG Chaoqing TANG Gaofeng PAN Tingting LI Yunfei CHEN Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Southwest University School of Mathematics and Statistics Southwest University School of Engineering University of Warwick

In this paper, we investigate the physical-layer secrecy outage performance of underlay spectrum sharing systems over Rayleigh and log-normal fading channels in the presence of one eavesdropper. In particular, the secondary transmitter sends data to the legitimate receiver under the constraints of the interference temperature at the primary receiver, while suffering the wiretap from the eavesdropper. Closed-form and approximated expressions are derived for the secrecy outage probability over Rayleigh and log-normal fading channels,respectively. The accuracy of our performance analysis is verified by simulation results.

关键词： spectrum sharing cognitive radio secrecy outage probability Rayleigh fading channels log-normal fading channels

来源：评论

学校读者我要写书评

暂无评论

Prox-DBRO-VR: A Unified Analysis on Byzantine-Resilient Decentralized Stochastic Composite Optimization With Variance Reduction and Nonasymptotic Convergence Rates

引用

IEEE Transactions on Systems, Man, and Cybernetics: Systems 2025年

作者： Hu, Jinhui Chen, Guo Li, Huaqing Guo, Xiaoyu Ran, Liang Huang, Tingwen Central South University School of Automation Hunan Changsha 410083 China City University of Hong Kong Department of Mechanical Engineering Hong Kong University of New South Wales School of Electrical Engineering and Telecommunications Sydney 2052 NSW Australia Southwest University Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Chongqing 400715 China Shenzhen University of Advanced Technology Faculty of Computer Science and Control Engineering Shenzhen 518055 China

Decentralized stochastic gradient algorithms efficiently solve large-scale finite-sum optimization problems when all agents in the network are reliable. However, most of these algorithms are not resilient to adverse conditions, such as malfunctioning agents, software bugs, and cyber attacks. This article aims to handle a class of general composite optimization problems over multiagent systems (MASs) in the presence of an unknown number of Byzantine agents. Building on a resilient aggregation mechanism and the proximal-gradient mapping method, a Byzantine-resilient decentralized stochastic proximal-gradient algorithmic framework is proposed, dubbed Prox-DBRO-VR, which achieves an optimization and control goal using only local computations and communications. To asymptotically reduce the noise variance arising from local gradient estimation and accelerate the convergence, we incorporate two localized variance-reduced (VR) techniques (SAGA and LSVRG) into Prox-DBRO-VR to design Prox-DBRO-SAGA and Prox-DBRO-LSVRG. By analyzing the contraction relationships among the gradient-learning error, resilient consensus condition, and convergence error in a unified theoretical framework, it is proved that both Prox-DBRO-SAGA and Prox-DBRO-LSVRG, with a well-designed constant (resp., decaying) step-size, converge linearly (resp., sublinearly) inside an error ball around the optimal solution to the original problem under standard assumptions. A tradeoff between convergence accuracy and Byzantine resilience in both linear and sublinear cases is also characterized. In numerical experiments, the effectiveness and practicability of the proposed algorithms are manifested via resolving a decentralized sparse machine learning problem under various Byzantine attacks. © 2013 IEEE.

关键词： Byzantine-resilient algorithms composite optimization decentralized stochastic optimization system security variance reduction

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Application of multiple two-dimensional interpolation methods to bathymetric data on the FVCOM unstructured triangular grid

引用

Applied Mathematics and Computation 2025年 507卷

作者： Zongli Ruan Guobing Qian Yiwei Wang Jia Xiao College of Science China University of Petroleum (East China) Qingdao 266580 PR China Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing 400715 PR China

In general, the ocean bathymetric dataset is defined on a uniform rectangular grid, whereas FVCOM employs an unstructured triangular grid. Consequently, it is necessary to interpolate the data from the nodes of the rectangular grid onto those of the triangular grid. The nearest neighbor method, bilinear method, and inverse distance weighting (IDW) method are three commonly utilized two-dimensional interpolation techniques, and inverse distance weighted regression (IDWR) represents a more recent interpolation approach. In this study, these methods were applied to interpolate the bathymetric data of the Hormuz Strait and the North Indian Ocean onto the FVCOM triangular grid. The experimental results demonstrate that a very small error in the interpolation of bathymetric data was achieved. Additionally, these methods were compared with the interpolation techniques provided by the MATLAB system. The comparative analysis reveals that the bilinear method can achieve a superior interpolation effect compared to the other three methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ISS -equilibrium with stability analysis for disturbed game-based impulsive systems

引用

Automatica 2025年 179卷

作者： Wenlu Liu Chuandong Li Xiaodi Li Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing 400715 PR China School of Mathematics and Statistics Shandong Normal University Ji’nan 250014 PR China

This paper focuses on a class of two-player differential games subject to exogenous disturbances, where one player employs piecewise-continuous control, and the other uses impulsive control. Particularly, the exploration of equilibrium solution in differential games is accompanied by the stability performance analysis of relevant system. To be more specific, the construction of saddle point in zero-sum differential game and Nash equilibrium in nonzero-sum differential game is established under the Lyapunov criteria for input-to-state stability ( ISS ). Furthermore, owing to the existence of external disturbances and the characterization of ISS property, two extended equilibrium solution concepts are introduced. We propose the definition of ϵ - ISS saddle point and ϵ - ISS Nash equilibrium for which the corresponding verification theorems are formulated. Finally, two numerical experiments are provided to illustrate the proposed results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A simple motion deblurring method by two continuous images 6

A simple motion deblurring method by two continuous images

引用

6th International Conference on information, Cybernetics, and Computational Social Systems, ICCSS 2019

作者： Zhang, Jihai Li, Jianfeng Liu, Guangyuan Chen, Tong Zhu, Tengteng Li, Bo Chongqing Key Laboratory of Nonlinear Circuits Intelligent Information Processing Chongqing400715 China

ISBN: (纸本)9781728158570

Restoring blurred images to clear images is a challenging problem. Most previous methods only analyzed the single image. However, for motion blurring, this method missed the key trajectory description process. Based on the essence of motion blur, our research combined the continuous frame image information in video to estimate the motion track, the SIFT algorithm was proposed for the first time to match the feature points of the target in the continuous frame image. The accurate motion blur angle and motion blur distance were obtained by combining the matching information to obtain an accurate PSF. Finally, the Wiener filtering algorithm combined with PSF was used for deblurring. Experiments showed that the proposed method can improve the image sharpness after restoration compared with the previous algorithms. © 2019 IEEE.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Event-Triggered Differentially Private Average Consensus for Multi-agent Network

引用

IEEE/CAA Journal of Automatica Sinica 2019年第1期6卷 75-83页

作者： Aijuan Wang Xiaofeng Liao Haibo He the College of Computer Science Chongqing University the School of Electronics and Information Engineering Southwest University the Department of Electrical Computer and Biomedical EngineeringUniversity of Rhode Island Kingston IEEE Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing

This paper investigates the differentially private problem of the average consensus for a class of discrete-time multi-agent network systems(MANSs). Based on the MANSs,a new distributed differentially private consensus algorithm(DPCA) is developed. To avoid continuous communication between neighboring agents, a kind of intermittent communication strategy depending on an event-triggered function is established in our DPCA. Based on our algorithm, we carry out the detailed analysis including its convergence, its accuracy, its privacy and the trade-off between the accuracy and the privacy level, respectively. It is found that our algorithm preserves the privacy of initial states of all agents in the whole process of consensus computation. The trade-off motivates us to find the best achievable accuracy of our algorithm under the free parameters and the fixed privacy level. Finally, numerical experiment results testify the validity of our theoretical analysis.

关键词： Average consensus differentially private event-triggered communication multi-agent network systems (MANSs)

来源：评论

学校读者我要写书评

暂无评论

Bayesian random Fourier filters for Gaussian noises

引用

Science China(information Sciences) 2018年第12期61卷 214-216页

作者： Shiyuan WANG Wanli WANG Shukai DUAN Lidan WANG Chi K.TSE College of Electronic and Information Engineering Southwest University Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Department of Electronic and Information Engineering Hong Kong Polytechnic University

Dear editor,Signal processing algorithms are generally used to identify an unknown system, and can be classified as batch algorithms and online learning algorithms(OLAs). Batch algorithms are applied to offline scenar... 详细信息

关键词： Bayesian random Fourier filters for Gaussian noises

来源：评论

学校读者我要写书评

暂无评论

Sparse Huber Adaptive Filter with Correntropy Induced Metric Penalty 35

Sparse Huber Adaptive Filter with Correntropy Induced Metric...

引用

第35届中国控制会议

作者： WANG Shiyuan ZHENG Yunfei DUAN Shukai College of Electronic and Information Engineering Southwest University Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing

ISBN: (纸本)9781509009107

The Huber adaptive filter is robust both in the Gaussian and non-Gaussian noise *** correntropy induced metric（CIM） is an excellent approximator of the l-norm and can be used as a sparsity penalty ***,a novel sparse method based on the Huber cost with CIM constraint（CIM-Huber） is developed for sparse system identification in this *** comparison,the Huber cost functions with zero-attracting penalty（ZA-Huber） and reweighted zero-attracting penalty（RZA-Huber） algorithm are discussed *** results show that the proposed CIM-Huber has a better performance in the identification of sparse systems than the ZA-Huber and the RZA-Huber,and can also be applied to system identification under the cases of various noise environments.

关键词： Sparse system identification Huber adaptive filter Correntropy induced metric Noise

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：