A graph G = (V, E) is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers dmin and dmax, dmin ≤ dmax, such that each node u ∈ V is uniquely associated to a leaf of T and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (u, v) ≤ dmax, where dT (u, v) is the sum of the weights of the edges on the unique path PT (u, v) from u to v in T...

Wrinkle ridges are the largest and most morphologically complex contractional landforms found on Moon. They occur exclusively in mare basalt thought to result from load induced subsidence flexure of lunar lithosphere. The displacement-length (Dmax/L) relations wrinkle ridge thrust faults mascons, where basalts generally thickest, non-mascon settings compared. results show no statistically signi...

The distribution pattern of renal cell carcinoma (RCC) histological subtypes according to age, gender and tumor size has not been well illustrated in RCC patients living in fast-developing regions of China. We recruited 2941 patients with clear cell renal cell carcinoma (ccRCC), papillary renal cell carcinoma (PCC) or chromophobe from two hospitals in coastal China (2004-2012) consecutively and...

A graph G is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree T and two non-negative real numbers dmin and dmax such that each leaf lu of T corresponds to a vertex u ∈ V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (lu, lv) ≤ dmax where dT (lu, lv) is the sum of the weights of the edges on the unique path from lu to lv in T . In this paper we analyze...

Previous research on SDN traffic engineering mostly focuses on static traffic, whereas dynamic traffic, though more practical, has drawn much less attention. Especially, online SDN multicast that supports IETF dynamic group membership (i.e., any user can join or leave at any time) has not been explored. Different from traditional shortest-path trees (SPT) and graph theoretical Steiner trees (ST...

We develop for set cover games several general cost-sharing methods that are approximately budget-balanced, in the core, and/or group-strategyproof. We first study the cost sharing for a single set cover game, which does not have a budgetbalanced mechanism in the core. We show that there is no cost allocation method that can always recover more than 1 ln n of the total cost and in the core. Her...

Let H be a separable Hilbert space, Ac : Dc ⊂ H → H a densely defined unbounded operator, bounded from below, let Dmin be the domain of the closure of Ac and Dmax that of the adjoint. Assume that Dmax with the graph norm is compactly contained in H and that Dmin has finite positive codimension in Dmax. Then the set of domains of selfadjoint extensions of Ac has the structure of a finite-dimensi...

BACKGROUND AND AIMS The interspecific allometry of maximum plant height (Hmax) with respect to maximum basal stem diameter (Dmax) has been studied for leptocaulis dicot and conifer tree species. In contrast, virtually nothing is known about the interspecific allometry of pachycaulis species. Here, the interspecific allometries for palms, cacti and cycads are reported and compared with those of ...