the complete convergence is investigated for moving-average processes of doubly infinite sequence of negative dependence sub-gaussian random variables with zero means, finite variances and absolutely summable coefficients. as a corollary, the rate of complete convergence is obtained under some suitable conditions on the coefficients.

the complete convergence is investigated for moving-average processes of doubly infinite sequence of negative dependence sub-gaussian random variables with zero means, finite variances and absolutely summable coefficients. as a corollary, the rate of complete convergence is obtained under some suitable conditions on the coefficients.

In order to model prominent failure modes experienced by multi-layered composites, a fine through-thickness discretisation is needed. If the structure also has large in-plane dimensions, computational cost of becomes large. light this, we propose an adaptive isogeometric continuum shell element for analysis structures. The key flexible and efficient method controlling continuity out-of-plane ap...

We construct a chiral Lagrangian for doubly heavy baryons and heavy mesons that is invariant under heavy quark-diquark symmetry at leading order and includes the leading O(1/mQ) symmetry violating operators. The theory is used to predict the electromagnetic decay width of the J = 3 2 member of the ground state doubly heavy baryon doublet. Numerical estimates are provided for doubly charm baryon...

We ask several questions on the structure of the polytope of doubly stochastic n n matrices Pn, known as a Birkhoo polytope. We discuss the volume of Pn, the work of the simplex method, and the mixing of random walks Pn.

Mathematics Subject Classification (2000): 53C25, 53C40, 53C42.

A class of discrete-time M=G=1 queues, including both round robin and last come rst served service, in which customers are subject to permutations is considered. These time slotted queues, analogous to the symmetric queues of Kelly, are analyzed by examination of the time reversed process. Product form stationary distributions are found for a type of doubly stochastic server of Schassberger [5]...

We claim that both of these walks have the same mixing time. This fact is in fact true for any Markov chain on groups. In this case note that we are considering a Markov chain on the symmetric group Sn. In general consider any group G and suppose we have a set of generators {g1, . . . , gk}. In each time step we choose a generator from this set according to a probability distribution μ and we a...