Previous research has shown that composite shape-stabilized phase change material (CPCM) has a remarkable capacity for thermal storage and stabilization, and it can be directly applied to highway construction without leakage. However, recent studies on temperature changing behaviors of CPCM and asphalt mixture cannot intuitively reflect the thermoregulation mechanism and efficiency of CPCM on a...

This memorandum surveys the empirical literature about the effects and determinants of clusters. It finds that clusters generally lead to more innovations, knowledge spillovers, faster diffusion of technologies and knowledge, and competitive advantages. The presence of a skilled labour force is the most important determinant for clusters. Other important factors for the existence of clusters ar...

In this paper we study the spectra of certain classes of Room frames. The three spectra which we study are incomplete Room squares, uniform Room frames and Room frames of type 2t. These problems have been studied in numerous papers over the years; in this paper, we complete the three spectra. In addition we find a Howell cube of type H3(6, 10). This corrects a previous claim of nonexistence of ...

in this paper we define the removable cycle that, if $im$ is a class of graphs, $gin im$, the cycle $c$ in $g$ is called removable if $g-e(c)in im$. the removable cycles in eulerian graphs have been studied. we characterize eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for eulerian graph to have removable cycles h...

In this paper we study simple families of clustered graphs that are highly non connected. We start by studying 3-cluster cycles, that are clustered graphs such that the underlying graph is a simple cycle and there are three clusters all at the same level. We show that in this case testing the c-planarity can be done efficiently and give an efficient drawing algorithm. Also, we characterize 3-cl...

A Hamilton circle in an infinite graph is a homeomorphic copy of the unit circle S1 that contains all vertices and all ends precisely once. We prove that every connected, locally connected, locally finite, claw-free graph has such a Hamilton circle, extending a result of Oberly and Sumner to infinite graphs. Furthermore, we show that such graphs are Hamilton-connected if and only if they are 3-...