Distance Preserving Graph Simplification

Large graphs are difficult to represent, visualize, and understand. In this paper, we introduce "gate graph" - a new approach to perform graph simplification. A gate graph provides a simplified topological view of the original graph. Specifically, we construct a gate graph from a large graph so that for any "non-local" vertex pair (distance higher than some threshold) in the original graph, their shortest-path distance can be recovered by consecutive "local" walks through the gate vertices in the gate graph. We perform a theoretical investigation on the gate-vertex set discovery problem. We characterize its computational complexity and reveal the upper bound of minimum gate-vertex set using VC-dimension theory. We propose an efficient mining algorithm to discover a gate-vertex set with guaranteed logarithmic bound. We further present a fast technique for pruning redundant edges in a gate graph. The detailed experimental results using both real and synthetic graphs demonstrate the effectiveness and efficiency of our approach.Comment: A short version of this paper will be published for ICDM'11, December 201

A review of development of micro-channel heat exchanger applied in air-conditioning system

AbstractMicro-channel heat exchanger(MCHX) has been increasingly applied in HVAC&R(Heating, Ventilation, and Air Conditioning & Refrigeration) field due to its higher efficiently heat transfer rate, more compact structure, lower cost. The characteristics of micro-channel heat transfer and fluid dynamics are summarized in this paper. The methods about optimizations (ie, geometry and thermodynamic performance) and the advantages and disadvantages of the MCHX are analyzed