• 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 Korean Society of Forest Science
• /
• v.96 no.2
• /
• pp.160-169
• /
• 2007

The data used to develop distance-independent individual models for natural mixed forests were collected from 712 remeasured permanent sample plots (25,526 trees) of 10-year periodic from 1990 to 2000 in Baihe Forest Bureau of Changbai Mountains, northeast China. Based on analyzing relationship between diameter increment of individual trees with tree size, competitive status, and site condition, the diameter growth models for individual trees of 15 species growing in mixed-species uneven-aged forest stands, that have simple form, good predicting precision, and easily applicable, were developed using stepwise regression method. The main variables influencing on diameter increment of individual trees were tree size and competition, however, the site conditions were not significantly related with diameter increment. The tree size variables (lnDBH and $DBH^2$) were the most significant and important predictors of diameter growth existing in all 15 growth models. The diameter increment was directly proportional to tree diameter for each species. For the competitive factors in growth model, the relative diameter (RD), canopy closure (P), and the ratio of diameter of subject tree with maximum diameter (DDM) were contributed to the diameter increment at a certain extent. Other measures of stand density, such as basal area of stand (G) and stand density index (SDI), were not significantly influenced on diameter increment. Site factors, such as site index, slope and aspect were not important to diameter increment and excluded in the final models. The total variance explained by the final models of squared diameter increment ($R^2$) for all 15 species ranged from 35% to 72% and these results compared quit closely with those of Wykoff (1990) for mixed conifer stands. Using independent data set, validation measures were evaluated for predicting models of diameter increment developed in this study. The result indicated that the estimated precision was all greater than 94% and the models were suitable to describe diameter increment.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.463-476
• /
• 2006

R-trees have been traditionally optimized for the I/O performance with the disk page as the tree node. Recently, researchers have proposed cache-conscious variations of R-trees optimized for the CPU cache performance in main memory environments, where the node size is several cache lines wide and more entries are packed in a node by compressing MBR keys. However, because there is a big difference between the node sizes of two types of R-trees, disk-optimized R-trees show poor cache performance while cache-optimized R-trees exhibit poor disk performance. In this paper, we propose a cache and disk optimized R-tree, called the PR-tree (Prefetching R-tree). For the cache performance, the node size of the PR-tree is wider than a cache line, and the prefetch instruction is used to reduce the number of cache misses. For the I/O performance, the nodes of the PR-tree are fitted into one disk page. We represent the detailed analysis of cache misses for range queries, and enumerate all the reasonable in-page leaf and nonleaf node sizes, and heights of in-page trees to figure out tree parameters for best cache and I/O performance. The PR-tree that we propose achieves better cache performance than the disk-optimized R-tree: a factor of 3.5-15.1 improvement for one-by-one insertions, 6.5-15.1 improvement for deletions, 1.3-1.9 improvement for range queries, and 2.7-9.7 improvement for k-nearest neighbor queries. All experimental results do not show notable declines of the I/O performance.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.8
• /
• pp.73-83
• /
• 2017

In this paper, we discuss the differences between an ordinary B-tree and B-tree implemented by NTFS. There are lots of distinctions between the two B-tree, if not understand the distinctions fully, it is difficult to utilize and analyze artifacts of NTFS. Not much, actually, is known about the implementation of NTFS, especially B-tree index for directory management. Several items of B-tree features are performed that includes a node size, minimum number of children, root node without children, type of key, key sorting, type of pointer to child node, expansion and reduction of node, return of node. Furthermore, it is emphasized the fact that NTFS use B-tree structure not B+structure clearly.

• Journal of Korean Society of Forest Science
• /
• v.96 no.2
• /
• pp.189-196
• /
• 2007

Allometry, basal area equations, and volume equations were developed with various tree measurement variables for the major species, Quercus mongolica and Quercus variabilis, in Korean natural hardwood forests. For allometry models, the relationships between total height-DBH, crown width-DBH, height to the widest portion of the crown-total height, and height to base of crown-total height were investigated. Multiple regression methods were used to relate annual basal area growth to tree variables of initial size (DBH, total height, crown width) and relative size (relative diameter, relative height) as well as competition measures (competition index, crown class, exposed crown area, percent exposed crown area, live crown ratio). For tree volume equations, the combined-variable and Schumacher models were fitted with DBH, total height and crown width for both species.

• Journal of Korea Game Society
• /
• v.18 no.5
• /
• pp.77-82
• /
• 2018

Go is the most complex board game in which the computer can not search all possible moves using an exhaustive search to find the best one. Prior to AlphaGo, all powerful computer Go programs have used the Monte-Carlo Tree Search (MCTS) to overcome the difficulty in positional evaluation and the very large branching factor in a game tree. In this paper, we tried to find the best sequence of moves using an MCTS on a very small Go board. We found that a $2{\times}2$ Go game would be ended in a tie and the size of Komi should be 0 point; Meanwhile, in a $3{\times}3$ Go Black can always win the game and the size of Komi should be 9 points.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.905-912
• /
• 2006

Depending on the location of the rendezvous point (RP), the network efficiency is determined in the core based tree (CBT) or protocol independent multicast-sparse mode (PIM-5M) multicasting protocol to provide the multicast services based on the shared tree. In this paper, a new algorithm to allocate the RP using the estimated values of the total cost and the size(number of entries) of the routing tables is proposed for efficiently controlling the cost and the number of routing table entries. The numerical results show that the proposed algorithm reduces the total cost in 5.37%, and the size of routing tables in 13.35% as compared to the previous algorithm.

• Journal of applied mathematics & informatics
• /
• v.42 no.3
• /
• pp.511-520
• /
• 2024

In this paper, we introduce the concept of split and non-split tree (D, C)- set of a connected graph G and its associated color variable, namely split tree (D, C) number and non-split tree (D, C) number of G. A subset S ⊆ V of vertices in G is said to be a split tree (D, C) set of G if S is a tree (D, C) set and ⟨V - S⟩ is disconnected. The minimum size of the split tree (D, C) set of G is the split tree (D, C) number of G, γ_χST (G) = min{|S| : S is a split tree (D, C) set}. A subset S ⊆ V of vertices of G is said to be a non-split tree (D, C) set of G if S is a tree (D, C) set and ⟨V - S⟩ is connected and non-split tree (D, C) number of G is γ_χST (G) = min{|S| : S is a non-split tree (D, C) set of G}. The split and non-split tree (D, C) number of some standard graphs and its compliments are identified.

• Journal of Ecology and Environment
• /
• v.35 no.4
• /
• pp.359-365
• /
• 2012

We investigated leaf disease intensity of Kalopanax septemlobus (prickly castor oil tree) caused by the parasitic fungus Mycosphaerella acanthopanacis, in thirty natural host populations in the Japanese Archipelago. The disease intensity observed for individual trees were analyzed using a generalized additive model as a function of tree size, tree density, climatic terms and spatial trend surface. Individual tree size and conspecific tree density were shown to have significant negative and positive effects on disease intensity, respectively. The findings suggest that the probability of disease infection is partly determined by dispersal of infection agents (ascospores) from the fallen leaves on the ground, which can be enhanced by aggregation of host trees in a forest stand. Regional-scale spatial bias was also present in disease intensity; the populations in northern Japan and southern Kyushu were more severely infected by the fungus than those in southwestern Honshu and Shikoku. Regional variation of disease intensity was explained by both climatic factors and a trend surface term, with a latitudinal cline detected, which increases towards the north. Further research should be conducted in order to understand all of the factors generating the latitudinal cline detected in this study.

• Journal of the Korean Society of Safety
• /
• v.32 no.3
• /
• pp.160-171
• /
• 2017

US national research laboratories developed the first Vital Area Identification (VAI) method for the physical protection of nuclear power plants that is based on Event Tree Analysis (ETA) and Fault Tree Analysis (FTA) techniques in 1970s. Then, Korea Atomic Energy Research Institute proposed advanced VAI method that takes advantage of fire and flooding Probabilistic Safety Assessment (PSA) results. In this study, in order to minimize the burden and difficulty of VAI, (1) a set of streamlined VAI rules were developed, and (2) this set of rules was applied to PSA fault tree and event tree at the initial stage of VAI process. This new rule-based VAI method is explained, and its efficiency and correctness are demonstrated throughout this paper. This new rule-based VAI method drastically reduces problem size by (1) performing PSA event tree simplification by applying VAI rules to the PSA event tree, (2) calculating preliminary prevention sets with event tree headings, (3) converting the shortest preliminary prevention set into a sabotage fault tree, and (4) performing usual VAI procedure. Since this new rule-based VAI method drastically reduces VAI problem size, it provides very quick and economical VAI procedure. In spite of an extremely reduced sabotage fault tree, this method generates identical vital areas to those by traditional VAI method. It is strongly recommended that this new rule-based VAI method be applied to the physical protection of nuclear power plants and other complex safety-critical systems such as chemical and military systems.