265 resultados para Traffic flow
Resumo:
A simple mathematical model depicting blood flow in the capillary is developed with an emphasis on the permeability property of the blood vessel based on Starling's hypothesis. In this study the effect of inertia has been neglected in comparison with the viscosity on the basis of the smallness of the Reynolds number of the flow in the capillary. The capillary blood vessel is approximated by a circular cylindrical tube with a permeable wall. The blood is represented by a couple stress fluid. With such an ideal model the velocity and pressure fields are determined. It is shown that an increase in the couple stress parameter increases the resistance to the flow and thereby decreases the volume rate flow. A comparison of the results with those of the Newtonian case has also been made.
Resumo:
The hydrodynamical problem of flow in proximal renal tubule is investigated by considering axisymmetric flow of a viscous, incompressible fluid through a long narrow tube of varying cross-section with reabsorption at the wall. Two cases for reabsorption have been studied (i) when the bulk flow,Q, decays exponentially with the axial distancex, and (ii) whenQ is an arbitrary function ofx such thatQ-Q 0 can be expressed as a Fourier integral (whereQ 0 is the flux atx=0). The analytic expressions for flow variables have been obtained by applying perturbation method in terms of wall parameter ε. The effects of ε on pressure drop across the tube, radial velocity and wall shear have been studied in the case of exponentially decaying bulk flow and it has been found that the results are in agreement with the existing ones for the renal tubules.
Resumo:
The effect of injection and suction on the generalised vortex flow of a steady laminar incompressible fluid over a stationary infinite disc with or without magnetic field under boundary-layer approximations has been studied. The coupled nonlinear ordinary differential equations governing the self-similar flow have been numerically solved using the finite-difference scheme. The results indicate that the injection produces a deeper inflow layer and de-stabilises the motion while suction or magnetic field suppresses the inflow layer and produces stability. The effect of decreasingn, the parameter characterising the nature of vortex flow, is similar to that of increasing the injection rate.
Resumo:
The unsteady laminar incompressible three-dimensional boundary layer flow and heat transfer on a flat plate with an attached cylinder have been studied when the free stream velocity components and wall temperature vary inversely as linear and quadratic functions of time, respectively. The governing semisimilar partial differential equations with three independent variables have been solved numerically using a quasilinear finite-difference scheme. The results indicate that the skin friction increases with parameter λ which characterizes the unsteadiness in the free stream velocity and the streamwise distance Image , but the heat transfer decreases. However, the skin friction and heat transfer are found to change little along Image . The effect of the Prandtl number on the heat transfer is found to be more pronounced when λ is small, whereas the effect of the dissipation parameter is more pronounced when λ is comparatively large.
Resumo:
The surface tension gradient driven flow that occurs during laser melting has been studied. The vorticity-streamfunction form of the Navier-Stokes equations and the energy equation has been solved by the ‘Alternative Direction Implicit’ method. It has been shown that the inertia forces in the melt strongly influence the flow pattern in the melt. The convection in the melt modifies the isotherms in the melt at high surface tension Reynolds number and high Prandtl number. The buoyancy driven flow has been shown to be negligible compared to the surface tension gradient driven flow in laser melting.
Resumo:
The network scenario is that of an infrastructure IEEE 802.11 WLAN with a single AP with which several stations (STAs) are associated. The AP has a finite size buffer for storing packets. In this scenario, we consider TCP controlled upload and download file transfers between the STAs and a server on the wireline LAN (e.g., 100 Mbps Ethernet) to which the AP is connected. In such a situation, it is known (see, for example, (3), [9]) that because of packet loss due to finite buffers at the Ap, upload file transfers obtain larger throughputs than download transfers. We provide an analytical model for estimating the upload and download throughputs as a function of the buffer size at the AP. We provide models for the undelayed and delayed ACK cases for a TCP that performs loss recovery only by timeout, and also for TCP Reno.
Resumo:
Abstract is not available.
Resumo:
Many novel computer architectures like array and multiprocessors which achieve high performance through the use of concurrency exploit variations of the von Neumann model of computation. The effective utilization of the machines makes special demands on programmers and their programming languages, such as the structuring of data into vectors or the partitioning of programs into concurrent processes. In comparison, the data flow model of computation demands only that the principle of structured programming be followed. A data flow program, often represented as a data flow graph, is a program that expresses a computation by indicating the data dependencies among operators. A data flow computer is a machine designed to take advantage of concurrency in data flow graphs by executing data independent operations in parallel. In this paper, we discuss the design of a high level language (DFL: Data Flow Language) suitable for data flow computers. Some sample procedures in DFL are presented. The implementation aspects have not been discussed in detail since there are no new problems encountered. The language DFL embodies the concepts of functional programming, but in appearance closely resembles Pascal. The language is a better vehicle than the data flow graph for expressing a parallel algorithm. The compiler has been implemented on a DEC 1090 system in Pascal.
Resumo:
Flow-insensitive solutions to dataflow problems have been known to be highly scalable; however also hugely imprecise. For non-separable dataflow problems this solution is further degraded due to spurious facts generated as a result of dependence among the dataflow facts. We propose an improvement to the standard flow-insensitive analysis by creating a generalized version of the dominator relation that reduces the number of spurious facts generated. In addition, the solution obtained contains extra information to facilitate the extraction of a better solution at any program point, very close to the flow-sensitive solution. To improve the solution further, we propose the use of an intra-block variable renaming scheme. We illustrate these concepts using two classic non-separable dataflow problems --- points-to analysis and constant propagation.
Resumo:
The possible role of reaj fluid effects in two aspects of flow cavitation namely inception and separation is discussed. This is primarily qualitative in the case of inception whereas some quantitative results are presented in the case of separation. Existing evidence clearly indicates that in particular viscous effects can play a significant role in determining the conditions for cavitation inception and in determining the location of cavitation separation from smooth bodies.
Resumo:
Consummating our earlier work [1], the unsteady flow of a fairly concentrated suspension due to a single contraction or expansion of the walls of a tube is studied. A comparison of the results obtained by using two different formulae for the additional drag terms in the governing equations has been made. A region of circulation in the flow field is observed when the volume fraction Z greater-or-equal, slanted 0.3, the Schmidt number Sc < 1 and the density ratio (density of the particulate phase/density of the fluid phase) > 1.
Resumo:
Data flow computers are high-speed machines in which an instruction is executed as soon as all its operands are available. This paper describes the EXtended MANchester (EXMAN) data flow computer which incorporates three major extensions to the basic Manchester machine. As extensions we provide a multiple matching units scheme, an efficient, implementation of array data structure, and a facility to concurrently execute reentrant routines. A simulator for the EXMAN computer has been coded in the discrete event simulation language, SIMULA 67, on the DEC 1090 system. Performance analysis studies have been conducted on the simulated EXMAN computer to study the effectiveness of the proposed extensions. The performance experiments have been carried out using three sample problems: matrix multiplication, Bresenham's line drawing algorithm, and the polygon scan-conversion algorithm.
Resumo:
A residual-based strategy to estimate the local truncation error in a finite volume framework for steady compressible flows is proposed. This estimator, referred to as the -parameter, is derived from the imbalance arising from the use of an exact operator on the numerical solution for conservation laws. The behaviour of the residual estimator for linear and non-linear hyperbolic problems is systematically analysed. The relationship of the residual to the global error is also studied. The -parameter is used to derive a target length scale and consequently devise a suitable criterion for refinement/derefinement. This strategy, devoid of any user-defined parameters, is validated using two standard test cases involving smooth flows. A hybrid adaptive strategy based on both the error indicators and the -parameter, for flows involving shocks is also developed. Numerical studies on several compressible flow cases show that the adaptive algorithm performs excellently well in both two and three dimensions.