PID Control of Planar Nonlinear Uncertain Systems in the Presence of Actuator Saturation

This paper investigates PID control design for a class of planar nonlinear uncertain systems in the presence of actuator saturation. Based on the bounds on the growth rates of the nonlinear uncertain function in the system model, the system is placed in a linear differential inclusion. Each vertex system of the linear differential inclusion is a linear system subject to actuator saturation. By placing the saturated PID control into a convex hull formed by the PID controller and an auxiliary linear feedback law, we establish conditions under which an ellipsoid is contractively invariant and hence is an estimate of the domain of attraction of the equilibrium point of the closed-loop system. The equilibrium point corresponds to the desired set point for the system output. Thus, the location of the equilibrium point and the size of the domain of attraction determine, respectively, the set point that the output can achieve and the range of initial conditions from which this set point can be reached. Based on these conditions, the feasible set points can be determined and the design of the PID control law that stabilizes the nonlinear uncertain system at a feasible set point with a large domain of attraction can then be formulated and solved as a constrained optimization problem with constraints in the form of linear matrix inequalities (LMIs). Application of the proposed design to a magnetic suspension system illustrates the design process and the performance of the resulting PID control law.      

Domain reversal and current transport property in BiFeO3 films

The electrical properties and domain reversal in BiFeO₃ ferroelectric films were studied using sandwiched heterostructures and piezoresponse force microscopy. A robust polarization state was observed, combined with a switchable domain pattern and a remanent polarization of approximately 100 μC cm^?2. In addition, domain reversal was explored using scanning probe microscopy. The results show that dipoles could be reversed along the direction of the electric field under a negative tip bias, leading to carrier gathering near the domain walls. The enhanced conductivity near the domain walls was owing to the discontinuous polarization boundary conditions. In addition, typical diode-like current transport properties are sensitive to various temperature conditions, which is attributed to the Schottky barriers at the contact interface. These findings extend the current understanding of domain texture reversal in ferroelectric films and shed light on their potential applications for future ferroelectric random-access memory operations over a wide temperature range.     

基于卓越工程师教育的频率特性分析课堂教学研究

频率特性分析在工程应用中具有重要的作用,在电路分析、模拟电子技术、信号与系统、自动控制理论等相关课程中都涉及到相关章节内容,在不同课程中如何根据工程应用和学生学习阶段把握具体的讲解内容和讲解方式非常重要。本文从频率特性的求解方法和具体物理意义角度开展在不同课程中讲解的方法,从时域和频域角度分别讨论其物理意义和具体的分析方法。通过渐进深化的教学过程和教学方法不断提高学生的知识掌握和应用技能,提高学生的工程意识、工程素质和工程创新能力,强化学生对于频率特性课程知识的综合应用能力。     

自适应融合层级特征的混合退化图像复原算法

多种退化类型混合的图像比单一类型的退化图像降质更严重,很难建立精确模型对其复原,研究端到端的神经网络算法是复原的关键.现有的基于操作选择注意力网络的算法(operation-wiseattentionnetwork,OWAN)虽然有一定的性能提升,但是其网络过于复杂,运行较慢,复原图像缺乏高频细节,整体效果也有提升的空间.针对这些问题,提出一种基于层级特征融合的自适应复原算法.该算法直接融合不同感受野分支的特征,增强复原图像的结构;用注意力机制对不同层级的特征进行动态融合,增加模型的自适应性,降低了模型冗余;另外,结合L1损失和感知损失,增强了复原图像的视觉感知效果.在DIV2K,BSD500等数据集上的实验结果表明,该算法无论是在峰值信噪比和结构相似性上的定量分析,还是在主观视觉质量方面,均优于OWAN算法,充分证明了该算法的有效性.     

基于词法特征的恶意域名快速检测算法

针对互联网中恶意域名攻击事件频发，现有域名检测方法实时性不强的问题，提出一种基于词法特征的恶意域名快速检测算法。该算法根据恶意域名的特点，首先将所有待测域名按照长度进行正则化处理后赋予权值；然后利用聚类算法将待测域名划分成多个小组，并利用改进的堆排序算法按照组内权值总和计算各域名小组优先级，根据优先级降序依次计算各域名小组中每一域名与黑名单上域名之间的编辑距离；最后依据编辑距离值快速判定恶意域名。算法运行结果表明，基于词法特征的恶意域名快速检测算法与单一使用域名语义和单一使用域名词法的恶意域名检测算法相比，准确率分别提高1.7%与2.5%，检测速率分别提高13.9%与6.8%，具有更高的准确率和实时性。     

Gradient-based recursive parameter estimation for a periodically nonuniformly sampled-data Hammerstein–Wiener system based on the key-term separation

The identification of the Hammerstein–Wiener (H-W) systems based on the nonuniform input–output dataset remains a challenging problem. This article studies the identification problem of a periodically nonuniformly sampled-data H-W system. In addition, the product terms of the parameters in the H-W system are inevitable. In order to solve the problem, the key-term separation is applied and two algorithms are proposed. One is the key-term-based forgetting factor stochastic gradient (KT-FFSG) algorithm based on the gradient search. The other is the key-term-based hierarchical forgetting factor stochastic gradient (KT-HFFSG) algorithm. Compared with the KT-FFSG algorithm, the KT-HFFSG algorithm gives more accurate estimates. The simulation results indicate that the proposed algorithms are effective.     

High-resolution ISAR imaging of fast rotating targets based on pattern-coupled Bayesian strategy for multiple measurement vectors

Very high resolution inverse synthetic aperture radar (ISAR) imaging of fast rotating targets is a complicated task. There may be insufficient pulses or may introduce migration through range cells (MTRC) during the coherent processing interval (CPI) when we use the conventional range Doppler (RD) ISAR technique. With compressed sensing (CS) technique, we can achieve the high-resolution ISAR imaging of a target with limited number of pulses. Sparse representation based method can achieve the super resolution ISAR imaging of a target with a short CPI, during which the target rotates only a small angle and the range migration of the scatterers is small. However, traditional CS-based ISAR imaging method generally faced with the problem of basis mismatch, which may degrade the ISAR image. To achieve the high resolution ISAR imaging of fast rotating targets, this paper proposed a pattern-coupled sparse Bayesian learning method for multiple measurement vectors, i.e. the PC-MSBL algorithm. A multi-channel pattern-coupled hierarchical Gaussian prior is proposed to model the pattern dependencies among neighboring range cells and correct the MTRC problem. The expectation-maximization (EM) algorithm is used to infer the maximum a posterior (MAP) estimate of the hyperparameters. Simulation results validate the effectiveness and superiority of the proposed algorithm.     

基于时频域的卷积神经网络运动想象脑电信号识别方法

针对目前运动想象脑电（EEG）信号识别率较低的问题，考虑到脑电信号蕴含着丰富的时频信息，提出一种基于时频域的卷积神经网络（CNN）运动想象脑电信号识别方法。首先，利用短时傅里叶变换（STFT）对脑电信号的相关频带进行预处理，并将多个电极的时频图组合构造出一种二维时频图；然后，针对二维时频图的时频特性，通过一维卷积的方法设计了一种新颖的CNN结构；最后，通过支持向量机（SVM）对CNN提取的特征进行分类。基于BCI数据集的实验结果表明，所提方法的平均识别率为86.5%，优于其他传统运动想象脑电信号识别方法；同时将该方法应用在智能轮椅上，验证了其有效性。     

When Does Communication Learning Need Hierarchical Multi-Agent Deep Reinforcement Learning

Abstract

Multi-agent systems need to communicate to coordinate a shared task. We show that a recurrent neural network (RNN) can learn a communication protocol for coordination, even if the actions to coordinate are performed steps after the communication phase. We show that a separation of tasks with different temporal scale is necessary for successful learning. We contribute a hierarchical deep reinforcement learning model for multi-agent systems that separates the communication and coordination task from the action picking through a hierarchical policy. We further on show, that a separation of concerns in communication is beneficial but not necessary. As a testbed, we propose the Dungeon Lever Game and we extend the Differentiable Inter-Agent Learning (DIAL) framework. We present and compare results from different model variations on the Dungeon Lever Game.