The M/G/1 processor-sharing model: transient behavior

This paper deals with the M/G/1 model with processor-sharing service discipline. LetL ^* (t, x) denote the number of jobs present at timet whose attained service time is not greater thanx,x0, andV ₀(t,z) the sojourn time of a tagged job placed in the system at timet and requiringz units of service. Explicit analytical expressions are obtained for the joint distribution ofL ^*(t, ·) andV ⁰(t, ·) under various initial conditions in terms of the Laplace transform with respect tot. It is shown that for initial conditions of special kind (there is one job or none) the results can be expressed in a closed form.     

The Atiyah-Segal completion theorem for C*-algebras

We generalize the Atiyah-Segal completion theorem to C ^*-algebras as follows. Let A be a C ^*-algebra with a continuous action of the compact Lie group G. If K _* ^G (A) is finitely generated as an R(G)-module, or under other suitable restrictions, then the I(G)-adic completion K _* ^G (A) is isomorphic to RK _*([A C(EG)]^G), where RK _* is representable K-theory for - C ^*-algebras and EG is a classifying space for G. As a corollary, we show that if and are homotopic actions of G, and if K _*(C ^* (G,A,)) and K _*(C ^* (G,A,)) are finitely generated, then K _*(C ^*(G,A,))K_*(C ^* (G,A,)). We give examples to show that this isomorphism fails without the completions. However, we prove that this isomorphism does hold without the completions if the homotopy is required to be norm continuous.This work was partially supported by an NSF Graduate Fellowship and by an NSF Postdoctoral Fellowship.     

A trust region method for implicit orthogonal distance regression

Let a family of curves or surfaces be given in implicit form via the model equationf (x,)=0, wherex ^d and ^m is a parameter vector. We present a trust region algorithm for solving the problem:find a parameter vector ^* such that the contour f(x, ^*)=0is a best fit to given data {z_i} _i ⁿ =1 ^d in a least squares sense. Specifically, we seek ^* and {x _i ^* } _i ⁿ =1 such thatf (x _i ^* , ^*) = 0,i=1,...,n, and _i=1 ⁿ z _i –x _i ^* ₂ ² is minimal. The termorthogonal distance regression is used to describe such constrained nonlinear least squares problems.     

Convex Optimal Designs for Compound Polynomial Extrapolation

The extrapolation design problem for polynomial regression model on the design space [–1,1] is considered when the degree of the underlying polynomial model is with uncertainty. We investigate compound optimal extrapolation designs with two specific polynomial models, that is those with degrees |m, 2m}. We prove that to extrapolate at a point z, |z| > 1, the optimal convex combination of the two optimal extrapolation designs | _m ^* (z), _2m ^* (z)} for each model separately is a compound optimal extrapolation design to extrapolate at z. The results are applied to find the compound optimal discriminating designs for the two polynomial models with degree |m, 2m}, i.e., discriminating models by estimating the highest coefficient in each model. Finally, the relations between the compound optimal extrapolation design problem and certain nonlinear extremal problems for polynomials are worked out. It is shown that the solution of the compound optimal extrapolation design problem can be obtained by maximizing a (weighted) sum of two squared polynomials with degree m and 2m evaluated at the point z, |z| > 1, subject to the restriction that the sup-norm of the sum of squared polynomials is bounded.     

Continuous-Review Tracking Policies for Dynamic Control of Stochastic Networks

This paper is concerned with dynamic control of stochastic processing networks. Specifically, it follows the so called heavy traffic approach, where a Brownian approximating model is formulated, an associated Brownian optimal control problem is solved, the solution of which is then used to define an implementable policy for the original system. A major challenge is the step of policy translation from the Brownian to the discrete network. This paper addresses this problem by defining a general and easily implementable family of continuous-review tracking policies. Each such policy has the following structure: at each point in time t, the controller observes the current vector of queue lengths q and chooses (i) a target position z(q) of where the system should be at some point in the near future, say at time t+l, and (ii) an allocation vector v(q) that describes how to split the server's processing capacity amongst job classes in order to steer the state from q to z(q). Implementation of such policies involves the enforcement of small safety stocks. In the context of the heavy traffic approach, the solution of the approximating Brownian control problem is used in selecting the target state z(q). The proposed tracking policy is shown to be asymptotically optimal in the heavy traffic limiting regime, where the Brownian model approximation becomes valid, for multiclass queueing networks that admit orthant Brownian optimal controls; this is a form of pathwise, or greedy, optimality. Several extensions are discussed.     

A queueing network with a single cyclically roving server

A queueingnetwork that is served by asingle server in a cyclic order is analyzed in this paper. Customers arrive at the queues from outside the network according to independent Poisson processes. Upon completion of his service, a customer mayleave the network, berouted to another queue in the network orrejoin the same queue for another portion of service. The single server moves through the different queues of the network in a cyclic manner. Whenever the server arrives at a queue (polls the queue), he serves the waiting customers in that queue according to some service discipline. Both the gated and the exhaustive disciplines are considered. When moving from one queue to the next queue, the server incurs a switch-over period. This queueing network model has many applications in communication, computer, robotics and manufacturing systems. Examples include token rings, single-processor multi-task systems and others. For this model, we derive the generating function and the expected number of customers present in the network queues at arbitrary epochs, and compute the expected values of the delays observed by the customers. In addition, we derive the expected delay of customers that follow a specific route in the network, and we introduce pseudo-conservation laws for this network of queues.Summary of notation B_i, B _i ^* (s) service time of a customer at queue i and its LST - b_i, b_i ⁽²⁾ mean and second moment of B_i - R_i, R _i ^* (s) duration of switch-over period from queue i and its LST - r_i, r_i mean and second moment of R_i - r, r⁽²⁾ mean and second moment of _i ^N =₁R_i - _i external arrival rate of type-i customers - _i total arrival rate into queue i - _i utilization of queue i; _i=_i - system utilization _i ^N =_1i - c=E[C] the expected cycle length - X _i ^j number of customers in queue j when queue i is polled - X_i=X _i ⁱ number of customers residing in queue i when it is polled - f_i(j) - X _i ^* number of customers residing in queue i at an arbitrary moment - Y_i the duration of a service period of queue i - W_i,T_i the waiting time and sojourn time of an arbitary customer at queue i - F^*(z₁, z₂,..., z_N) GF of number of customers present at the queues at arbitrary moments - F_i(z₁, z₂,..., z_N) GF of number of customers present at the queues at polling instants of queue i - ¯F_i(z₁, z₂,...,z_N) GF of number of customers present at the queues at switching instants of queue i - V_i(z₁, z₂,..., z_N) GF of number of customers present at the queues at service initiation instants at queue i - ¯V_i(z₁,z₂,...,z_N) GF of number of customers present at the queues at service completion instants at queue i The work of this author was supported by the Bernstein Fund for the Promotion of Research and by the Fund for the Promotion of Research at the Technion.Part of this work was done while H. Levy was with AT&T Bell Laboratories.     

On Bures Distance and *-Algebraic Transition Probability between Inner Derived Positive Linear Forms over W*-Algebras

On a W^*-algebra M, for given two positive linear forms , M ₊ ^* and algebra elements a, b M, a variational expression for the Bures distance d _B( ^a , ^b ) between the inner derived positive linear forms ^a =(a _*·a) and ^b =(b ^*·b) is obtained. Along with the proof of the formula, also an earlier result of S. Gudder on noncommutative probability will be slighly extended. Also, the given expression of the Bures distance relates nicely to the system of seminorms proposed by D. Buchholz which occurs, along with the problem of estimating the so-called `weak intertwiners", in algebraic quantum field theory. In the last section, some optimization problem will be considered.     

A spectral mapping theorem for scalar-type spectral operators in locally convex spaces

LetT be a continuous scalar-type spectral operator defined on a quasi-complete locally convex spaceX, that is,T=fdP whereP is an equicontinuous spectral measure inX andf is aP-integrable function. It is shown that (T) is precisely the closedP-essential range of the functionf or equivalently, that (T) is equal to the support of the (unique) equicontinuous spectral measureQ ^* defined on the Borel sets of the extended complex plane ^* such thatQ ^*({})=0 andT=zdQ _*(z). This result is then used to prove a spectral mapping theorem; namely, thatg((T))=(g(T)) for anyQ ^*-integrable functiong: ^{* *} which is continuous on (T). This is an improvement on previous results of this type since it covers the case wheng((T))/{} is an unbounded set in a phenomenon which occurs often for continuous operatorsT defined in non-normable spacesX.     

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.     

Second-order properties of the loss probability inM/M/s/s +c systems

The Erlang loss function, which gives the steady state loss probability in anM/M/s/s system, has been extensively studied in the literature. In this paper, we look at the similar loss probability inM/M/s/s + c systems and an extension of it to nonintegral number of servers and queue capacity. We study its monotonicity properties. We show that the loss probability is convex in the queue capacity, and that it is convex in the traffic intensity if is below some ^* and concave if is greater that ^*, for a broad range of number of servers and queue capacities. We prove that the one-server loss system is the onlyM/M/s/s +c system for which the loss probability is concave in the traffic intensity in all its range.Research supported by Grant BD/645/90-RM from Junta Nacional de Investigação Científica e Tecnológica.On leave from: Departamento de Matemática, Instituto Superior Técnico, Av. Rovisco Pais, 1096 Lisboa Codex, Portugal.     

The Arveson Extension Theorem and coanalytic models

We develop techniques which allow one to describe in simple terms the set of operators on Hilbert space of the form M^{* ()} |M, where M is multiplication by z on a Hilbert space of analytic functions satisfying certain technical assumptions, M^{* ()} is the direct sum of a countably infinite number of copies of M^*, andM is invariant for M^{* ()}. One of the main ingredients in our technique is the Arveson Extension Theorem and this paper illustrates the great power and tractability of that theorem in a concrete setting.Research partially supported by NSF grant MCS 81-02518     

p-Frames in Separable Banach Spaces

Let X be a separable Banach space with dual X ^*. A countable family of elements {g _i }X ^* is a p-frame (1 p ) if the norm _X is equivalent to the ^p -norm of the sequence {g _i ()}. Without further assumptions, we prove that a p-frame allows every gX ^* to be represented as an unconditionally convergent series g=d _i g _i for coefficients {d _i } ^q , where 1/p+1/q=1. A p-frame {g _i } is not necessarily linear independent, so {g _i } is some kind of overcomplete basis for X ^*. We prove that a q-Riesz basis for X ^* is a p-frame for X and that the associated coefficient functionals {f _i } constitutes a p-Riesz basis allowing us to expand every fX (respectively gX ^*) as f=g _i (f)f _i (respectively g=g(f _i )g _i ). In the general case of a p-frame such expansions are only possible under extra assumptions.     

A note on sub-multiplicative norms

Summary IfX is a finite-dimensional linear space andL(X) the linear space of linear operators onX thenL(X) may be represented asXX ^*. IfE={e ₁, ...,e _n } is a basis forX and e _j y _j ^* is a typical element ofXX ^*, then norms can be introduced onL(X) in the form y _j ^* e _j . Given that the norm onX isE-absolute we derive a necessary and sufficient condition for the norm onL(X) to be submultiplicative.     

Maximal order for quadratures usingn evaluations

The problem is to find approximationsI (f; h) to the integralI(f; h)= ₀ ^h f. Such an approximation has local orderp ifI(f; h)–I (f; h)=O(h ^p ) ash0. Let(n) denote the maximal local order possible for a method usingn evaluations of a function or its derivatives. We show that (n)=2n+1 if the information used is Hermitian. This is conjectured to be true in general. The conjecture is established for all methods using three or fewer evaluations.This research was supported in part by the National Science Foundation under Grant MCS75-222-55 and the Office of Naval Research under Contract N00014-76-C-0370, NR 044-422. Numerical results reported in this paper were obtained through the computing facilities of the University of Maryland.     

Linear complementarity problems solvable by A single linear program

It is shown that the linear complementarity problem of finding az inR ⁿ such thatMz + q 0, z 0 andz ^T (Mz + q) = 0 can be solved by a single linear program in some important special cases including those whenM or its inverse is a Z-matrix, that is a real square matrix with nonpositive off-diagonal elements. As a consequence certain problems in mechanics, certain problems of finding the least element of a polyhedral set and certain quadratic programming problems, can each be solved by a single linear program.Research supported by NSF Grant GJ 35292.     

Some classes of matrices in linear complementarity theory

The linear complementarity problem is the problem of finding solutionsw, z tow = q + Mz, w0,z0, andw ^T z=0, whereq is ann-dimensional constant column, andM is a given square matrix of dimensionn. In this paper, the author introduces a class of matrices such that for anyM in this class a solution to the above problem exists for all feasibleq, and such that Lemke's algorithm will yield a solution or demonstrate infeasibility. This class is a refinement of that introduced and characterized by Eaves. It is also shown that for someM in this class, there is an even number of solutions for all nondegenerateq, and that matrices for general quadratic programs and matrices for polymatrix games nicely relate to these matrices.Research partially supported by National Science Foundation Grant NSF-GP-15031.     

Algebras of sets generating non-barrelled spaces

IfA is a -algebra on setX, thenl ₀ (X,A) is a barrelled space of class ₀. IfA is an algebra, there are conditions which imply thatl ₀ (X,A) is suprabarelled. Here, wheneverA is an algebra, we give conditions forl ₀ (X,A) to be not barrelled which are related with the existence of non-trivial convergent sequences.Supported in part by DGICYT, project PB91-0407 and by the Institució Valenciana d'Estudis i Investigació, project 023.     

Total flux estimates for a finite element approximation of the Dirichlet problem using the boundary penalty method

Summary This paper considers a fully practical piecewise linear finite element approximation of the Dirichlet problem for a second order self-adjoint elliptic equation,Au=f, in a smooth region< ⁿ (n=2 or 3) by the boundary penalty method. Using an unfitted mesh; that is ^h , an approximation of with dist (, ^h )Ch ² is not in general a union of elements; and assuminguH ⁴ () we show that one can recover the total flux across a segment of the boundary of with an error ofO(h ²⁾. We use these results to study a fully practical piecewise linear finite element approximation of an elliptic equation by the boundary penalty method when the prescribed data on part of the boundary is the total flux.Supported by a SERC research studentship     

On the number of solutions to a class of linear complementarity problems

In this note, we consider the linear complementarity problemw = Mz + q, w 0, z 0, w ^T z = 0, when all principal minors ofM are negative. We show that for such a problem for anyq, there are either 0, 1, 2, or 3 solutions. Also, a set of sufficiency conditions for uniqueness is stated.The work of both authors is partially supported by a grant from the National Science Foundation, MCS 77-03472.     

Left linear theories — A generalization of module theory

In this paper we introduce left linear theories of exponentN (a set) on the setL as mapsL ×L ^N (l, ) l · L such that for alll L and , L ^N the relation (l · ) =l( · ) holds, where · L ^N is given by ( · )(i) = (i),i N. We assume thatL has a unit, that is an element L ^N withl · =l, for alll L, and · = , for all L ^N . Next, left (resp. right)L-modules andL-M-bimodules and their homomorphisms are defined and lead to categoriesL-Mod, Mod-L, andL-M-Mod. These categories are algebraic categories and their free objects are described explicitly. Finally, Hom(X, Y) andX Y are introduced and their properties are investigated.Herrn Professor Dr. D. Pumplün zum 60. Geburtstag gewidmet