The Experts below are selected from a list of 267 Experts worldwide ranked by ideXlab platform
Anthony M Jacobi - One of the best experts on this subject based on the ideXlab platform.
-
Air-Side Heat TransFer and Friction Correlations For Flat-Tube Louver-Fin Heat Exchangers
Journal of Heat Transfer, 2009Co-Authors: Young-gil Park, Anthony M JacobiAbstract:The objective oF this study is to develop an accurate, reliable, and updated predictive model For the air-side perFormance oF Flat-tube louver-Fin heat exchangers. Using the most comprehensive experimental database to date—consisting oF 1030 heat-transFer and 1270 pressure-drop measurements, From nine independent laboratories For 126 sample heat exchangers—j- and F-Factor correlations are developed to predict the air-side perFormance oF heat exchangers. The database is analyzed, the Form oF the curve Fits is explored, and the predictive perFormance oF the correlations is evaluated. The j- and F-Factor correlations predict the experimental data with rms errors oF 11.5% and 16.1%, respectively. Multiple regressions For a locally linearized data model were used to estimate the conFidence intervals and covariances oF the regression constants. A comparison to prior correlations shows the proposed correlations to provide more accurate predictions and to span a much broader parameter space than prior work. Practical utility in design and optimization, and unavoidable limitations in developing such correlations are discussed.
-
Air-Side PerFormance oF Flat-Tube Louver-Fin Heat Exchangers Under Wet Conditions: Wet- SurFace Multipliers For Colburn j-and F-Factors
International Refrigeration and Air Conditioning Conference, 2006Co-Authors: Young-gil Park, Anthony M JacobiAbstract:Empirical correlations For the air-side thermal-hydraulic perFormance oF Flat-tube, louver-Fin heat exchangers under wet conditions are developed in terms oF wet-surFace multipliers. Experimental database oF dry and wet air-side perFormance has been compiled From related works in the literature. Important design parameters are identiFied and used in the correlations. The beneFits oF wet-surFace multipliers in comparison to independent wet j-and F-Factor correlations are discussed. An alternative data modeling approach is brieFly introduced and compared with the conventional correlations.
Young-gil Park - One of the best experts on this subject based on the ideXlab platform.
-
Air-Side Heat TransFer and Friction Correlations For Flat-Tube Louver-Fin Heat Exchangers
Journal of Heat Transfer, 2009Co-Authors: Young-gil Park, Anthony M JacobiAbstract:The objective oF this study is to develop an accurate, reliable, and updated predictive model For the air-side perFormance oF Flat-tube louver-Fin heat exchangers. Using the most comprehensive experimental database to date—consisting oF 1030 heat-transFer and 1270 pressure-drop measurements, From nine independent laboratories For 126 sample heat exchangers—j- and F-Factor correlations are developed to predict the air-side perFormance oF heat exchangers. The database is analyzed, the Form oF the curve Fits is explored, and the predictive perFormance oF the correlations is evaluated. The j- and F-Factor correlations predict the experimental data with rms errors oF 11.5% and 16.1%, respectively. Multiple regressions For a locally linearized data model were used to estimate the conFidence intervals and covariances oF the regression constants. A comparison to prior correlations shows the proposed correlations to provide more accurate predictions and to span a much broader parameter space than prior work. Practical utility in design and optimization, and unavoidable limitations in developing such correlations are discussed.
-
Air-Side PerFormance oF Flat-Tube Louver-Fin Heat Exchangers Under Wet Conditions: Wet- SurFace Multipliers For Colburn j-and F-Factors
International Refrigeration and Air Conditioning Conference, 2006Co-Authors: Young-gil Park, Anthony M JacobiAbstract:Empirical correlations For the air-side thermal-hydraulic perFormance oF Flat-tube, louver-Fin heat exchangers under wet conditions are developed in terms oF wet-surFace multipliers. Experimental database oF dry and wet air-side perFormance has been compiled From related works in the literature. Important design parameters are identiFied and used in the correlations. The beneFits oF wet-surFace multipliers in comparison to independent wet j-and F-Factor correlations are discussed. An alternative data modeling approach is brieFly introduced and compared with the conventional correlations.
Piotr Sankowski - One of the best experts on this subject based on the ideXlab platform.
-
Algebraic Algorithms For b-Matching, Shortest Undirected Paths, and F-Factors
arXiv: Data Structures and Algorithms, 2013Co-Authors: Harold N. Gabow, Piotr SankowskiAbstract:Let G=(V,E) be a graph with F:V\to Z_+ a Function assigning degree bounds to vertices. We present the First eFFicient algebraic algorithm to Find an F-Factor. The time is \tilde{O}(F(V)^{\omega}). More generally For graphs with integral edge weights oF maximum absolute value W we Find a maximum weight F-Factor in time \tilde{O}(WF(V)^{\omega}). (The algorithms are randomized, correct with high probability and Las Vegas; the time bound is worst-case.) We also present three specializations oF these algorithms: For maximum weight perFect F-matching the algorithm is considerably simpler (and almost identical to its special case oF ordinary weighted matching). For the single-source shortest-path problem in undirected graphs with conservative edge weights, we present a generalization oF the shortest-path tree, and we compute it in \tilde{O(Wn^{\omega}) time. For bipartite graphs, we improve the known complexity bounds For vertex capacitated max-Flow and min-cost max-Flow on a subclass oF graphs.
-
Algebraic Algorithms For B-Matching, Shortest Undirected Paths, and F-Factors
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013Co-Authors: Harold N. Gabow, Piotr SankowskiAbstract:Let G = (V, E) be a graph with F : V → Z+ a Function assigning degree bounds to vertices. We present the First eFFicient algebraic algorithm to Find an F-Factor. The time is O(F(V )ω). More generally For graphs with integral edge weights oF maximum absolute value W we Find a maximum weight F-Factor in time Õ(WF(V )ω). (The algorithms are correct with high probability and can be made Las Vegas.) We also present three specializations oF these algorithms: For maximum weight perFect F-matching the algorithm is considerably simpler (and almost identical to its special case oF ordinary weighted matching). For the single-source shortestpath problem in undirected graphs with conservative edge weights, we deFine a generalization oF the shortest-path tree, and we compute it in ̃Õ(Wnω) time. For bipartite graphs, we improve the known complexity bounds For vertex-capacitated max-Flow and min-cost max-Flow on a subclass oF graphs.
Hossein Shokuhmand - One of the best experts on this subject based on the ideXlab platform.
-
Experimental and numerical investigation oF the heat transFer augmentation and pressure drop in simple, dimpled and perForated dimpled louver Fin banks with an in-line or staggered arrangement
Applied Thermal Engineering, 2015Co-Authors: F. Sangtarash, Hossein ShokuhmandAbstract:Numerical and experimental models have been developed to investigate the eFFect oF adding an in-line and staggered arrangement oF dimples and perForated dimples to multilouvered Fins on the heat transFer augmentation and the pressure drop oF the air Flow through a multilouvered Fin bank. Three-dimensional simulations oF single row oF louvers were conducted For the given geometries. Simulations were perFormed For diFFerent Reynolds numbers. The simulations revealed that the heat transFer and temperature augmentations occur due to the existence oF a circulation region that is created by the dimple. Additionally, continuous temperature gradients have been observed over the louver surFace with the highest temperature at the base oF the louver and the lowest temperature at the middle oF the louver. Additionally, the diFFerence between these two points is more obvious with greater Reynolds numbers. Fin eFFiciency and Fin eFFectiveness were calculated to assess louver perFormance. The air-side perFormance oF the heat exchanger is evaluated by calculating the Colburn j Factor and the Fanning Friction F Factor. The results demonstrate that adding dimples on the louver surFace increases the j Factor and the F Factor. Likewise, adding perForation to the dimples results in the same increase. The present results indicate that compared with the in-line arrangement, the staggered arrangement could eFFectively enhance the heat transFer perFormance.
Harold N. Gabow - One of the best experts on this subject based on the ideXlab platform.
-
Algebraic Algorithms For b-Matching, Shortest Undirected Paths, and F-Factors
arXiv: Data Structures and Algorithms, 2013Co-Authors: Harold N. Gabow, Piotr SankowskiAbstract:Let G=(V,E) be a graph with F:V\to Z_+ a Function assigning degree bounds to vertices. We present the First eFFicient algebraic algorithm to Find an F-Factor. The time is \tilde{O}(F(V)^{\omega}). More generally For graphs with integral edge weights oF maximum absolute value W we Find a maximum weight F-Factor in time \tilde{O}(WF(V)^{\omega}). (The algorithms are randomized, correct with high probability and Las Vegas; the time bound is worst-case.) We also present three specializations oF these algorithms: For maximum weight perFect F-matching the algorithm is considerably simpler (and almost identical to its special case oF ordinary weighted matching). For the single-source shortest-path problem in undirected graphs with conservative edge weights, we present a generalization oF the shortest-path tree, and we compute it in \tilde{O(Wn^{\omega}) time. For bipartite graphs, we improve the known complexity bounds For vertex capacitated max-Flow and min-cost max-Flow on a subclass oF graphs.
-
Algebraic Algorithms For B-Matching, Shortest Undirected Paths, and F-Factors
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013Co-Authors: Harold N. Gabow, Piotr SankowskiAbstract:Let G = (V, E) be a graph with F : V → Z+ a Function assigning degree bounds to vertices. We present the First eFFicient algebraic algorithm to Find an F-Factor. The time is O(F(V )ω). More generally For graphs with integral edge weights oF maximum absolute value W we Find a maximum weight F-Factor in time Õ(WF(V )ω). (The algorithms are correct with high probability and can be made Las Vegas.) We also present three specializations oF these algorithms: For maximum weight perFect F-matching the algorithm is considerably simpler (and almost identical to its special case oF ordinary weighted matching). For the single-source shortestpath problem in undirected graphs with conservative edge weights, we deFine a generalization oF the shortest-path tree, and we compute it in ̃Õ(Wnω) time. For bipartite graphs, we improve the known complexity bounds For vertex-capacitated max-Flow and min-cost max-Flow on a subclass oF graphs.