具有混合隔离策略的非线性计算机病毒传播模型的Hopf分岔研究

建立了考虑潜伏期时滞和临时免疫期时滞的具有混合隔离策略的非线性计算机病毒传播模型,旨在帮助理解计算机病毒在网络中的传播规律。通过计算模型基本再生数,以不同时滞组合为分岔参数,研究了模型的局部渐近稳定性;利用中心流形定理和规范型理论分析了Hopf分岔的方向和周期解的稳定性,并通过数值模拟验证了理论分析的正确性。研究结果可为计算机病毒治理提供理论依据。     

饮用水库上游农村污水生态净化与农业利用方案设计

针对地处城市饮用水源上游的山区农村,提出生态净化与农业利用相结合的水污染控制方案,即将村庄生活污水经新建干管收集后,顺势自流输入到三级生态塘进行生态净化,用潜污泵将清液提升到山上进行竹林灌溉.探讨农村污水收集方式和净化工艺的适用性,并进行竹林喷灌负荷核算和投资效益分析.阐述该方案在削减污染提高水库水质、改善农村生活环境和促进农业增产增收等方面的综合作用.     

部分信息下一类一主多从激励策略

本文研究在部分信息下,一主多从且从者之间非合作的激励问题,给出了寻找主者的激励策略的一般方法;并对线性二次情形提出了仿射型激励策略所应满足的充分条件.     

具有稳定自治动态的一般非线性系统的镇定问题

针对一般非线性系统,在它的自治动态是稳定的条件下,应用Lyapunov方法获得它可全局渐近稳定的充分条件,同时在系统函数是解析的情况下,基于输出反馈控制律,构造出了类Luenberger观测器,使得闭环系统的平衡点全局渐近稳定.     

不确定的时间范围下含期权的最优投资决策

不同于以往研究的含期权的最优投资消费决策,研究了不确定的时间范围下含期权的最优投资决策,运用动态规划原理和随机分析的方法,解决对应的最优控制问题,最优策略可通过对应的HJB方程得到,并显式地得到了HARA效用下的最优投资策略及最优财富过程.     

Traffic resource allocation for complex networks

In this paper, an optimal resource allocation strategy is proposed to enhance traffic dynamics in complex networks. The network resources are the total node packet-delivering capacity and the total link bandwidth. An analytical method is developed to estimate the overall network capacity by using the concept of efficient betweenness (ratio of algorithmic betweenness and local processing capacity). Three network structures (scale-free, small-world, and random networks) and two typical routing protocols (shortest path protocol and efficient routing protocol) are adopted to demonstrate the performance of the proposed strategy. Our results show that the network capacity is reversely proportional to the average path length for a particular routing protocol and the shortest path protocol can achieve the largest network capacity when the proposed resource allocation strategy is adopted.     

正则型控制系统的全局反馈镇定

在对非线性控制系统全局镇定的研究中 ,Byrness,Isidori讨论了光滑非线性系统的光滑反馈与全局正则型的等价条件 ;Kokotovic,Sussmann则在讨论了全局镇定的正实条件后 ,得到了一个判定系统为全局光滑可镇定的重要条件 .本文则考察一类正则型控制系统 ,通过变换系统和构造全局反馈镇定律的方法 ,得到全局光滑镇定     

仿射内点既约投影Hessian算法解非线性约束优化

本文结合非单调内点回代技术,提供了新的仿射信赖域方法解含有非负变量约束和非线性等式约束的优化问题.为求解大规模问题,采用等式约束的Jacobian矩阵的QR分解和两块校正的双边既约Hessian矩阵投影,将问题分解成零空间和值空间两个信赖域子问题.零空间的子问题为通常二次目标函数只带椭球约束的信赖域子问题,而值空间的子问题使用满足信赖域约束参数的值空间投影向量方向.通过引入Fletcher罚函数作为势函数,将由两个子问题结合信赖域策略构成的合成方向,并使用非单调线搜索技术回代于可接受的非负约束内点步长.在合理的条件下,算法具有整体收敛性且两块校正的双边既约Hessian投影法将保持超线性收敛速率.非单调技术将克服高度非线性情况,加快收敛进展.     

LMI-Based Robust <Emphasis Type="Italic">H</Emphasis><Subscript>∞</Subscript> Control of Uncertain Neutral Systems with State and Input Delays

Robust stabilization and robust H_∞ control problems for a class of uncertain neutral system with state and input delays are considered. By choosing a Lyapunov-Krasovskii functional, an alternative delay-dependent sufficient condition for the existence of a controller is derived in terms of linear matrix inequalities. Furthermore, a convex optimization problem can be formulated to obtain an H_∞ controller which minimizes an upper H_∞ norm bound of the closed-loop state-input delayed system.     

Elusive properties of infinite graphs

A graph property is said to be elusive (or evasive) if every algorithm testing this property by asking questions of the form “is there an edge between vertices $x$ and $y$?” requires, in the worst case, to ask about all pairs of vertices. The unsettled Aanderaa–Karp–Rosenberg conjecture is that every nontrivial monotone graph property is elusive for any finite vertex set. We show that the situation is completely different for infinite vertex sets: the monotone graph properties “every vertex has degree at least $n$” and “every connected component has size at least $m$,” where $n\ge 1$ and $m\ge 2$ are natural numbers, are not elusive for infinite vertex sets, but the monotone graph property “the graph contains a cycle” is elusive for arbitrary vertex set. On the other hand, we also prove that every algorithm testing some natural monotone graph properties, for example, “every vertex has degree at least $n$” or “connected” on the vertex set $\omega$ should check “lots of edges,” more precisely, all the edges of an infinite complete subgraph.