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.     

A Multiple Reorder Point Inventory Policy

This paper discusses the development and application of a multiple reorder inventory policy which can be stated as follows: reorder an optimal lot size Q when inventory (stock on hand) falls to R, R-Q, R-2Q,..., R-NQ; where R is the reorder level. If demands cause the inventory to fall below two reorder levels, say a jump from R+ ? to R-2Q+?′ where ? and ?′ < Q, an order for 2Q is placed. The policy is a form of (S,q) policy where the maximum stock level S = R + Q. The system is of particular value in cases where the coefficient of variation of lead time demand μ _l (μ _l = σ _l /λ _l )is large (say >0·5) and continuous inventory records are maintained. Tables, charts and nomographs to simplify clerical tasks can be obtained quite readily. In this formulation R and Q are not independent factors as in the usual Wilson formulation, but are obtained by minimizing a single cost functional subject to the constraint of a specified risk of out-of-stock condition or a specified level of service (Galliher and Simmond, 1957), (Morse et al., 1959). The particular application concerns the raw material inventories of a manufacturer of metal pressings who is required to offer “immediate service”. The demand distribution during the lead time closely approximates the exponential distribution, and lead times are constant for each raw material. The application of the multiple reorder policy results in a 30 to 35 per cent reduction in inventory for a 95 per cent service level. Measures of sensitivity and response are obtained, and the mean number of shortages is expressed in closed form. The policy is compared with the Wilson policy and shown to be more “effective” in that it results in lower inventories and a smaller number of orders for the case considered.     

Finite <Emphasis Type="Italic">p</Emphasis>-groups whose non-normal subgroups have few orders

Suppose that G is a finite p-group. If G is not a Dedekind group, then G has a non-normal subgroup. We use p^M(G) and p^m(G) to denote the maximum and minimum of the orders of the non-normal subgroups of G; respectively. In this paper, we classify groups G such that M(G) < 2m(G)?1: As a by-product, we also classify p-groups whose orders of non-normal subgroups are p^k and p^k+1.     

Sums of Values of Nonprincipal Characters over a Sequence of Shifted Primes

For a nonprincipal character χ modulo D, we prove a nontrivial estimate of the form Σ_n≤x Λ(n)χ(n ? l) \( \ll x\exp \{ - 0.6\sqrt {\ln D} \} \) for the sum of values of χ over a sequence of shifted primes in the case when x ≥ D^1/2+ε, (l,D) = 1, and the modulus of the primitive character generated by χ is a cube-free number.     

On a problem of impulse control under interference

This paper contains several results about the structure of the congruence kernel C^(S)(G) of an absolutely almost simple simply connected algebraic group G over a global field K with respect to a set of places S of K. In particular, we show that C^(S)(G)) is always trivial if S contains a generalized arithmetic progression. We also give a criterion for the centrality of C^(S)(G) in the general situation in terms of the existence of commuting lifts of the groups G(K_v) for v ? S in the S-arithmetic completion ?^(S). This result enables one to give simple proofs of the centrality in a number of cases. Finally, we show that if K is a number field and G is K-isotropic, then C^(S)(G) as a normal subgroup of ?^(S) is almost generated by a single element.     

Coherence relative to a weak torsion class

Let R be a ring. A subclass T of left R-modules is called a weak torsion class if it is closed under homomorphic images and extensions. Let T be a weak torsion class of left R-modules and n a positive integer. Then a left R-module M is called T-finitely generated if there exists a finitely generated submodule N such that M/N ∈ T; a left R-module A is called (T,n)-presented if there exists an exact sequence of left R-modules

$$0 \to {K_{n - 1}} \to {F_{n - 1}} \to \cdots \to {F_1} \to {F_0} \to M \to 0$$

such that F₀,..., F_n?1 are finitely generated free and K_n?1 is T-finitely generated; a left R-module M is called (T,n)-injective, if Ext ⁿ _R (A,M) = 0 for each (T, n+1)-presented left R-module A; a right R-module M is called (T,n)-flat, if Tor ^R _n (M,A) = 0 for each (T, n+1)-presented left R-module A. A ring R is called (T,n)-coherent, if every (T, n+1)-presented module is (n + 1)-presented. Some characterizations and properties of these modules and rings are given.

     

Isomorphisms of Cayley graphs of a free Abelian group

A group G is called a CI-group provided that the existence of some automorphism σ ∈ Aut(G) such that σ(A) = B follows from an isomorphism Cay(G, A) ? = Cay (G, B) between Cayley graphs, where A and B are two systems of generators for G. We prove that every finitely generated abelian group is a CI-group.     

On the dimension of solution spaces of a noncommutative sigma model in the case of uniton number 2

This is primarily an overview article on some results and problems involving the classical Hardy function Z(t):= ζ(1/2 + it)(χ(1/2 + it))^?1/2, ζ(s) = χ(s)ζ(1 ? s). In particular, we discuss the first and third moments of Z(t) (with and without shifts) and the distribution of its positive and negative values. A new result involving the distribution of its values is presented.     

Unit Interval Orders of Open and Closed Intervals

A poset P = (X, ?) is a unit OC interval order if there exists a representation that assigns an open or closed real interval I(x) of unit length to each x ∈ P so that x ? y in P precisely when each point of I (x) is less than each point in I (y). In this paper we give a forbidden poset characterization of the class of unit OC interval orders and an efficient algorithm for recognizing the class. The algorithm takes a poset P as input and either produces a representation or returns a forbidden poset induced in P.     

On the coincidence of Grünberg-Kegel graphs of a finite simple group and its proper subgroup

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 denoted by π(G). The spectrum ω(G) of a group G defines its prime graph (or Grünberg-Kegel graph) Γ(G) with vertex set π(G), in which any two different vertices r and s are adjacent if and only if the number rs belongs to the set ω(G). We describe all the cases when the prime graphs of a finite simple group and of its proper subgroup coincide.     

Short cycles in repeated exponentiation modulo a prime

Given a prime p, we consider the dynamical system generated by repeated exponentiations modulo p, that is, by the map \({u \mapsto f_g(u)}\), where f _g (u) ≡ g ^u (mod p) and 0 ≤ f _g (u) ≤ p ? 1. This map is in particular used in a number of constructions of cryptographically secure pseudorandom generators. We obtain nontrivial upper bounds on the number of fixed points and short cycles in the above dynamical system.     

Some results on the annihilator graph of a commutative ring

Let R be a commutative ring. The annihilator graph of R, denoted by AG(R), is the undirected graph with all nonzero zero-divisors of R as vertex set, and two distinct vertices x and y are adjacent if and only if ann _R (xy) ≠ ann _R (x) ∪ ann _R (y), where for z ∈ R, ann _R (z) = {r ∈ R: rz = 0}. In this paper, we characterize all finite commutative rings R with planar or outerplanar or ring-graph annihilator graphs. We characterize all finite commutative rings R whose annihilator graphs have clique number 1, 2 or 3. Also, we investigate some properties of the annihilator graph under the extension of R to polynomial rings and rings of fractions. For instance, we show that the graphs AG(R) and AG(T(R)) are isomorphic, where T(R) is the total quotient ring of R. Moreover, we investigate some properties of the annihilator graph of the ring of integers modulo n, where n ? 1.     

Geometric interpretation of the Wagner curvature tensor in the case of a manifold with contact metric structure

Considering a manifold (φ, ξ, η, g, X, D) with contact metric structure, we introduce the concept of N-extended connection (connection on a vector bundle (D, π,X)), with N an endomorphism of the distribution D, and show that the curvature tensor of each N-extended connection for a suitably chosen endomorphism N coincides with the Wagner curvature tensor.     

Spectral asymptotics of a nonself-adjoint elliptic differential operator with an indefinite weight function

In the present paper, we compute the leading term of the asymptotics of the angular eigenvalue distribution function of the problem Au = λω(x)u(x) in a bounded domain Ω ? R ⁿ , where A is an elliptic differential operator of order 2m with domain D(A) ? W _m ^2m (Ω). The weight function ω(x) (x ∈ Ω) is indefinite and can also take zero values on a set of positive measure.     

Stochastic inventory system with lead time flexibility: offered by a manufacturer/transporter

This paper studies lead time flexibility in a two-stage continuous review supply chain in which the retailer uses the (R, Q) inventory system: when his inventory position reaches R, the retailer places orders with size Q to the manufacturer, who uses a transportation provider to deliver them with different lead time options. According to the contract, the manufacturer is able to expedite or postpone the delivery if the retailer makes such a request. Hence, the retailer has the flexibility to modify the lead time by using the most up-to-date demand information. The optimal lead time policy is found to be a threshold-type policy. The sensitivity analysis also shows that R is much more sensitive to the change of lead time than Q, and thus, the paper is primarily focused on finding optimal R. We also provide a cost approximation which yields unimodal cost in R. Furthermore, we analyze the order crossing problem and derive an upper bound for the probability of order crossing. Finally, we conduct an extensive sensitivity analysis to illustrate the effects of lead time flexibility on supply chain performance and discuss the managerial insights.     

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.     

Some related paradoxes of queuing theory: new cases and a unifying explanation

In this paper, we study a number of closely related paradoxes of queuing theory, each of which is based on the intuitive notion that the level of congestion in a queuing system should be directly related to the stochastic variability of the arrival process and the service times. In contrast to such an expectation, it has previously been shown that, in all H _k /G/1 queues, PW (the steady-state probability that a customer has to wait for service) decreases when the service-time becomes more variable. An analagous result has also been proved for p_loss (the steady-state probability that a customer is lost) in all H_k/G/1 loss systems. Such theoretical results can be seen, in this paper, to be part of a much broader scheme of paradoxical behaviour which covers a wide range of queuing systems. The main aim of this paper is to provide a unifying explanation for these kinds of behaviour. Using an analysis based on a simple, approximate model, we show that, for an arbitrary set of n GI/G_k/1 loss systems (k=1,..., n), if the interarrival-time distribution is fixed and ‘does not differ too greatly’ from the exponential distribution, and if the n systems are ordered in terms of their p_loss values, then the order that results whenever c_A<1 is the exact reverse of the order that results whenever c_A>1, where c_A is the coefficient of variation of the interarrival time. An important part of the analysis is the insensitivity of the p_loss value in an M/G/1 loss system to the choice of service-time distribution, for a given traffic intensity. The analysis is easily generalised to other queuing systems for which similar insensitivity results hold. Numerical results are presented for paradoxical behaviour of the following quantities in the steady state: p_loss in the GI/G/1 loss system; PW and W _q (the expected queuing time of customers) in the GI/G/1 queue; and p_K (the probability that all K machines are in the failed state) in the GI/G/r machine interference model. Two of these examples of paradoxical behaviour have not previously been reported in the literature. Additional cases are also discussed.     

On a classical theorem on the diameter and minimum degree of a graph

In this work, we obtain good upper bounds for the diameter of any graph in terms of its minimum degree and its order, improving a classical theorem due to Erd¨os, Pach, Pollack and Tuza.We use these bounds in order to study hyperbolic graphs(in the Gromov sense). To compute the hyperbolicity constant is an almost intractable problem, thus it is natural to try to bound it in terms of some parameters of the graph. Let H(n, δ_0) be the set of graphs G with n vertices and minimum degree δ_0, and J(n, Δ) be the set of graphs G with n vertices and maximum degree Δ. We study the four following extremal problems on graphs: a(n, δ_0) = min{δ(G) | G ∈ H(n, δ_0)}, b(n, δ_0) = max{δ(G) |G ∈ H(n, δ_0)}, α(n, Δ) = min{δ(G) | G ∈ J(n, Δ)} and β(n, Δ) = max{δ(G) | G ∈ J(n, Δ)}. In particular, we obtain bounds for b(n, δ_0) and we compute the precise value of a(n, δ_0), α(n, Δ) andβ(n, Δ) for all values of n, δ_0 and Δ, respectively.     

Error estimates for a projection-difference method for a linear differential-operator equation

We study a projection-difference method for approximately solving the Cauchy problem u′(t) + A(t)u(t) + K(t)u(t) = h(t), u(0) = 0 for a linear differential-operator equation in a Hilbert space, where A(t) is a self-adjoint operator and K(t) is an operator subordinate to A(t). Time discretization is based on a three-level difference scheme, and space discretization is carried out by the Galerkin method. Under certain smoothness conditions on the function h(t), we obtain estimates for the convergence rate of the approximate solutions to the exact solution.     

Invariable generation of prosoluble groups

A group G is invariably generated by a subset S of G if G = 〈s^g(s) | s ∈ S〉 for each choice of g(s) ∈ G, s ∈ S. Answering two questions posed by Kantor, Lubotzky and Shalev in [8], we prove that the free prosoluble group of rank d ≥ 2 cannot be invariably generated by a finite set of elements, while the free solvable profinite group of rank d and derived length l is invariably generated by precisely l(d ? 1) + 1 elements.