具有不同耦合强度且带有时滞的振子网络上的同步

本文研究了具有不同耦合强度且带有时滞的振子网络上的同步问题．我们给出了该网络同步状态的稳定性准则，证实了其同步状态的稳定性与网络的拓扑性无关．最后，通过数值模拟验证了我们的理论结果．     

一类具有阶段结构和时滞的捕食系统的持续生存和稳定性

我们提出和研究一类带有阶段结构和时滞的捕食模型,得到了种群持续生存的充分条件.研究了阶段结构和时滞对系统稳定性的影响,获得了系统发生Hopf分支和稳定性的条件以及轨道渐进稳定的周期解的存在性.     

具连续分布滞量的非线性中立型抛物偏泛函微分方程的振动性

考虑一类具连续分布滞量的非线性中立型抛物偏泛函微分方程解的振动性,借助Green定理和时滞微分不等式获得了这类方程在Robin,Dirichlet边值条件下所有解振动的若干充分条件.     

拟等级网格下非线性延迟微分方程间断有限元法

本文利用间断有限元法求解非线性延迟微分方程,在拟等级网格下.给出非线性延迟微分方程间断有限元解的整体收敛阶和局部超收敛阶,数值实验验证了理论结果的正确性.     

含时间延迟三维节能减排系统的动力学分析

考虑节能减排量,碳排放量和经济增长量之间的关系,以及时间延迟现象,建立含时间延迟的三维节能减排系统的微分方程模型,分析平衡点及其稳定性态,得到出现Hopf分支的条件.利用中心流形理论和规范性方法给出Hopf分支的性质.数值模拟验证了理论结果的有效性.     

带有非线性收获和妊娠时滞的微分代数捕食者-食饵系统的稳定性及Hopf分支

本文研究了一类同时带有非线性食饵收获和捕食者妊娠时滞的微分代数捕食者-食饵系统的稳定性及Hopf分支问题.利用了分支理论和稳定性理论,以捕食者妊娠时滞作为系统的分支参数,获得了所提出的新系统在正平衡点处系统稳定性的相关判据条件和Hopf分支的产生条件.推广了一般带有线性收获和时滞的微分代数捕食者-食饵系统的结论.     

ON ALMOST AUTOMORPHIC SOLUTIONS OF THIRD-ORDER NEUTRAL DELAY-DIFFERENTIAL EQUATIONS WITH PIECEWISE CONSTANT ARGUMENT

We present some conditions for the existence and uniqueness of almost automorphic solutions of third order neutral delay-differential equations with piecewise constant of the form(x(t) + px(t-1))′′′= a0x([t]) + a_1x([t-1]) + f(t),where [·] is the greatest integer function,p,a0 and a1are nonzero constants,and f(t) is almost automorphic.     

Approximate Controllability of Neutral Functional Differential Systems with State-Dependent Delay

This paper deals with the approximate controllability of semilinear neutral functional differential systems with state-dependent delay. The fractional power theory and α-norm are used to discuss the problem so that the obtained results can apply to the systems involving derivatives of spatial variables. By methods of functional analysis and semigroup theory, sufficient conditions of approximate controllability are formulated and proved. Finally, an example is provided to illustrate the applications of the obtained results.     

Resource allocation in rooted trees for VLSI applications

ABSTRACT

Several optimization problems of modifying the weight of vertices in rooted trees, some of which are special cases of the inverse 1-median problem, are solved. Such problems arise in Very Large Scale Integration (VLSI) design of hardware security circuits, circuit synchronization, and analog-to-digital converters. These problems require assigning costly hardware (demands) to the leaves of rooted trees. One common property of these problems is that a resource allocated to an internal node can be shared by the entire sub-tree emanated at the node. Two types of problems are studied here. (1) A tree node employs an addition operation and the demands at the leaves are obtained by summing the resources allocated to nodes along the root-to-leaf paths. A linear-time bottom-up algorithm is shown to minimize the total resources allocated to tree nodes. (2) A tree’s node employs a multiplication operation and the demands at the leaves are obtained by multiplying the resources allocated to nodes along the root-to-leaf paths. A bottom-up dynamic programming algorithm is shown to minimize the total resources allocated to the tree’s nodes. While the above problems are usually solved by design engineers heuristically, this paper offers optimal solutions that can be easily programmed in CAD tools.     

以能耗最低为目标的列车调控方案研究

研究的是以能耗最低为目标的单、多列车优化调控方案问题.首先根据列车运行的各个阶段的分析,构建以运行能耗最低为目标的非线性规划模型,采用逐步迭代算法进行求解,得到的最佳运行模式为无惰行运行,相应的最小能耗为12.47kwh.对于无高峰期的多列车节能运行控制问题,建立了以回收能量最多为目标的0-1非线性规划模型,得到发车间隔为578.86s、575.59s和760.89s,并以此规律循环33轮的发车间隔时间表,使得能量回收最大为250.57kwh,回收率为19.66%.对于存在早晚高峰的情形,建立了以回收能量最多为目标的5阶段0.1非线性规划模型,求出了全天的最优发车方案.