• Journal of the Korean Institute of Landscape Architecture
• /
• v.32 no.4
• /
• pp.7-20
• /
• 2004

This study was executed to find out how to improve the planting and use of landscaping plants in Chuncheon. The number of street trees was 17,877 in 2003. The major species of street trees were Ginkgo biloba(52.7％), Prunus sargentii(15.3％), Zelkova serrata(8.9％), Platanus occidentalis(7.3％). Salix babylonica and Platanus occidentalis were decreased, while Prunus sargentii and Zelkova serrata were increased. Salix babylonica is a good species for a lakeside city, but its seeds cause allergies to some people. Most of the trees have been removed in Chuncheon. The planting of Salix babylonica(♂) resulted in no problems, and it should be propagated to plant. The soil of several areas was analysed to investigate soil conditions. The outskirts of city had good conditions in pH, organic matter and minerals, but the downtown areas had high alkalic, due to alkali from footpath concrete blocks. Appropriate pruning adds to the aesthetic and prolongs the useful life; it also requires less managing of insects and diseases to maintain good healthy of street trees. Street trees were not properly pruned due to electric lines and shortage of pruning information. The pruning was controlled by Korea Electric Power Co, which has no pruning information. Pruning must be maintained by a professional landscape company to maintain good shape such as with Bonsai. The Shrubs planting zone between street trees and other trees, and preservation plates were established for healthy of street trees. They have to be repaired and maintained well to keep better environmental conditions. The number of tree and flower species of 68 schools in Chuncheon were 12 and 16, respectively. The species that showed high preference were Juniperus chinensis, Pinus koraiensis, Pinus densiflora, Rosa centifolia, Forsythia koreana, and Rhododendron schlippenbachii. The high frequency of the protection trees designated by Chuncheon were Pinus densiflora, Ginko biloba, Zelkova serrata, Quercus species. It was thought that the diversification of street tree species, the selection of street trees suitable to each space, the generalization of use of native species, the appropriate pruning and proper fertilization, the control of pests and diseases, and the opinions of citizens concerning landscape plants were needed to improve the planting, use and maintenance of landscaping plants in Chuncheon.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.427-432
• /
• 1998

When an undirected tree T and a vertex ${\gamma}$ in the tree are given the problem to transform T into a rooted tree with ${\gamma}$ as its root is considered. Using Euler tour and prefix sum an optimal algorithm has been developed [2,3]. We will present another parallel algorithm which is optimal also on EREW PRAM. Our approach resuces the given tree step by step by pruning and pointer jumping. That is the tree structure is retained during algorithm processing such that than other tree computations can be carried out in parallel.

• ETRI Journal
• /
• v.43 no.6
• /
• pp.1024-1037
• /
• 2021

Mining high utility itemsets (HUIs) from transaction databases considers such factors as the unit profit and quantity of purchased items. Two-phase tree-based algorithms transform a database into compressed tree structures and generate candidate patterns through a recursive pattern-growth procedure. This procedure requires a lot of memory and time to construct conditional pattern trees. To address this issue, this study employs two compressed tree structures, namely, Utility Count Tree and String Utility Tree, to enumerate valid patterns and thus promote fast utility computation. Furthermore, the study presents an algorithm called single-phase utility computation (SPUC) that leverages these two tree structures to mine HUIs in a single phase by incorporating novel pruning strategies. Experiments conducted on both real and synthetic datasets demonstrate the superior performance of SPUC compared with IHUP, UP-Growth, and UP-Growth+algorithms.

• The KIPS Transactions:PartD
• /
• v.13D no.5 s.108
• /
• pp.651-660
• /
• 2006

Algorithms for mining association rules based on the Apriori algorithm use the hash tree data structure for storing and counting supports of the candidate frequent itemsets and the most part of the execution time is consumed for searching in the hash tree. The DHP(Direct Hashing and Pruning) algorithm makes efforts to reduce the number of the candidate frequent itemsets to save searching time in the hash tree. For this purpose, the DHP algorithm does preparative simple counting supports of the candidate frequent itemsets. At this time, the DHP algorithm uses the direct hash table to reduce the overhead of the preparative counting supports. This paper proposes and evaluates an efficient hashing mechanism for the direct hash table $H_2$ which is for pruning in phase 2 and the hash tree $C_k$, which is for counting supports of the candidate frequent itemsets in all phases. The results showed that the performance improvement due to the proposed hashing mechanism was 82.2% on the maximum and 18.5% on the average compared to the conventional method using a simple mod operation.

• Spatial Information Research
• /
• v.19 no.2
• /
• pp.71-76
• /
• 2011

In this paper, for using emerging patterns to define and analyze the significant difference of safe and non-safe power load lines, and identify which line is potentially non-safe, we proposed an incremental TFP-tree algorithm for mining emerging patterns that can search efficiently within limitation of memory. Especially, the concept of pre-infrequent patterns pruning and use of two different minimum supports, made the algorithm possible to mine most emerging patterns and handle the problem of mining from incrementally increased, large size of data sets such as power consumption data.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2003.05a
• /
• pp.206-213
• /
• 2003

Application of existing decision tree algorithms for Internet retail customer classification is apt to construct a bushy tree due to imprecise source data. Even excessive analysis may not guarantee the effectiveness of the business although the results are derived from fully detailed segments. Thus, it is necessary to determine the appropriate number of segments with a certain level of abstraction. In this study, we developed a stopping rule that considers the total amount of information gained while generating a rule tree. In addition to forwarding from root to intermediate nodes with a certain level of abstraction, the decision tree is investigated by the backtracking pruning method with misclassification loss information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.782-791
• /
• 2013

This paper proposes the location estimation techniques of distributed targets with the multi-sensor data perceived through IR sensors of the military robots. In order to match up targets with measured azimuths, we apply the maximum likelihood (ML), depth-first, and breadth-first tree search algorithms, in which we use the measured azimuths and the number of pixels on IR screen for pruning branches and selecting candidates. After matching up targets with azimuths, we estimate the coordinate of each target by obtaining the intersection point of the azimuths with the least square error (LSE) algorithm. The experimental results show the probability of missing target, mean of the number of calculating nodes, and mean error of the estimated coordinates of the proposed algorithms.

• Molecules and Cells
• /
• v.22 no.1
• /
• pp.89-96
• /
• 2006

"Determinate" and "indeterminate" inflorescences in plants are controlled by a single recessive gene, for example, SELF-PRUNING (SP) in Solanum lycopersicum, TERMINAL FLOWER1 in Arabidopsis, CENTRORADIALIS in Antirrhinum, and CENTRORADIALIS-like gene in tobacco. Pepper (Capsicum annuum L.) is an indeterminate species in which shoots grow indefinitely. In this study, we cloned and characterized the pepper SP-like gene (CaSP). RT-PCR revealed that the CaSP transcript accumulates to higher levels in floral buds than in other organs. Comparison of genomic DNA and cDNA sequences from indeterminate and determinate pepper plants revealed the insertion of a single base in the first exon of CaSP in the determinate pepper plants. CaSP is annotated in linkage group 8 (chromosome 6) of the SNU2 pepper genetic map and showed similar synteny to SP in tomato. Transgenic tobacco plants overexpressing CaSP displayed late-flowering phenotypes similar to the phenotypes caused by overexpression of CaSP orthologs in other plants. Collectively, these results suggest that pepper CaSP is an ortholog of SP in tomato.

• Journal of Forest and Environmental Science
• /
• v.34 no.2
• /
• pp.162-164
• /
• 2018

This study quantified the carbon storage and uptake by street trees in Seoul and explored suitable planting and management strategies. A systematic sampling model was used to select 50 plots to survey the structures of street trees. The average density and cover of street trees were approximately 5.8 trees/$100m^2$ and 12.1%, respectively. Trees with a dbh of less than 30 cm accounted for about 66.3% of the total number of trees surveyed. The total carbon storage and uptake by the street trees were approximately 103,641 t and 10,992 t/yr, respectively. The total carbon uptake equaled the amount of annual carbon emissions from driving of about 11,000 cars. Street tree planting and management strategies were proposed to enhance carbon uptake. They included multi-layered and multi-aged planting, securing ground and space for plant growth, and avoiding excessive tree pruning.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.2
• /
• pp.183-203
• /
• 1993

One of the most difficult and time-consuming stages in the development of the knowledge-based system is a knowledge acquisition. A splitting algorithm is developed to infer a rule-tree which can be converted to a rule-typed knowledge. A market segmentation may be performed in order to establish market strategy suitable to each market segment. As the sales data of a product market is probabilistic and noisy, it becomes necessary to prune the rule-tree-at an acceptable level while generating a rule-tree. A splitting algorithm is developed using the pruning measure based on a total amount of information gain and the measure of existing algorithms. A user can easily adjust the size of the resulting rule-tree according to his(her) preferences and problem domains. The algorithm is applied to a market segmentation problem of a medium-large computer market. The algorithm is illustrated step by step with a sales data of a computer market and is analyzed.