共查询到20条相似文献,搜索用时 46 毫秒
1.
两类带有确定潜伏期的SEIS传染病模型的分析 总被引:2,自引:0,他引:2
通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异.对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在.对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的. 相似文献
2.
科学合理的规模结构不仅是实现规模经济的基本条件,而且是提高经济效益、降低交易成本、获得较高的企业竞争力的重要保证.基于规模理论,从生产规模、资本规模、市场规模以及效益规模四大因素入手,提出了一套基于规模的企业竞争力评价指标体系,运用蜘蛛图法建立了基于规模的企业竞争力评价模型,并结合具体的数据分析说明了企业竞争力的大小强弱.此种方法具有直观形象、定量化、可操作性强的特点. 相似文献
3.
Zhang Jule 《东北数学》1998,(1)
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. 相似文献
4.
整环R称为ω-凝聚整环,是指R的每个有限型理想是有限表现型的.本文证明了ω-凝聚整环是v-凝聚整环,且若(RDTF,M)是Milnor方图,则在Ⅰ型情形,R是ω-凝聚整环当且仅当D和T都是ω-整环,且T_M是赋值环;对于Ⅱ-型情形,R是ω-凝聚整环当且仅当D是域,[F:D]<∞,M是R的有限型理想,T是ω-凝聚整环,且R_M是凝聚整环. 相似文献
5.
Malin Palö Forsström 《Stochastic Processes and their Applications》2018,128(11):3880-3896
In a recent paper by Jonasson and Steif, definitions to describe the volatility of sequences of Boolean functions, 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. 相似文献
6.
Ferenc Bencs 《Discrete Mathematics》2018,341(12):3321-3330
The independence polynomial of a graph is where denotes the number of independent sets of of size (note that ). 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. 相似文献
7.
The paper investigates the properties of a class of resource allocation algorithms for communication networks: if a node of this network has requests to transmit and is idle, it tries to access the channel at a rate proportional to . A stochastic model of such an algorithm is investigated in the case of the star network, in which 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 interacting communication nodes. A fluid scaling analysis of the network is derived with the scaling parameter 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 . The main result is that, on this time scale and under appropriate conditions, the state of a node with index is of the order of , with , where is a piecewise linear function. Convergence results on the fluid time scale and a stability property are derived as a consequence of this study. 相似文献
8.
9.
Let be a finite simple graph. For , the difference of , where is the neighborhood of and is called the critical difference of . is called a critical set if equals the critical difference and is the intersection of all critical sets. is the union of all critical independent sets. An independent set is an inclusion minimal set with if no proper subset of has positive difference.A graph is called a König–Egerváry graph if the sum of its independence number and matching number equals .In this paper, we prove a conjecture which states that for any graph the number of inclusion minimal independent set with is at least the critical difference of the graph.We also give a new short proof of the inequality .A characterization of unicyclic non-König–Egerváry graphs is also presented and a conjecture which states that for such a graph , the critical difference equals , is proved.We also make an observation about using Edmonds–Gallai Structure Theorem as a concluding remark. 相似文献
10.
It is trivial that every 3-polytope has a face of degree at most 5, called minor. The height of a face is the maximum degree of the vertices incident with . It follows from the partial double -pyramids that can be arbitrarily large for each if a 3-polytope is allowed to have faces of types or .In 1996, M. Horňák and S. Jendrol’ proved that every 3-polytope without faces of types and has a minor face of height at most 39 and constructed such a 3-polytope satisfying for all minor faces .The purpose of this paper is to prove that every 3-polytope without faces of types and has a minor face of height at most 30, which bound is tight due to the Horňák–Jendrol’ construction. 相似文献
11.
Takahiko Hara 《Annals of the Institute of Statistical Mathematics》1988,40(2):395-406
This paper is concerned with two kinds of multiple outlier problems in multivariate regression. One is a multiple location-slippage problem and the other is a multiple scale-inflation problem. A multi-decision rule is proposed. Its optimality is shown for the first problem in a class of left orthogonally invariant distributions and is also shown for the second problem in a class of elliptically contoured distributions. Thus the decision rule is robust against departures from normality. Further the null robustness of the decision statistic which the rule is based on is pointed out in each problem. 相似文献
12.
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 , every planar graph without is 4-choosable. Furthermore, Jin et al. (2016) showed that for each , every signed planar graph without is signed 4-choosable. In this paper, we show that for each , every planar graph without is 4-DP-colorable, which is an extension of the above results. 相似文献
13.
This paper deals with the Cayley graph , 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 is the product of the left translation group and a dihedral group of order . The proof uses several properties of the subgraph of induced by the set . In particular, is a -regular graph whose automorphism group is
has as many as maximal cliques of size , and its subgraph whose vertices are those in these cliques is a 3-regular, Hamiltonian, and vertex-transitive graph. A relation of the unique cyclic subgroup of of order with regular Cayley maps on 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--balanced regular Cayley map on . 相似文献
14.
Let be a purely discontinuous additive functional of a subordinate Brownian motion . We give a sufficient condition on the non-negative function that guarantees that finiteness of implies finiteness of its expectation. This result is then applied to study the relative entropy of and the probability measure induced by a purely discontinuous Girsanov transform of the process . We prove these results under the weak global scaling condition on the Laplace exponent of the underlying subordinator. 相似文献
15.
David Gilat Isaac Meilijson Laura Sacerdote 《Stochastic Processes and their Applications》2018,128(6):1849-1856
For a martingale starting at with final variance , and an interval , let be the normalized length of the interval and let be the normalized distance from the initial point to the lower endpoint of the interval. The expected number of upcrossings of by is at most if and at most otherwise. Both bounds are sharp, attained by Standard Brownian Motion stopped at appropriate stopping times. Both bounds also attain the Doob upper bound on the expected number of upcrossings of for submartingales with the corresponding final distribution. Each of these two bounds is at most , with equality in the first bound for . The upper bound on the length covered by during upcrossings of an interval restricts the possible variability of a martingale in terms of its final variance. This is in the same spirit as the Dubins & Schwarz sharp upper bound on the expected maximum of above , the Dubins & Schwarz sharp upper bound on the expected maximal distance of from , and the Dubins, Gilat & Meilijson sharp upper bound on the expected diameter of . 相似文献
16.
《Expositiones Mathematicae》2023,41(1):1-19
As a consequence of the classification of finite simple groups, the classification of permutation groups of prime degree is complete, apart from the question of when the natural degree of is prime. We present heuristic arguments and computational evidence based on the Bateman–Horn Conjecture to support a conjecture that for each prime there are infinitely many primes of this form, even if one restricts to prime values of . Similar arguments and results apply to the parameters of the simple groups , and which arise in the work of Dixon and Zalesskii on linear groups of prime degree. 相似文献
17.
Banach空间有界线性算子强连续双半群 总被引:3,自引:0,他引:3
许跟起 《纯粹数学与应用数学》1995,11(1):78-85
本文在Banach空间上研究单参数有界线性算子族-强连续双半群。 相似文献
18.
19.
Vignon Oussa 《Journal of Functional Analysis》2018,274(4):1202-1254
In this work, we provide a unified method for the construction of reproducing systems arising from unitary irreducible representations of some solvable Lie groups. In contrast to other well-known techniques such as the coorbit theory, the generalized coorbit theory and other discretization schemes, we make no assumption on the integrability or square-integrability of the representations of interest. Moreover, our scheme produces explicit constructions of frames with precise frame bounds. As an illustration of the scope of our results, we highlight that a large class of representations which naturally occur in wavelet theory and time–frequency analysis is handled by our scheme. For example, the affine group, the generalized Heisenberg groups, the shearlet groups, solvable extensions of vector groups and various solvable extensions of non-commutative nilpotent Lie groups are a few examples of groups whose irreducible representations are handled by our method. The class of representations studied in this work is described as follows. Let G be a simply connected, connected, completely solvable Lie group with Lie algebra . Next, let π be an infinite-dimensional unitary irreducible representation of G obtained by inducing a character from a closed normal subgroup of G. Additionally, we assume that , is a closed subgroup of G, is a fixed Haar measure on the solvable Lie group M and there exists a linear functional such that the representation is realized as acting in . Making no assumption on the integrability of , we describe explicitly a discrete subset Γ of G and a vector such that is a tight frame for . We also construct compactly supported smooth functions s and discrete subsets such that is a frame for . 相似文献
20.
Motivated by the relation , holding for the -generalized Catalan numbers of type and , the connection between dominant regions of the -Shi arrangement of type and is investigated. More precisely, it is explicitly shown how copies of the set of dominant regions of the -Shi arrangement of type , biject onto the set of type 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 copies of the set of -Dyck paths of height
and the set of lattice paths inside an rectangle is provided. 相似文献