The busy period of an M/M/1 queue with balking and reneging

It has been shown by (R.O. Al-Seedy, A.A. El-Sherbiny, S.A. El-Shehawy, S.I. Ammar, Transient solution of the M/M/c queue with balking and reneging, Comput. Math. Appl. 57 (2009) 1280–1285) that a generating function technique can be successfully applied to derive the transient solution for an M/M/c queueing system. In this paper, we further illustrate how this technique can be used to obtain the busy period density function of an M/M/1 queue with balking and reneging. Finally, numerical calculations are presented.     

Analysis of the M/Gi/1 →/M/1 queueing model

An M/GI/1 queueing system is in series with a unit with negative exponential service times and infinite waiting room capacity. We determine a closed form expression for the generating function of the joint queue length distribution in steady state. This result is obtained via the solution of a new type of functional equation in two variables.     

The Fourier-series method for inverting transforms of probability distributions

This paper reviews the Fourier-series method for calculating cumulative distribution functions (cdf's) and probability mass functions (pmf's) by numerically inverting characteristic functions, Laplace transforms and generating functions. Some variants of the Fourier-series method are remarkably easy to use, requiring programs of less than fifty lines. The Fourier-series method can be interpreted as numerically integrating a standard inversion integral by means of the trapezoidal rule. The same formula is obtained by using the Fourier series of an associated periodic function constructed by aliasing; this explains the name of the method. This Fourier analysis applies to the inversion problem because the Fourier coefficients are just values of the transform. The mathematical centerpiece of the Fourier-series method is the Poisson summation formula, which identifies the discretization error associated with the trapezoidal rule and thus helps bound it. The greatest difficulty is approximately calculating the infinite series obtained from the inversion integral. Within this framework, lattice cdf's can be calculated from generating functions by finite sums without truncation. For other cdf's, an appropriate truncation of the infinite series can be determined from the transform based on estimates or bounds. For Laplace transforms, the numerical integration can be made to produce a nearly alternating series, so that the convergence can be accelerated by techniques such as Euler summation. Alternatively, the cdf can be perturbed slightly by convolution smoothing or windowing to produce a truncation error bound independent of the original cdf. Although error bounds can be determined, an effective approach is to use two different methods without elaborate error analysis. For this purpose, we also describe two methods for inverting Laplace transforms based on the Post-Widder inversion formula. The overall procedure is illustrated by several queueing examples.     

Fast solution of unsymmetric banded Toeplitz systems by means of spectral factorizations and Woodbury's formula

A fast algorithm for solving systems of linear equations with banded Toeplitz matrices is studied. An important step in the algorithm is a novel method for the spectral factorization of the generating function associated with the Toeplitz matrix. The spectral factorization is extracted from the right deflating subspaces corresponding to the eigenvalues inside and outside the open unit disk of a companion matrix pencil constructed from the coefficients of the generating function. The factorization is followed by the Woodbury inversion formula and solution of several banded triangular systems. Stability of the algorithm is discussed and its performance is demonstrated by numerical experiments. Copyright © 2012 John Wiley & Sons, Ltd.     

On certain generating functions in positive characteristic

We present new methods for the study of a class of generating functions introduced by the second author which carry some formal similarities with the Hurwitz zeta function. We prove functional identities which establish an explicit connection with certain deformations of the Carlitz logarithm introduced by M. Papanikolas and involve the Anderson-Thakur function and the Carlitz exponential function. They collect certain functional identities in families for a new class of L-functions introduced by the first author. This paper also deals with specializations at roots of unity of these generating functions, producing a link with Gauss-Thakur sums.     

High-precision Gauss–Turán quadrature rules for Laguerre and Hermite weight functions

Procedures and corresponding Matlab software are presented for generating Gauss–Turán quadrature rules for the Laguerre and Hermite weight functions to arbitrarily high accuracy. The focus is on the solution of certain systems of nonlinear equations for implicitly defined recurrence coefficients. This is accomplished by the Newton–Kantorovich method, using initial approximations that are sufficiently accurate to be capable of producing n-point quadrature formulae for n as large as 42 in the case of the Laguerre weight function, and 90 in the case of the Hermite weight function.     

The Enumeration of General Rooted Planar Maps

This paper provides some functional equations satisfied by the generating functions for enumerating general rooted planar maps with up to three parameters. Furthermore, the generating functions can be obtained explicitly by employing the Lagrangian inversion. This is also an answer to an open problem in 1989.     

一种基于小波尺度函数变换的Laplace反演方法

该文基于Ｄａｕｂｅｃｈｉｅｓ小波尺度函数变换建立了关于Ｌａｐｌａｃｅ变换的一种反演数值方法．通过对小波尺度函数的低带通谱特性的定性与定量讨论,给出了这一反演方法所得原像函数的适用域．结果发现：其区域大小随着小波尺度函数的分辨指标（ｒｅｓｏｌｕｔｉｏｎｌｅｖｅｌ）选取的升高而增大．最后,以颤振曲线、具有指数增长的复函数、和一维振动弦的初边值问题等为例,定量给出了其反演方法的数值结果．通过与相应的原像精确结果对比发现：在反演的有效区域内,其数值反演的原像几乎与精确的原像图象重合．这表明这一Ｌａｐｌａｃｅ反演数值方法是有效和可靠的．     

Classification of integrable Vlasov-type equations

The classification of integrable Vlasov-type equations reduces to a functional equation for a generating function. We find a general solution of this functional equation in terms of hypergeometric functions. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 154, No. 2, pp. 249–260, February, 2008.     

Using Cumulant Functions in Queueing Theory

A new approach for obtaining the transient solution for the first and second moments of the system size in a finite capacity M/M/1 queueing systems is developed. The approach uses the cumulant generating function which has previously been used in the analysis of compartmental models but has not been used to analyze queueing systems.     

Lagrange Inversion and Schur Functions

Macdonald defined an involution on symmetric functions by considering the Lagrange inverse of the generating function of the complete homogeneous symmetric functions. The main result we prove in this note is that the images of skew Schur functions under this involution are either Schur positive or Schur negative symmetric functions. The proof relies on the combinatorics of Lagrange inversion. We also present a q-analogue of this result, which is related to the q-Lagrange inversion formula of Andrews, Garsia, and Gessel, as well as the operator of Bergeron and Garsia.     

Weighted inversion numbers,restricted growth functions,and standard young tableaux

We give a family of weighted inversion numbers with the same generating function which interpolate between the inversion number and MacMahon's major index. Foata's bijection is obtained in a natural way from a simple involution. An alternative proof uses q-difference equations which yield some new results. We obtain a new generating function for restricted growth functions and two q-analogs of a formula for the number of standard Young tableaux of a given shape. While the first really goes back to MacMahon, the second uses one of our weighted inversion numbers and appears to be new.     

Transient solution of anM/M/1 queue with balking

An infinite capacityM/M/1 queue with balking is discussed. Defining the generating function in an unusual and direct way, the time-dependent solution for the system size is obtained elegantly.     

On the use of divergence distance in fuzzy clustering

Clustering algorithms divide up a dataset into a set of classes/clusters, where similar data objects are assigned to the same cluster. When the boundary between clusters is ill defined, which yields situations where the same data object belongs to more than one class, the notion of fuzzy clustering becomes relevant. In this course, each datum belongs to a given class with some membership grade, between 0 and 1. The most prominent fuzzy clustering algorithm is the fuzzy c-means introduced by Bezdek (Pattern recognition with fuzzy objective function algorithms, 1981), a fuzzification of the k-means or ISODATA algorithm. On the other hand, several research issues have been raised regarding both the objective function to be minimized and the optimization constraints, which help to identify proper cluster shape (Jain et al., ACM Computing Survey 31(3):264–323, 1999). This paper addresses the issue of clustering by evaluating the distance of fuzzy sets in a feature space. Especially, the fuzzy clustering optimization problem is reformulated when the distance is rather given in terms of divergence distance, which builds a bridge to the notion of probabilistic distance. This leads to a modified fuzzy clustering, which implicitly involves the variance–covariance of input terms. The solution of the underlying optimization problem in terms of optimal solution is determined while the existence and uniqueness of the solution are demonstrated. The performances of the algorithm are assessed through two numerical applications. The former involves clustering of Gaussian membership functions and the latter tackles the well-known Iris dataset. Comparisons with standard fuzzy c-means (FCM) are evaluated and discussed.     

The parity of Farey denominators and the Farey index

A function E(b,s) is defined on the set implicitly, by a functional equation. Various conjectures arise from tables and some of these are proved. This function is then related to a partial sum of Farey indices weighted according to the parity of the Farey denominators. An explicit formula for E(b,s) is given, together with sharp bounds, and these show that the weighted partial sums of Farey indices are much smaller than expected. The explicit formula was determined from numerical trials: the question arises whether a constructive derivation from the functional equation should be possible in these and similar circumstances.     

Inversion relations, reciprocity and polyominoes

We derive self-reciprocity properties for a number of polyomino generating functions, including several families of column-convex polygons, three-choice polygons, and staircase polygons with a staircase hole. In so doing, we establish a connection between the reciprocity results known to combinatorialists and the inversion relations used by physicists to solve models in statistical mechanics. For several classes of convex polygons, the inversion (reciprocity) relation, augmented by certain symmetry and analyticity properties, completely determines the anisotropic perimeter generating function.     

Enumeration of trees by inversions

Mallows and Riordan “The Inversion Enumerator for Labeled Trees,” Bulletin of the American Mathematics Society, vol. 74 [1968] pp. 92-94) first defined the inversion polynomial, J_n(q) for trees with n vertices and found its generating function. In the present work, we define inversion polynomials for ordered, plane, and cyclic trees, and find their values at q = 0, ± 1. Our techniques involve the use of generating functions (including Lagrange inversion), hypergeometric series, and binomial coefficient identities, induction, and bijections. We also derive asymptotic formulae for those results for which we do not have a closed form. © 1995 John Wiley & Sons, Inc.     

New inversion formula for the solution to an inverse diffraction problem

For the solution to the basic problem of quantitative texture analysis, a new inversion formula is derived that makes use of the generating function for Legendre polynomials.     

Application of the Jacobi functional equation and the ATS theorem in a quantum optical model

A new method is devised to study the atomic inversion in the model of a two-level atom interacting with a single quantized mode of the (initially coherent) electromagnetic field in an ideal resonant cavity. The method is based on number-theoretic results applied to the approximation of special series, specifically, on the functional equation for Jacobi theta functions and the ATS theorem. New asymptotic formulas are derived, with the help of which the behavior of the atomic inversion function on various time intervals can be determined in detail depending on the parameters of the system.     

Using the Sherman-Morrison-Woodbury inversion formula for a fast solution of tridiagonal block Toeplitz systems

A fast numerical algorithm for solving systems of linear equations with tridiagonal block Toeplitz matrices is presented. The algorithm is based on a preliminary factorization of the generating quadratic matrix polynomial associated with the Toeplitz matrix, followed by the Sherman-Morrison-Woodbury inversion formula and solution of two bidiagonal and one diagonal block Toeplitz systems. Tight estimates of the condition numbers are provided for the matrix system and the main matrix systems generated during the preliminary factorization. The emphasis is put on rigorous stability analysis to rounding errors of the Sherman-Morrison-Woodbury inversion. Numerical experiments are provided to illustrate the theory.