Applying the cluster method to count occurrences of generalized permutation patterns

We apply ideas from the cluster method to q-count the permutations of a multiset according to the number of occurrences of certain generalized patterns, as defined by Babson and Steingrímsson. In particular, we consider those patterns with three letters and one internal dash, as well as permutation statistics composed of counting the number of occurrences of multisets of such patterns. Counting is done via recurrences which simplify in the case of permutations. A collection of Maple procedures implementing these recurrences accompanies the article.     

Implementation of REDIM reduced chemistry to model an axisymmetric laminar diffusion methane–air flame

The goal of this work is to analyze the use of automatically reduced chemistry by the Reaction–Diffusion Manifold (REDIM) method in simulating axisymmetric laminar coflow diffusion flames. Detailed chemical kinetic models are usually computationally prohibitive for simulating complex reacting flows, and therefore reduced models are required. Automatic reduction model approaches usually exploit the natural multi-scale structure of combustion systems. The novel REDIM approach applies the concept of invariant manifolds to treat also the influence of the transport processes on the reduced model, which overcomes a fundamental problem of model reduction in neglecting the coupling of molecular transport with thermochemical processes. We have considered a previously well studied atmospheric pressure nitrogen-diluted methane–air flame as a test case to validate the methodology presented here. First, one-dimensional and two-dimensional REDIMs were computed and tabulated in lookup tables. Then, the full set of governing equations are projected on the REDIM and implemented in the object-oriented C++ Gascoigne code with a new add-on library to deal with the REDIM tables. The projected set of governing equations have been discretized by the Finite Element Method (FEM) and solved by a GMRES iteration preconditioned by a geometric multigrid method. Local grid refinement, adaptive mesh and parallelization are applied to ensure efficiency and precision. The numerical results obtained using the REDIM approach have shown very good agreement with detailed numerical simulations and experimental data.     

The N-policy of a discrete time Geo/G/1 queue with disasters and its application to wireless sensor networks

We analyze an N-policy of a discrete time Geo/G/1 queue with disasters. We obtain the probability generating functions of the queue length, the sojourn time, and regeneration cycles such as the idle period and the busy period. We apply the queue to a power saving scheme in wireless sensor networks under unreliable network connections where data packets are lost by external attacks or shocks. We present various numerical experiments for application to power consumption control in wireless sensor networks. We investigate the characteristics of the optimal N-policy that minimizes power consumption and derive practical insights on the operation of the N-policy in wireless sensor networks.     

Pitman closeness results for Type-I censored data from exponential distribution

Recent work on Pitman closeness has compared estimators under Type-II censored samples from exponential distribution based on observed number of failures. In this paper, we carry out similar Pitman closeness comparisons for Type-I censored samples from exponential distribution based on time under test.     

Groups which do not admit ghosts

A ghost in the stable module category of a group is a map between representations of that is invisible to Tate cohomology. We show that the only non-trivial finite -groups whose stable module categories have no non-trivial ghosts are the cyclic groups and . We compare this to the situation in the derived category of a commutative ring. We also determine for which groups the second power of the Jacobson radical of is stably isomorphic to a suspension of .

     

Optimal replacement and allocation of multi‐state elements in k‐within‐m‐from‐r/n sliding window systems

This paper proposes a new model that generalizes the linear sliding window system to the case of multiple failures. The considered k ‐within‐ m ‐from‐ r / n sliding window system consists of n linearly ordered multi‐state elements and fails if at least k groups out of m consecutive groups of r consecutive multi‐state elements have cumulative performance lower than the demand W . A reliability evaluation algorithm is suggested for the proposed system. In order to increase the system availability, maintenance actions can be performed, and the elements can be optimally allocated. A joint element allocation and maintenance optimization model is formulated with the objective of minimizing the total maintenance cost subjected to the pre‐specified system availability requirement. Basic procedures of genetic algorithms are adapted to solve the optimization problem. Numerical experiments are presented to illustrate the applications. Copyright © 2015 John Wiley & Sons, Ltd.     

“Living” Free Radical Polymerization in Tubular Reactors. I. Modeling of the Complete Molecular Weight Distribution Using Probability Generating Functions

This is the first of a series of works aiming at developing a tool for designing “living” free radical polymerization processes in tubular reactors, in order to achieve tailor‐made MWDs. A mathematical model of the nitroxide‐mediated controlled free radical polymerization is built and implemented to predict the complete MWD. It is shown that this objective may be achieved accurately and efficiently by means of the probability generating function (pgf) transformation. Comparison with experimental data is good. The potential of the resulting model for optimization activities involving the complete MWD is also shown.