Analysis of the adaptive MMAP[K]/PH[K]/1 queue: A multi-type queue with adaptive arrivals and general impatience

In this paper we introduce the adaptive MMAP[K] arrival process and analyze the adaptive MMAP[K]/PH[K]/1 queue. In such a queueing system, customers of K different types with Markovian inter-arrival times and possibly correlated customer types, are fed to a single server queue that makes use of r thresholds. Service times are phase-type and depend on the type of customer in service. Type k customers are accepted with some probability a_i,k if the current workload is between threshold i − 1 and i. The manner in which the arrival process changes its state after generating a type k customer also depends on whether the customer is accepted or rejected.     

On K 1,k -factorization of bipartite multigraphs

A K1,k-factorization of λKm,n is a set of edge-disjoint K1,k-factors of λKm,n, which partition the set of edges of λKm,n. In this paper, it is proved that a sufficient condition for the existence of K1,k-factorization of λKm,n, whenever k is any positive integer, is that （1） m ≤ kn, （2） n ≤ km, （3） km-n = kn-m ≡ 0 （mod （k^2- 1）） and （4） λ（km-n）（kn-m） ≡ 0 （mod k（k- 1）（k^2 - 1）（m ＋ n））.     

On the multi-phase M/G/1 queueing system with random feedback

In this paper we consider an M/G/1 queue with k phases of heterogeneous services and random feedback, where the arrival is Poisson and service times has general distribution. After the completion of the i-th phase, with probability θ _i the (i + 1)-th phase starts, with probability p _i the customer feedback to the tail of the queue and with probability 1 − θ _i − p _i  = q _i departs the system if service be successful, for i = 1, 2 , . . . , k. Finally in kth phase with probability p _k feedback to the tail of the queue and with probability 1 − p _k departs the system. We derive the steady-state equations, and PGF’s of the system is obtained. By using them the mean queue size at departure epoch is obtained.     

An M|G|1 Retrial Queue with Nonpersistent Customers and Orbital Search

Abstract

The M|G|1 retrial queue with nonpersistent customers and orbital search is considered. If the server is busy at the time of arrival of a primary customer, then with probability 1 ? H ₁ it leaves the system without service, and with probability H ₁ > 0, it enters into an orbit. Similarly, if the server is occupied at the time of arrival of an orbital customer, with probability 1 ? H ₂, it leaves the system without service, and with probability H ₂ > 0, it goes back to the orbit. Immediately after the completion of each service, the server searches for customers in the orbit with probability p > 0, and remains idle with probability 1 ? p. Search time is assumed to be negligible. In the case H ₂ = 1, the model is analyzed in full detail using the supplementary variable method. The joint distribution of the server state and the orbit length in steady state is studied. The structure of the busy period and its analysis in terms of Laplace transform is discussed. We also provide a direct method of calculation for the first and second moment of the busy period. In the case H ₂ < 1, closed form solution is obtained for exponentially distributed service time, in terms of hypergeometric series.     

An Eberhard-Like Theorem for Pentagons and Heptagons

Eberhard proved that for every sequence (p _k ), 3≤k≤r, k≠6, of nonnegative integers satisfying Euler’s formula ∑ _k≥3(6−k)p _k =12, there are infinitely many values p ₆ such that there exists a simple convex polyhedron having precisely p _k faces of size k for every k≥3, where p _k =0 if k>r. In this paper we prove a similar statement when nonnegative integers p _k are given for 3≤k≤r, except for k=5 and k=7 (but including p ₆). We prove that there are infinitely many values p ₅,p ₇ such that there exists a simple convex polyhedron having precisely p _k faces of size k for every k≥3. We derive an extension to arbitrary closed surfaces, yielding maps of arbitrarily high face-width. Our proof suggests a general method for obtaining results of this kind.     

Additive Latin transversals and group rings

LetA={a ₁, …,a _k} and {b ₁, …,b _k} be two subsets of an abelian groupG, k≤|G|. Snevily conjectured that, when |G| is odd, there is a numbering of the elements ofB such thata _i+b _i,1≤i≤k are pairwise distinct. By using a polynomial method, Alon affirmed this conjecture for |G| prime, even whenA is a sequence ofk<|G| elements. With a new application of the polynomial method, Dasgupta, Károlyi, Serra and Szegedy extended Alon’s result to the groupsZ _p ^r andZ _p ^rin the casek<p and verified Snevily’s conjecture for every cyclic group. In this paper, by employing group rings as a tool, we prove that Alon’s result is true for any finite abelianp-group withk<√2p, and verify Snevily’s conjecture for every abelian group of odd order in the casek<√p, wherep is the smallest prime divisor of |G|. This work has been supported partly by NSFC grant number 19971058 and 10271080.     

On the order of relative approximation of classes of differentiable periodic functions by splines

In the case where n → ∞, we obtain order equalities for the best L _q -approximations of the classes W _p ^r , 1 ≤ q ≤ p ≤ 2, of differentiable periodical functions by splines from these classes.     

A Quadrature Formula for Diffusion Polynomials Corresponding to a Generalized Heat Kernel

Let {φ _k } be an orthonormal system on a quasi-metric measure space  ${\mathbb{X}}Let {φ _k } be an orthonormal system on a quasi-metric measure space  \mathbbX{\mathbb{X}}, {ℓ _k } be a nondecreasing sequence of numbers with lim  _k→∞ ℓ _k =∞. A diffusion polynomial of degree L is an element of the span of {φ _k :ℓ _k ≤L}. The heat kernel is defined formally by K_t(x,y)=?_k=0^￥exp(-l_k²t)f_k(x)[`(f_k(y))]K_{t}(x,y)=\sum_{k=0}^{\infty}\exp(-\ell _{k}^{2}t)\phi_{k}(x)\overline{\phi_{k}(y)}. If T is a (differential) operator, and both K _t and T _y K _t have Gaussian upper bounds, we prove the Bernstein inequality: for every p, 1≤p≤∞ and diffusion polynomial P of degree L, ‖TP‖ _p ≤c ₁ L ^c ‖P‖ _p . In particular, we are interested in the case when \mathbbX{\mathbb{X}} is a Riemannian manifold, T is a derivative operator, and p 1 2p\not=2. In the case when \mathbbX{\mathbb{X}} is a compact Riemannian manifold without boundary and the measure is finite, we use the Bernstein inequality to prove the existence of quadrature formulas exact for integrating diffusion polynomials, based on an arbitrary data. The degree of the diffusion polynomials for which this formula is exact depends upon the mesh norm of the data. The results are stated in greater generality. In particular, when T is the identity operator, we recover the earlier results of Maggioni and Mhaskar on the summability of certain diffusion polynomial valued operators.     

Universaln-soft maps ofn-dimensional spaces in absolute Borel and projective classes

LetC be one of the absolute Borel classesM _α ,A _α , with 1≤α<ω ₁ or one of the absolute projective classesP _k ,k≥1. A map of ann-dimensional spaceX ∈ C onto the Hilbert cube which is ann-soft map in Shchepin's sense and universal in the class of maps of spaces of dimension smaller that or equal ton from the classC into separable metrizable spaces is constructed. Translated fromMatematicheskie Zametki, Vol. 60, No. 6, pp. 845–850, December, 1996.     

On the structure ofp-zero-sum free sequences and its application to a variant of Erdös-Ginzburg-Ziv theorem

Letp be any odd prime number. Letk be any positive integer such that . LetS = (a ₁,a ₂,...,a _2p−k ) be any sequence in ℤ_p such that there is no subsequence of lengthp of S whose sum is zero in ℤ_p. Then we prove that we can arrange the sequence S as follows:

On the Existence of Specific Stars in Planar Graphs

Given a graph G, a (k;a,b,c)-star in G is a subgraph isomorphic to a star K_1,3 with a central vertex of degree k and three leaves of degrees a, b and c in G. The main result of the paper is: Every planar graph G of minimum degree at least 3 contains a (k;a,b,c)-star with a≤ b≤ c and (i) k = 3, a≤ 10, or (ii) k = 4, a = 4, 4≤ b≤ 10, or (iii) k = 4, a = 5, 5≤ b≤ 9, or (iv) k = 4, 6≤ a≤ 7, 6≤ b≤ 8, or (v) k = 5, 4≤ a≤ 5, 5≤ b≤ 6 and 5≤ c≤ 7, or (vi) k = 5 and a = b = c = 6.     

Analysis of multiserver retrial queueing system: A martingale approach and an algorithm of solution

The paper studies a multiserver retrial queueing system withm servers. Arrival process is a point process with strictly stationary and ergodic increments. A customer arriving to the system occupies one of the free servers. If upon arrival all servers are busy, then the customer goes to the secondary queue, orbit, and after some random time retries more and more to occupy a server. A service time of each customer is exponentially distributed random variable with parameter μ₁. A time between retrials is exponentially distributed with parameter μ₂ for each customer. Using a martingale approach the paper provides an analysis of this system. The paper establishes the stability condition and studies a behavior of the limiting queue-length distributions as μ₂ increases to infinity. As μ₂→∞, the paper also proves the convergence of appropriate queue-length distributions to those of the associated “usual” multiserver queueing system without retrials. An algorithm for numerical solution of the equations, associated with the limiting queue-length distribution of retrial systems, is provided. AMS 2000 Subject classifications: 60K25 60H30.     

Bicolored Matchings in Some Classes of Graphs

We consider the problem of finding in a graph a set R of edges to be colored in red so that there are maximum matchings having some prescribed numbers of red edges. For regular bipartite graphs with n nodes on each side, we give sufficient conditions for the existence of a set R with |R|=n+1 such that perfect matchings with k red edges exist for all k,0≤k≤n. Given two integers p<q we also determine the minimum cardinality of a set R of red edges such that there are perfect matchings with p red edges and with q red edges. For 3-regular bipartite graphs, we show that if p≤4 there is a set R with |R|=p for which perfect matchings M_k exist with |M_k∩R|≤k for all k≤p. For trees we design a linear time algorithm to determine a minimum set R of red edges such that there exist maximum matchings with k red edges for the largest possible number of values of k.     

Quasiminimizers in one dimension: integrability of the derivative,inverse function and obstacle problems

It is shown that a K-quasiminimizer u for the one-dimensional p-Dirichlet integral is a K′-quasiminimizer for the q-Dirichlet integral, 1  ≤  q  <  p ₁(p, K), where p ₁(p, K) > p; the exact value for p ₁(p, K) is obtained. The inverse function of a non-constant u is also K′′-quasiminimizer for the s-Dirichlet integral and the range of the exponent s is specified. Connections between quasiminimizers, superminimizers and solutions to obstacle problems are studied.     

Successions in integer partitions

A partition of an integer n is a representation n=a ₁+a ₂+⋅⋅⋅+a _k , with integer parts 1≤a ₁≤a ₂≤…≤a _k . For any fixed positive integer p, a p-succession in a partition is defined to be a pair of adjacent parts such that a _i+1−a _i =p. We find generating functions for the number of partitions of n with no p-successions, as well as for the total number of such successions taken over all partitions of n. In the process, various interesting partition identities are derived. In addition, the Hardy-Ramanujan asymptotic formula for the number of partitions is used to obtain an asymptotic estimate for the average number of p-successions in the partitions of n. This material is based upon work supported by the National Research Foundation under grant number 2053740.     

Kp,q-factorization of complete bipartite graphs

Let K _m,nbe a complete bipartite graph with two partite sets having m and n vertices, respectively. A K _p,q-factorization of K _m,n is a set of edge-disjoint K _p,q-factors of K _m,n which partition the set of edges of K _m,n. When p = 1 and q is a prime number, Wang, in his paper “On K _1,k -factorizations of a complete bipartite graph” (Discrete Math, 1994, 126: 359—364), investigated the K _1,q -factorization of K _m,nand gave a sufficient condition for such a factorization to exist. In the paper “K _1,k -factorizations of complete bipartite graphs” (Discrete Math, 2002, 259: 301—306), Du and Wang extended Wang’s result to the case that q is any positive integer. In this paper, we give a sufficient condition for K _m,n to have a K _p,q-factorization. As a special case, it is shown that the Martin’s BAC conjecture is true when p : q = k : (k+ 1) for any positive integer k.     

Transversals of additive Latin squares

LetA={a ₁, …,a _k} andB={b ₁, …,b _k} be two subsets of an Abelian groupG, k≤|G|. Snevily conjectured that, whenG is of odd order, there is a permutationπ ∈S _ksuch that the sums α _i +b _i , 1≤i≤k, are pairwise different. Alon showed that the conjecture is true for groups of prime order, even whenA is a sequence ofk<|G| elements, i.e., by allowing repeated elements inA. In this last sense the result does not hold for other Abelian groups. With a new kind of application of the polynomial method in various finite and infinite fields we extend Alon’s result to the groups (ℤ _p ) ^a and in the casek<p, and verify Snevily’s conjecture for every cyclic group of odd order. Supported by Hungarian research grants OTKA F030822 and T029759. Supported by the Catalan Research Council under grant 1998SGR00119. Partially supported by the Hungarian Research Foundation (OTKA), grant no. T029132.     

Approximative characteristics of the isotropic classes of periodic functions of many variables

Exact-order estimates are obtained for the best orthogonal trigonometric approximations of the Besov (B _p,θ ^r ) and Nukol’skii (H _p ^r ) classes of periodic functions of many variables in the metric of L _q , 1 ≤ p, q ≤ ∞. We also establish the orders of the best approximations of functions from the same classes in the spaces L ₁ and L _∞ by trigonometric polynomials with the corresponding spectrum.     

相关序的进一步研究

Let (X1,X2,…,Xn) and (Y1,Y2,…Yn) be real random vectors with the same marginal distributions,if (X1,X2,…,Xn)≤c(Y1,Y2,…Yn), it is showed in this paper that ∑i=1^n Xi≤cx∑i=1^n Yi and max1≤k≤n∑i=1^k Xi≤icx max1≤k≤n∑i=1^k Yi hold. Based on this fact,a more general comparison theorem is obtained.     

Functions of bounded boundary rotation

Classes of functionsU _k, which generalize starlike functions in the same manner that the classV _k of functions with boundary rotation bounded bykπ generalizes convex functions, are defined. The radius of univalence and starlikeness is determined. The behavior off _α(z) = ∫ ₀ ^z [f'(t)]^α dt is determined for various classes of functions. It is shown that the image of |z|<1 underV _kfunctions contains the disc of radius 1/k centered at the origin, andV _k functions are continuous in |z|≦1 with the exception of at most [k/2+1] points on |z|=1.