The paper presents analysis of two-dimensional non-Newtonian incompressible viscous flow between parallel plates. The governing problem of momentum equations are reduced to NODE using similarity transformations. The resulting equation is solved using series solution and homotopy analysis method. These methods have advantages over pure numerical methods for obtaining the derived quantities accur...

In this paper, we introduce the concept of quantile-based generalized cumulative residual entropy of order $(alpha,beta)$ for residual and past lifetimes and study their properties. Further we study the proposed information measure for series and parallel system when random variable are untruncated or truncated in nature and some characterization results are presented. At the end, we study gene...

In this paper a redundancy allocation problem is studied where for the first time the supplier selection is taken into consideration and redundant components are provided from appropriate suppliers with the most suitable offers such as discount on buying price of components, warranty length for components, things like that, so that the system reliability, profit and the warranty length proposed...

Recall that a series-parallel graph consists of an edge, or of two series-parallel graphs connected in series or in parallel. A graph can be decomposed into series-parallel blocks if and only if it has treewidth 2. It is easy to see that these graphs cannot, in general, be embedded isometrically into `1: consider, for example, the n-cycle. In this lecture, we shall show two different constant-d...

This study analyzes and evaluates four transmission characteristics of the capacitive power transfer (CPT) with resonance coupling. A constant voltage source is used under all conditions. The target compensation topologies for investigation are series-series (SS), series-parallel (SP), parallel-series (PS) parallel-parallel (PP) topologies. analysis results unified conditions describe five char...

Many combinatorial problems can be efficiently solved in parallel for series]parallel multigraphs. The edge-coloring problem is one of a few combinatorial problems for which no NC parallel algorithm has been obtained for series]parallel multigraphs. This paper gives an NC parallel algorithm for the Ž . Ž . problem on series]parallel multigraphs G. It takes O log n time with O Dnrlog n processor...