• 디지털산업정보학회논문지
• /
• 제7권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.

• 대한산업공학회지
• /
• 제19권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.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2016년도 제53차 동계학술대회논문집 24권1호
• /
• pp.267-269
• /
• 2016

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

• 대한전자공학회논문지SD
• /
• 제41권5호
• /
• pp.43-50
• /
• 2004

현재의 반도체 공정은 Deep Sub- Micmn (DSM)으로 발전하면서, 선폭이 줄어들고 구동 주파수가 높아지고 있다. 이로 인해 clock source로부터 clock을 필요로 하는 각 단자(sink)까지의 '지연시간의 최대 차'로 정의되어지는 clock skew가 회로의 속도 향상에 있어 중요 제약요소가 되고 있다. 또한 이를 얼마나 줄이느냐 하는 것은 동기식 회로 설계에 있어 중요한 문제가 되고 있다. 따라서 낮은 clock skew를 위한 배선 기술에 대해 많은 연구들이 이루어지고 있다. 본 논문에서는 clock skew를 줄이기 위한 방법으로서 새로운 Advanced clock Tree Generation(ACTG) 방법을 개발하였다. ACTG는 2단계의 계층적 routing을 통해 최적의 clock tree를 구성한다. 본 논문에서 제안하는 알고리즘을 C 언어로 프로그램하여 구현하 후 벤치마크 테스트 데이터에 대하여 실험한 결과, 주어진 skew 범위를 만족시키면서 지연 시간을 감소시키는 효과를 얻을 수 있었다.

• 한국조경학회지
• /
• 제28권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
• /
• 제6권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
• /
• 제1권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.

• 한국CDE학회논문집
• /
• 제2권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.

• 인간식물환경학회지
• /
• 제24권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.

• 정보처리학회논문지D
• /
• 제12D권7호
• /
• pp.965-978
• /
• 2005

소프트웨어 개발 시, 일정과 품질에 저해 요인이 되는 결함이 다수 존재한다. 일정과 품질의 저해 요인을 제거하고 동시에 체계적으로 이를 관리하기 위하여 본 논문에서는 opportunity tree 프레임워크를 설계한다. 유사한 프로젝트를 수행 시 영역 전문가의 지식을 활용한 opportunity tree 발생되는 문제점을 예측, 대비할 수 있게 하여, 소프트웨어 프로세스를 개선할 수 있다 본 연구에서는 소프트웨어 개발 시 발생하는 일정관리에 대한 결함을 찾아내고, 원인을 식별 및 해결책을 제시하고자 한다.