共查询到10条相似文献,搜索用时 62 毫秒
1.
Vladimir P. Korzhik 《Discrete Mathematics》1998,190(1-3):149-162
The author has proposed methods of constructing index 2 and 3 current graphs generating triangular embeddings of graphs Kn−Km with unboundedly large m (as n increases). As a result, triangular embeddings of graphs of many families of graphs Kn−Km with unboundedly large m were constructed. The paper gives a survey of these results and a short explanation of the methods. 相似文献
2.
This paper deals with the M/G/1 queue with D-policy, i.e., the server is turned off at the end of a busy period and turned on when the cumulative amount of work firstly exceeds some fixed value D. We first concentrate on the computation of the steady-state probabilities. The first moments and relationships among the busy period, the number of customers served and other performance measures are investigated. Some variants of the main model and the special case of the M/M/1 are also studied. 相似文献
3.
4.
Bonin et al. (1993) recalled an open problem related to the recurrence relation verified by NSW numbers. The recurrence relation is the following: fn+1 = 6fn − fn−1, with f1 = 1 and f2 = 7, and no combinatorial interpretation seems to be known. In this note, we define a regular language L whose number of words having length n is equal to fn+1. Then, by using L we give a direct combinatorial proof of the recurrence. 相似文献
5.
Andrea Baiocchi 《Queueing Systems》1992,10(3):235-247
This paper investigates the asymptotic behaviour of the loss probability of theM / G/1/K and G/M/1/K queues as the buffer size increases. It is shown that the loss probability approaches its limiting value, which depends on the offered load, with an exponential decay in essentially all cases. The value of the decay rate can be easily computed from the main queue parameters. Moreover, the close relation existing between the loss behaviour of the two examined queueing systems is highlighted and a duality concept is introduced. Finally some numerical examples are given to illustrate on the usefulness of the asymptotic approximation. 相似文献
6.
We consider a variation of a classical Turán-type extremal problem (F. Chung, R. Graham, Erd
s on Graphs: His Legacy of Unsolved Problems, AK Peters Ltd., Wellesley, 1998, Chapter 3) as follows: Determine the smallest even integer σ(Kr,s,n) such that every n-term graphic sequence π=(d1,d2,…,dn) with term sum σ(π)=d1+d2++dnσ(Kr,s,n) is potentially Kr,s-graphic, where Kr,s is a r×s complete bipartite graph, i.e., π has a realization G containing Kr,s as its subgraph. In this paper, we first give sufficient conditions for a graphic sequence being potentially Kr,s-graphic, and then we determine σ(Kr,r,n) for r=3,4. 相似文献
7.
V. A. Belonogov 《Algebra and Logic》2005,44(1):13-24
In the representation theory of symmetric groups, for each partition of a natural number n, the partition h() of n is defined so as to obtain a certain set of zeros in the table of characters for Sn. Namely, h() is the greatest (under the lexicographic ordering ) partition among P(n) such that (g) 0. Here, is an irreducible character of Sn, indexed by a partition , and g is a conjugacy class of elements in Sn, indexed by a partition . We point out an extra set of zeros in the table that we are dealing with. For every non self-associated partition P(n), the partition f() of n is defined so that f() is greatest among the partitions of n which are opposite in sign to h() and are such that (g) 0 (Thm. 1). Also, for any self-associated partition of n > 1, we construct a partition
() P(n) such that
() is greatest among the partitions of n which are distinct from h() and are such that (g) 0 (Thm. 2).Supported by RFBR grant No. 04-01-00463 and by RFBR-BRFBR grant No. 04-01-81001.Translated from Algebra i Logika, Vol. 44, No. 1, pp. 24–43, January–February, 2005. 相似文献
8.
Multilevel processor sharing scheduling disciplines have recently been resurrected in papers that focus on the differentiation between short and long TCP flows in the Internet. We prove that, for M/G/1 queues, such disciplines are better than the processor sharing discipline with respect to the mean delay whenever the hazard rate of the service time distribution is decreasing. 相似文献
9.
A finite group G is said to be a Bn-group if any n-element subset A = {a1, a2,..., an} of G satisfies . In this paper, the characterizations of the B6- and B7-groups are given. 相似文献
10.