New generating function formulae of even- and odd-Hermite polynomials obtained and applied in the context of quantum optics

By combining the operator Hermite polynomial method and the technique of integration within an ordered product of operators, for the first time we derive the generating function of even- and odd-Hermite polynomials which will be useful in constructing new optical field states. We then show that the squeezed state and photon-added squeezed state can be expressed by even- and odd-Hermite polynomials.

Generating function of product of bivariate Hermite polynomials and their applications in studying quantum optical states

By virtue of the operator-Hermite-polynomial method, we derive some new generating function formulas of the product of two bivariate Hermite polynomials. Their applications in studying quantum optical states are presented.

Some new generating function formulae of the two-variable Hermite polynomials and their application in quantum optics

We derive some new generating function formulae of the two-variable Hermite polynomials, such as ∞∑n=0tm/m!Hn,2m（x）,∞∑n=0sntm/n!m!H2n,2m（x,y）,and ∞∑n=0sntm/n!m!H2n＋l,2m＋k（x,y）.We employ the operator Hermite polynomial method and the technique of integration within an ordered product of operators to solve these problems, which will be useful in constructing new optical field states.

Quantum fields presentation and generating functions of symplectic Schur functions and symplectic universal characters

This paper is concerned with construction of quantum fields presentation and generating functions of symplectic Schur functions and symplectic universal characters.The boson-fermion correspondence for these symmetric functions have been presented.In virtue of quantum fields,we derive a series of infinite order nonlinear integrable equations,namely,universal character hierarchy,symplectic KP hierarchy and symplectic universal character hierarchy,respectively.In addition,the solutions of these integrable systems have been discussed.

Generating functions for powers of second-order recurrence sequences

For the sequences satisfying the recurrence relation of the second order,the generating functions for the products of the powers of these sequences are established.This study was from Carlita and Riordan who began a study on closed form of generating functions for powers of second-order recurrence sequences.This investigation was completed by Stnica.Inspired by the recent work of Istva＇n about the non-closed generating functions of the products of the powers of the second-order sequences,the authors give several extensions of Istva＇n＇s results in this paper.

Improved Discrete Interval-Valued Stress-Strength Interference Model Based on Extended Universal Generating Function

In practical engineering,sometimes the probability density functions( PDFs) of stress and strength can not be exactly determined,or only limited experiment data are available. In these cases,the traditional stress-strength interference( SSI) model based on classical probabilistic approach can not be used to evaluate reliabilities of components. To solve this issue, the traditional universal generating function( UGF) is introduced and then it is extended to represent the discrete interval-valued random variable.Based on the extended UGF,an improved discrete interval-valued SSI model is proposed, which has higher calculation precision compared with the existing methods. Finally,an illustrative case is given to demonstrate the validity of the proposed model.

Reliability Bounds based on Universal Generating Function and Discrete Stress-strength Interference Model

A method for estimating the component reliability is proposed when the probability density functions of stress and strength can not be exactly determined. For two groups of finite experimental data about the stress and strength, an interval statistics method is introduced. The processed results are formulated as two interval-valued random variables and are graphically represented component reliability are proposed based on the by using two histograms. The lower and upper bounds of universal generating function method and are calculated by solving two discrete stress-strength interference models. The graphical calculations of the proposed reliability bounds are presented through a numerical example and the confidence of the proposed reliability bounds is discussed to demonstrate the validity of the proposed method. It is showed that the proposed reliability bounds can undoubtedly bracket the real reliability value. The proposed method extends the exciting universal generating function method and can give an interval estimation of component reliability in the case of lake of sufficient experimental data. An application example is given to illustrate the proposed method

Lucas Symbolic Formulae and Generating Functions for Chebyshev Polynomials

This work shows that each kind of Chebyshev polynomials may be calculated from a symbolic formula similar to the Lucas formula for Bernoulli polynomials. It exposes also a new approach for obtaining generating functions of them by operator calculus built from the derivative and the positional operators.

THE CALCULUS OF GENERATING FUNCTIONS AND THE FORMAL ENERGY FOR HAMILTONIAN ALGORITHMS

In [2-4], symplectic schemes of arbitrary order are constructed by generating functions. However the construction of generating functions is dependent on the chosen coordinates. One would like to know that under what circumstance the construction of generating functions will be independent of the coordinates. The generating functions are deeply associated with the conservation laws, so it is important to study their properties and computations. This paper will begin with the study of Darboux transformation, then in section 2, a normalization Darboux transformation will be defined naturally. Every symplectic scheme which is constructed from Darboux transformation and compatible with the Hamiltonian equation will satisfy this normalization condition. In section 3, we will study transformation properties of generator maps and generating functions. Section 4 will be devoted to the study of the relationship between the invariance of generating functions and the generator maps. In section 5, formal symplectic erengy of symplectic schemes are presented.

Some New Generating Functions for the Modified Laguerre Polynomials

In this paper,we obtain some new results on bilateral generating functions of the modified Laguerre polynomials.We also get generating function relations between the modified Laguerre polynomials and the generalized Lauricella functions.Some special cases and important applications are also discussed.

Universal generating function based probabilistic production simulation for wind power integrated power systems

According to the demand of sustainable development and low-carbon electricity, it is important to develop clean resources and optimize scheduling generation mix. Firstly, a novel method for probabilistic production simulation for wind power integrated power systems is proposed based on universal generating function(UGF), which completes the production simulation with the chronological wind power and load demand. Secondly,multiple-period multiple-state wind power model and multiple-state thermal unit power model are adopted, and both thermal power and wind power are coordinately scheduled by the comprehensive cost including economic cost and environmental cost. Furthermore, the accommodation and curtailment of wind power is synergistically considered according to the available regulation capability of conventional generators in operation. Finally, the proposed method is verified and compared with conventional convolution method in the improved IEEE-RTS 79 system.

MOMENT GENERATING FUNCTIONS OF RANDOM VARIABLES AND ASYMPTOTIC BEHAVIOUR FOR GENERALIZED FELLER OPERATORS

Describes the representation of moment generating function for the S-lambda type random variables. Higher order asymptotic formula for generalized Feller operators; Regular n-r order moment for the random variables.

Joint probability generating function for degrees of active/passive random intersection graphs

Correlations of active and passive random intersection graphs are studied in this paper. We present the joint probability generating function for degrees of GactVe（n, re, p） and GPaSSiW（n, re, p）, which are generated by a random bipartite graph G＊ （n, ~rt, p） on n ＋ rn vertices.

Approximate Solutions to the Hamilton-Jacobi Equations for Generating Functions

For a nonlinear finite time optimal control problem,a systematic numerical algorithm to solve the Hamilton-Jacobi equation for a generating function is proposed in this paper.This algorithm allows one to obtain the Taylor series expansion of the generating function up to any prescribed order by solving a sequence of first order ordinary differential equations recursively.Furthermore,the coefficients of the Taylor series expansion of the generating function can be computed exactly under a certain technical condition.Once a generating function is found,it can be used to generate a family of optimal control for different boundary conditions.Since the generating function is computed off-line,the on-demand computational effort for different boundary conditions decreases a lot compared with the conventional method.It is useful to online optimal trajectory generation problems.Numerical examples illustrate the effectiveness of the proposed algorithm.

Explicit Forms of q-Deformed Lévy-Meixner Polynomials and Their Generating Functions

The classical Levy-Meixner polynomials are distinguished through the special forms of their generating functions. In fact, they are completely determined by 4 parameters： c1, c2,γ and β. In this paper, for-1 〈q〈 1, we obtain a unified explicit form of q-deformed Levy-Meixner polynomials and their generating functions in term of c1, c2, γand β, which is shown to be a reasonable interpolation between classical case （q=1） and fermionic case （q=-1）.In particular, when q=0 it＇s also compatible with the free case.

INVERTING GENERATING FUNCTIONS WITH INCREASED NUMERICAL PRECISION-A COMPUTATIONAL EXPERIENCE

In this paper, we consider the numerical inversion of a variety of generating functions （GFs） that arise in the area of engineering and non-engineering fields. Three classes of GFs are taken into account in a comprehensive manner： classes of probability generating functions （PGFs） that are given in rational and non-rational forms, and a class of GFs that are not PGFs. Among others, those PGFs that are not explicitly given but contain a number of unknowns are largely considered as they are often encountered in many interesting applied problems. For the numerical inversion of GFs, we use the methods of the discrete （fast） Fourier transform and the Taylor series expansion. Through these methods, we show that it is remarkably easy to obtain the desired sequence to any given accuracy, so long as enough numerical precision is used in computations. Since high precision is readily available in current software packages and programming languages, one can now lift, with little effort, the so-called Laplacian curtain that veils the sequence of interest. To demonstrate, we take a series of representative examples： the PGF of the number of customers in the discrete-time Geo^X/Geo/c queue, the same in the continuous-time M^X/D/c queue, and the GFs arising in the discrete-time renewal process.

On Rationality of Generating Function for the Number of Spanning Trees in Circulant Graphs

Let F(x)=∑∞n=1 Tsi,s2,...,sk(n)x^n be the generating function for the number,Ts1bs2,...,sk(n) of spanning trees in the circulant graph Cn(s1,S2,...,Sk).We show that F(x)is a rational function with integer coefficients satisfying the property F(x)=F(l/x).A similar result is also true for the circulant graphs C2n(s1,S2,....,Sk,n)of odd valency.We illustrate the obtained results by a series of examples.

Reliability Analysis of Excavator Rectifier Feedback System with Multi-State Components Based on Belief Universal Generating Function Method

In view of the complexity and uncertainty of system, both the state performances and state probabilities of multi-state components can be expressed by interval numbers. The belief function theory is used to characterize the uncertainty caused by various factors. A modified Markov model is proposed to obtain the state probabilities of components at any given moment and subsequently the mass function is used to represent the precise belief degree of state probabilities. Based on the primary studies of universal generating function(UGF)method, a belief UGF(BUGF) method is utilized to analyze the reliability and the uncertainty of excavator rectifier feedback system. This paper provides an available method to evaluate the reliability of multi-state systems(MSSs) with interval state performances and state probabilities, and also avoid the interval expansion problem.

Reliability Evaluation of Compressor Systems Based on Universal Generating Function Method

At present, universal generating function(UGF) is a reliability evaluation technique which holds the bare-looking and easily program-realized merits in multi-state system. Thus, it is meaningful to apply this method to an actual industry system. Compressor systems in natural gas pipelines are series-parallel multi-state systems,where the compressor units in each compressor station work in a parallel way and these pressure-boosting stations in the pipeline are series connected. Considering the characteristic of gas pipelines, this paper develops two different UGFs to evaluate the system reliability. One(Model 1) establishes a system model from every compressor unit while the other(Model 2) considers the whole system as a combination of multi-state components. Besides, all the parameters of "weight" in UGFs are obtained from thermal-hydraulic models based on the actual engineering and"probability" from Monte Carlo simulation. The results show that the system reliabilities calculated by different UGFs are approximately equal. In addition, the demand of gas and the gas pipeline transportation system show a reverse trend. Because the number of parameters needed in Model 2 is far less than that needed in Model 1,Model 2 is simpler programming and faster solved.

Generating Function Methods for Coefficient-Varying Generalized Hamiltonian Systems

The generating function methods have been applied successfully to generalized Hamiltonian systems with constant or invertible Poisson-structure matrices.In this paper,we extend these results and present the generating function methods preserving the Poisson structures for generalized Hamiltonian systems with general variable Poisson-structure matrices.In particular,some obtained Poisson schemes are applied efficiently to some dynamical systems which can be written into generalized Hamiltonian systems(such as generalized Lotka-Volterra systems,Robbins equations and so on).