■中的一类特殊整谱图

图G是一个简单,图G的补图记为-G,如果G的谱完全由整数组成,就称G是整谱图,鸡尾酒会图G=CP(n)=K_(2n)-nK_2(K_(2n)是完全图).本文确定了当-μ1=ab 1时,图类■中的所有的整谱图.     

[αCP（a）∪βCP（b）]^-中的一类特殊整谱图

图G是一个简单，图G的补图记为G^-，如果G的谱完全由整数组成，就称G是整谱图，鸡尾酒会图G=CP（n）=K2n-nK2（K2n是完全图）.本文确定了当μ1^-=ab＋1时，图类[αCP（a）∪βCP（b）]^-中的所有整谱图.     

Polling systems in heavy traffic: Higher moments of the delay

We study an asymmetric cyclic polling model with general mixtures of exhaustive and gated service, and with zero switch-over times, in heavy traffic. We derive closed-form expressions for all moments of the steady-state delay at each of the queues, under standard heavy-traffic scalings. The expressions obtained provide new and useful insights into the behavior of polling systems under heavy-load conditions. This revised version was published online in June 2006 with corrections to the Cover Date.     

图类αK_a∪βCP(b)中的一类特殊整谱图

图G是一个简单图,图G的补图记为G,如果G的谱完全由整数组成,就称G是整谱图.鸡尾酒会图CP(n)=K_(2n)-nK2(K_(2n是完全图)和完全图K_a都是整谱图.μ_1表示图类αK_a∪βCP(b)的一个主特征值,确定了当μ_1=2a并且a-1>2b-2时,图类αK_a∪βCP(b)中的所有的整谱图.     

Polling Systems with Switch-over Times under Heavy Load: Moments of the Delay

Consider an asymmetric cyclic polling system with general service-time and switch-over time distributions, and with general mixtures of exhaustive and gated service, in heavy traffic. We obtain explicit expressions for all moments of the steady-state delay at each of the queues, under heavy-traffic scalings. The expressions are strikingly simple: they depend on only a few system parameters, and moreover, can be expressed as finite products of simple known terms. The exact results provide new and useful insights into the behavior of polling systems in heavy traffic. In addition, the results suggest simple and fast approximations for the moments of the delay in stable polling systems. Numerical experiments demonstrate the usefulness of the approximations for moderately and heavily loaded systems.     

Theta-3 is connected

In this paper, we show that the θ-graph with three cones is connected. We also provide an alternative proof of the connectivity of the Yao graph with three cones.     

基于Gronwall积分不等式的比例时滞神经网络稳定性分析

在时滞神经网络的研究中,人们通常是利用构造李亚普诺夫函数来分析系统的稳定性.该文研究了一类具有放缩时滞的神经网络,利用Gronwall积分不等式研究了该放缩时滞神经网络的稳定性问题,得出该系统全局指数稳定性的新判据,并通过实例仿真验证了结果的有效性和可行性.     

图类αK_(α,α)UβCP(b)中的一类特殊整谱图

图G是一个简单,图G的补图记为G,如果G的谱完全由整数组成,就称G是整谱图,鸡尾酒会图CP (n)=K_(2n)-nK_2(K_(2n)是完全图)和完全二部图K_(a,a)都是整谱图.u_1表示图类αK_(α,α)UβCP(b)的一个主特征值,本文确图了当u_1=2b 1时,图类αK_(α,α)UβCP(b)中的所有的整谱图.     

Connectivity threshold and recovery time in rank-based models for complex networks

We study a generalized version of the protean graph (a probabilistic model of the World Wide Web) with a power law degree distribution, in which the degree of a vertex depends on its age as well as its rank. The main aim of this paper is to study the behaviour of the protean process near the connectivity threshold. Since even above the connectivity threshold it is still possible that the graph becomes disconnected, it is important to investigate the recovery time for connectivity, that is, how long we have to wait to regain the connectivity.     

图类■中的整谱图

设图G是一个简单图,图G的补图记为-G,如果G的谱都是整数,就称G是整谱图.鸡尾酒会图CP(n)=K2n-nK2(K2n是2n阶完全图)和完全图Ka都是整谱图[1].本文确定了图类■中的所有整谱图.     

图类^-αKα∪βCP（b）中的整谱图

设图G是一个简单图,图G的补图记为^-G,如果G的谱都是整数,就称G是整谱图．鸡尾酒会图CP（n）=K2n-nK2（K2n是2n阶完全图）和完全图Kα都是整谱图．本文确定了图类^-αKα∪βCP（b）中的所有整谱图．     

一类含时变分布时滞的退化中立型系统的鲁棒稳定性(英文)

考虑含分布时滞的退化中立型系统的鲁棒稳定性.利用算子Ω的稳定性和线性矩阵不等式得到一个新的鲁棒稳定性判据,本判据将中立型时滞、时变离散时滞、时变分布时滞和退化中立型系统一起考虑,相比已有文献具有较低的保守性.利用Matlab可以验证本判据的有效性.     

Modelling dynamic network loading ontransportation networks through a continuous

The efforts spent by researchers in the last few years in traffic modelling have been focused on the modelization of dynamic behaviour of the several components making up a transportation system.In the field of traffic assignment, a large number of models and procedures have been proposed in order to perform Dynamic Network Loading (DNL), that is the reproduction of within-day variable link performances once a corresponding Origin/Destination (O/D) demand and users' choice model has been given. These models can be used both to evaluate traffic flows and, what is more relevant, to simulate the effects of regulation strategies on users' behaviour.

In this paper, after a brief review of the state of the art in this field, a continuous dynamic network loading model is proposed; it removes some of the drawbacks of other packet approach models proposed in literature and explicitly allows the en-route modification of the followed path. An algorithmic development of the model and a set of applications on text networks are also proposed.     

New results for global stability of a class of neutral-type neural systems with time delays

This paper studies the global convergence properties of a class of neutral-type neural networks with discrete time delays. This class of neutral systems includes Cohen–Grossberg neural networks, Hopfield neural networks and cellular neural networks. Based on the Lyapunov stability theorems, some delay independent sufficient conditions for the global asymptotic stability of the equilibrium point for this class of neutral-type systems are derived. It is shown that the results presented in this paper for neutral-type delayed neural networks are the generalization of a recently reported stability result. A numerical example is also given to demonstrate the applicability of our proposed stability criteria.