Learn More
The <i>canonical ordering</i> for triconnected planar graphs is a powerful method for designing graph algorithms. This paper introduces the <i>orderly pair</i> of connected planar graphs, which extends the concept of canonical ordering to planar graphs not required to be triconnected. Let <i>G</i> be a connected planar graph. We give a linear-time algorithm(More)
—Power consumption is one of the most critical problems in data centers. One effective way to reduce power consumption is to consolidate the hosting workloads and shut down physical machines which become idle after consolidation. Server consolidation is a NP-hard problem. In this paper, a new algorithms Dynamic Round-Robin (DRR), is proposed for(More)
Let G be an n-node planar graph. In a visibility representation of G, each node of G is represented by a horizontal line segment such that the line segments representing any two adjacent nodes of G are vertically visible to each other. In the present paper we give the best known compact visibility representation of G. Given a canonical ordering of the(More)
Erlotinib, an EGFR tyrosine kinase inhibitor, can inhibit the proliferation and survival of cancer cells. It has been widely used to treat non-small cell lung cancer. This study aimed to evaluate the effects of erlotinib on bronchial hyperresponsiveness, airway inflammation, and airway remodeling in sensitized, ovalbumin-challenged rats. Two experimental(More)
To investigate whether cardiac dysfunction or abnormal measurements on cardiopulmonary exercise testing (CPET) are present in patients with obstructive sleep apnea syndrome (OSAS) and what factors are responsible for exercise limitation in these patients. We enrolled 20 patients with moderate or severe OSAS in the OSA group and 20 subjects without OSAS in(More)