关于两类M/M/1排队系统的渐进稳定性

讨论了两类M/M/1排队系统的关系,通过较简单的方法得到了系统的稳态解是渐进稳定的.     

Measure differential equation with a nonlinear growth/decay term

In this paper we obtain an existence result for a measure differential equation with a nonlinear growth/decay term that may change the sign. This generalizes the model setting proposed by Piccoli and Rossi to applications in life sciences describing for example birth/death processes of individuals. The proof requires a modification of the approximating schemes introduced in the original paper of Piccoli and Rossi. The new scheme combines model discretization with an exponential solution of the nonlinear growth/decay term, and hence, preserves nonnegativity of the measure. Furthermore, we formulate a new analytic condition on the measure vector field, which substantially simplifies the previous proof of continuity of solutions with respect to initial data while simultaneously generalizing the former condition formulated by Piccoli and Rossi.     

Tail asymptotics for the fundamental period in the MAP/G/1 queue

This paper studies the tail behavior of the fundamental period in the MAP/G/1 queue. We prove that if the service time distribution has a regularly varying tail, then the fundamental period distribution in the MAP/G/1 queue has also regularly varying tail, and vice versa, by finding an explicit expression for the asymptotics of the tail of the fundamental period in terms of the tail of the service time distribution. Our main result with the matrix analytic proof is a natural extension of the result in (de Meyer and Teugels, J. Appl. Probab. 17: 802–813, 1980) on the M/G/1 queue where techniques rely heavily on analytic expressions of relevant functions. I.-S. Wee’s research was supported by the Korea Research Foundation Grant KRF 2003-070-00008.     

A Revision of the Proof of the Kepler Conjecture

The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. The original proof, announced in 1998 and published in 2006, is long and complex. The process of revision and review did not end with the publication of the proof. This article summarizes the current status of a long-term initiative to reorganize the original proof into a more transparent form and to provide a greater level of certification of the correctness of the computer code and other details of the proof. A final part of this article lists errata in the original proof of the Kepler conjecture.     

On the value of Gaussian sums

Gauss' original proof for the value of Gaussian sums relies on a summation of Gaussian polynomials. It is demonstrated how his proof can be simplified by using a different summation of Gaussian polynomials.     

A new proof of the two weight norm inequality for the one-sided fractional maximal operator

We give a new proof of the two weight norm inequality for the one-sided, fractional maximal operator, , simplifying the original proof of Martín-Reyes and de la Torre.

     

A sample-path approach to the optimality of echelon order-up-to policies in serial inventory systems

We present a new proof of the optimality of echelon order-up-to policies in serial inventory systems, first proved by Clark and Scarf. Our proof is based on a sample-path analysis as opposed to the original proof based on dynamic programming induction.     

On the complete monotonicity of the waiting time density in some GI/G/k systems

In this note the complete monotonicity of the waiting time density in GI/G/k queues is proved under the assumption that the service time density is completely monotone. This is an extension of Keilson's [3] result for M/G/1 queues. We also provide another proof of the result that complete monotonicity is preserved by geometric compounding.     

A simplified proof of the real-time recognizability of palindromes on turing machines

A comparatively short proof is given of the recognizability of palindromes in real time on multitape Turing machines. It is based on the same idea as the original proof by the author, and on Z. Galil's idea for simplifying the proof by using the Fischer-Paterson algorithm for finding all symmetric suffixes in linear time.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 68, pp. 123–139, 1977.     

On Mayfield’s stability proof for the discretized transparent boundary condition for the parabolic equation

Mayfield’s numerical implementation of transparent boundary condition for the Schrödinger-type parabolic equations is revisited. An inaccuracy in the original proof of the conditional stability for the resulting scheme is pointed out. The highly unusual and impressive original result is reestablished and a new proof is presented. Some further remarks and estimates on the instability which occurs when the Mayfield condition is violated are given.     

Probabilistic proof of the interchangeability of ./M/1 queues in series

Given a finite number of empty ./M/1 queues, let customers arrive according to an arbitrary arrival process and be served at each queue exactly once, in some fixed order. The process of departing customers from the network has the same law, whatever the order in which the queues are visited. This remarkable result, due to R. Weber [4], is given a simple probabilistic proof.     

A correction to and improvement of ‘Strong approximations of some biometric estimates under random censorship’

Summary In the proof of the main result of the original paper there is an error. Instead of repairing that proof to get just the original result, at the critical spot we improve the proof and obtain a much better result. In particular, we approximate the product-limit and empirical cumulative hazard processes by suitable copies of the corresponding limiting Gaussian processes with rates of approximation that on appropriate fixed half lines reduce to the rates of Komlós, Major and Tusnády for the uncensored empirical process.     

A direct proof of the five element basis theorem

We present a direct proof of the consistency of the existence of a five element basis for the uncountable linear orders. Our argument is based on the approach of König, Larson, Moore and Veličković and simplifies the original proof of Moore.     

Stability of the rarefaction wave for a coupled compressible Navier‐Stokes/Allen‐Cahn system

In this paper, we are concerned with the large time behavior of solutions to the Cauchy problem for the one dimensional Navier‐Stokes/Allen‐Cahn system. Motivated by the relationship between the Navier‐Stokes/Allen‐Cahn system and the Navier‐Stokes system, we can prove that the solutions to the one‐dimensional compressible Navier‐Stokes/Allen‐Cahn system tend time‐asymptotically to the rarefaction wave, where the strength of the rarefaction wave is not required to be small. The proof is mainly based on a basic energy method.     

A New Proof of the Protasov-Voynov Theorem on Semigroups of Nonnegative Matrices

A new combinatorial proof of the Protasov-Voynov theorem on the structure of irreducible semigroups of nonnegative matrices is proposed. The original proof was obtained by geometric methods.

     

Approximation of multiserver retrial queues by means of generalized truncated models

It is well-known that an analytical solution of multiserver retrial queues is difficult and does not lead to numerical implementation. Thus, many papers approximate the original intractable system by the so-called generalized truncated systems which are simpler and converge to the original model. Most papers assume heuristically the convergence but do not provide a rigorous mathematical proof. In this paper, we present a proof based on a synchronization procedure. To this end, we concentrate on theM/M/c retrial queue and the approximation developed by Neuts and Rao (1990). However, the methodology can be employed to establish the convergence of several generalized truncated systems and a variety of Markovian multiserver retrial queues. J.R. Artalejo thanks the support received from DGES 98-0837.     

A geometric proof of the definability of Hausdorff limits

We give a geometric proof of the following well-established theorem for o-minimal expansions of the real field: the Hausdorff limits of a compact, definable family of sets are definable. While previous proofs of this fact relied on the model-theoretic compactness theorem, our proof explicitly describes the family of all Hausdorff limits in terms of the original family.     

On the mean curvatures sharp estimates of hypersurfaces

Sharp estimates for the mean curvatures of hypersurfaces in Riemannian manifolds are known from the works of Jorge-Xavier ^[3], Markvorsen ^[6] and Vlachos ^[11]. We first give a simplified proof of these estimates. This proof shows that a similar original result holds for hypersurfaces in Einstein manifolds which are warped product of by Ricci-flat manifolds.     

The M/M/c with critical jobs

We consider theM/M/c queue, where customers transfer to a critical state when their queueing (sojourn) time exceeds a random time. Lower and upper bounds for the distribution of the number of critical jobs are derived from two modifications of the original system. The two modified systems can be efficiently solved. Numerical calculations indicate the power of the approach.