We present a dynamic data structure for representing a graph G with tree-depth at most D. Tree-depth is an important graph parameter which arose in the study of sparse graph classes. The structure allows addition and removal of edges and vertices such that the resulting graph still has tree-depth at most D, in time bounds depending only on D. A tree-depth decomposition of the graph is maintaine...

The spatial resolution of disparity perception is poor compared to luminance perception, yet we do not notice that depth edges are more blurry than luminance edges. Is this because the two cues are combined by the visual system? Subjects judged the locations of depth-defined or luminance-defined edges, which were separated by up to 5.6 min of arc. The perceived edge location was a function of t...

Monitoring of depth of anesthesia is an ongoing problem in anesthesia. In this paper, using SEF, BDR, BTR parameters which is calculated by power spectral density. EEG data were obtained from 7 patients (ASA I, II) during general anesthesia with sevoflurane. The anesthetic depth evaluation index algorism was embodied to obtain a quantified index with the scale of 0~100. Then quantified index co...

BACKGROUND Epibenthic cyanobacteria often grow in environments where the fluctuation of light intensity and quality is extreme and frequent. Different strategies have been developed to cope with this problem depending on the distribution of cyanobacteria in the water column. PRINCIPAL FINDINGS Here we provide an experimental proof that the light intensity plays an important role in the vertic...

The quenched solid density functional theory (QSDFT) is employed to study methane adsorption on coal at geological conditions. Themain focus is made on coal deformation in the course of adsorption that may result in either expansion/swelling or contraction, depending upon the pressure, temperature, and pore size. Twoqualitatively different types of deformation behaviorwere found depending upon ...

Following the model introduced by Aguech, Lasmar and Mahmoud [Probab. Engrg. Inform. Sci. 21 (2007) 133–141], the weighted depth of a node in a labelled rooted tree is the sum of all labels on the path connecting the node to the root. We analyze weighted depths of nodes with given labels, the last inserted node, nodes ordered as visited by the depth first search process, the weighted path lengt...