نتایج جستجو برای: parallel flow
تعداد نتایج: 692514 فیلتر نتایج به سال:
flow in natural river bends is a complex and turbulent phenomenon which affects the scour and sedimentations and causes an irregular bed topography on the bed. for the reason, the flow hydralics and the parameters which affect the flow to be studied and understand. in this study the effect of bed and wall roughness using the software fluent discussed in a sharp 90-degree flume bend with 40.3cm ...
In this paper, flow and heat transfer of nanofluid through a converging or diverging channel with porous medium is investigated. The fluid constantly flows under the effect of magnetic field through the channel. The diverging/converging fluid motion is modeled using the momentum and energy equations. The influence of some parameters such as opening channel angle, Reynolds number and Darcy’s num...
This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...
In this paper, unsteady two phase simulation of nanofluid flow and heat transfer between moving parallel plates, in presence of the magnetic field is studied. The significant effects of thermophoresis and Brownian motion have been contained in the model of nanofluid flow. The three governing equations are solved simultaneously via Galerkin method (GM). Comparison with other works indicates that...
We consider the NP-hard problem of scheduling n jobs in m two-stage parallel flow shops so as to minimize the makespan. This problem decomposes into two subproblems: assigning the jobs to parallel flow shops; and scheduling the jobs assigned to the same flow shop by use of Johnson’s rule. For m = 2, we present a 32 -approximation algorithm, and for m = 3, we present a 12 7 -approximation algori...
The maximum flow problem is one of the most fundamental problems in network flow theory and has been investigated extensively. The Ford-Fulkerson algorithm is a simple algorithm to solve the maximum flow problem based on the idea of augmenting path. But its time complexity is high and it’s a pseudo-polynomial time algorithm. In this paper, a parallel Ford-Fulkerson algorithm is given. The idea ...
The external and independent control of plasma flow velocity shears parallel and perpendicular to magnetic field lines is realized using segmented collisionless-plasma sources. Electrostatic ion-cyclotron instabilities are observed to be suppressed by the perpendicular flow velocity shears, the suppression physics of which is found to be distinguished into two aspects. On the other hand, the pa...
This paper describes a general technique to identify control flow errors in parallel programs, which can be automated into a compiler. The compiler builds a system of linear equations that describes the global control flow of the whole program. Solving these equations using standard techniques of linear algebra can locate a wide range of control flow bugs at compile time. This paper also descri...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید