Asyptotics for linear difference equations I:basic theory

We present here a unified treatment of asymptotic theory of linear difference equations. This is based on anadapted theory of discrete dichotomy. The obtained results narrow the gap between Poincarés Theorem and (the discrete analoue of) Levinson's Theorem.     

一类三阶非线性控制系统的概周期解

本文研究了一类三阶非线性控制系统（１）的一致概周期解的存在性，得到了简洁的充分条件，并对保证有一致概周期解存在的参数范围及其与系统系数间的关系作出了估计。     

Design of controller for Lur’e systems guaranteeing dichotomy

In this paper, the problem of controller design for Lur’e systems guaranteeing dichotomy is investigated. On the basis of Kalman-Yakubovich-Popov (KYP) lemma and two frequency equalities, a new methodology for the dichotomy analysis of the Lur’e systems is proposed. A linear matrix inequality (LMI) based criterion is derived, which is equivalent to the Leonov’s frequency-domain one, while for the dichotomy analysis and synthesis which is more straightforward than the frequency-domain one. In virtue of this result, a dynamic output feedback controller ensuring the dichotomy property for Lur’e systems is designed. Finally a numerical example is included to demonstrate the validity and the applicability of the proposed approach.     

Dichotomy and trichotomy of difference equations

Dedicated to Professor Gerry Ladas on his sixtieth birthday in acknowledgement of his leading role of difference equations. We extend the notions of dichotomy and trichotomy to nonlinear ordinary difference equations. This is accomplished by using two completely different approaches. In the first approach we use a notion, independent of the nature of our difference equation, called tracking. In the second approach we introduce a discrete analogue of dichotomy and trichotomy in variation.     

Exponential dichotomy and dichotomy radius for difference equations

The aim of this paper is to provide a new approach concerning the characterization of exponential dichotomy of difference equations by means of admissible pair of sequence spaces. We classify the classes of input and output spaces, respectively, and deduce necessary and sufficient conditions for exponential dichotomy applicable for a large variety of systems. By an example we show that the obtained results are the most general in this topic. As an application we deduce a general lower bound for the dichotomy radius of difference equations in terms of input-output operators acting on sequence spaces which are invariant under translations.     

Acyclicity and reduction

We provide, for each non-self dual Borel class Γ, a concrete finite antichain basis for the class of non-potentially Γ Borel relations whose closure has an acyclic symmetrization, considering the quasi-order of injective continuous reducibility. Along similar lines, we provide a sufficient condition for reducing the oriented graph ${\mathbb{G}}_0$ involved in the Kechris–Solecki–Todor?evi? dichotomy. We also prove a similar result giving a minimum set instead of an antichain if we allow rectangular reductions.     

The firefighter problem for cubic graphs

We show that the firefighter problem is NP-complete for cubic graphs. We also show that given a rooted tree of maximum degree three in which every leaf is at the same distance from the root, it is NP-complete to decide whether or not there is a strategy that protects every leaf from the fire, which starts at the root. By contrast, we describe a polynomial time algorithm to decide if it is possible to save a given subset of the vertices of a graph with maximum degree three, provided the fire breaks out at a vertex of degree at most two.     

一种新的应用于弹性分组环的公平算法

为了达到高的带宽利用率,理想的空间重用和带宽分配的公平性.本文提出一种新的应用于弹性分组环网络的带宽分配算法,该算法采用了有限集合中收敛速度最快的二分法,通过对公平速率的逐次逼近来实现带宽的动态分配,适用于分布式网络环境.分析和仿真表明采用基于二分法的带宽分配算法能够给每个节点分配到接近理想的公平带宽,整个环路在实现公平性的同时能够得到最大的空间重用并且收剑迅速.     

一类二阶非线性微分方程边值问题的有效解法

证明了一类非线性常微分方程初值问题的解关于初始斜率的单调性,并在此基础上有效运用二分法对于此类非线性常微分方程值问题进行求解.