Showing papers on "Tree (data structure) published in 1973"
129 citations
TL;DR: An approach of representing patterns by trees rather than by strings is described, and the tree system is applied to the problem of syntactic pattern recognition.
Abstract: An approach of representing patterns by trees rather than by strings is described. A review of tree systems that include tree grammars, transformations, and mappings on trees and tree automata is briefly presented. The tree system is then applied to the problem of syntactic pattern recognition. Tree grammars are used for pattern description, and tree automata are used for classification. Illustrative examples include the application of the tree system to the classification of bubble chamber events and some English characters.
129 citations
102 citations
TL;DR: This application shows that tree metrics can be used to select a componential analysis which is maximally consistent with an empirically derived set of trees.
99 citations
TL;DR: Soil and plant analysis for tree culture as discussed by the authors, Soil and Plant Analysis for Tree culture, مرکز فناوری اطلاعات و اشاوρزی
Abstract: Soil and plant analysis for tree culture , Soil and plant analysis for tree culture , مرکز فناوری اطلاعات و اطلاع رسانی کشاورزی
90 citations
TL;DR: The desirability and the advantages of deriving taper equations from existing volume equations are discussed and it is demonstrated that the most common types of volume equations can be converted to tapers.
Abstract: The desirability and the advantages of deriving taper equations from existing volume equations are discussed. It is demonstrated that the most common types of volume equations can be converted to c...
89 citations
TL;DR: A new competition index, modified Area Potentially Available (APA), was tested in a complex unevenaged stand composed of 19 different hardwood species and exhibits a strong correlation with individual tree basal area growth.
Abstract: A new competition index, modified Area Potentially Available (APA), was tested in a complex unevenaged stand composed of 19 different hardwood species. APA considers tree size, spatial distribution, and distance relationships in quantifying intertree competition and exhibits a strong correlation with individual tree basal area growth. The most important characteristic of APA is its potential for evaluating silvicultural practices.
88 citations
TL;DR: A computer program [Network Analysis Program Using Parameter Extractions (NAPPE)] that incorporates all of the concepts discussed in this paper has been written and several examples illustrating the usefulness and efficiency of NAPPE are included.
Abstract: A new method is presented for obtaining network functions in which some, none, or all of the network elements are represented by symbolic parameters (i.e., symbolic network functions). Unlike the topological tree enumeration or signal flow graph methods generally used to derive symbolic network functions, this new process uses fast, efficient, numerical-type algorithms to determine the contribution of those network branches not represented by symbolic parameters. A computer program [Network Analysis Program Using Parameter Extractions (NAPPE)] that incorporates all of the concepts discussed in this paper has been written. Several examples illustrating the usefulness and efficiency of NAPPE are included.
79 citations
TL;DR: A compact matrix representation of an acyclic exchanger network is derived and used to generate a decision tree for the heat exchanger problem and the optimal network is located by enumerating the entire tree using a search procedure.
Abstract: A compact matrix representation of an acyclic exchanger network is derived and used to generate a decision tree for the heat exchanger problem. The optimal network, which is imbedded in one of the tree nodes, is located by enumerating the entire tree using a search procedure. When this is not feasible, an alternate partial enumeration method is suggested. Sample problems ranging in size from 4 to 10 streams are used to illustrate the methods.
65 citations
01 Jan 1973
TL;DR: This chapter presents a procedure for agglomerative hierarchical clustering and describes the computational approaches for implementation.
Abstract: The association measures might be used to construct a similarity matrix that describes the strength of all pairwise relationships among the entities—variables or data units—in the data set. The methods of hierarchical cluster analysis operate on this similarity matrix to construct a tree that depicts specified relationships among the entities. The branches represent one entity while the root represents the entire collection of entities. Moving down the tree from the branches toward the root depicts increasing aggregation of the entities into clusters. Hierarchical clustering methods that build a tree from branches to root are called agglomerative methods. The divisive hierarchical methods begin at the root and work toward the branches. This chapter presents a procedure for agglomerative hierarchical clustering and describes the computational approaches for implementation.
63 citations
Journal Article•
Journal Article•
TL;DR: The paper describes a method of representing and analysing the multi-stage, dynamic nature of many types of research and development projects, using a modified decision tree format called a “project tree,” and the project trees are considered in one analysis based on heuristics.
Abstract: The paper describes a method of representing and analysing the multi-stage, dynamic nature of many types of research and development projects. The method makes use of a number of well-known techniques, decision trees, mathematical programming and simulation in combination. Each project which could form part of a laboratory portfolio is represented in a modified decision tree format called a “project tree,” and the project trees are then considered in one analysis based on heuristics. The approach is demonstrated using a small illustrative example, and an industrial case study is described, giving attention to computational problems of size.
TL;DR: An approach is described based on the application of a stochastic linear-programming formulation to a portfolio of projects, each planned using a form of the decision-tree structure called a `project tree.
Abstract: Many models of research and development (R&D) projects do not consider the intermediate outcomes and decisions that may be foreseen to arise during their evolution through the technical and commercial stages. Consideration of the sequential aspects of allocating scarce resources to a set of projects may make a great difference to the solution of the problem in terms of the optimum subset of projects to work on in the immediate future. The solution of this problem is important to R&D management. An approach is described based on the application of a stochastic linear-programming formulation to a portfolio of projects, each planned using a form of the decision-tree structure called a `project tree.' A series of elementary examples are presented as a means of gaining insight into the method. The general formulation is then presented in detail and applied to a small problem.
IBM1
TL;DR: This paper considers the design of a novel tree search scheme based on a bit vector representation of data and shows that essentially the same algorithm can be used to design either an ideal search tree or a bit-vector tree.
Abstract: A standard information retrieval operation is to determine which records in a data collection satisfy a given query expressed in terms of data values. The process of locating the desired responses can be represented by a tree search model. This paper poses an optimization problem in the design of such trees to serve a well-specified application. The problem is academic in the sense that ordinarily the optimal tree cannot be implemented by means of practical techniques. On the other hand, it is potentially useful for the comparison it affords between observed performance and that of an intuitively attractive ideal search procedure.As a practical application of such a model this paper considers the design of a novel tree search scheme based on a bit vector representation of data and shows that essentially the same algorithm can be used to design either an ideal search tree or a bit-vector tree. An experimental study of a small formatted file illustrates the concepts.
TL;DR: It is shown that the stack algorithm introduced by Zigangirov and by Jelinek is essentially equivalent to the Fano algorithm with regard to the set of nodes examined and the path selected, although the description, implementation, and action of the two algorithms are quite different.
Abstract: Sequential decoding procedures are studied in the context of selecting a path through a tree. Several algorithms are considered and their properties compared. It is shown that the stack algorithm introduced by Zigangirov and by Jelinek is essentially equivalent to the Fano algorithm with regard to the set of nodes examined and the path selected, although the description, implementation, and action of the two algorithms are quite different. A modified Fano algorithm is introduced, in which the quantizing parameter \Delta is eliminated. It can be inferred from limited simulation results that, at least in some applications, the new algorithm is computationally inferior to the old; however, it is of some theoretical interest since the conventional Fano algorithm may be considered to be a quantized version of it.
Patent•
12 Feb 1973
TL;DR: In this article, a pipe length with a threaded and tapered end for insertion into the tree trunk was designed for pressure feeding of liquid chemicals into tree trunks and long peripheral slits were provided as the primary exit for liquid passing through the pipe.
Abstract: A device for pressure feeding of liquid chemicals into tree trunks comprises a pipe length with a threaded and tapered end for insertion into the tree trunk. Long peripheral slits are provided in the threaded and tapered end as the primary exit for liquid passing through the pipe to carry beneficial chemicals into the tree trunk and to prevent reaction forces of pressure feeding from ejecting the device from the trunk.
TL;DR: The contour presentation described provides a good visual construct, useful for comparative purposes, of the space–time relationships of the growth layer during the development of a tree.
Abstract: A functional method of bringing together the patterns in the annual increment of wood in the stem and root of a tree is presented and related to the analyses of Duff and Nolan. Alternative terms fo...
TL;DR: This method involves principles at present mainly confined to studies in the area of artificial intelligence such as feature extraction, approximate tree matching, and strategy improvement by feedback from the matching process.
Abstract: A method of analyzing statements in a programming language which can tolerate a considerable inaccuracy in their specification is proposed. This method involves principles at present mainly confined to studies in the area of artificial intelligence such as feature extraction, approximate tree matching, and strategy improvement by feedback from the matching process. A pilot program incorporating the principles is described and preliminary operating results are presented. A final section surveys further principles which are currently being investigated.
Patent•
[...]
11 May 1973
TL;DR: In this article, the rake heads are attached to the unhinged ends of the first and second handles to provide an articulated tool which is particularly useful in gathering and picking up loose materials such as tree leaves.
Abstract: First and second elongated handles are hingedly connected to the respective ends of a cross-handle. Opposed rake heads are attached to the unhinged ends of the first and second handles to provide an articulated tool which is particularly useful in gathering and picking up loose materials such as tree leaves.
01 Jan 1973
TL;DR: In this paper, the forested areas of Arizona and New Mexico were divided into 10 physiographic-climatic regions and the regions were then subdivided into five to nine seed collection zones about 50 miles wide.
Abstract: The forested areas of Arizona and New Mexico were divided into 10 physiographic-climatic regions. These regions were then subdivided into five to nine seed collection zones about 50 miles wide. Provenance tests will be conducted to determine variation and need for adjustments. Seed used for reforestation should be limited to that collected within the local zone. A 10-unit classification system for rating cone crops is included. Oxford: 232.312.1:232.311.
01 Jan 1973
01 Dec 1973