Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times larger than the size of the document. A considerable amount of memory is needed to store the tree structure of the XML document. Here a technique is presented that allows to represent the tree structure of an XML docu...

In this paper we develop a technique for transforming an internal-memory tree data structure into an external-memory structure. We show how the technique can be used to develop a search tree like structure , a priority queue, a (one-dimensional) range tree and a segment tree, and give examples of how these structures can be used to develop eecient I/O algorithms. All our algorithms are either e...

The main purpose of this paper is to introduce several concepts of the metric-like spaces. For instance, we define concepts such as equal-like points, cluster points and completely separate points. Furthermore, this paper is an attempt to present compatibility definitions for the distance between a point and a subset of a metric-like space and also for the distance between two subsets of a metr...

In this paper we show that an arbitrary tree structured QBD Markov chain can be embedded in a tree-like QBD process with a special structure. Moreover, we present an algebraic proof that applying the natural fixed point iteration (FPI) to the nonlinear matrix equation V = B + ∑d s=1 Us(I − V )Ds that solves the tree-like QBD process, is equivalent to the more complicated iterative algorithm pre...

evaluating the forest stands structure in different development stages is one of the ways for better understanding the forest dynamics and its response to natural disturbances. this study was carried out in the compartment 319, kheiroud forest in order to quantify the structure properties of mixed beech stands in the stem exclusion phase. for this purpose, three one-hectare sample plots were se...

We propose a novel recommendation method based on tree. With user behavior data, the tree based model can capture user interests from coarse to fine, by traversing nodes top down and make decisions whether to pick up each node to user. Compared to traditional model-based methods like matrix factorization (MF), our tree based model does not have to fetch and estimate each item in the entire set....

In this paper we introduce the notion of an Open Non-uniform Cylindrical Algebraic Decomposition (NuCAD), and present an efficient model-based algorithm for constructing an Open NuCAD from an input formula. A NuCAD is a generalization of Cylindrical Algebraic Decomposition (CAD) as defined by Collins in his seminal work from the early 1970s, and as extended in concepts like Hong’s partial CAD. ...