向量对策理想-Nash平衡点的存在性

本文采用向量优化问题中理想解的概念,定义向量对策理想-Nash平衡点,并证明这一平衡点的存在性．这一结果一方面体现了向量对策Pareto-Nash平衡点和弱Pareto-Nash平衡点的存在性,同时,还给出了特殊的Pareto-Nash平衡点的存在性．     

一类具有时滞的流行病模型分析

讨论了一类带有时滞的SE IS流行病模型,并讨论了阈值、平衡点和稳定性.模型是一个具有确定潜伏期的时滞微分方程模型,在这里我们得到了各类平衡点存在条件的阈值R0;当R0<1时,只有无病平衡点P0,且是全局渐近稳定的;当R0>1时,除无病平衡点外还存在唯一的地方病平衡点Pe,且该平衡点是绝对稳定的.     

差分系统平衡点的判别

平衡点在研究差分系统的零解的稳定性时具有极其重要的作用.本文首先给出了线性差分系统平衡点存在的充要条件,然后给出非线性差分系统平衡点存在的充分条件,最后给出了高阶差分系统平衡点存在的充分条件.     

R(O)SSLER系统平衡点集的镇定

研究了R\"ossler系统的镇定问题. 当参数变化时, R\"ossler系统具有两条平衡点曲线, 因此是一个多平衡点系统. 在这些平衡点中, 有的是不稳定, 有的平衡点上会出现Hopf分岐.提出了一种多项式反馈控制律, 保证R\"ossler系统的两平衡点曲线上的平衡点都渐近稳定. 现有的方法只能保证某个参数点附近平衡点渐近稳定.     

具有时滞和阶段结构的生态-流行病模型的稳定性及其Hopf分支

本文研究一个食饵具有阶段结构和捕食者染病的捕食者-食饵模型的稳定性,并讨论了由疾病的潜伏期引起的时滞对种群动力学性态的影响.通过分析特征方程,运用Hurwitz判定定理,讨论了该模型的平凡平衡点、捕食者灭绝平衡点、无病平衡点及地方病平衡点的局部稳定性,并得到了地方病平衡点附近Hopf分支存在的充分条件;通过构造适当的Lyapunov泛函,运用La Sall不变集原理,得到了这些平衡点全局稳定的充分条件.     

一类具有离散双时滞的SEIR传染病模型的稳定性与持久性

针对一类潜伏期和恢复期描述为离散双时滞的SEIR传染病模型,给出无病平衡点和地方病平衡点存在条件,证明了无病平衡点和地方病平衡点的稳定性,以及疾病的持久性.应用数值模拟验证了疾病的持久性与灭绝性,分析了接触率对疾病流行趋势的影响.     

集值映射的Nash平衡点集的通有稳定性

本文讨论了集值映射的Nash平衡点的存在及平衡点集的通有稳定性,得到大多数的集值映射的Nash平衡点集是稳定的。     

具有年龄结构的离散HIV/AIDS模型的全局分析

本文根据艾滋病传播的特点建立了有年龄结构的高维离散SIA模型,和有干预的具有年龄结构的离散HIV模型.对每种模型,我们首先给出了建模思想,用差分方程建立了数学模型,然后对模型平衡点的稳定性进行了理论分析,得出一定条件下模型无病平衡点和地方病平衡点的稳定性.另外,本文还给出了模型的基本再生数,其意义为一个病人在染病期内平均感染的人数,基本再生数决定了模型无病平衡点和地方病平衡点的存在性和稳定性.     

一类带有潜伏期和部分免疫的传染病模型的全局分析

通过假设被接种者具有部分免疫,建立了一类具有潜伏期和接种的SEIR传染病模型,借助再生矩阵得到了确定此接种模型动力学行为的基本再生数.当基本再生数小于1时,模型只有无病平衡点;当基本再生数大于1时,除无病平衡点外,模型还有唯一的地方病平衡点.借助Liapunov函数,证明了无病平衡点和地方病平衡点的全局稳定性.     

一类具免疫控制的SIR传染病模型的稳定性

利用微分方程理论研究了一类具有常数输入和免疫控制的数学模型,讨论了模型无病平衡点和地方病平衡点的存在性以及局部稳定性.构造Dulac函数的方法,得到了无病平衡点和地方病平衡点的全局稳定性充分条件,同时利用Matlab软件进行了数值模拟.     

二次曲面和平面位置关系的判式

在解析几何中有二次曲线与直线位置关系的讨论、二次曲面与直线位置关系的讨论,而二次曲面与平面相关位置关系的探讨较少.本文给出二次曲面a11x2+a22y2+a33z2+2a12xy+2a13xz+2a23yz+2a14x+2a24y+2a34z+a44=0(1)和平面Ax+By+Cz+D=0(2)的相对位置的判别式Δ=a11a12a13a14Aa21a22a23a24Ba31a32a33a34Ca41a42a43a44DA B C D0(aij=aji).(3)并证明了:若Δ>0,则二次曲面(1)与平面(2)相交;若Δ=0,则(1)和(2)相切;若Δ<0,则(1)和(2)相离.     

Partnership formation based on multiple traits

A model of partnership formation based on two traits, called beauty and character, is presented. There are two classes of individual and partners must be of different classes. Individuals prefer prospective partners with a high beauty measure and of a similar character. This problem may be interpreted as e.g. a job search problem in which the classes are employer and employee, or a mate choice problem in which the classes are male and female. Beauty can be observed instantly. However, a costly date (or interview) is required to observe the character of a prospective partner. On observing the beauty of a prospective partner, an individual decides whether he/she wishes to date. During a date, the participants observe each other’s character and then decide whether to form a pair. Mutual acceptance is required both for a date to occur and pair formation. On finding a partner, an individual stops searching. Beauty has a continuous distribution on a finite interval, while character ‘forms a circle’ and has a uniform distribution. Criteria based on the concept of a subgame perfect Nash equilibrium are used to define a symmetric equilibrium of this game. It is argued that this equilibrium is unique. When dating costs are high, this equilibrium is a block separating equilibrium as in more classical formulations of two-sided job search problems. However, for sufficiently small dating costs the form of this equilibrium is essentially different.     

Solution to the variation problem for information path functional of a controlled random process

The paper introduces a new approach to dynamic modeling, using the variation principle, applied to a functional on trajectories of a controlled random process, and its connection to the process' information functional. In [V.S. Lerner, Dynamic approximation of a random information functional, J. Math. Anal. Appl. 327 (1) (2007) 494-514, available online 5-24-06], we presented the information path functional with the Lagrangian, determined by the parameters of a controlled stochastic equation. In this paper, the solution to the path functional's variation problem provides both a dynamic model of a random process and the model's optimal control, which allows us to build a two-level information model with a random process at the microlevel and a dynamic process at the macrolevel. A wide class of random objects, modeled by the Markov diffusion process and a common structure of the process' information functional, leads to a universal information structure of the dynamic model, which is specified and identified on a particular object with the applied optimal control functions. The developed mathematical formalism, based on classical methods, is aimed toward the solution of problems identification, combined with an optimal control synthesis, which is practically implemented and also demonstrated in the paper's example.     

On a Mathematical Comparison between Hierarchy and Network with a Classification of Coordination Structures

This paper proposes a mathematical model to compare a network organization with a hierarchical organization. In order to formulate the model, we define a three-dimensional framework of the coordination structure of a network and of other typical coordination structures. In the framework, we can define a network structure by contrasting it with a hierarchy, in terms of the distribution of decision making, which is one of the main features of information processing. Based on this definition, we have developed a mathematical model for evaluating coordination structures. Using this model, we can derive two boundary conditions among the coordination structures with respect to the optimal coordination structure. The boundary conditions help us to understand why an organization changes its coordination structure from a hierarchy to a network and what factors cause this change. They enable us, for example, to find points of structural change where the optimal coordination structure shifts from a hierarchy to a hierarchy with delegation or from a hierarchy with delegation to a network, when the nature of the task changes from routine to non-routine. In conclusion, our framework and model may provide a basis for discussing the processes that occur when coordination structures change between a hierarchy and a network.     

覆盖数不超过3的图上渡河问题

1000多年前,英国著名学者Alcuin曾提出一个古老的渡河问题,即狼、羊和卷心菜的渡河问题。2006年,Prisner把该问题推广到任意的冲突图上,考虑了一类情况更一般的渡河运输问题。所谓冲突图是指一个图G=(V,E),这里V代表某些物品的集合,V中的两个点有边连结当且仅当这两个点是冲突的,即在无人监管的情况下不允许留在一起的点。图G=(V,E)的一个可行运输方案是指在保证不发生任何冲突的前提下,把V的点所代表的物品全部摆渡到河对岸的一个运输方案。图G的Alcuin数定义为它存在可行运输方案时所需船的最小容量。本文讨论了覆盖数不超过3的连通图的Alcuin数,给出了该类图Alcuin数的完全刻画。     

Complex affine distributions

Geometry of affine immersions is the study of hypersurfaces that are invariant under affine transformations. As with the hypersurface theory on the Euclidean space, an affine immersion can induce a torsion-free affine connection and a (pseudo)-Riemannian metric on the hypersurface. Moreover, an affine immersion can induce a statistical manifold, which plays a central role in information geometry. Recently, a statistical manifold with a complex structure is actively studied since it connects information geometry and Kähler geometry. However, a holomorphic complex affine immersion cannot induce such a statistical manifold with a Kähler structure. In this paper, we introduce complex affine distributions, which are non-integrable generalizations of complex affine immersions. We then present the fundamental theorem for a complex affine distribution, and show that a complex affine distribution can induce a statistical manifold with a Kähler structure.     

Characterizations of g-frames and g-Riesz bases in Hilbert spaces

In this paper, we introduce the pre-frame operator Q for the g-frame in a complex Hilbert space, which will play a key role in studying g-frames and g-Riesz bases etc. Using the pre-frame operator Q, we give some necessary and sufficient conditions for a g-Bessel sequence, a g-frame, and a g-Riesz basis in a complex Hilbert space, which have properties similar to those of the Bessel sequence, frame, and Riesz basis respectively. We also obtain the relation between a g-frame and a g-Riesz basis, and the relation of bounds between a g-frame and a g-Riesz basis. Lastly, we consider the stability of a g-frame or a g-Riesz basis for a Hilbert space under perturbation.     

Almost Alternating Diagrams and Fibered Links in S3

Let R be a Seifert surface obtained by applying Seifert's algorithmto a connected diagram D for a link L. In this paper, lettingD be almost alternating, we give a practical algorithm to determinewhether L is a fibered link and R is a fiber surface. We furthershow that L is a fibered link and R is a fiber surface for Lif and only if R is a Hopf plumbing, that is, a successive plumbingof a finite number of Hopf bands. It has been known for sometime that this is true if D is alternating, and we show thatit is not always true if D is 2-almost alternating. In the appendix,we partially answer C. Adams's open question concerning almostalternating diagrams. 2000 Mathematical Subject Classification:57M25.