We study the edit-distance of regular tree languages. The edit-distance is a metric for measuring the similarity or dissimilarity between two objects, and a regular tree language is a set of trees accepted by a finite-state tree automaton or described by a regular tree grammar. Given two regular tree languages L and R, we define the editdistance d(L,R) between L and R to be the minimum edit-dis...

We consider the K-satisfiability problem on a regular d-ary rooted tree. For this model, we demonstrate how we can calculate in closed form, the moments of the total number of solutions as a function of d and K, where the average is over all realizations, for a fixed assignment of the surface variables. We find that different moments pick out different ’critical’ values of d, below which they d...

k-d tree (or Multidimensional binary search tree) is often used as a data structure for organizing and manipulating spatial data. We present several algorithms for the parallel construction of k-d trees on coarse-grained distributed memory parallel machines. We analyze them both theoretically and experimentally. Experimental results on the CM-5 are reported. 1 Multidimensional Binary Search Tre...

This paper explores a tree kernel-based method for nominal semantic role labeling (SRL). In particular, a new dependency-driven constituent parse tree (D-CPT) structure is proposed to better represent the dependency relations in a CPT-style structure, which employs dependency relation types instead of phrase labels in CPT. In this way, D-CPT not only keeps the dependency relationship informatio...

knowing and conducting studies on size characters of trees is essential for assessing the tree volumeand/or other statistical parameters and also forest management. the characteristics of 529 treesincluding diameter at breast height (dbh) and total height were measured in an even-aged fraxinusstand for two periods from 2005 to 2012 in chelir district, a part of experimental kheyrud forest.resul...

Using existing equations to estimate the biomass of a single tree or a forest stand still involves large uncertainties. In this study, we developed individual-tree biomass models for Chinese Fir (Cunninghamia lanceolata.) stands in Fujian Province, southeast China, by using 74 previously established models that have been most commonly used to estimate tree biomass. We selected the best fit mode...

We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set of n points in IR, for fixed d ≥ 1, using the simple rule of splitting each node’s hyperrectangular region with a hyperplane that cuts the longest side. An interesting consequence of the packing lemma is that standar...

We present a conceptual model linking dry-mass allocational allometry, hydraulic limitation, and vertical stratification of environmental conditions to patterns in vertical tree growth and tree height. Maximum tree height should increase with relative moisture supply and both should drive variation in apparent stomatal limitation. Carbon isotope discrimination (D) should not vary with maximum t...

The suffix tree — the compacted trie of all the suffixes of a string — is the most important and widely-used data structure in string processing. We consider a natural combinatorial question about suffix trees: for a string S of length n, how many nodes νS(d) can there be at (string) depth d in its suffix tree? We prove ν(n, d) = maxS∈Σn νS(d) is O((n/d) logn), and show that this bound is almos...

Let Tn be a (d − 1)-ary tree of height n. A bilateral regular tree is the multigraph T d n,n that is defined by : (i) juxtaposing two Tn’s, (ii) drawing a new edge between two roots and (iii) drawing d− 1 edges between each leaf and a new vertex, called the sink. In this paper the sandpile group of T d n,n is determined.