离散的SI和SIS传染病模型的研究

为了描述个体的死亡、染病者的恢复以及疾病的传染,引入了相应的概率.基于总种群中个体数量为常数的假设,根据染病者能否恢复分别建立了具有生命动力学的离散SI和SIS传染病模型.所得到的结果显示:它们具有与相应连续模型相同的动力学性态,并确定了各自的阈值.在它们的阈值之下,传染病最终将灭绝;在它们的阈值之上,传染病将会发展成为地方病,染病者的数量将趋向于一确定的正常数.     

高中数学专题研究的一个案例──关于沪闵路─春申路口红绿灯时间设置合理性的研究

一、专题的背景与分析 　　1. 背景 　　闵行区的沪闵路─春申路口是交通特别拥挤的交叉路口之一.家住莘庄地区的同学有一个共同的感受,在他们到校或回家路上必经的沪闵路─春申路口时常遇到塞车现象.……     

报童模型及ARMA预测在航空配餐问题中的应用

航班承载人数的不确定性,造成航空公司在配餐中利润的流失,现存的配餐模式存在较多的浪费.本文利用基于损失厌恶的报童模型和ARMA时间序列分析模型对深圳航空公司某航班的配餐份数进行了建模分析和预测,并通过对两种模型输出的比较,得出了长期预测与短期预测的模型应用理论.将实际的历史数据代人到模型中验证,其结果优于经验模式下的配餐盈利情况.本文所采用的研究方法和研究结果对航空公司的精益发展有建设性的意义.     

巧解一道"牛吃草"问题

"牛吃草"问题又称为消长问题,是17世纪英国伟大的科学家牛顿提出来的.典型牛吃草问题的条件是假设草的生长速度固定不变,不同头数的牛吃光同一片草地所需的天数各不相同,求若干头牛吃这片草地可以吃多少天.由于吃的天数不同,草又是天天在生长的,所以草的存量随吃的天数不断地变化.……     

大钟与六位密码

福尔摩西接到电话的时候正在翻看一本关于城中富翁艾伦王的传奇故事。艾伦王年少时靠贩卖廉价的小闹钟起家,经过几十年的辛勤努力,把自己的事业拓展成了最有名的钟表公司,是本市最有名的富翁。艾伦王年纪已经很大了,身体也不好。他的儿女众多,但是他们和艾伦王的关系并不融洽。大家都猜测他们对艾伦王的财富虎视眈眈。"喂,福尔摩西吗?"约翰焦急的声音从电话那头传过来。"是我。"福尔摩西回应道。     

Drucker-Prager准则可靠度解析

视岩体强度参数为正态分布随机变量,以可靠度理论为基础,推导了Drucker-Prager准则可靠度判别的解析表达式,并通过Monte-Carlo法和一次可靠度方法验证了其正确性.应用所得到的公式分析了岩体强度参数的变异性对屈服准则判别结果的影响.结果表明,强度参数的变异性对Drucker-Prager准则可靠概率的影响程度不尽相同,在变异系数较大的情况下,它们对可靠概率的影响显著,不可忽略.为岩体屈服的可靠度判别提供了一条新思路.     

负数的自述

我是负数,你以前虽然见过我,但我们还不很熟悉.下面就听听我的自述,我们会成为好朋友的.一、我的出现是实际生活的需要.数的扩充都是由于实际的需要而产生的,负数的引入也不例外,它是由于表示具有相反意义的量的需要而产生的.小学学过的自然数和分数只能表示相反意义的量中的一个量,不能满足实际需要,为了更好的记数而引入一种     

一道以群的定义为背景的高考试题赏析

每一年的高考数学试卷中都有一些以高等数学背景立意的好题目,如2006年四川卷理科第16题,是一道以近世代数中群的定义为背景立意的填空题,这样的试题能够有效考查学生的学习能力、思维能力和数学创新意识,这为高校选拔学习潜质好的学生创造了条件.……     

“1”的自述

我是数字1,大家对我似乎很熟悉,其实却不然,为了以后我们能够成为好朋友,也为了同学们能学好数学,下面请听我的自我介绍:一、我是最小的正整数,我的绝对值还是我;我的相反数是-1,-1的绝对值也是我;我的任何次幂都是我1n=1;我的算术根还是我n1=1;一个数与它倒数的积也等于我,怎么样,牛吧?其实这也不算什么,下面还有更牛的呢.     

导数在高考命题中的"五大"热点

导数作为大学的重要内容,进入中学数学教材后,给传统的内容注入了生机与活力,为中学数学命题的研究提供了新视角,新方法.由于导数是研究函数性质的一个很好的工具,它的用途十分广泛,它在解决函数、不等式、解析几何等问题有独到的功能.因此,近几年的高考正逐年加大对导数问题的考查力度,本文通过对07年全国各地高考题的整理和分析寻找命题规律,希望能对今后的教学提供一点复习思路.……     

Strongly Regular Rings and SF-rings

in this paper, new characteristic properties of strongly regular rings are' given.Relations between certain generalizations of duo rings are also considered. The followingconditions are shown to be equivalent: (1) R is a strongly regular ring; (2) R is a left SFring such that every product of two independent closed left ideals of R is zero; (3) R is aright SF-ring such that every product of two independent closed left ideals of R is zero; (4)R is a left SF-ring whose every special left annihilator is a quasi-ideal; (5) R is a right SFring whose every special left annihilator is a quasi-ideal; (6) R is a left SF-ring whose everymaximal left ideal is a quasi-ideal; (7) R is a right SF-ring whose every maximal left ideal isa quasi-ideal; (8) R is a left SF-ring such that the set N(R) of all nilpotent elements of R isa quasi-ideal; (9) R is a right SF-ring such that N(R) is a quasi-ideal.     

Milnor方图中的w-凝聚性

整环R称为ω-凝聚整环,是指R的每个有限型理想是有限表现型的.本文证明了ω-凝聚整环是v-凝聚整环,且若(RDTF,M)是Milnor方图,则在Ⅰ型情形,R是ω-凝聚整环当且仅当D和T都是ω-整环,且T_M是赋值环;对于Ⅱ-型情形,R是ω-凝聚整环当且仅当D是域,[F:D]<∞,M是R的有限型理想,T是ω-凝聚整环,且R_M是凝聚整环.     

两类带有确定潜伏期的SEIS传染病模型的分析

通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异．对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在．对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的．     

基于规模的企业竞争力蜘蛛图法评价研究

科学合理的规模结构不仅是实现规模经济的基本条件,而且是提高经济效益、降低交易成本、获得较高的企业竞争力的重要保证.基于规模理论,从生产规模、资本规模、市场规模以及效益规模四大因素入手,提出了一套基于规模的企业竞争力评价指标体系,运用蜘蛛图法建立了基于规模的企业竞争力评价模型,并结合具体的数据分析说明了企业竞争力的大小强弱.此种方法具有直观形象、定量化、可操作性强的特点.     

Polynomial-time algorithms for regular set-covering and threshold synthesis

A set-covering problem is called regular if a cover always remains a cover when any column in it is replaced by an earlier column. From the input of the problem - the coefficient matrix of the set-covering inequalities - it is possible to check in polynomial time whether the problem is regular or can be made regular by permuting the columns. If it is, then all the minimal covers are generated in polynomial time, and one of them is an optimal solution. The algorithm also yields an explicit bound for the number of minimal covers. These results can be used to check in polynomial time whether a given set-covering problem is equivalent to some knapsack problem without additional variables, or equivalently to recognize positive threshold functions in polynomial time. However, the problem of recognizing when an arbitrary Boolean function is threshold is NP-complete. It is also shown that the list of maximal non-covers is essentially the most compact input possible, even if it is known in advance that the problem is regular.     

Bijections between generalized Catalan families of types A and C

Motivated by the relation ${\mathsf{N}}^m\left(C_n\right)=(mn+1){\mathsf{N}}^m\left(A_{n?1}\right)$, holding for the $m$-generalized Catalan numbers of type $A$ and $C$, the connection between dominant regions of the $m$-Shi arrangement of type $A_{n?1}$ and $C_n$ is investigated. More precisely, it is explicitly shown how $mn+1$ copies of the set of dominant regions of the $m$-Shi arrangement of type $A_{n?1}$, biject onto the set of type $C_n$ such regions. This is achieved by exploiting two different viewpoints of the representative alcove of each region: the Shi tableau and the abacus diagram. In the same line of thought, a bijection between $mn+1$ copies of the set of $m$-Dyck paths of height $n$ and the set of $N?E$ lattice paths inside an $n\times mn$ rectangle is provided.     

The minimum volume of subspace trades

A subspace bitrade of type $T_q(t,k,v)$ is a pair $(T_0,T_1)$ of two disjoint nonempty collections of $k$-dimensional subspaces of a $v$-dimensional space $V$ over the finite field of order $q$ such that every $t$-dimensional subspace of $V$ is covered by the same number of subspaces from $T_0$ and $T_1$. In a previous paper, the minimum cardinality of a subspace $T_q(t,t+1,v)$ bitrade was established. We generalize that result by showing that for admissible $v$, $t$, and $k$, the minimum cardinality of a subspace $T_q(t,k,v)$ bitrade does not depend on $k$. An example of a minimum bitrade is represented using generator matrices in the reduced echelon form. For $t=1$, the uniqueness of a minimum bitrade is proved.     

Regularity of random attractors for fractional stochastic reaction–diffusion equations on Rn

We investigate the regularity of random attractors for the non-autonomous non-local fractional stochastic reaction–diffusion equations in $H^s({\mathbb{R}}^n)$ with $s\in (0,1)$. We prove the existence and uniqueness of the tempered random attractor that is compact in $H^s({\mathbb{R}}^n)$ and attracts all tempered random subsets of $L^2({\mathbb{R}}^n)$ with respect to the norm of $H^s({\mathbb{R}}^n)$. The main difficulty is to show the pullback asymptotic compactness of solutions in $H^s({\mathbb{R}}^n)$ due to the noncompactness of Sobolev embeddings on unbounded domains and the almost sure nondifferentiability of the sample paths of the Wiener process. We establish such compactness by the ideas of uniform tail-estimates and the spectral decomposition of solutions in bounded domains.     

On the roots of Wiener polynomials of graphs

The Wiener polynomial of a connected graph $G$ is defined as $W(G;x)=\sum x^{d(u,v)}$, where $d(u,v)$ denotes the distance between $u$ and $v$, and the sum is taken over all unordered pairs of distinct vertices of $G$. We examine the nature and location of the roots of Wiener polynomials of graphs, and in particular trees. We show that while the maximum modulus among all roots of Wiener polynomials of graphs of order $n$ is $\left(\genfrac{}{}{0ex}{}{n}{2}\right)?1$, the maximum modulus among all roots of Wiener polynomials of trees of order $n$ grows linearly in $n$. We prove that the closure of the collection of real roots of Wiener polynomials of all graphs is precisely $(?\infty ,0]$, while in the case of trees, it contains $(?\infty ,?1]$. Finally, we demonstrate that the imaginary parts and (positive) real parts of roots of Wiener polynomials can be arbitrarily large.     

On the shape of random Pólya structures

Panagiotou and Stufler recently proved an important fact on their way to establish the scaling limits of random Pólya trees: a uniform random Pólya tree of size $n$ consists of a conditioned critical Galton–Watson tree $C_n$ and many small forests, where with probability tending to one, as $n$ tends to infinity, any forest $F_n\left(v\right)$, that is attached to a node $v$ in $C_n$, is maximally of size $\left|F_n\left(v\right)\right|=O(logn)$. Their proof used the framework of a Boltzmann sampler and deviation inequalities.In this paper, first, we employ a unified framework in analytic combinatorics to prove this fact with additional improvements for $\left|F_n\left(v\right)\right|$, namely $\left|F_n\left(v\right)\right|=\Theta (logn)$. Second, we give a combinatorial interpretation of the rational weights of these forests and the defining substitution process in terms of automorphisms associated to a given Pólya tree. Third, we derive the limit probability that for a random node $v$ the attached forest $F_n\left(v\right)$ is of a given size. Moreover, structural properties of those forests like the number of their components are studied. Finally, we extend all results to other Pólya structures.