Approximations for the delay probability in the M/G/s queue

This paper develops approximations for the delay probability in an M/G/s queue. For M/G/s queues, it has been well known that the delay probability in the M/M/s queue, i.e., the Erlang delay formula, is usually a good approximation for other service-time distributions. By using an excellent approximation for the mean waiting time in the M/G/s queue, we provide more accurate approximations of the delay probability for small values of s. To test the quality of our approximations, we compare them with the exact value and the Erlang delay formula for some particular cases.     

Criteria for Invertibility of Elements in Associates

We continue the investigation of invertible elements in associates, i.e., in (n + 1)-ary groupoids that are (i, j)-associative for all i j (mod s), where s is a divisor of a number n. For s = 1, an arbitrary associate is a semigroup. We establish two new criteria for the invertibility of elements, which generalize the results obtained earlier, and formulate corollaries for (n + 1)-groups and polyagroups, i.e., quasigroup associates.     

Arc-disjoint in-trees in directed graphs

Given a directed graph D = (V,A) with a set of d specified vertices S = {s ₁,…, s _d } ⊆ V and a function f: S → ℕ where ℕ denotes the set of natural numbers, we present a necessary and sufficient condition such that there exist Σ _i=1 ^d f(s _i ) arc-disjoint in-trees denoted by T _i,1,T _i,2,…, for every i = 1,…,d such that T _i,1,…, are rooted at s _i and each T _i,j spans the vertices from which s _i is reachable. This generalizes the result of Edmonds [2], i.e., the necessary and sufficient condition that for a directed graph D=(V,A) with a specified vertex s∈V, there are k arc-disjoint in-trees rooted at s each of which spans V. Furthermore, we extend another characterization of packing in-trees of Edmonds [1] to the one in our case. Supported by JSPS Research Fellowships for Young Scientists. Supported by the project New Horizons in Computing, Grand-in-Aid for Scientific Research on Priority Areas, MEXT Japan.     

Stability of generalized monotone maps with respect to their characterizations

We show that the known types of generalized monotone maps are not stable with respect to their characterizations (i.e. the characterizations are not maintained if an arbitrary map of this type is disturbed by an element with sufficiently small norm) and introduce s-quasimonotone maps, which are stable with respect to their characterization. For gradient maps, s-quasimonotonicity is related to s-quasiconvexity (introduced by Phu in Optimization, 38, 1996) of the underlying function. A necessary and sufficient condition for a univariate polynomial to be s-quasimonotone is given. Furthermore, some stability properties of s-quasiconvex functions are presented.     

Disjoint skolem sequences and related disjoint structures

A Skolem sequence of order n is a sequence S = (s₁, s₂…, s²ⁿ) of 2n integers satisfying the following conditions: (1) for every k ∈ {1, 2,… n} there exist exactly two elements s_i,S_j such that S_i = S_j = k; (2) If s_i = s_j = k,i < j then j ? i = k. In this article we show the existence of disjoint Skolem, disjoint hooked Skolem, and disjoint near-Skolem sequences. Then we apply these concepts to the existence problems of disjoint cyclic Steiner and Mendelsohn triple systems and the existence of disjoint 1-covering designs. © 1993 John Wiley & Sons, Inc.     

Singular Probability Distributions and Fractal Properties of Sets of Real Numbers Defined by the Asymptotic Frequencies of Their <Emphasis Type="Italic">s</Emphasis>-Adic Digits

Properties of the set T _s of “particularly nonnormal numbers” of the unit interval are studied in detail (T _s consists of real numbers x some of whose s-adic digits have the asymptotic frequencies in the nonterminating s-adic expansion of x, and some do not). It is proved that the set T _s is residual in the topological sense (i.e., it is of the first Baire category) and is generic in the sense of fractal geometry (T _s is a superfractal set, i.e., its Hausdorff-Besicovitch dimension is equal to 1). A topological and fractal classification of sets of real numbers via analysis of asymptotic frequencies of digits in their s-adic expansions is presented. Dedicated to V. S. Korolyuk on occasion of his 80th birthday __________ Published in Ukrains'kyi Matematychnyi Zhurnal, Vol. 57, No. 9, pp. 1163–1170, September, 2005.     

Extended skolem sequences

A k-extended Skolem sequence of order n is an integer sequence (s₁, s₂,…, s_2n+1) in which s_k = 0 and for each j ? {1,…,n}, there exists a unique i ? {1,…, 2n} such that s_i = s_i+j = j. We show that such a sequence exists if and only if either 1) k is odd and n ≡ 0 or 1 (mod 4) or (2) k is even and n ≡ 2 or 3 (mod 4). The same conditions are also shown to be necessary and sufficient for the existence of excess Skolem sequences. Finally, we use extended Skolem sequences to construct maximal cyclic partial triple systems. © 1995 John Wiley & Sons, Inc.     

A note on Freiman models in Heisenberg groups

Green and Ruzsa recently proved that for any s ≥ 2, any small squaring set A in a (multiplicative) abelian group, i.e., |A·A| < K|A|, has a Freiman smodel: it means that there exists a group G and a Freiman s-isomorphism from A into G such that |G| < f (s,K)|A|.     

Generalization of convergence conditions for a restarted GMRES

We consider the GMRES(s), i.e. the restarted GMRES with restart s for the solution of linear systems Ax = b with complex coefficient matrices. It is well known that the GMRES(s) applied on a real system is convergent if the symmetric part of the matrix A is positive definite. This paper introduces sufficient conditions implying the convergence of a restarted GMRES for a more general class of non‐Hermitian matrices. For real systems these conditions generalize the known result initiated as above. The discussion after the main theorem concentrates on the question of how to find an integer j such that the GMRES(s) converges for all s ≥ j. Additional properties of GMRES obtained by derivation of the main theorem are presented in the last section. Copyright © 2000 John Wiley & Sons, Ltd.     

Structural interpretation and derivation of necessary and sufficient conditions for delay moments in FIFO multiserver queues

Scheller-Wolf [12] established necessary and sufficient conditions for finite stationary delay moments in stable FIFO GI/GI/s queues that incorporate the interaction between service time distribution, traffic intensity (ρ) and the number of servers in the queue. These conditions can be used to show that when the service time has finite first but infinite αth moment, s slow servers can give lower delays than one fast server. In this paper, we derive an alternative derivation of these moment results: Both upper bounds, that serve as sufficient conditions, and lower bounds, that serve as necessary conditions are presented. In addition, we extend the class of service time distributions for which the necessary conditions are valid. Our new derivations provide a structural interpretation of the moment bounds, giving intuition into their origin: We show that FIFO GI/GI/s delay can be represented as the minimum of (s − k) i.i.d. GI/GI/1 delays, when ρ satisfies k < ρ < k+1. AMS Subject Classification 60K25     

Independent trees in graphs

IfG is a finite undirected graph ands is a vertex ofG, then two spanning treesT ₁ andT ₂ inG are calleds — independent if for each vertexx inG the paths fromx tos inT ₁ andT ₂ are openly disjoint. It is known that the following statement is true fork3: IfG isk-connected, then there arek pairwises — independent spanning, trees inG. As a main result we show that this statement is also true fork=4 if we restrict ourselves to planar graphs. Moreover we consider similar statements for weaklys — independent spanning trees (i.e., the tree paths from a vertex tos are edge disjoint) and for directed graphs.     

An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths

In this paper, we consider the evacuation problem in a network which consists of a directed graph with capacities and transit times on its arcs. This problem can be solved by the algorithm of Hoppe and Tardos [B. Hoppe, É. Tardos, The quickest transshipment problem, Math. Oper. Res. 25(1) (2000) 36–62] in polynomial time. However their running time is high-order polynomial, and hence is not practical in general. Thus, it is necessary to devise a faster algorithm for a tractable and practically useful subclass of this problem. In this paper, we consider a network with a sink s such that (i) for each vertex v≠s the sum of the transit times of arcs on any path from v to s takes the same value, and (ii) for each vertex v≠s the minimum v-s cut is determined by the arcs incident to s whose tails are reachable from v. This class of networks is a generalization of grid networks studied in the paper [N. Kamiyama, N. Katoh, A. Takizawa, An efficient algorithm for evacuation problem in dynamic network flows with uniform arc capacity, IEICE Trans. Infrom. Syst. E89-D (8) (2006) 2372–2379]. We propose an efficient algorithm for this network problem.     

A Structure Preserving Generalization of Independence,Domination and Irredundance

Abstract

The now famous inequality chain ir≤γ≤i≤β ≤ Γ ≤ IR, where ir and IR denote the lower and upper irredundance numbers of a graph, γ and Γ the lower and upper domination numbers, i the independent domination number and β the independence number of a graph, may be seen as the culmination of a process by which we start with independence (a hereditary property of vertex sets); we characterize maximal independence by domination (a superhereditary property of vertex sets), and then characterize minimal domination by irredundance (again a hereditary property). In this paper we generalize independent, dominating and irredundant sets of a graph G to what we will call s-dominating, s-independent and s-irredundant functions (for s a positive integer), which are functions of the type f : V (G) → N, in such a way that the maximal 1-independent, the minimal 1- dominating and the maximal 1-irredundant functions are the characteristic functions of the maximal independent, the minimal dominating and the maximal irredundant sets of G respectively. In addition, we would want to preserve those properties of and relationships between independence, domination and irredundance needed to extend the inequality chain ir≤γ≤i≤β ≤ Γ ≤ IR to one for s-dominating, s-independent and s-irredundant functions by a process similar to that described above.     

On some invariants in numerical semigroups and estimations of the order bound

Let S={s _i } _i∈??? be a numerical semigroup. For s _i ∈S, let ν(s _i ) denote the number of pairs (s _i ?s _j ,s _j )∈S ². When S is the Weierstrass semigroup of a family $\{\mathcal{C}_{i}\}_{i\in\mathbb{N}}Let S={s _i } _i∈ℕ⊆ℕ be a numerical semigroup. For s _i ∈S, let ν(s _i ) denote the number of pairs (s _i −s _j ,s _j )∈S ². When S is the Weierstrass semigroup of a family {C_i}_{i ? \mathbbN}\{\mathcal{C}_{i}\}_{i\in\mathbb{N}} of one-point algebraic-geometric codes, a good bound for the minimum distance of the code C_i\mathcal{C}_{i} is the Feng and Rao order bound d _ORD (C _i ). It is well-known that there exists an integer m such that d _ORD (C _i )=ν(s _i+1) for each i≥m. By way of some suitable parameters related to the semigroup S, we find upper bounds for m and we evaluate m exactly in many cases. Further we conjecture a lower bound for m and we prove it in several classes of semigroups.     

Monotonicity and supermodularity results for the Erlang loss system

For the Erlang loss system with s servers and offered load a, we show that: (i) the load carried by the last server is strictly increasing in a; (ii) the carried load of the whole system is strictly supermodular on {(s,a)|s=0,1,… and a>0}.     

No large sets which can be translated away from every Marczewski null set

There is no set of size continuum which is “s₀-shiftable”, i. e., which can be translated away from every set in the Marczewski ideal s₀ (where a set of reals is in s₀ if for every perfect set there is a perfect subset disjoint from it). (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Solutions of one dimensional steady flow of dusty gas in an anholonomic co-ordinate system

We study the geometry of one-dimensional (i.e. unidirectional) incompressible steady dusty gas flow in Frenet frame field system (anholonomic co-ordinate system) by assuming the paths of velocities of dust and fluid phases to be in the same direction. The intrinsic decompositions of the basic equation are carried out and solutions for velocity of fluid phaseu, velocity of dust phasev and pressure of the fluid are obtained in terms of spin coefficients, i.e. geometrical parameters like curvatures and torsions of the streamline when the flow is

On universality of the Lerch zeta-function

It is known that the Lerch zeta-function L(λ, α, s) with transcendental parameter α is universal in the Voronin sense; i.e., every analytic function can be approximated by shifts L(λ, α, s + iτ) uniformly on compact subsets of some region. In this paper, the universality for some classes of composite functions F(L(λ, α, s)) is obtained. In particular, general theorems imply the universality of the functions sin(L(λ, α, s)) and sinh(L(λ, α, s)).