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

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

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

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

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

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

巧解一道"牛吃草"问题

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

大钟与六位密码

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

Drucker-Prager准则可靠度解析

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

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

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

也谈立体几何中的轨迹问题——从一道调考试题说起

2010-2011学年度武汉市部分学校新高三起点调研测试的一道试题引起了我的注意.原题如下: 在正四面体P-ABC中,M为△ABC内(含边界)一动点,且点M到三个侧面PAB,PBC,PCA的距离成等差数列,则点M的轨迹是 A.一条线段 B.椭圆的一部分 C.双曲线的一部分 D.抛物线的一部分     

股票收益率和新息的尾部估计

利用极值理论来考虑上证综指收益率的尾部.为了选择合理的超越门限,采用平均剩余函数和De-Haan矩估计相结合的方法.在学生t分布和广义误差分布的新患假设下,用GARCH和EGARCH新息的ARMA模型拟合指数收益率,并且使用极值理论的极大似然方法估计模型残差的尾指,估计结果表明收益率的尾指和模型的残差尾指基本一致.     

神奇的骰子

骰子在许多游戏中出现,特别是赌博游戏,当中蕴含了丰富的数学知识,引起了许多数学爱好者们的关注和研究.一个普通的骰子是正六面体,它的六个面分别为数字1,2,3,4,5,6,还有许多不同的骰子、不同的玩法,充满了神奇,但神奇的骰子背后离不开数学知识的支撑.本文将介绍三     

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

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

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

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

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.     

Denseness of volatile and nonvolatile sequences of functions

In a recent paper by Jonasson and Steif, definitions to describe the volatility of sequences of Boolean functions, $f_n:{\{?1,1\}}^n\to \{?1,1\}$ were introduced. We continue their study of how these definitions relate to noise stability and noise sensitivity. Our main results are that the set of volatile sequences of Boolean functions is a natural way “dense” in the set of all sequences of Boolean functions, and that the set of non-volatile Boolean sequences is not “dense” in the set of noise stable sequences of Boolean functions.     

Milnor方图中的w-凝聚性

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

On trees with real-rooted independence polynomial

The independence polynomial of a graph $G$ is

$I(G,x)=\sum _{k\ge 0}{i}_k\left(G\right)x^k,$

where $i_k\left(G\right)$ denotes the number of independent sets of $G$ of size $k$ (note that $i_0\left(G\right)=1$). In this paper we show a new method to prove real-rootedness of the independence polynomials of certain families of trees.In particular we will give a new proof of the real-rootedness of the independence polynomials of centipedes (Zhu’s theorem), caterpillars (Wang and Zhu’s theorem), and we will prove a conjecture of Galvin and Hilyard about the real-rootedness of the independence polynomial of the so-called Fibonacci trees.     

A scaling analysis of a star network with logarithmic weights

The paper investigates the properties of a class of resource allocation algorithms for communication networks: if a node of this network has $L$ requests to transmit and is idle, it tries to access the channel at a rate proportional to $log(1+L)$. A stochastic model of such an algorithm is investigated in the case of the star network, in which $J$ nodes can transmit simultaneously, but interfere with a central node 0 in such a way that node 0 cannot transmit while one of the other nodes does. One studies the impact of the log policy on these $J+1$ interacting communication nodes. A fluid scaling analysis of the network is derived with the scaling parameter $N$ being the norm of the initial state. It is shown that the asymptotic fluid behavior of the system is a consequence of the evolution of the state of the network on a specific time scale $(N^t,t\in (0,1))$. The main result is that, on this time scale and under appropriate conditions, the state of a node with index $j\ge 1$ is of the order of $N^{a_j\left(t\right)}$, with $0\le a_j\left(t\right)<1$, where $t?a_j\left(t\right)$ is a piecewise linear function. Convergence results on the fluid time scale and a stability property are derived as a consequence of this study.     

Low minor faces in 3-polytopes

It is trivial that every 3-polytope has a face of degree at most 5, called minor. The height $h\left(f\right)$ of a face $f$ is the maximum degree of the vertices incident with $f$. It follows from the partial double $n$-pyramids that $h\left(f\right)$ can be arbitrarily large for each $f$ if a 3-polytope is allowed to have faces of types $(4,4,\infty )$ or $(3,3,3,\infty )$.In 1996, M. Horňák and S. Jendrol’ proved that every 3-polytope without faces of types $(4,4,\infty )$ and$(3,3,3,\infty )$ has a minor face of height at most 39 and constructed such a 3-polytope satisfying $h\left(f\right)\ge 30$ for all minor faces $f$.The purpose of this paper is to prove that every 3-polytope without faces of types $(4,4,\infty )$ and$(3,3,3,\infty )$ has a minor face of height at most 30, which bound is tight due to the Horňák–Jendrol’ construction.     

A sufficient condition for DP-4-colorability

DP-coloring of a simple graph is a generalization of list coloring, and also a generalization of signed coloring of signed graphs. It is known that for each $k\in \{3,4,5,6\}$, every planar graph without $C_k$ is 4-choosable. Furthermore, Jin et al. (2016) showed that for each $k\in \{3,4,5,6\}$, every signed planar graph without $C_k$ is signed 4-choosable. In this paper, we show that for each $k\in \{3,4,5,6\}$, every planar graph without $C_k$ is 4-DP-colorable, which is an extension of the above results.     

Automorphism groups of Cayley graphs generated by block transpositions and regular Cayley maps

This paper deals with the Cayley graph $\mathrm{Cay}({\mathrm{Sym}}_n,T_n)$, where the generating set consists of all block transpositions. A motivation for the study of these particular Cayley graphs comes from current research in Bioinformatics. As the main result, we prove that $\text{Aut}\left(\mathrm{Cay}({\mathrm{Sym}}_n,T_n)\right)$ is the product of the left translation group and a dihedral group ${\mathsf{D}}_{n+1}$ of order $2(n+1)$. The proof uses several properties of the subgraph $\Gamma$ of $\mathrm{Cay}({\mathrm{Sym}}_n,T_n)$ induced by the set $T_n$. In particular, $\Gamma$ is a $2(n?2)$-regular graph whose automorphism group is ${\mathsf{D}}_{n+1},$ $\Gamma$ has as many as $n+1$ maximal cliques of size $2$, and its subgraph $\Gamma \left(V\right)$ whose vertices are those in these cliques is a 3-regular, Hamiltonian, and vertex-transitive graph. A relation of the unique cyclic subgroup of ${\mathsf{D}}_{n+1}$ of order $n+1$ with regular Cayley maps on ${\text{Sym}}_n$ is also discussed. It is shown that the product of the left translation group and the latter group can be obtained as the automorphism group of a non-$t$-balanced regular Cayley map on ${\text{Sym}}_n$.