Unsteady-Flow Of A Viscous-Fluid Between 2 Parallel Disks With A Time-Varying Gap Width And A Magnetic-Field

The unsteady incompressible viscous fluid flow between two parallel infinite disks which are located at a distance h(t*) at time t* has been studied. The upper disk moves towards the lower disk with velocity h'(t*). The lower disk is porous and rotates with angular velocity Omega(t*). A magnetic field B(t*) is applied perpendicular to the two disks. It has been found that the governing Navier-Stokes equations reduce to a set of ordinary differential equations if h(t*), a(t*) and B(t*) vary with time t* in a particular manner, i.e. h(t*) = H(1 - alpha t*)(1/2), Omega(t*) = Omega(0)(1 - alpha t*)(-1), B(t*) = B-0(1 - alpha t*)(-1/2). These ordinary differential equations have been solved numerically using a shooting method. For small Reynolds numbers, analytical solutions have been obtained using a regular perturbation technique. The effects of squeeze Reynolds numbers, Hartmann number and rotation of the disk on the flow pattern, normal force or load and torque have been studied in detail

Diffraction Of Elastic Waves By Two Parallel Rigid Strips Embedded In An Infinite Orthotropic Medium

The elastodynamic response of a pair of parallel rigid strips embedded in an infinite orthotropic medium due to elastic waves incident normally on the strips has been investigated. The mixed boundary value problem has been solved by the Integral Equation method. The normal stress and the vertical displacement have been derived in closed form. Numerical values of stress intensity factors at inner and outer edges of the strips and vertical displacement at points in the plane of the strips for several orthotropic materials have been calculated and plotted graphically to show the effect of material orthotropy.

A 3-hour quantitative comparison of glucose-based versus rice-based oral rehydration solution intake by children with diarrhoea in Port Moresby General Hospital

Measurements were made of the intake of a WHO/UNICEF glucose-based and a rice cereal-based oral rehydration solution (ORS) by children with diarrhoea. Twenty children who presented to the Children's Outpatient Department at Port Moresby General Hospital with acute diarrhoea and mild dehydration were randomly assigned to an ORS and measurements were taken over the following 3 hours. For data analysis, the patients were paired by weight. Testing the means of the paired samples by t test showed that there was no significant difference between the amount of rice ORS and the amount of glucose ORS taken over 3 hours. The discovery of oral rehydration solution (ORS) for the treatment of diarrheal disease has been heralded as the most important medical discovery of the century. Cereal-based ORS is able to decrease stool output and the duration of diarrheal illness more than the standard glucose-based ORS, through the increased absorption provided by oligosaccharides without the imposition of a greater osmotic penalty. Moreover, the peptides in cereals enhance amino acid and water absorption, while providing nutritional benefits. UNICEF's glucose-based ORS is becoming more widely used in Papua New Guinea (PNG). 20 children aged 6-37 months (mean age, 15 months) who presented to the Children's Outpatient Department at Port Moresby General Hospital during September-October 1993 with acute diarrhea and mild dehydration were randomly assigned to receive either a rice-based ORS or standard glucose ORS, and measurements were taken over the following 3 hours. The patients were paired by weight for analysis. No statistically significant difference was found between the amount of rice ORS and the amount of glucose ORS taken over 3 hours.

Acceptability of a rice-based oral rehydration solution in Port Moresby General Hospital's Children's Outpatient Department

The guardians of children brought to the Port Moresby General Hospital's Children's Outpatient Department with a chief complaint of diarrhoeal disease were questioned regarding their preference of glucose-based vs rice-based oral rehydration solution (ORS) in order to determine the acceptability of a rice-based ORS. Of the 93 guardians interviewed, greater than 60% preferred the glucose-based solution in its mixability, appearance and taste, and 65% initially reported that their children preferred the taste of the glucose solution. However, after a 30-minute trial, only 58% of children still preferred the glucose solution. In a country where diarrhoeal disease is a leading cause of child death and guardians are the primary health care providers, the acceptability of an ORS is critical to the morbidity and mortality of Papua New Guinea's children. Killing an estimated 2.9 million children annually, diarrheal disease is the second leading cause of child mortality worldwide. Diarrheal disease is also the second leading cause of child mortality in Papua New Guinea (PNG), killing an average 193 inpatient children per year over the period 1984-90. However, despite the high level of diarrhea-related mortality and the proven efficacy of oral rehydration therapy (ORT) in managing diarrhea-related dehydration, standardized ORT has been underutilized in PNG. The current glucose-based oral rehydration solution (ORS) does not reduce the frequency or volume of a child's diarrhea, the most immediate concern of caregivers during episodes of illness. Cereal-based ORS, made from cereals which are commonly available as food staples in most countries, better address the short-term concerns of caregivers while offering a superior nutritional profile. A sample of guardians of children brought to the Port Moresby General Hospital's Children's Outpatient Department complaining of child diarrhea were asked about their preferences on glucose-based versus rice-based ORS in order to determine the acceptability of a rice-based ORS. More than 60% of the 93 guardians interviewed preferred the glucose-based solution for its mixability, appearance, and taste. 65% initially reported that their children preferred the taste of the glucose solution. However, after a 30-minute trial, only 58% of children still preferred the glucose solution.

The Parallel Complexity Of Propagation In Boolean Circuits

We consider the problem of deciding whether the output of a boolean circuit is determined by a partial assignment to its inputs. This problem is easily shown to be hard, i.e., co-Image Image -complete. However, many of the consequences of a partial input assignment may be determined in linear time, by iterating the following step: if we know the values of some inputs to a gate, we can deduce the values of some outputs of that gate. This process of iteratively deducing some of the consequences of a partial assignment is called propagation. This paper explores the parallel complexity of propagation, i.e., the complexity of determining whether the output of a given boolean circuit is determined by propagating a given partial input assignment. We give a complete classification of the problem into those cases that are Image -complete and those that are unlikely to be Image complete.

On the direct parallel solution of systems of linear equations: New algorithms and systolic structures

The paper presents two new algorithms for the direct parallel solution of systems of linear equations. The algorithms employ a novel recursive doubling technique to obtain solutions to an nth-order system in n steps with no more than 2n(n −1) processors. Comparing their performance with the Gaussian elimination algorithm (GE), we show that they are almost 100% faster than the latter. This speedup is achieved by dispensing with all the computation involved in the back-substitution phase of GE. It is also shown that the new algorithms exhibit error characteristics which are superior to GE. An n(n + 1) systolic array structure is proposed for the implementation of the new algorithms. We show that complete solutions can be obtained, through these single-phase solution methods, in 5n−log2n−4 computational steps, without the need for intermediate I/O operations.

Parallel parsing of programming languages

A new method of specifying the syntax of programming languages, known as hierarchical language specifications (HLS), is proposed. Efficient parallel algorithms for parsing languages generated by HLS are presented. These algorithms run on an exclusive-read exclusive-write parallel random-access machine. They require O(n) processors and O(log2n) time, where n is the length of the string to be parsed. The most important feature of these algorithms is that they do not use a stack.

SHAMP: An experimental shared memory multimicroprocessor system for performance evaluation of parallel algorithms

In this paper, the design and implementation of a single shared bus, shared memory multiprocessing system using Intel's single board computers is presented. The hardware configuration and the operating system developed to execute the parallel algorithms are discussed. The performance evaluation studies carried out on Image are outlined.

A new parallel algorithm for parsing arithmetic infix expressions

A new parallel algorithm for transforming an arithmetic infix expression into a par se tree is presented. The technique is based on a result due to Fischer (1980) which enables the construction of the parse tree, by appropriately scanning the vector of precedence values associated with the elements of the expression. The algorithm presented here is suitable for execution on a shared memory model of an SIMD machine with no read/write conflicts permitted. It uses O(n) processors and has a time complexity of O(log2n) where n is the expression length. Parallel algorithms for generating code for an SIMD machine are also presented.

A new algorithm for parallel solution of linear equations

Abstract is not available.

Parallel processor scheduling for minimizing total weighted tardiness using ant colony optimization

In the modern business environment, meeting due dates and avoiding delay penalties are very important goals that can be accomplished by minimizing total weighted tardiness. We consider a scheduling problem in a system of parallel processors with the objective of minimizing total weighted tardiness. Our aim in the present work is to develop an efficient algorithm for solving the parallel processor problem as compared to the available heuristics in the literature and we propose the ant colony optimization approach for this problem. An extensive experimentation is conducted to evaluate the performance of the ACO approach on different problem sizes with the varied tardiness factors. Our experimentation shows that the proposed ant colony optimization algorithm is giving promising results compared to the best of the available heuristics.

Note On The Stability Of Parallel Magnetic-Fields - Comment

It is shown that the conclusions arrived at regarding the instability of an incompressible fluid cylinder in the presence of the magnetic field and the streaming velocity in a recent communication easily follow from the study of propagation characteristics of Alfvén surface waves along cylindrical plasma columns made earlier.

Topochemical dimerization of non-parallel double bonds: 7-methoxycoumarin

X-ray crystal structure analysis of 7-methoxycoumarin reveals that the reactive double bonds are rotated by about 65° with respect to each other, the centre-to-centre distance between the double bonds being 3.83 Å. In spite of this unfavourable arrangement, photodimerization occurs in the crystalline state yielding the syn-head-tail dimer as the only product. Lattice energy calculations on ground-state molecules in crystals throw light on the mechanism of the reaction.

Implementation of parallel tridiagonal solvers for a heterogeneous computing environment

Tridiagonal diagonally dominant linear systems arise in many scientific and engineering applications. The standard Thomas algorithm for solving such systems is inherently serial forming a bottleneck in computation. Algorithms such as cyclic reduction and SPIKE reduce a single large tridiagonal system into multiple small independent systems which can be solved in parallel. We have developed portable cyclic reduction and SPIKE algorithm OpenCL implementations with the intent to target a range of co-processors in a heterogeneous computing environment including Field Programmable Gate Arrays (FPGAs), Graphics Processing Units (GPUs) and other multi-core processors. In this paper, we evaluate these designs in the context of solver performance, resource efficiency and numerical accuracy.

Parallel polygon scan conversion algorithms: Performance evaluation on a shared bus architecture

In this paper, three parallel polygon scan conversion algorithms have been proposed, and their performance when executed on a shared bus architecture has been compared. It has been shown that the parallel algorithm that does not use edge coherence performs better than those that use edge coherence. Further, a multiprocessing architecture has been proposed to execute the parallel polygon scan conversion algorithms more efficiently than a single shared bus architecture.