<Emphasis Type="Italic">GI</Emphasis>/<Emphasis Type="Italic">M</Emphasis>/1 type queueing-inventory systems with postponed work,reservation, cancellation and common life time

In this paper we analyze two single server queueing-inventory systems in which items in the inventory have a random common life time. On realization of common life time, all customers in the system are flushed out. Subsequently the inventory reaches its maximum level S through a (positive lead time) replenishment for the next cycle which follows an exponential distribution. Through cancellation of purchases, inventory gets added until their expiry time; where cancellation time follows exponential distribution. Customers arrive according to a Poisson process and service time is exponentially distributed. On arrival if a customer finds the server busy, then he joins a buffer of varying size. If there is no inventory, the arriving customer first try to queue up in a finite waiting room of capacity K. Finding that at full, he joins a pool of infinite capacity with probability γ (0 < γ < 1); else it is lost to the system forever. We discuss two models based on ‘transfer’ of customers from the pool to the waiting room / buffer. In Model 1 when, at a service completion epoch the waiting room size drops to preassigned number L ? 1 (1 < L < K) or below, a customer is transferred from pool to waiting room with probability p (0 < p < 1) and positioned as the last among the waiting customers. If at a departure epoch the waiting room turns out to be empty and there is at least one customer in the pool, then the one ahead of all waiting in the pool gets transferred to the waiting room with probability one. We introduce a totally different transfer mechanism in Model 2: when at a service completion epoch, the server turns idle with at least one item in the inventory, the pooled customer is immediately taken for service. At the time of a cancellation if the server is idle with none, one or more customers in the waiting room, then the head of the pooled customer go to the buffer directly for service. Also we assume that no customer joins the system when there is no item in the inventory. Several system performance measures are obtained. A cost function is discussed for each model and some numerical illustrations are presented. Finally a comparison of the two models are made.     

Optimal strategy in <Emphasis Type="Italic">N</Emphasis>-policy production system with early set-up

This paper considers a production system in which an early set-up is possible. The machine(server) is turned off when there are no units(customers) to process. When the accumulated number of units reaches m(<N), the operator starts a set-up that takes a random time. After the set-up, if there are N or more units waiting for processing, the machine begins to process the units immediately. Otherwise the machine remains dormant in the system until the accumulated number of units reaches N. We model this system by M/G/1 queue with early set-up and N-policy. We use the decomposition property of a vacation queue to derive the distribution of the number of units in the system. We, then, build a cost model and develop a procedure to find the optimal values of (m,N) that minimize a linear average cost.     

Some Numerical Data for Single-Server Queues Involving Deterministic Input Arrangements

The steady-state parameters of the bulk input queue D _c /M/1 and the Erlang service queue D/E _c /1 have been tabulated for C = 1(1)6(2)12(4)20 and 25, 50 and 100 and for ρ = 0·1(0·1)0·9. The tabulation includes the mean waiting time, idle time and queue size. In addition the queue D/E _c /1 has been compared with the queue M/E _c /1 to indicate the gains to be achieved by regularizing the arrival mechanism for a given E _c service facility.     

A single-server queue with batch arrivals and semi-Markov services

We investigate the transient and stationary queue length distributions of a class of service systems with correlated service times. The classical \(M^X/G/1\) queue with semi-Markov service times is the most prominent example in this class and serves as a vehicle to display our results. The sequence of service times is governed by a modulating process J(t). The state of \(J(\cdot )\) at a service initiation time determines the joint distribution of the subsequent service duration and the state of \(J(\cdot )\) at the next service initiation. Several earlier works have imposed technical conditions, on the zeros of a matrix determinant arising in the analysis, that are required in the computation of the stationary queue length probabilities. The imposed conditions in several of these articles are difficult or impossible to verify. Without such assumptions, we determine both the transient and the steady-state joint distribution of the number of customers immediately after a departure and the state of the process J(t) at the start of the next service. We numerically investigate how the mean queue length is affected by variability in the number of customers that arrive during a single service time. Our main observations here are that increasing variability may reduce the mean queue length, and that the Markovian dependence of service times can lead to large queue lengths, even if the system is not in heavy traffic.     

Note edge-colourings of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">n,n</Emphasis></Subscript> with no long two-coloured cycles

Consider the set of all proper edge-colourings of a graph G with n colours. Among all such colourings, the minimum length of a longest two-coloured cycle is denoted L(n, G). The problem of understanding L(n, G) was posed by Häggkvist in 1978 and, specifically, L(n, K _n,n ) has received recent attention. Here we construct, for each prime power q ≥ 8, an edge-colouring of K _n,n with n colours having all two-coloured cycles of length ≤ 2q ², for integers n in a set of density 1 ? 3/(q ? 1). One consequence is that L(n, K _n,n ) is bounded above by a polylogarithmic function of n, whereas the best known general upper bound was previously 2n ? 4.     

On the norm property of the Hilbert symbol for polynomial formal modules in a multidimensional local field

In a two-dimensional local field K containing the pth root of unity, a polynomial formal group F _c (X, Y) = X + Y + cXY acting on the maximal ideal M of the ring of integers б _K and a constructive Hilbert pairing {·, ·} _c : K ₂(K) × F _c (M) → <ξ> _c , where <ξ> _c is the module of roots of [p] _c (pth degree isogeny of F _c ) with respect to formal summation are considered. For the extension of two-dimensional local fields L/K, a norm map of Milnor groups Norm: K ₂(L) → K ₂(K) is considered. Its images are called norms in K ₂(L). The main finding of this study is that the norm property of pairing {·, ·}c: {x,β} _c : = 0 ? x is a norm in K ₂(K([p] _c ^-1 (β))), where [p] _c ^-1 (β) are the roots of the equation [p] _c = β, is checked constructively.     

A discrete queue with double thresholds policy and its application to SVC systems

A discrete time Geo/Geo/1 queue with (m, N)-policy is considered in this paper. There are three operation periods being considered: high speed, low speed service periods and idle periods. With double thresholds policy, the server begins to take a working vacation when the number of customers is below m after a service and there is one customer in the system at least. What’s more, if the system becomes empty after a service, the server will take an ordinary vacation. Otherwise, high speed service continues if the number of customers still exceeds m after a service. At the vacation completion instant, servers resume their service if the quantity of customers exceeds N. Vacations can also be interrupted when the system accumulate customers more than the prefixed threshold. Using the quasi birth-death process and matrix-geometric solution methods, we derive the stationary queue length distribution and some system characteristics of interest. Based on these, we apply the queue to a virtual channel switching system and present various numerical experiments for the system. Finally, numerical results are offered to illustrate the optimal (m, N)-policy to minimize cost function and obtain practical consequence on the operation of double thresholds policy.     

Analysis of queues in a random environment with impatient customers

We study M/M/c queues (c = 1, 1 < c < ∞ and c = ∞) in a Markovian environment with impatient customers. The arrivals and service rates are modulated by the underlying continuous-time Markov chain. When the external environment operates in phase 2, customers become impatient. We focus our attention on the explicit expressions of the performance measures. For each case of c, the corresponding probability generating function and mean queue size are obtained. Several special cases are studied and numerical experiments are presented.     

Finite simple groups that are not spectrum critical

Let G be a finite group. The spectrum of G is the set ω(G) of orders of all its elements. The subset of prime elements of ω(G) is called the prime spectrum and is denoted by π(G). A group G is called spectrum critical (prime spectrum critical) if, for any subgroups K and L of G such that K is a normal subgroup of L, the equality ω(L/K) = ω(G) (π(L/K) = π(G), respectively) implies that L = G and K = 1. In the present paper, we describe all finite simple groups that are not spectrum critical. In addition, we show that a prime spectrum minimal group G is prime spectrum critical if and only if its Fitting subgroup F(G) is a Hall subgroup of G.     

Span of a DL-algebra

Unless otherswise specified, all objects are defined over a field k of characteristic 0. Let K be a field. The unessentialness of an extension of the algebra Der K by means of a splittable semisimple Lie algebra is established. Let D _K be the category of differential Lie algebras (DL-algebras) (g;K). In this paper for an extension L/K the functor η:D _K → D _L , defining the tensor product L ? _K of vector spaces and the homomorphism of Lie algebras, is constructed. If the extension L/K is algebraic, then η is unique. The results will be required for strengthening the progress on Gelfand–Kirillov problem and weakened conjecture [1, 2].     

The absolute continuity of convolution products of orbital measures in exceptional symmetric spaces

Let G be a non-compact group, K the compact subgroup fixed by a Cartan involution and assume G / K is an exceptional, symmetric space, one of Cartan type E, F or G. We find the minimal integer, L(G),  such that any convolution product of L(G) continuous, K-bi-invariant measures on G is absolutely continuous with respect to Haar measure. Further, any product of L(G) double cosets has non-empty interior. The number L(G) is either 2 or 3, depending on the Cartan type, and in most cases is strictly less than the rank of G.     

Approximation algorithms for the robust facility leasing problem

In this paper, we consider the robust facility leasing problem (RFLE), which is a variant of the well-known facility leasing problem. In this problem, we are given a facility location set, a client location set of cardinality n, time periods \(\{1, 2, \ldots , T\}\) and a nonnegative integer \(q < n\). At each time period t, a subset of clients \(D_{t}\) arrives. There are K lease types for all facilities. Leasing a facility i of a type k at any time period s incurs a leasing cost \(f_i^{k}\) such that facility i is opened at time period s with a lease length \(l_k\). Each client in \(D_t\) can only be assigned to a facility whose open interval contains t. Assigning a client j to a facility i incurs a serving cost \(c_{ij}\). We want to lease some facilities to serve at least \(n-q\) clients such that the total cost including leasing and serving cost is minimized. Using the standard primal–dual technique, we present a 6-approximation algorithm for the RFLE. We further offer a refined 3-approximation algorithm by modifying the phase of constructing an integer primal feasible solution with a careful recognition on the leasing facilities.     

A Note on a Queueing Optimization Problem

Van Ackere and Ninios (VN) used discrete-event simulation to determine the optimal strategies for a monopolist who operates a single-server facility and uses advertising to attract customers. Their model was based upon an M/E _r /1/K queue. In this paper, we re-analyze their model using queueing theory and numerical optimization. Our results allow the optimal strategies to be characterized more precisely, and this leads to a reassessment and modification of the conclusions reached by VN.     

Description of the Space of Riesz Potentials of Functions in a Grand Lebesgue Space on ℝ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

The Riesz potentials L^af, 0 < α < ∞, are considered in the framework of a grand Lebesgue space L_a^p),θ, 1 < p < ∞, θ > 0, on Rn with grandizers a ∈ L¹(?ⁿ), which are understood in the case α ≥ n/p in terms of distributions on test functions in the Lizorkin space. The images under I^α of functions in a subspace of the grand space which satisfy the so-called vanishing condition is studied. Under certain assumptions on the grandizer, this image is described in terms of the convergence of truncated hypersingular integrals of order α in this subspace.     

On Subspaces of Cesàro Spaces

We obtain a characterization of subspaces of L _p , with 1 < p < ∞, on which the L _p -norm is equivalent to the norm of the Cesàro space Ces _p . Also, we show that Ces _p has a complemented copy of the Cesàro sequence space ces _p .     

Uniform Homeomorphisms of Unit Spheres and Property H of Lebesgue–Bochner Function Spaces

Assume that the unit spheres of Banach spaces X and Y are uniformly homeomorphic.Then we prove that all unit spheres of the Lebesgue–Bochner function spaces L_p(μ, X) and L_q(μ, Y)are mutually uniformly homeomorphic where 1 ≤ p, q ∞. As its application, we show that if a Banach space X has Property H introduced by Kasparov and Yu, then the space L_p(μ, X), 1 ≤ p ∞,also has Property H.     

Normality of the Thue–Morse sequence along Piatetski-Shapiro sequences,II

We prove that the Thue–Morse sequence t along subsequences indexed by ?n ^c ? is normal, where 1 < c < 3/2. That is, for c in this range and for each ω ∈ {0, 1} ^L , where L ≥ 1, the set of occurrences of ω as a factor (contiguous finite subsequence) of the sequence \(n \mapsto {t_{\left\lfloor {{n^c}} \right\rfloor }}\) has asymptotic density 2^?L . This is an improvement over a recent result by the second author, which handles the case 1 < c < 4/3.In particular, this result shows that for 1 < c < 3/2 the sequence \(n \mapsto {t_{\left\lfloor {{n^c}} \right\rfloor }}\) attains both of its values with asymptotic density 1/2, which improves on the bound c < 1.4 obtained by Mauduit and Rivat (who obtained this bound in the more general setting of q-multiplicative functions, however) and on the bound c ≤ 1.42 obtained by the second author.In the course of proving the main theorem, we show that 2/3 is an admissible level of distribution for the Thue–Morse sequence, that is, it satisfies a Bombieri–Vinogradov type theorem for each exponent η < 2/3. This improves on a result by Fouvry and Mauduit, who obtained the exponent 0.5924. Moreover, the underlying theorem implies that every finite word ω ∈ {0, 1} ^L is contained as an arithmetic subsequence of t.     

The weighted Hardy spaces associated to self-adjoint operators and their duality on product spaces

Let L be a non-negative self-adjoint operator acting on L²(R ⁿ ) satisfying a pointwise Gaussian estimate for its heat kernel. Let w be an A _r weight on R ⁿ × R ⁿ , 1 < r < ∞. In this article we obtain a weighted atomic decomposition for the weighted Hardy space H _L,w ^p (R ⁿ ×R ⁿ ), 0 < p ≤ 1 associated to L. Based on the atomic decomposition, we show the dual relationship between H _L,w ¹ (R ⁿ × R ⁿ ) and BMO_L,w(R ⁿ × R ⁿ ).     

A Note on Campanato Spaces and Their Applications

In this paper, we obtain a version of the John–Nirenberg inequality suitable for Campanato spaces C_p,β with 0 < p < 1 and show that the spaces C_p,β are independent of the scale p ∈ (0,∞) in sense of norm when 0 < β < 1. As an application, we characterize these spaces by the boundedness of the commutators [b,B _α ] _j (j = 1, 2) generated by bilinear fractional integral operators B _α and the symbol b acting from L_p1 × L_p2 to L ^q for p1, p2 ∈ (1,∞), q ∈ (0,∞) and 1/q = 1/p1 + 1/p2 ? (α + β)/n.     

Choiceless Ramsey Theory of Linear Orders

Motivated by work of Erd?s, Milner and Rado, we investigate symmetric and asymmetric partition relations for linear orders without the axiom of choice. The relations state the existence of a subset in one of finitely many given order types that is homogeneous for a given colouring of the finite subsets of a fixed size of a linear order. We mainly study the linear orders 〈 ^α 2,< _{l e x} 〉, where α is an infinite ordinal and < _{l e x} is the lexicographical order. We first obtain the consistency of several partition relations that are incompatible with the axiom of choice. For instance we derive partition relations for 〈 ^ω 2,< _{l e x} 〉 from the property of Baire for all subsets of ^ω 2 and show that the relation \(\langle ^{\kappa }{2}, <_{lex}\rangle \longrightarrow (\langle ^{\kappa }{2}, <_{lex}\rangle )^{2}_{2}\) is consistent for uncountable regular cardinals κ with κ ^<κ = κ. We then prove a series of negative partition relations with finite exponents for the linear orders 〈 ^α 2,< _{l e x} 〉. We combine the positive and negative results to completely classify which of the partition relations \(\langle ^{\omega }{2}, <_{lex}\rangle \longrightarrow (\bigvee _{\nu <\lambda }K_{\nu },\bigvee _{\nu <\mu }M_{\nu })^{m}\) for linear orders K _ν ,M _ν and m≤4 and 〈 ^ω 2,< _{l e x} 〉→(K,M) ⁿ for linear orders K,M and natural numbers n are consistent.