نتایج جستجو برای: pipe bend
تعداد نتایج: 22622 فیلتر نتایج به سال:
Predicting the agglomeration and breakage of solid particles is important when designing a compact efficient water purification process. A coupled computational fluid dynamics model presented where population balance equation applied to track particle size distribution for periodic turbulent pipe flow with 180° bends Reynolds numbers 15,000<Ref<35,000 bend radii rB=dh,rB=1.5dh rB=2.5dh. The cri...
Abstract The Downstream Surge Chamber of a pumped storage power station adopts impedance with an upper chamber layout. tailrace tunnel is connected the connecting pipe through right-angle bifurcated and bend. layout type special water flow conditions are complex. To study its hydraulic characteristics, three-dimensional field mathematical model at bottom surge established, variation law charact...
In this research, the effect of installing position of bridge pier on scouring depth was studied in a bend laboratory flume, which is made of Plexiglas with 180 bend and a relative radius of Rc/B=4.7. Tests were conducted using one pier 6 cm in diameter under four discharge conditions with constant depth of 12 cm and clear-water conditions. Flume bed was fully paved by uniform sand. It was foun...
In this paper the laminar flow in the rectangular channel bends is simulated using numerical techniques. The turning angle of the channel bend and the area ratio of the channel cross-section are two important parameters to be examined. For flow simulation, the body fitted 3-D continuity and momentum equations are used and a body fitted general purpose code is developed. The existing results of ...
In this paper the laminar flow in the rectangular channel bends is simulated using numerical techniques. The turning angle of the channel bend and the area ratio of the channel cross-section are two important parameters to be examined. For flow simulation, the body fitted 3-D continuity and momentum equations are used and a body fitted general purpose code is developed. The existing results of ...
An EPG-representation of a graph G is a collection of paths in a plane square grid, each corresponding to a single vertex of G, so that two vertices are adjacent if and only if their corresponding paths share infinitely many points. In this paper we focus on graphs admitting EPG-representations by paths with at most 2 bends. We show hardness of the recognition problem for this class of graphs, ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید