• Journal of Korea Society of Digital Industry and Information Management
• /
• v.7 no.3
• /
• pp.43-53
• /
• 2011

The many cities are changing in the city form where the person and nature are mixed. Namely, the government invests many expense in tree field of distance space for the change in the green city. In this paper, we design and implement a tree growth management system using PDA built in 13.56MHz RFID reader and CBD(Component Based Development) for ubiquitous computing environments. Our system provides history management to increase business efficiency for location coordinate of tree and history information of tree which using RFID, the RFlD tag is attaching the new tree and that is inputting GPS location information in PDA and provides tree information of tree by location coordinate to history management. Finally, we show from a performance analysis that our system achieves about 85% average tree read rate of RFID under test scenario environments.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.3
• /
• pp.51-57
• /
• 1993

This paper develops 0($n^3$) algorithm to construct a cut-tree generated by Gomory-Hu algorithm. The algorithm only requires node sets defined by the minimal cut in each of the (n-1) maximal flow determinations. Merging computerized facility layout procedure that uses cut-tree concept to generate design skeletons with our algorithm requires less storage space than merging it with Gomory-Hu algorithm. Also, the cut-tree can easily be modified when the (n-1) minimal cut-sets are updated due to changes on arc capacities.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.01a
• /
• pp.267-269
• /
• 2016

본 논문에서는 언리얼 엔진4의 Behavior Tree(행동 트리)를 이용하여 NPC의 다양한 상태와 움직임을 가진 어드벤처 게임 AI를 설계 및 개발하였고, 그 효율성을 분석하였다. Behavior Tree는 상태와 행동을 계층적으로 나누어 AI의 행동을 결정하는 알고리즘으로 FSM(Finite State Machine, 유한상태기계)과 비교하여 유지보수와 행동 규칙 검증의 어려움을 해결하는 데 장점이 있음을 확인하였다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.5
• /
• pp.43-50
• /
• 2004

The clock skew is one of the major constraints for high-speed operation of synchronous integrated circuits. In this paper, we propose a hierarchical partitioning based clock network design algorithm called Advanced Clock Tree Generation (ACTG). Especially new effective partitioning and refinement techniques have been developed in which the capacitance and edge length to each sink are considered from the early stage of clock design. Hierarchical structures obtained by parhtioning and refinement are utilized for balanced clock routing. We use zero skew routing in which Elmore delay model is used to estimate the delay. An overlap avoidance routing algorithm for clock tree generation is proposed. Experimental results show significant improvement over conventional methods.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.28 no.5
• /
• pp.93-103
• /
• 2000

This research is to propose a rational criterion of the selection and the management f the roadside trees, and to establish the planting design and system with the objective of improving the roadside environment. All of the roadside trees in each objective courses in Kangnung, and the soil disposition, hardness of the soil in the planting areas have been investigated. Also, we have surveyed the kinds of the trees which kandgnung inhabitants want. The conclusion is as follows Most of roadsides have trees, but they need the introduction of shrubs or ground covering plants according to the locations and the environmental conditions. We have selected nineteen species in regard to the roadside tree criterion and the growing conditions living in Kangnung. It is desirable that we make banding style planting space between each roadside tree to improve the low ratio of green coverage. We have found out that Ligustrum obtusifolium, Buxus micropnylla, Euonymus japonica, Rhododendron schlippenbachii, Phyllostachys nigro and Rosa rugosa, ect. are suitable. In order to soften and weaken the rigidity of the hard substances on a paved roadside, the climbers such as the perennial herbaceous flowering and hedera rhombea should be preferred rather than annual herbaceous flowering because of curtailment of expenditure. To posses a systematical greenery frame in kangnung, we have planned a planting design system that would expand the greenery space every year. Moreover, we have to make a plan to overcome space restrictions. We have established a flexible plan considering the roadside conditions and the improved standard planting methods with an ultimate aim to create a special roadside view.

• Communications for Statistical Applications and Methods
• /
• v.6 no.1
• /
• pp.159-168
• /
• 1999

We introduce a new conditional signed-rank test for the tree alternatives comparing several treatments with a control in the randomized block design. We demonstrate its performance by comparing with 3 classes of signed-rank tests proposed by Park et al.(1991) in some general situations. In most cases the proposed procedure is simpler to compute and has better power than others.

• Journal of Computational Design and Engineering
• /
• v.1 no.3
• /
• pp.161-172
• /
• 2014

This paper presents three different search engines for the detection of CAD-parts in large databases. The analysis of the contained information is performed by the export of the data that is stored in the structure trees of the CAD-models. A preparation program generates one XML-file for every model, which in addition to including the data of the structure tree, also owns certain physical properties of each part. The first search engine is specializes in the discovery of standard parts, like screws or washers. The second program uses certain user input as search parameters, and therefore has the ability to perform personalized queries. The third one compares one given reference part with all parts in the database, and locates files that are identical, or similar to, the reference part. All approaches run automatically, and have the analysis of the structure tree in common. Files constructed with CATIA V5, and search engines written with Python have been used for the implementation. The paper also includes a short comparison of the advantages and disadvantages of each program, as well as a performance test.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.2
• /
• pp.77-84
• /
• 1997

This paper is concerning the development of multiple neural networks system of problem domains where the complete input space can be decomposed into several different regions, and these are known prior to training neural networks. We will adopt oblique decision tree to represent the divided input space and sel ect an appropriate subnetworks, each of which is trained over a different region of input space. The overall architecture of multiple neural networks system, called the federated architecture, consists of a facilitator, normal subnetworks, and tile networks. The role of a facilitator is to choose the subnetwork that is suitable for the given input data using information obtained from decision tree. However, if input data is close enough to the boundaries of regions, there is a large possibility of selecting the invalid subnetwork due to the incorrect prediction of decision tree. When such a situation is encountered, the facilitator selects a tile network that is trained closely to the boundaries of partitioned input space, instead of a normal subnetwork. In this way, it is possible to reduce the large error of neural networks at zones close to borders of regions. The validation of our approach is examined and verified by applying the federated neural networks system to the configuration design of a midship structure.

• Journal of People, Plants, and Environment
• /
• v.24 no.2
• /
• pp.219-227
• /
• 2021

Background and objective: Urban street trees play an important role in carbon reduction in cities where greenspace is scarce. There are ongoing studies on carbon reduction by street trees. However, information on the carbon reduction capacity of street trees based on field surveys is still limited. This study aimed to quantify carbon uptake and storage by urban street trees and suggest a method to improve planting of trees in order to increase their carbon reduction capacity. Methods: The cities selected were Sejong, Chungju, and Jeonju among cities without research on carbon reduction, considering the regional distribution in Korea. In the cities, 155 sample sites were selected using systematic sampling to conduct a field survey on street environments and planting structures. The surveyed data included tree species, diameter at breast height (DBH), diameter at root collar (DRC), height, crown width, and vertical structures. The carbon uptake and storage per tree were calculated using the quantification models developed for the urban trees of each species. Results: The average carbon uptake and storage of street trees were approximately 7.2 ± 0.6 kg/tree/yr and 87.1 ± 10.2 kg/tree, respectively. The key factors determining carbon uptake and storage were tree size, vertical structure, the composition of tree species, and growth conditions. The annual total carbon uptake and storage were approximately 1,135.8 tons and 22,737.8 tons, respectively. The total carbon uptake was about the same amount as carbon emitted by 2,272 vehicles a year. Conclusion: This study has significance in providing the basic unit to quantify carbon uptake and storage of street trees based on field surveys. To improve the carbon reduction capacity of street trees, it is necessary to consider planning strategies such as securing and extending available grounds and spaces for high-density street trees with a multi-layered structure.

• The KIPS Transactions:PartD
• /
• v.12D no.7 s.103
• /
• pp.965-978
• /
• 2005

There are many defects that cause the schedule and qualify problems during software development. This paper designs the opportunity tree framer work that removes and manages the schedule and quality problems as well. For the similar projects, we can estimate defects and prepare to solve them by using domain expert knowledge and the opportunity tree framework which can greatly improve the software process. This research provides solution of schedule defect problem and detection of defect and its causes that happen on software development.