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

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

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

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

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

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

差分系统平衡点的判别

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

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

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

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

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

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

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

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

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

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

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

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

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

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

在解析几何中有二次曲线与直线位置关系的讨论、二次曲面与直线位置关系的讨论,而二次曲面与平面相关位置关系的探讨较少.本文给出二次曲面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)相离.     

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.     

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.     

New parameters of subsets in polynomial association schemes

We define new parameters, a zero interval and a dual zero interval, of subsets in P- or Q-polynomial association schemes. A zero interval of a subset in a P-polynomial association scheme is a successive interval index for which the inner distribution vanishes, and a dual zero interval of a subset in a Q-polynomial association scheme is a successive interval index for which the dual inner distribution vanishes. We derive bounds of the lengths of a zero interval and a dual zero interval using the degree and dual degree respectively, and show that a subset in a P-polynomial association scheme (resp. a Q-polynomial association scheme) having a large length of a zero interval (resp. a dual zero interval) induces a completely regular code (resp. a Q-polynomial association scheme). Moreover, we consider the spherical analogue of a dual zero interval.     

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.     

Side-payment contracts in two-person nonzero-sum supply chain games: Review,discussion and applications

This paper investigates supply chain coordination with side-payment contracts. We first summarize specific side-payment contracts and present our review on the literature that developed general side-payment schemes to coordinate supply chains. Following our review, we discuss two criteria that a proper side-payment contract must satisfy, and accordingly introduce a decision-dependent transfer payment function and a constant transfer term. We present the condition that the transfer function must satisfy, and use Nash arbitration scheme and Shapley value to compute the constant transfer term and derive its closed-form solution. Next, we provide a five-step procedure for the development of side-payment contract, and apply it to four supply chain games: Cournot and Bertrand games, a two-retailer supply chain game with substitutable products and a one-supplier, one-retailer supply chain. More specifically, for the Cournot game, we construct a linear transfer function and a constant side-payment to coordinate two producers. For the Bertrand game, we build a nonlinear transfer function which is equivalent to a revenue-sharing contract, and show that the constant term is zero and two firms in the game equally share the system-wide profit. For a supply chain with substitutable products, we present a side-payment contract to coordinate two retailers. For a two-echelon supply chain, we develop a proper side-payment scheme that can coordinate the supply chain and also help reduce the impact of forward buying on supply chain performance.     

On arithmetic Macaulayfication of Noetherian rings

The Rees algebra is the homogeneous coordinate ring of a blowing-up. The present paper gives a necessary and sufficient condition for a Noetherian local ring to have a Cohen-Macaulay Rees algebra: A Noetherian local ring has a Cohen-Macaulay Rees algebra if and only if it is unmixed and all the formal fibers of it are Cohen-Macaulay. As a consequence of it, we characterize a homomorphic image of a Cohen-Macaulay local ring. For non-local rings, this paper gives only a sufficient condition. By using it, however, we obtain the affirmative answer to Sharp's conjecture. That is, a Noetherian ring having a dualizing complex is a homomorphic image of a finite-dimensional Gorenstein ring.

     

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

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

A conjecture on bipartite graphical regular representations

In this paper we are concerned with the classification of the finite groups admitting a bipartite DRR and a bipartite GRR.First, we find a natural obstruction that prevents a finite group from admitting a bipartite GRR. Then we give a complete classification of the finite groups satisfying this natural obstruction and hence not admitting a bipartite GRR. Based on these results and on some extensive computer computations, we state a conjecture aiming to give a complete classification of the finite groups admitting a bipartite GRR.Next, we prove the existence of bipartite DRRs for most of the finite groups not admitting a bipartite GRR found in this paper. Actually, we prove a much stronger result: we give an asymptotic enumeration of the bipartite DRRs over these groups. Again, based on these results and on some extensive computer computations, we state a conjecture aiming to give a complete classification of the finite groups admitting a bipartite DRR.