On the Realization of Tree Graphs

1968 ◽  
Vol 15 (3) ◽  
pp. 271-273 ◽  
Author(s):  
G. Kishi ◽  
Y. Kajitani
Keyword(s):  
Author(s):  
Yuning Jiang ◽  
Dimitris Kouzoupis ◽  
Haoyu Yin ◽  
Moritz Diehl ◽  
Boris Houska

2021 ◽  
Author(s):  
Jihan Almaas Novelia ◽  
Diari Indriati
Keyword(s):  

1988 ◽  
Vol 12 (3) ◽  
pp. 453-459 ◽  
Author(s):  
Guizhen Liu
Keyword(s):  

Author(s):  
Satya R. T. Peddada ◽  
Daniel R. Herber ◽  
Herschel C. Pangborn ◽  
Andrew G. Alleyne ◽  
James T. Allison

High-performance cooling is often necessary for thermal management of high power density systems. Both human intuition and vast experience may not be adequate to identify optimal thermal management designs as systems increase in size and complexity. This paper presents a design framework supporting comprehensive exploration of a class of single phase fluid-based cooling architectures. The candidate cooling system architectures are represented using labeled rooted tree graphs. Dynamic models are automatically generated from these trees using a graph-based thermal modeling framework. Optimal performance is determined by solving an appropriate fluid flow control problem, handling temperature constraints in the presence of exogenous heat loads. Rigorous case studies are performed in simulation, with components having variable sets of heat loads and temperature constraints. Results include optimization of thermal endurance for an enumerated set of 4,051 architectures. In addition, cooling system architectures capable of steady-state operation under a given loading are identified.


1976 ◽  
Vol 59 (1) ◽  
pp. 159-166 ◽  
Author(s):  
F. Solimano ◽  
E. Beretta

2013 ◽  
Vol 45 (1-2) ◽  
pp. 365-374 ◽  
Author(s):  
Kexiang Xu ◽  
Jinlan Wang ◽  
Hongshuang Liu
Keyword(s):  

10.37236/2401 ◽  
2012 ◽  
Vol 19 (2) ◽  
Author(s):  
Natalie Aisbett
Keyword(s):  

We prove a conjecture of Postnikov, Reiner and Williams by defining a partial order on the set of tree graphs with $n$ vertices that induces inequalities between the $\gamma$-polynomials of their associated graph-associahedra. The partial order is given by relating trees that can be obtained from one another by operations called tree shifts. We also show that tree shifts lower the $\gamma$-polynomials of graphs that are not trees, as do the flossing moves of Babson and Reiner.


Sign in / Sign up

Export Citation Format

Share Document