Physiological measurements like branch angles, branch lengths, branch diameters and branch cross-sectional area of the 3-D pulmonary tree structures are clinically essential in evaluating the function of normal and diseased lung and during the breathing process. In order to facilitate these measurements and study relative structural changes, the 3-D lung tree volumes are reduced to a 3-D Euclid...

The existence of small d-regular graphs of a prescribed girth g is equivalent to the existence of certain codes in the d-regular infinite tree. We show that in the tree ‘‘perfect’’ codes exist, but those are usually not ‘‘graphic’’. We also give an explicit coloring that is ‘‘nearly perfect’’ as well as ‘‘nearly graphic’’. r 2004 Elsevier Inc. All rights reserved.

high-density planting system is one of the effective methods for improving production and profitability of tree orchards. in this research, the effects of four planting densities (1904, 2666, 3137 and 4800 tree/ha) on annual shoot growth, tree yield, physicochemical properties of fruit and leaf mineral contents of apple (malus domestica borkh cv ‘granny smith’treegrafted on m26 clonal rootstock...

Heap security has been a major concern since the past two decades. Recently many methods have been proposed to secure heap i.e. to avoid heap overrun and attacks. The paper describes a method suggested to secure heap at the operating system level. Major emphasis is given to Solaris operating system’s dynamic memory manager. When memory is required dynamically during runtime, the SysVmalloc acts...

In this paper, we consider the Steiner problem in graphs, which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph with nonnegative edge costs. We use the formulation of this problem as a shortest spanning tree (SST) problem with additional constraints given previously in the literature. We strengthen this SST formulation and present a branch and...

In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a “self-avoiding tree-indexed random walk”. The order of the tree T can be as large as a constant fraction of the order of the graph G, and the maximum degree of T can be close to the minimum degree of G. We show that our algorithm works in a variety of intere...

To quantify the relationship between temporal and spatial variation in tree transpiration, we measured sap flow in 129 trees with constant-heat sap flow sensors in a subalpine forest in southern Wyoming, USA. The forest stand was located along a soil water gradient from a stream side to near the top of a ridge. The stand was dominated by Pinus contorta Dougl. ex Loud. with Picea engelmannii Par...

The distance matrix of a tree is extensively investigated in the literature. The classical result concerns the determinant of the matrix D (see Graham and Pollak [7]), which asserts that if T is any tree on n vertices then det(D) = (−1)(n− 1)2. Thus, det(D) is a function dependent only on n, the number of vertices of the tree. The formula for the inverse of the matrix D was obtained in a subseq...

Parallel algorithms for main memory databases become an increasingly interesting topic as the amount of main memory and the number of CPU cores in computer systems increase. This paper suggests a method for parallelizing the k-d tree and its kNN search algorithm as well as suggesting optimizations. In empirical tests, the resulting modified k-d tree outperforms both the k-d tree and a paralleli...

The Gilbert network problem is a generalization of the Steiner minimal tree problem derived by adding flow-dependent weights to the edges. In this paper, we define a special class of minimum Gilbert networks, called pseudo-Gilbert–Steiner trees, and we show that it can be constructed by Gilbert’s generalization of Melzak’s method. Besides, a counterexample, a pseudo-Gilbert–Steiner tree, is con...