An XML structural join evaluates structural relationships (e.g. parent-child or ancestordescendant) between XML elements. It serves as an important computation unit in XML pattern matching. Several classical structural join algorithms have been proposed such as Stack-tree join and XR-Tree join. In this paper, we consider to answer the problem of structural join by partitioning. The Dietz number...

We give a general construction of triangulations starting from walk in the quarter plane with small steps, which is discrete version mating trees. use special instance this to bijection between maps equipped rooted spanning tree and walks plane. also show how allows recover several known bijections such objects uniform way.

BACKGROUND Plant food allergies associated with lipid transfer protein (LTP) have been widely described in the Mediterranean Basin. OBJECTIVE The aim of this work was to describe the clinical profile and pollen sensitization of plant food- allergic patients sensitized to LTP in a non-Mediterranean area. METHODS Patients with clear IgE-mediated symptoms associated with plant foods and a posi...

The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane. This network is referred to as a minimum λ-tree. The problem is a generalisation of the classical Euclidean and rectilinear Steiner ...

The partial discharge activity during propagation of electrical treeing in epoxy resin is described. The electrical trees grew in needle-plane samples without and with an internal barrier up to the final breakdown. The simultaneous taken tree growth and discharge activity show a correlation between the propagation state of the tree and the thereby measured PD. Especially the changes in the tree...

Information-Centric Networking (ICN) is one promising architecture paradigm which is a profound shift from address-centric communication model to information-centric one. Although ICN routing has attracted much attention from researchers, there are few researches on improving it inspired by other fields. In this paper, we propose a Routing mechanism for ICN incorporating Software-Defined Networ...

Given a set P of points in the plane, a geometric minimum-diameter spanning tree (GMDST) of P is a spanning tree of P such that the longest path through the tree is minimized. In this paper, we present an approximation algorithm that generates a tree whose diameter is no more than (1+ ) times that of a GMDST, for any > 0. Our algorithm reduces the problem to several grid-aligned versions of the...

We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighborhood of the root of the tree converges to a limit. We compute the limiting distribution explicitly and study its properties. We introduce an infinite random tree consistent with these limiting distributions and show ...