Flow And Heat-Transfer Over An Upstream Moving Wall With A Magnetic-Field And A Parallel Free Stream

The flow and heat transfer over an upstream moving non-isothermal wall with a parallel free stream have been considered. The magnetic field has been applied in the free stream parallel to the wall and the effect of induced magnetic field has been included in the analysis. The boundary layer equations governing the steady incompressible electrically conducting fluid flow have been solved numerically using a shooting method. This problem is interesting because a solution exists only when the ratio of the wall velocity does not exceed a certain critical value and this critical value depends on the magnetic field and magnetic Prandtl number. Also dual solutions exist for a certain range of wall velocity.

Stream power criterion and design of sand bed channels at incipient motion

The critical stream power criterion may be used to describe the incipient motion of cohesionless particles of plane sediment beds. The governing equation relating ``critical stream power'' to ``shear Reynolds number'' is developed by using the present experimental data as well as the data from several other sources. Simultaneously, a resistance equation, relating the ``particle Reynolds number'' to the``shear Reynolds number'' is developed for plane sediment beds in wide channels with little or no transport. By making use of these relations, a procedure is developed to design plane sediment beds such that any two of the four design variables, including particle size, energy/friction slope, flow depth, and discharge per unit width in the channel should be known to predict the remaining two variables. Finally, a straightforward design procedure using design tables/design curves and analytical methods is presented to solve six possible design problems.

Synergistic Execution of Stream Programs on Multicores with Accelerators

The StreamIt programming model has been proposed to exploit parallelism in streaming applications oil general purpose multicore architectures. The StreamIt graphs describe task, data and pipeline parallelism which can be exploited on accelerators such as Graphics Processing Units (GPUs) or CellBE which support abundant parallelism in hardware. In this paper, we describe a novel method to orchestrate the execution of if StreamIt program oil a multicore platform equipped with an accelerator. The proposed approach identifies, using profiling, the relative benefits of executing a task oil the superscalar CPU cores and the accelerator. We formulate the problem of partitioning the work between the CPU cores and the GPU, taking into account the latencies for data transfers and the required buffer layout transformations associated with the partitioning, as all integrated Integer Linear Program (ILP) which can then be solved by an ILP solver. We also propose an efficient heuristic algorithm for the work-partitioning between the CPU and the GPU, which provides solutions which are within 9.05% of the optimal solution on an average across the benchmark Suite. The partitioned tasks are then software pipelined to execute oil the multiple CPU cores and the Streaming Multiprocessors (SMs) of the GPU. The software pipelining algorithm orchestrates the execution between CPU cores and the GPU by emitting the code for the CPU and the GPU, and the code for the required data transfers. Our experiments on a platform with 8 CPU cores and a GeForce 8800 GTS 512 GPU show a geometric mean speedup of 6.94X with it maximum of 51.96X over it single threaded CPU execution across the StreamIt benchmarks. This is a 18.9% improvement over it partitioning strategy that maps only the filters that cannot be executed oil the GPU - the filters with state that is persistent across firings - onto the CPU.

Construction of Stability Multipliers with Prescribed Phase Characteristics: an Improved Value for $\sigma

For a feedback system consisting of a transfer function $G(s)$ in the forward path and a time-varying gain $n(t)(0 \leqq n(t) \leqq k)$ in the feedback loop, a stability multiplier $Z(s)$ has been constructed (and used to prove stability) by Freedman [2] such that $Z(s)(G(s) + {1 / K})$ and $Z(s - \sigma )(0 < \sigma < \sigma _ * )$ are strictly positive real, where $\sigma _ * $ can be computed from a knowledge of the phase-angle characteristic of $G(i\omega ) + {1 / k}$ and the time-varying gain $n(t)$ is restricted by $\sigma _ * $ by means of an integral inequality. In this note it is shown that an improved value for $\sigma _ * $ is possible by making some modifications in his derivation. ©1973 Society for Industrial and Applied Mathematics.

Nonsimilar incompressible laminar boundary layers with magnetic field.

The solution of the steady laminar incompressible nonsimilar magneto-hydrodynamic boundary layer flow and heat transfer problem with viscous dissipation for electrically conducting fluids over two-dimensional and axisymmetric bodies with pressure gradient and magnetic field has been presented. The partial differential equations governing the flow have been solved numerically using an implicit finite-difference scheme. The computations have been carried out for flow over a cylinder and a sphere. The results indicate that the magnetic field tends to delay or prevent separation. The heat transfer strongly depends on the viscous dissipation parameter. When the dissipation parameter is positive (i.e. when the temperature of the wall is greater than the freestream temperature) and exceeds a certain value, the hot wall ceases to be cooled by the stream of cooler air because the ‘heat cushion’ provided by the frictional heat prevents cooling whereas the effect of the magnetic field is to remove the ‘heat cushion’ so that the wall continues to be cooled. The results are found to be in good agreement with those of the local similarity and local nonsimilarity methods except near the point of separation, but they are in excellent agreement with those of the difference-differential technique even near the point of separation.

Singular value decomposition based computationally efficient algorithm for rapid dynamic near-infrared diffuse optical tomography

Purpose: A computationally efficient algorithm (linear iterative type) based on singular value decomposition (SVD) of the Jacobian has been developed that can be used in rapid dynamic near-infrared (NIR) diffuse optical tomography. Methods: Numerical and experimental studies have been conducted to prove the computational efficacy of this SVD-based algorithm over conventional optical image reconstruction algorithms. Results: These studies indicate that the performance of linear iterative algorithms in terms of contrast recovery (quantitation of optical images) is better compared to nonlinear iterative (conventional) algorithms, provided the initial guess is close to the actual solution. The nonlinear algorithms can provide better quality images compared to the linear iterative type algorithms. Moreover, the analytical and numerical equivalence of the SVD-based algorithm to linear iterative algorithms was also established as a part of this work. It is also demonstrated that the SVD-based image reconstruction typically requires O(NN2) operations per iteration, as contrasted with linear and nonlinear iterative methods that, respectively, requir O(NN3) and O(NN6) operations, with ``NN'' being the number of unknown parameters in the optical image reconstruction procedure. Conclusions: This SVD-based computationally efficient algorithm can make the integration of image reconstruction procedure with the data acquisition feasible, in turn making the rapid dynamic NIR tomography viable in the clinic to continuously monitor hemodynamic changes in the tissue pathophysiology.

A Shapley value analysis to coordinate the formation of procurement

In this paper we address the problem of forming procurement networks for items with value adding stages that are linearly arranged. Formation of such procurement networks involves a bottom-up assembly of complex production, assembly, and exchange relationships through supplier selection and contracting decisions. Recent research in supply chain management has emphasized that such decisions need to take into account the fact that suppliers and buyers are intelligent and rational agents who act strategically. In this paper, we view the problem of Procurement Network Formation (PNF) for multiple units of a single item as a cooperative game where agents cooperate to form a surplus maximizing procurement network and then share the surplus in a fair manner. We study the implications of using the Shapley value as a solution concept for forming such procurement networks. We also present a protocol, based on the extensive form game realization of the Shapley value, for forming these networks.

Sensitivity of Eigen Value to Damage and Its Identification

The reduction in natural frequencies,however small, of a civil engineering structure, is the first and the easiest method of estimating its impending damage. As a first level screening for health-monitoring, information on the frequency reduction of a few fundamentalmodes can be used to estimate the positions and the magnitude of damage in a smeared fashion. The paper presents the Eigen value sensitivity equations, derived from first-order perturbation technique, for typical infra-structural systems like a simply supported bridge girder, modelled as a beam, an endbearing pile, modelled as an axial rod and a simply supported plate as a continuum dynamic system. A discrete structure, like a building frame is solved for damage using Eigen-sensitivity derived by a computationalmodel. Lastly, neural network based damage identification is also demonstrated for a simply supported bridge beam, where the known-pairs of damage-frequency vector is used to train a neural network. The performance of these methods under the influence of measurement error is outlined. It is hoped that the developed method could be integrated in a typical infra-structural management program, such that magnitudes of damage and their positions can be obtained using acquired natural frequencies, synthesized from the excited/ambient vibration signatures.

Tendency toward crossover of the effective susceptibility exponent from its doubled Ising value to its doubled mean-field value near a double critical point

The critical behavior of osmotic susceptibility in an aqueous electrolyte mixture 1-propanol (1P)+water (W)+potassium chloride is reported. This mixture exhibits re-entrant phase transitions and has a nearly parabolic critical line with its apex representing a double critical point (DCP). The behavior of the susceptibility exponent is deduced from static light-scattering measurements, on approaching the lower critical solution temperatures (TL’s) along different experimental paths (by varying t) in the one-phase region. The light-scattering data analysis substantiates the existence of a nonmonotonic crossover behavior of the susceptibility exponent in this mixture. For the TL far away from the DCP, the effective susceptibility exponent γeff as a function of t displays a nonmonotonic crossover from its single limit three-dimensional (3D)-Ising value ( ∼ 1.24) toward its mean-field value with increase in t. While for that closest to the DCP, γeff displays a sharp, nonmonotonic crossover from its nearly doubled 3D-Ising value toward its nearly doubled mean-field value with increase in t. The renormalized Ising regime extends over a relatively larger t range for the TL closest to the DCP, and a trend toward shrinkage in the renormalized Ising regime is observed as TL shifts away from the DCP. Nevertheless, the crossover to the mean-field limit extends well beyond t>10−2 for the TL’s studied. The observed crossover behavior is attributed to the presence of strong ion-induced clustering in this mixture, as revealed by various structure probing techniques. As far as the critical behavior in complex or associating mixtures with special critical points (like the DCP) is concerned, our results indicate that the influence of the DCP on the critical behavior must be taken into account not only on the renormalization of the critical exponent but also on the range of the Ising regime, which can shrink with decrease in the influence of the DCP and with the extent of structuring in the system. The utility of the field variable tUL in analyzing re-entrant phase transitions is demonstrated. The effective susceptibility exponent as a function of tUL displays a nonmonotonic crossover from its asymptotic 3D-Ising value toward a value slightly lower than its nonasymptotic mean-field value of 1. This behavior in the nonasymptotic, high tUL region is interpreted in terms of the possibility of a nonmonotonic crossover to the mean-field value from lower values, as foreseen earlier in micellar systems.

The core and shapley value analysis for cooperative formation of procurement networks

Formation of high value procurement networks involves a bottom-up assembly of complex production, assembly, and exchange relationships through supplier selection and contracting decisions, where suppliers are intelligent and rational agents who act strategically. In this paper we address the problem of forming procurement networks for items with value adding stages that are linearly arranged We model the problem of Procurement Network Formation (PNF) for multiple units of a single item as a cooperative game where agents cooperate to form a surplus maximizing procurement network and then share the surplus in a stable and fair manner We first investigate the stability of such networks by examining the conditions under which the core of the game is non-empty. We then present a protocol, based on the extensive form game realization of the core, for forming such networks so that the resulting network is stable. We also mention a key result when the Shapley value is applied as a solution concept.

Software Pipelined Execution of Stream Programs on GPUs

The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multi-core architectures. This model allows programmers to specify the structure of a program as a set of filters that act upon data, and a set of communication channels between them. The StreamIt graphs describe task, data and pipeline parallelism which can be exploited on modern Graphics Processing Units (GPUs), as they support abundant parallelism in hardware. In this paper, we describe the challenges in mapping StreamIt to GPUs and propose an efficient technique to software pipeline the execution of stream programs on GPUs. We formulate this problem - both scheduling and assignment of filters to processors - as an efficient Integer Linear Program (ILP), which is then solved using ILP solvers. We also describe a novel buffer layout technique for GPUs which facilitates exploiting the high memory bandwidth available in GPUs. The proposed scheduling utilizes both the scalar units in GPU, to exploit data parallelism, and multiprocessors, to exploit task and pipelin parallelism. Further it takes into consideration the synchronization and bandwidth limitations of GPUs, and yields speedups between 1.87X and 36.83X over a single threaded CPU.

Boundary value problems for third-order nonlinear ordinary differential equations

In this paper, we describe how to analyze boundary value problems for third-order nonlinear ordinary differential equations over an infinite interval. Several physical problems of interest are governed by such systems. The seminumerical schemes described here offer some advantages over solutions obtained by using traditional methods such as finite differences, shooting method, etc. These techniques also reveal the analytic structure of the solution function. For illustrative purposes, several physical problems, mainly drawn from fluid mechanics, are considered; they clearly demonstrate the efficiency of the techniques presented here.

Impact of riparian land use on stream insects of Kudremukh National Park, Karnataka state, India

The impact of riparian land use on the stream insect communities was studied at Kudremukh National Park located within Western Ghats, a tropical biodiversity hotspot in India. The diversity and community composition of stream insects varied across streams with different riparian land use types. The rarefied family and generic richness was highest in streams with natural semi evergreen forests as riparian vegetation. However, when the streams had human habitations and areca nut plantations as riparian land use type, the rarefied richness was higher than that of streams with natural evergreen forests and grasslands. The streams with scrub lands and iron ore mining as the riparian land use had the lowest rarefied richness. Within a landscape, the streams with the natural riparian vegetation had similar community composition. However, streams with natural grasslands as the riparian vegetation, had low diversity and the community composition was similar to those of paddy fields. We discuss how stream insect assemblages differ due to varied riparian land use patterns, reflecting fundamental alterations in the functioning of stream ecosystems. This understanding is vital to conserve, manage and restore tropical riverine ecosystems.

Solution of MDPS using simulation-based value iteration

This article proposes a three-timescale simulation based algorithm for solution of infinite horizon Markov Decision Processes (MDPs). We assume a finite state space and discounted cost criterion and adopt the value iteration approach. An approximation of the Dynamic Programming operator T is applied to the value function iterates. This 'approximate' operator is implemented using three timescales, the slowest of which updates the value function iterates. On the middle timescale we perform a gradient search over the feasible action set of each state using Simultaneous Perturbation Stochastic Approximation (SPSA) gradient estimates, thus finding the minimizing action in T. On the fastest timescale, the 'critic' estimates, over which the gradient search is performed, are obtained. A sketch of convergence explaining the dynamics of the algorithm using associated ODEs is also presented. Numerical experiments on rate based flow control on a bottleneck node using a continuous-time queueing model are performed using the proposed algorithm. The results obtained are verified against classical value iteration where the feasible set is suitably discretized. Over such a discretized setting, a variant of the algorithm of [12] is compared and the proposed algorithm is found to converge faster.

Boundary value problems for third-order nonlinear ordinary differential equations

In this paper, we describe how to analyze boundary value problems for third-order nonlinear ordinary differential equations over an infinite interval. Several physical problems of interest are governed by such systems. The seminumerical schemes described here offer some advantages over solutions obtained by using traditional methods such as finite differences, shooting method, etc. These techniques also reveal the analytic structure of the solution function. For illustrative purposes, several physical problems, mainly drawn from fluid mechanics, are considered; they clearly demonstrate the efficiency of the techniques presented here.