نتایج جستجو برای: bejan number

تعداد نتایج: 1168369  

Thermodynamic analysis of a steady state flow and heat transfer of an Oldroyd 8-constant fluid with effect of heat source, velocity slip and buoyancy force under tranverse a magnetic field is is carried out in this paper. The model for momentum and energy balance is tackled numerically using Method of Weighted Residual (MWR). Partition method is used to minimize the associated residuals. The re...

A edge 2-rainbow dominating function (E2RDF) of a graph G is a ‎function f from the edge set E(G) to the set of all subsets‎ ‎of the set {1,2} such that for any edge.......................

Journal: :Frontiers in Physics 2022

The aim of this research work is to study the performance hybrid eclectically conducting nanofluid (MWCNT-Fe 3 O 4 ) with entropy optimization impacts using CVFEM approach. 3D and contour plots are two types outcomes that extend discrepancy analyzed variables. Newtonian liquid presumed as a testing fluid, non-Darcy model employed simulate permeable domain. geometry has adiabatic walls one wavy ...

Journal: :نشریه شهرسازی و معماری 0

0

Journal: :نشریه شهرسازی و معماری 0

0

Journal: :نشریه شهرسازی و معماری 0

0

Journal: :نشریه شهرسازی و معماری 0

0

Journal: :نشریه شهرسازی و معماری 0

0

Journal: :Entropy 2001
Shu-Kun Lin

Seemingly universal geometric forms unite the flow systems of engineering and nature. For example, tree-shaped flows can be seen in computers, lungs, dendritic crystals, urban street patterns, and communication links. In this groundbreaking book, Adrian Bejan considers the design and optimization of engineered systems and discovers a deterministic principle of the generation of geometric form i...

Journal: :iranian journal of mathematical chemistry 2014
m. ghorbani m. songhori

the chromatic number of a graph g, denoted by χ(g), is the minimum number of colors such that g can be colored with these colors in such a way that no two adjacent vertices have the same color. a clique in a graph is a set of mutually adjacent vertices. the maximum size of a clique in a graph g is called the clique number of g. the turán graph tn(k) is a complete k-partite graph whose partition...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید