Asymptotic Behavior of Loss Probability in GI/M/1/K Queue as K Tends to Infinity

We obtain an asymptotic behavior of the loss probability for the GI/M/1/K queue as K for cases of <1, >1 and =1.     

Asymptotic Expansions for the Congestion Period for the M/M/∞ Queue

We consider the M/M/ queue with arrival rate , service rate and traffic intensity =/. We analyze the first passage distribution of the time the number of customers N(t) reaches the level c, starting from N(0)=m>c. If m=c+1 we refer to this time period as the congestion period above the level c. We give detailed asymptotic expansions for the distribution of this first passage time for , various ranges of m and c, and several different time scales. Numerical studies back up the asymptotic results.     

Formal Dimension for Semisimple Symmetric Spaces

If G is a semisimple Lie group and (, ) an irreducible unitary representation of G with square integrable matrix coefficients, then there exists a number d() such that

Numerical approximations for the steady‐state waiting times in a GI/G/1 queue

This paper focuses on easily computable numerical approximations for the distribution and moments of the steadystate waiting times in a stable GI/G/1 queue. The approximation methodology is based on the theory of Fredholm integral equations and involves solving a linear system of equations. Numerical experimentation for various M/G/1 and GI/M/1 queues reveals that the methodology results in estimates for the mean and variance of waiting times within ±1% of the corresponding exact values. Comparisons with competing approaches establish that our methodology is not only more accurate, but also more amenable to obtaining waiting time approximations from the operational data. Approximations are also obtained for the distributions of steadystate idle times and interdeparture times. The approximations presented in this paper are intended to be useful in roughcut analysis and design of manufacturing, telecommunications, and computer systems as well as in the verification of the accuracies of inequalities, bounds, and approximations.     

Operating characteristics of MX/G/1 queue with N-policy

We consider aM ^X/G/1 queueing system withN-policy. The server is turned off as soon as the system empties. When the queue length reaches or exceeds a predetermined valueN (threshold), the server is turned on and begins to serve the customers. We place our emphasis on understanding the operational characteristics of the queueing system. One of our findings is that the system size is the sum of two independent random variables: one has thePGF of the stationary system size of theM ^X/G/1 queueing system withoutN-policy and the other one has the probability generating function _j=0 ^N=1 _j z ^j/ _j=0 ^N=1 _j , in which _j is the probability that the system state stays atj before reaching or exceedingN during an idle period. Using this interpretation of the system size distribution, we determine the optimal thresholdN under a linear cost structure.     

Some mildly wild circles in Sn arising from algebraic K-Theory

We study wild embeddings of S ¹ in S ⁿ which are tame in a sense introduced by Quinn. We show that if is a finitely presented group with H ₁()=H ₂()=0, then any finiteness obstruction K ₀() can be realized on the complement of such an embedded S ¹. We also realize trivially symmetric K _–1() obstructions on the complements of such embeddings. For trivially symmetric , the embeddings constructed are shown to be isotopy homogeneous.     

Analysis of a class of fractional programming problems

We propose a solution strategy for fractional programming problems of the form max _xx g(x)/ (u(x)), where the function satisfies certain convexity conditions. It is shown that subject to these conditions optimal solutions to this problem can be obtained from the solution of the problem max _xx g(x) + u(x), where is an exogenous parameter. The proposed strategy combines fractional programming andc-programming techniques. A maximal mean-standard deviation ratio problem is solved to illustrate the strategy in action.     

A finite characterization ofK-matrices in dimensions less than four

The class of realn × n matricesM, known asK-matrices, for which the linear complementarity problemw – Mz = q, w 0, z 0, w ^T z =0 has a solution wheneverw – Mz =q, w 0, z 0 has a solution is characterized for dimensionsn <4. The characterization is finite and practical. Several necessary conditions, sufficient conditions, and counterexamples pertaining toK-matrices are also given. A finite characterization of completelyK-matrices (K-matrices all of whose principal submatrices are alsoK-matrices) is proved for dimensions <4.Partially supported by NSF Grant MCS-8207217.Research partially supported by NSF Grant No. ECS-8401081.     

The Coordinatewise Uniformly Kadec–Klee Property in Some Banach Spaces

We introduce a new property UKK _c for a Banach space and show for an Orlicz sequence space the following: UKK _c H _{c 2}.     

Computations of K- and L-Theory of Cocompact Planar Groups

The verification of the isomorphism conjectures of Baum and Connes and Farrell and Jones for certain classes of groups is used to compute the algebraic K- and L-theory and the topological K-theory of cocompact planar groups (=cocompact N.E.C-groups) and of groups G appearing in an extension where is a finite group and the conjugation -action on ⁿ is free outside . These computations apply, for instance, to two-dimensional crystallographic groups and cocompact Fuchsian groups.     

Infinitesimal obstructions to weakly mixing

Let ^t be the flow (parametrized with respect to arc length) of a smooth unit vector field v on a closed Riemannian manifold M ⁿ , whose orbits are geodesics. Then the (n-1)-plane field normal to v, v, is invariant under d ^t and, for each x M, we define a smooth real function _x (t) : (1 + _i (t)), where the _i(t) are the eigenvalues of AA ^T, A being the matrix (with respect to orthonormal bases) of the non-singular linear map d^2t , restricted to v at the point _x ^-t M ⁿ.Among other things, we prove the Theorem (Theorem II, below). Assume v is also volume preserving and that _x ^' (t) 0 for all x M and real t; then, if _x ^t : M M is weakly missng for some t, it is necessary that vx 0 at all x M.     

The Eta Invariant and the Connective K-Theory of the Classifying Space for Cyclic 2 Groups

We use the eta invariant to study the connective K-theory groups ko _m (B ) of the classifying space for the cyclic group where - 2 2.     

Some <Emphasis Type="Italic">L</Emphasis>-Function of a Regular Covering of a Graph

Let ₁:KH, ₂:HG and ₂₁:KG be three finite regular coverings of graphs, and let be a representation of the covering transformation group of ₁. We show that the (Bartholdi type) L-function of G associated to the representation of the covering transformation group of ₂₁ induced from is equal to that of H associated to by means of ordinary voltage assignments.Acknowledgments. We would like to thank the referee for many valuable comments and suggestions. This is partially supported by Grant-in-Aid for Science Research (C).Final version received: February 16, 2004     

The Higher K-Theory of Real Curves

If X is a smooth curve defined over the real numbers , we show that K _n (X) is the sum of a divisible group and a finite elementary Abelian 2-group when n 2. We determine the torsion subgroup of K _n (X), which is a finite sum of copies of and 2, only depending on the topological invariants of X() and X(), and show that (for n 2) these torsion subgroups are periodic of order 8.     

Range of the posterior probability of an interval for priors with unimodality preserving contaminations

Range of the posterior probability of an interval over the -contamination class ={=(1–)₀+q:qQ} is derived. Here, ₀ is the elicited prior which is assumed unimodal, is the amount of uncertainty in ₀, andQ is the set of all probability densitiesq for which =(1–)₀+q is unimodal with the same mode as that of ₀. We show that the sup (resp. inf) of the posterior probability of an interval is attained by a prior which is equal to (1–)₀ except in one interval (resp. two disjoint intervals) where it is constant.     

Geometric modules and Quinn homology theory

LetR be a ring with unit and invariant basis property. In [1], the authors define a functorK(_;R):TOP/LIP _c-LPEP by combining the open cone construction of [7] with a geometric module construction and show this functor is a homology theory. This paper shows that if attention is restricted to objects TOP/LIP _c with a homotopy colimit structure, then the functorK(_;R) is a Quinn homology theory, In particular, for each having a homotopy colimit structure,K(;R) is a homotopy colimit in the category of -spectra. Furthermore, the constituent spectra of this homotopy colimit are obtained naturally from the fibres of .Partially supported by the National Science Foundation under grant number DMS88-03148.Partially supported by the SNF (Denmark) under grant number 11-7792.     

Assembly maps,K-theory, and hyperbolic groups

Following Connes and Moscovici, we show that the Baum-Connes assembly map forK _*(C*v) is rationally injective when is word-hyperbolic, implying the Equivariant Novikov conjecture for such groups. Using this result in topologicalK-theory and Borel-Karoubi regulators, we also show that the corresponding generalized assembly map in algebraicK-theory is rationally injective.     

Waterman classes and triangular sums of double Fourier series

Let ^a ={nln^a (n+1)}, where a R. The following results are established: For every &fnof ^a BV ((- ]²), the triangular partial sums of its Fourier series are uniformly bounded if a = -1, and converge everywhere if a < -1.For every a>0, there exists &fnof ^a BV ((- ]²) such that the triangular partial sums of its Fourier series are unbounded at the point (0;0).     

The Remaining Service Time upon Reaching a High Level in M/G/1 Queues

The distribution of the remaining service time upon reaching some target level in an M/G/1 queue is of theoretical as well as practical interest. In general, this distribution depends on the initial level as well as on the target level, say, B. Two initial levels are of particular interest, namely, level 1 (i.e., upon arrival to an empty system) and level B–1 (i.e., upon departure at the target level).In this paper, we consider a busy cycle and show that the remaining service time distribution, upon reaching a high level B due to an arrival, converges to a limiting distribution for B. We determine this asymptotic distribution upon the first hit (i.e., starting with an arrival to an empty system) and upon subsequent hits (i.e., starting with a departure at the target) into a high target level B. The form of the limiting (asymptotic) distribution of the remaining service time depends on whether the system is stable or not. The asymptotic analysis in this paper also enables us to obtain good analytical approximations of interesting quantities associated with rare events, such as overflow probabilities.     

K1 for Triangulated Categories

For a small triangulated category we describe Neeman's K ₁ in terms of generators and relations. This result extends to triangulated categories Sherman's and Nenashev's results on Quillen's K ₁ for exact categories. The generators are double distinguished triangles, and the relations are the diagonal double distinguished triangles and the relations associated to the so-called coherent 3×3 double diagrams.