浙江发展会展旅游的战略构想

通过对浙江会展旅游现状的分析和研究,总结了浙江会展旅游业的现状与优势,指出了面临的问题,进而从政府与会展企业角度提出了发展浙江会展旅游业的对策.     

Evolution of Weighted Networks by Duplication-Divergence Mechanism

The duplication and divergence process is ubiquitous in nature and man-made networks. Motivated by the duplication-divergence mechanism which depicts the growth of protein networks, we propose a weighted network model in which topological evolution is coupled with weight dynamics. Large scale numerical results indicate that our model can naturally generate networks with power-law-like distributions of degree, strength and weight. The degree-strength correlation is illustrated as well. These properties are in agreement well with empirical data observed in real-world systems. Furthermore, by altering the retention probability δ, weighted, structured exponential networks are realized.     

Synchronizing Complex Networks by an Adaptive Adjustment Mechanism

We propose an adaptive adjustment mechanism for synchronizing complex networks, in particular for sociological or/and biological systems. We do not take it for granted that a dynamical system is put on isolated nodes and they are coupled with each other by one （or more） variable（s）, as employed in most previous models. As a replacement, we suppose that each node may have any finite number of possible states, and their evolutions with time are determined by their nearest-neighbouring （or even second-nearest-neighbouring, etc） nodes in an adaptive adjustment mechanism. It is found that synchronization can be achieved for almost all connected networks and that the scale-free property can evidently improve the synchronizing speed.     

高负荷情形开网络的强逼近

本文用强逼近理论,对一般排队网络在高负荷情形下,得到了队长,虚等待时间和顾客在网中逗留时间的强逼近定理.同时还得到了队长嵌入过程的强逼近定理.     

3族新的不含紧优与几乎紧优的有向双环网络无限族

给出了3族新的不含紧优与几乎紧优的有向双环网络.     

有向S—回路和有向S—迹

本文给出了有向生成回路和有向生成迹的几个充分条件。 设G为强连通1—图,无环,n阶。对于G的任两不相邻顶点x,y。①如果 d(x)+d(y)≥2n+1。那么对于G的任两顶点u和v,或有u-v有向S-迹,或有v-u有向S-迹。②如果 d(x)+d(y)≥2n-3。那么G含有向S-回路。     

球上Dirichlet空间的生成核与复合算子

本文的记号沿用〔1〕中的.令B”CC“是单位球,:、。于户,:·匆=习二叭. ‘.1Vf=(f二,,…,了:。),其中介‘=af丽’d。(:)为C“=RZ”上不一测度,且使v(B“)二1 .B”上Diriehlet空间的定义如下〔2〕: D“=={f{l在B,上全纯,f(0)=o,}ljl}’==J,.v了·示。(2)之下成为一个H*lbe·t空间.},.vj.初·相似文献   

k-边覆盖对策及其核心

本文针对从图的k-边覆盖问题引出的合作对策模型，利用线性规划对偶理论得到了其核心非空的一个充分条件和构造核心分配的多项式时间算法，并将这一结果推广到了一般的k-集合覆盖对策模型中．     

三角B-B曲面在非结构网格生成中的应用

基于生成非结构化网格的Delaunay三角形化方法,应用三次三角Bernstein-Bézier曲面来控制网格点的分布情况。对于给定边界,利用三次非均匀B样条进行边界的拟合及重新离散。对初始化形成的Delaunay三角形,应用三次三角Bernstein-Bézier曲面来计算位于其中的点的长度标尺,通过对三角Bernstein-Bézier曲面边界点的定义来控制三角形内长度标尺的分布。对复杂通道网格剖分的实例表明,此方法可以很好地控制内部网格点的分布情况。