PRE-IMAGE ENTROPY OF NONAUTONOMOUS DYNAMICAL SYSTEMS*

The authors define and study topological pre-image entropy for the non-autonomous discrete dynamical systems given by a sequence {fi}i=1^∞ of continuous self-maps of a compact topological space. The basic properties and the invariant with respect to equiconjugacy of pre-image entropy for the non-autonomous discrete dynamical systems are obtained.     

An augmented BV setting for feedback switching control

<正> This paper considers dynamical systems under feedback with control actions limited toswitching.The authors wish to understand the closed-loop systems as approximating multi-scale problemsin which the implementation of switching merely acts on a fast scale.Such hybrid dynamicalsystems are extensively studied in the literature,but not much so far for feedback with partial stateobservation.This becomes in particular relevant when the dynamical systems are governed by partialdifferential equations.The authors introduce an augmented BV setting which permits recognition ofcertain fast scale effects and give a corresponding well-posedness result for observations with such minimalregularity.As an application for this setting,the authors show existence of solutions for systemsof semilinear hyperbolic equations under such feedback with pointwise observations.     

混杂系统粒子滤波混合状态估计及故障诊断算法

混杂系统同时包含连续动态特性和离散动态特性,并且两种动态相互作用,使其故障诊断变得更加困难。针对此问题,提出了一种混合系统粒子滤波混合状态估计及故障诊断算法,提高了现有方法的适用范围和诊断效率。针对混杂系统受控迁移、自治迁移和随机迁移等特点,首先利用随机混杂自动机对系统离散状态(包括故障)和连续状态进行统一建模,重点对现有基于扩展卡尔曼粒子滤波的连续估计算法进行改进,支持利用在线监测数据来估计混杂系统各类迁移产生的各种离散和连续状态,最后根据离散状态估计结果快速实现故障诊断。通过对典型非线性混杂系统的故障诊断,证明了该方法的有效性。     

Computing the Determinant of a Matrix with Polynomial Entries by Approximation

Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. This paper proposes an effective algorithm to compute the determinant of a matrix with polynomial entries using hybrid symbolic and numerical computation. The algorithm relies on the Newton’s interpolation method with error control for solving Vandermonde systems. The authors also present the degree matrix to estimate the degree of variables in a matrix with polynomial entries, and the degree homomorphism method for dimension reduction. Furthermore, the parallelization of the method arises naturally.     

Generating exact nonlinear ranking functions by symbolic-numeric hybrid method

This paper presents a hybrid symbolic-numeric algorithm to compute ranking functions for establishing the termination of loop programs with polynomial guards and polynomial assignments. The authors first transform the problem into a parameterized polynomial optimization problem, and obtain a numerical ranking function using polynomial sum-of-squares relaxation via semidefinite programming (SDP). A rational vector recovery algorithm is deployed to recover a rational polynomial from the numerical ranking function, and some symbolic computation techniques are used to certify that this polynomial is an exact ranking function of the loop programs. At last, the authors demonstrate on some polynomial loop programs from the literature that our algorithm successfully yields nonlinear ranking functions with rational coefficients.     

Novel Criteria for Exponential Stability of Linear Non-Autonomous Functional Differential Equations

General linear non-autonomous functional differential equations are considered. Explicit criteria for exponential stability are given. Furthermore, the authors present an explicit robust stability bound for systems subject to time-varying perturbations. Two examples are given to illustrate the obtained results.     

二阶动力学系统模型的跟踪设计

考虑了基于分散状态反馈控制律的二阶动力学系统输出渐近跟踪设计,该控制律包括被控对象状态和参考模型状态两部分。给出了问题解的存在条件:两个矩阵方程,其中一个为二阶Sylvester矩阵方程。给出了所有控制器增益阵的完全参数化表达式。归纳出了二阶动力学系统模型参考输出跟踪控制律的设计算法。该算法直接基于原系统的参数矩阵,无须对系统增广或变换,仅涉及自由参数的选取和一些简单的代数运算,便于工程应用。仿真结果说明所给出的算法是有效的。     

Complexity analysis of network-based dynamical systems

This paper investigates the nonlinear dynamics of network-based dynamical systems where network communication channels of finite data rates are inserted into the closed loops of the control systems. The authors analyze the bifurcation and chaotic behavior of the non-smooth dynamical systems. The authors first prove that for almost all system parameters there are no periodic orbits. This result distinguishes this type of non-smooth dynamical systems from many others exhibiting border-collision bifurcations. Next, the authors show analytically that the chaotic sets are separated from the region containing the line segment of all fixed points with a finite distance. Finally, the authors employ a simple model to highlight that both the number of clients sharing a common network channel and fluctuations in the available network bandwidth have significant influence on the performance of such dynamical systems.     

GVW algorithm over principal ideal domains

GVW algorithm was given by Gao, Wang, and Volny in computing a Gröbner bases for ideal in a polynomial ring, which is much faster and more simple than F5. In this paper, the authors generalize GVW algorithm and present an algorithm to compute a Gröbner bases for ideal when the coefficient ring is a principal ideal domain.     

开关变换器的仿真建模方法及最大Lyapunov指数计算

提出DC-DC开关变换器的两种建模方法,并对之进行了比较,以便更有效地对变换器中的各种线性、非线性现象进行数值仿真及分析计算。一种建模方法是考虑时间,将时间变量看成为一个状态变量,从而建立非自治系统模型;另一种是不考虑时间,而仅考虑电路状态变量,来建立变换器的自治系统模型。两种模型的数值仿真结果完全一致,但以这两种模型为基础,计算所得到的最大Lyapunov指数的表现是不同的,相比较而言,以自治系统模型为基础,计算所得的最大Lyapunov指数包含更多的信息,它不仅能指示混沌的产生,而且可以指示各次分叉的情况。     

Efficiently counting affine roots of mixed trigonometric polynomial systems

Estimating the number of isolated roots of a polynomial system is not only a fundamental study theme in algebraic geometry but also an important subproblem of homotopy methods for solving polynomial systems. For the mixed trigonometric polynomial systems, which are more general than polynomial systems and rather frequently occur in many applications, the classical B′ezout number and the multihomogeneous B′ezout number are the best known upper bounds on the number of isolated roots. However, for the deficient mixed trigonometric polynomial systems, these two upper bounds are far greater than the actual number of isolated roots. The BKK bound is known as the most accurate upper bound on the number of isolated roots of a polynomial system. However, the extension of the definition of the BKK bound allowing it to treat mixed trigonometric polynomial systems is very difficult due to the existence of sine and cosine functions. In this paper, two new upper bounds on the number of isolated roots of a mixed trigonometric polynomial system are defined and the corresponding efficient algorithms for calculating them are presented. Numerical tests are also given to show the accuracy of these two definitions, and numerically prove they can provide tighter upper bounds on the number of isolated roots of a mixed trigonometric polynomial system than the existing upper bounds, and also the authors compare the computational time for calculating these two upper bounds.     

基于边界矩和改进FCM聚类的水下目标识别

水下目标的识别是水下机器人对环境动态感知、快速定位与跟踪视觉目标的关键, 本文针对水下成像的特殊性以及成像环境的复杂性,旨在设计一种快速、准确的目标识别系统以指导水下机器人进行下一步的任务. 首先, 综合运用一些流行的算法, 简要介绍了一种有效的边界分割算法; 然后通过对边界矩的分析和修正, 构造了具有平移、旋转及比例变换不变性的仿射变换; 最后详细描述了改进的FCM聚类识别的设计理念. 通过对实测的4类物体组成的水下目标的识别实验, 证明了所提水下目标识别系统可以用于水下目标识别, 并且具有较高的鲁棒性和实时性.     

Computing Sparse GCD of Multivariate Polynomials via Polynomial Interpolation

The problem of computing the greatest common divisor (GCD) of multivariate polynomials, as one of the most important tasks of computer algebra and symbolic computation in more general scope, has been studied extensively since the beginning of the interdisciplinary of mathematics with computer science. For many real applications such as digital image restoration and enhancement, robust control theory of nonlinear systems, L₁-norm convex optimization in compressed sensing techniques, as well as algebraic decoding of Reed-Solomon and BCH codes, the concept of sparse GCD plays a core role where only the greatest common divisors with much fewer terms than the original polynomials are of interest due to the nature of problems or data structures. This paper presents two methods via multivariate polynomial interpolation which are based on the variation of Zippel’s method and Ben-Or/Tiwari algorithm, respectively. To reduce computational complexity, probabilistic techniques and randomization are employed to deal with univariate GCD computation and univariate polynomial interpolation. The authors demonstrate the practical performance of our algorithms on a significant body of examples. The implemented experiment illustrates that our algorithms are efficient for a quite wide range of input.     

Rational Solutions of High-Order Algebraic Ordinary Differential Equations

This paper considers algebraic ordinary differential equations(AODEs) and study their polynomial and rational solutions. The authors first prove a sufficient condition for the existence of a bound on the degree of the possible polynomial solutions to an AODE. An AODE satisfying this condition is called noncritical. Then the authors prove that some common classes of low-order AODEs are noncritical. For rational solutions, the authors determine a class of AODEs, which are called maximally comparable, such that the possible poles of any rational solutions are recognizable from their coefficients. This generalizes the well-known fact that any pole of rational solutions to a linear ODE is contained in the set of zeros of its leading coefficient. Finally, the authors develop an algorithm to compute all rational solutions of certain maximally comparable AODEs, which is applicable to 78.54% of the AODEs in Kamke's collection of standard differential equations.     

基于粒子群算法的开关系统最优控制问题的数值算法

针对开关系统,给出了数学模型并引出了其最优控制问题,提出开关系统最优控制问题的加权粒子群算法,给出了相关的推理过程及算法步骤。加权粒子群算法不必找出支付泛函关于时间的显式表达,就可以找到其最优解,同样适用于其子系统为非线性的情形。分析了粒子群算法快速全局优化的特点,说明该算法能找到优化问题的全局最优解。以开关动态系统和一般开关线性二次问题的数值算例验证了该方法的有效性。     

A complex systems science perspective on wireless networks

The paper targets a future world where all wireless networks are self-organising entities and in which the predominant mode of spectrum access is dynamic. The paper explores whether the behaviour of a collection of autonomous self-organising wireless systems can be treated as a complex system and whether complex systems science can shed light on the design and deployment of these networks. The authors focus on networks that self-organise from a frequency perspective to understand the behaviour of a collection of wireless self-organising nodes. Each autonomous network is modelled as a cell in a lattice and follows a simple set of self-organisation rules. Two scenarios are considered, one in which each cell is based on cellular automata and which provides an abstracted view of interference and a second in which each cell uses a self-organising technique which more accurately accounts for interference. The authors use excess entropy to measure complexity and in combination with entropy gain an understanding of the structure emerging in the lattice for the self-organising networks. The authors show that the self-organising systems presented here do exhibit complex behaviour. Finally, the authors look at the robustness of these complex systems and show that they are robust against changes in the environment.     

Discovering non-terminating inputs for multi-path polynomial programs

This paper investigates the termination problems of multi-path polynomial programs （MPPs） with equational loop guards. To establish sufficient conditions for termination and nontermination simultaneously, the authors propose the notion of strong/weak non-termination which under/over- approximates non-termination. Based on polynomial ideal theory, the authors show that the set of all strong non-terminating inputs （SNTI） and weak non-terminating inputs （WNTI） both correspond to tile real varieties of certain polynomial ideals. Furthermore, the authors prove that the variety of SNTI is computable, and under some sufficient conditions the variety of WNTI is also computable. Then by checking the computed SNTI and WNTI varieties in parallel, termination properties of a consid- ered MPP can be asserted. As a consequence, the authors establish a new framework for termination analysis of MPPs.     

基于广义微分Petri网的混合系统仿真方法

针对混合动态系统仿真的特点，建立其广义微分Petri网仿真模型，将混合系统的仿真统一于同一建模框架下，在此框架下，离散事件和连续状态变化对混合系统演化的推动作用均可以通过仿真模型中的变迁激发来完成，通过对广义微分Petri网的仿真过程进行分析，给出了基于该模型框架的仿真算法，并对仿真过程中出现的由资源共享引起冲突现象及其解决方案进行分析，最后讨论了仿真系统的死锁及其避免问题。     

Research on robust fault-tolerant control for networked control system with packet dropout

A kind of networked control system with network-induced delay and packet dropout, modeled on asynchronous dynamical systems was tested, and the integrity design of the networked control system with sensors failures and actuators failures was analyzed using hybrid systems technique based on the robust fault-tolerant control theory. The parametric expression of controller is given based on the feasible solution of linear matrix inequality. The simulation results are provided on the basis of detailed theoretical analysis, which further demonstrate the validity of the proposed schema.     

逐步增加I型混合截尾试验下B-S部件的可靠性分析

在逐步增加I型混合截尾试验下,利用最大期望(expectation maximization, EM)算法讨论了Birnbaum-Saunders(B-S)部件的参数及可靠度的估计问题。将B-S分布复杂的分布形式转换成较为简单的逆高斯分布和逆高斯分布倒数的等加权和形式,推导出逐步增加I型混合截尾中隐藏变量的后验密度,进而获得部件寿命参数和可靠度的极大似然估计和渐近置信区间。蒙特卡罗数值算例表明,简化后的B-S分布在逐步增加I型混合截尾试验方案中,EM算法经过较少迭代即达到收敛。同时,通过对数据情形I和情形Ⅱ下的估计结果分析,给出了较一般截尾试验方式更为丰富的结论,使得相应的统计结果更加全面和精确。