• Communications for Statistical Applications and Methods
• /
• v.18 no.6
• /
• pp.809-816
• /
• 2011

A tree-indexed autoregressive(AR) process is a time series defined on a tree which is generated by a branching process and/or a deterministic splitting mechanism. This short article is concerned with conditional heteroscedastic structure of the tree-indexed AR models. It has been usual in the literature to analyze conditional mean structure (rather than conditional variance) of tree-indexed AR models. This article pursues to identify quadratic conditional heteroscedasticity inherent in various tree-indexed AR models in a unified way, and thus providing some perspectives to the future works in this area. The identical conditional variance of sisters sharing the same mother will be referred to as the branching heteroscedasticity(BH, for short). A quasilikelihood but preliminary estimation of the quadratic BH is discussed and relevant limit distributions are derived.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.5
• /
• pp.1137-1149
• /
• 2014

Since the bifurcating autoregressive (BAR) model was developed by Cowan and Staudte (1986) to analyze cell lineage data, a lot of research has been directed to BAR and its generalizations. Based mainly on the author's works, this paper is concerned with a contemporary review on the BAR in terms of an overview and perspectives. Specifically, bifurcating structure is extended to multi-cast tree and to branching tree structure. The AR(1) time series model of Cowan and Staudte (1986) is generalized to tree structured random processes. Branching correlations between individuals sharing the same parent are introduced and discussed. Various methods for estimating parameters and related asymptotics are also reviewed. Consequently, the paper aims to give a contemporary overview on the BAR model, providing some perspectives to the future works in this area.

• The Korean Journal of Ecology
• /
• v.6 no.4
• /
• pp.1-9
• /
• 1983

The observation of branching pattern on Magnolia denudata Desr. was performed from July 1982 to September 1983 and then computer simulation was carried out. Tree crown pattern depends on not genetic factors but also environmental factors and the determination of branchin pattern which characterized it appears to properly explain the relationships such as branching pattern and allocation of materials through the analysis of influence branches under several assumptions. Now that computer simulated simulated pattern was considered as the accumulation of two factors which controled the growth, it was represented as the stimulated tree which differs in branching rate that described allocation of material necessary for the growth of each branch. There was a tendency of allocation ratio of nutrients, i.e. subbranch to main branch to decrease by the passage of year. Under assumption that branch was branched when accumulated material reached 1, it was possible to represent the allocation of nutrients are residual $nutrient{\times}\frac{1}{1+F};in main; branch, ; residual; nutrient{\times}\frac{F}{1+F}$ in subbranch, A(iA, iC)+$F^(iA-1)$ in current twig. Like this, the basic minute difference of the allocation of nutrients according to the branch resulted in complicated patterns in the tree crown.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11a
• /
• pp.830-833
• /
• 2005

SDM(Structural Dynamics Modification) is to improve dynamic characteristics of a structure, more specifically of a base structure, by adding or deleting auxiliary(modifying) structures. In this paper, I will focus on the optimal layout of the stiffeners which are attached to the plate to maximize 1st natural frequency. Recently, a new topology method was proposed by yamazaki. He uses growing and branching tree model. I modified the growing and branching tree model. The method is designated modified tree model. To expand the layout of stiffeners, I will consider non-matching problem. The problem is solved by using local lagrange multiplier without the mesh regeneration. Moreover The CMS(Component mode synthesis) method is employed to reduce the computing time of eigen reanalysis using reduced componet models.

• ETRI Journal
• /
• v.36 no.3
• /
• pp.450-459
• /
• 2014

In this paper, we present a new, easy-to-generate system that is capable of creating virtual 3D tree models and simulating a variety of growth processes of a tree from a single, real tree image. We not only construct various tree models with the same trunk through our proposed digital image matting method and skeleton-based abstraction of branches, but we also animate the visual growth of the constructed 3D tree model through usage of the branch age information combined with a scaling factor. To control the simulation of a tree growth process, we consider tree-growing attributes, such as branching orders, branch width, tree size, and branch self-bending effect, at the same time. Other invisible branches and leaves are automatically attached to the tree by employing parametric branch libraries under the conventional procedural assumption of structure having a local self-similarity. Simulations with a real image confirm that our system makes it possible to achieve realistic tree models and growth processes with ease.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.598-607
• /
• 2005

We propose a new external-memory index data structure, the Suffix B-tree. The Suffix B-tree is a B-tree in which the key is a string like the String B-tree. While the node in the String B-tree is implemented with a Patricia trio, the node in the Suffix B-tree is implemented with an array. So the Suffix B-tree is simpler and easier to be Implemented than the String B-tree. Nevertheless, the branching algorithm of the Suffix B-tree is as efficient as that of the String B-tree. Consequently, the Suffix B-tree takes the same worst-case disk accesses as the String B-tree to solve the string matching problem, which is fundamental and important in the area of string algorithms.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.27 no.4
• /
• pp.143-150
• /
• 1999

The purpose of this research is to find som ways to model tree forms more efficiently in reference with surveying structural data and handling parameters in plant Editor of AccuRender, the AutoCAD-based rendering software adopting the procedural plant modeling technique. In case of modelling a new tree, because it is efficient to modify an existing tree data as a template, we attempted to classify 81 species' data from existing plant library including conifers and deciduous tree. According to the qualitative characteristics and quantitative parameters of geometrical and branching structure, 8 types of tree form were classified with factor and cluster analysis. Some critical aspects found in the distributions of standardized scores of parameters in each type were discussed for explaining the tree forms intuitively. For adaptability of the resulted classification and typical parameters, 10 species of tree were measured and modelled, and proved to be very similar to the real structures of tree forms. CG or CAD-based plant modelling technique would be recommended not only as a presentation tool but for planting design, landscape simulation and assessment.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.51-54
• /
• 2005

This paper proposes an index structure which is used to process X-Path on S-XML data. There are many previous index structures based on tree structure for X-Path processing. Because of general tree index's top-down query fashion, the unnecessary node traversal makes heavy access and decreases the query processing performance. And both of the two query types for X-Path called single-path query and branching query need to be supported in proposed index structure. This method uses a combination of path summary and the node indexing. First, it manages hashing on hierarchy elements which are presented in tag in S-XML. Second, array blocks named path summary array is created in each node of hashing to store the path information. The X-Path processing finds the tag element using hashing and checks array blocks in each node to determine the path of query's result. Based on this structure, it supports both single-path query and branching path query and improves the X-Path processing performance.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.133-136
• /
• 2002

This paper presents a new method of Huffman decoding which gives a significant improvement of processing efficiency based on the reconstruction of an efficient one-dimensional array data structure incorporating the numeric interpretation of the accrued codewords in the binary tree. In the Proposed search method, the branching address is directly obtained by the arithematic operation with the incoming digit value eliminating the compare instruction needed in the binary tree search. The proposed search method gives 30% of improved Processing efficiency and the memory space of the reconstructed Huffman table is reduced to one third compared to the ordinary ‘compare and jump’ based binary tree. The experimental result with the six MPEG-2 AAC test files also shows about 198% of performance improvement compared to those of the widely used conventional sequential search method.

• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.123-128
• /
• 2004

A tree structure model has been proposed for representing the unequal-area facility layout. Each facility has a different rectangular shape specified by its area and aspect ratio. In this layout problem, based on the assumption that the shop floor has enough space for laying out the facilities, no constraint is considered for a shop floor. Objectives are minimizing total part movement between facilities and total rectangular layout area where all facilities and dead spaces are enclosed. Using the genetic code corresponding to two kinds of information, facility sequence and branching positions in the tree structure model, a genetic algorithm has been applied for finding non-dominated solutions in the two-objective layout problem. We use three kinds of crossover (PMX, OX, CX) for the former part of the chromosome and one-point crossover for the latter part. Two kinds of layout problems have been tested by the proposed method. The results demonstrate that the presented algorithm is able to find good solutions in enough short time.