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

• 한국조경학회지
• /
• 제21권3호
• /
• pp.89-98
• /
• 1993

It is necessary for the park tree manager to have the current information about the status of trees, which can help him with right decisions. However, there are many problems in the existing management method such as huge amount of data, tedious work, and the difficult update work due to the lack of necessary data or the inappropriate data record and management method. The sole use of database management system(DBMS) cannot slove these problems because it cannot handle graphic data based on the locational information. So, it is imperative for the park manager to have locational data as well as attribute data of the park tree concerned. Therefore, the purpose of this study is to develop the personal computer-based, user friendly park tree management information system, which deals with attribute data(DBMS) and graphic data(using the CAD) together within the integrated environment. The park tree management information system developed in this study provides a complete operating environment for data input, update, query, delete, and retrieve. The major advantages of this system are as follows: 1) To search the location and distribution of trees. 2) To record, store, and manage data easily. 3) When the manager is changed, delivery of the park tree work is convenient. 4) The system can help the manager with the correct information for the efficient park tree management.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권5호
• /
• pp.527-547
• /
• 2009

Moving object management is widely used in traffic, logistic and data mining applications in ubiquitous environments. It is required to analyze spatio-temporal data and trajectories for moving object management. In this paper, we proposed a novel index structure for spatio-temporal aggregation of trajectory in a constrained network, named aCN-RB-tree. It manages aggregation values of trajectories using a constraint network-based index and it also supports direction of trajectory. An aCN-RB-tree consists of an aR-tree in its center and an extended B-tree. In this structure, an aR-tree is similar to a Min/Max R-tree, which stores the child nodes' max aggregation value in the parent node. Also, the proposed index structure is based on a constrained network structure such as a FNR-tree, so that it can decrease the dead space of index nodes. Each leaf node of an aR-tree has an extended B-tree which can store timestamp-based aggregation values. As it considers the direction of trajectory, the extended B-tree has a structure with direction. So this kind of aCN-RB-tree index can support efficient search for trajectory and traffic zone. The aCN-RB-tree can find a moving object trajectory in a given time interval efficiently. It can support traffic management systems and mining systems in ubiquitous environments.

• 한국통신학회논문지
• /
• 제32권10A호
• /
• pp.1004-1014
• /
• 2007

In sensor networks, it is crucial to reliably and energy-efficiently deliver sensed information from each source to a sink node. Specifically, in mobile sink (user) applications, due to the sink mobility, a stationary dissemination path may no longer be effective. The path will have to be continuously reconfigured according to the current location of the sink. Moreover, the dynamic optimal path from each source to the sink is required in order to reduce end-to-end delay and additional energy wastage. In this paper, an Adaptive Reversal Optimal path Tree (AROT) protocol is proposed. Information delivery from each source to a mobile sink can be easily achieved along the AROT without additional control overhead, because the AROT proactively performs adaptive sink mobility management. In addition, the dynamic path is optimal in terms of hop counts and the AROT can maintain a robust tree structure by quickly recovering the partitioned tree with minimum packet transmission. Finally, the simulation results demonstrate that the AROT is a considerably energy-efficient and robust protocol.

• 대한공간정보학회지
• /
• 제5권2호
• /
• pp.45-54
• /
• 1997

도시녹지공간의 수목은 체계적이고, 신속한 관리를 함으로써 인간에게 더 많은 혜택을 부여한다. 현재 도시 녹지공간에 있어서의 수목관리의 방법론적인 방안을 고려해 볼 때 수목관리의 유지관리를 위한 자료의 수집과 처리, 첨단 System을 활용한 관리체계가 극히 미흡한 실정이다. 이를 위해서는 먼저 녹지자원 관리를 위한 효율적이고 체계적인 자료의 수집 및 처리와 합리적인 분석과정이 필요하며 그 다음으로 이러한 자료를 토대로 하여 적절한 도시녹지공간에 있어서의 수목관리를 효율적으로 처리할 수 있는 시스템과 그 활용이 필요하다. 이러한 시스템으로 본 연구에서는 최근 여러 분야에서 이용되고 있는 GIS을 이용하여 도시녹지관리모델을 제시하고 이를 통하여 그 효율성을 극대화하였다.

• 디지털융복합연구
• /
• 제18권11호
• /
• pp.427-432
• /
• 2020

효과적인 산림경영계획 수립을 위해서는 수고, 흉고직경 등 수목관리정보에 대한 조사가 필요하다. 하지만 기존의 산림조사 방법의 효율성을 향상시키기 위한 데이터 취득 기술의 융복합 및 적용에 대한 연구는 부족한 실정이다. 이에 본 연구에서는 3D 스캐너를 통해 취득되는 포인트클라우드 데이터를 활용하여 수목관리정보를 구축하고 분석하였다. 고정형 및 이동형 3D 스캐너를 이용하여 연구대상지에 대한 데이터를 취득하였으며, 작업시간 비교를 통해 이동형 3D 스캐너의 효율성을 제시하였다. 또한 포인트클라우드 데이터를 이용한 식생의 객체별 분류를 수행하고, 흉고직경 및 수고에 대한 정보를 구축함으로써 객체 관리가 가능한 수목관리정보를 구축하였다. 기존의 측정 방법과 비교한 정확도 평가 결과 수고는 0.02-0.09m, 흉고직경은 0.01-0.04m의 차이를 나타내었다. 향후 추가적인 연구를 통해 객체별 식생의 위치와 수관에 대한 정보를 구축한다면 산림관리정보 구축 관련 업무 효율성 증가에 기여할 것이다.

• 디지털산업정보학회논문지
• /
• 제6권3호
• /
• pp.49-57
• /
• 2010

We extended a general attack tree to apply cyber attack model for network vulnerability analysis. We defined an extended cyber attack tree (E-CAT) which extends the general attack tree by associating each node of the tree with a transition of attack that could have contributed to the cyber attack. The E-CAT resolved the limitation that a general attack tree can not express complex and sophisticate attacks. Firstly, the Boolean expression can simply express attack scenario with symbols and codes. Secondary, An Attack Generation Probability is used to select attack method in an attack tree. A CONDITION-composition can express new and modified attack transition which a aeneral attack tree can not express. The E-CAT is possible to have attack's flexibility and improve attack success rate when it is applied to cyber attack model.

• Journal of Forest and Environmental Science
• /
• 제35권3호
• /
• pp.181-188
• /
• 2019

This study was performed to construct tree species classification map according to three information types (spectral information, texture information, and spectral and texture information) by altitude (30 m, 60 m, 90 m) using the unmanned aerial vehicle images and the object-based classification method, and to evaluate the concordance rate through field survey data. The object-based, optimal weighted values by altitude were 176 for 30 m images, 111 for 60 m images, and 108 for 90 m images in the case of Scale while 0.4/0.6, 0.5/0.5, in the case of the shape/color and compactness/smoothness respectively regardless of the altitude. The overall accuracy according to the type of information by altitude, the information on spectral and texture information was about 88% in the case of 30 m and the spectral information was about 98% and about 86% in the case of 60 m and 90 m respectively showing the highest rates. The concordance rate with the field survey data per tree species was the highest with about 92% in the case of Pinus densiflora at 30 m, about 100% in the case of Prunus sargentii Rehder tree at 60 m, and about 89% in the case of Robinia pseudoacacia L. at 90 m.

• Journal of Communications and Networks
• /
• 제13권4호
• /
• pp.385-392
• /
• 2011

A loop can take place in the process of managing tree topology for mobility management of mobile nodes in infrastructure-based mobile ad hoc networks. The formation of a loop degrades an effective bandwidth of the wireless network by passing an identical message repeatedly within the same loop. Therefore, the loop should be resolved to revert the system back to the normal state. In this paper, we propose a simple and novel mechanism that detects and resolves a loop quickly by tracking the depth of trees. The mobility management approach that employs the loop resolution method is evaluated comparatively with the original tree-based one and the hybrid one. It is shown that the proposed approach far outperforms the other approaches, and it is robust against the rapid changes in network topology.

• 한국컴퓨터정보학회논문지
• /
• 제17권6호
• /
• pp.119-130
• /
• 2012

본 논문에서는 수목관리의 효율성을 극대화하고자 객체지향 설계 모델링을 이용한 GIS 및 스마트폰 기반의 유비쿼터스 수목관리 시스템을 제안한다. 이를 위해 제안하는 시스템은 클라이언트/서버(C/S) 형태로 구현한다. 클라이언트에 해당하는 현장용 수목관리 시스템은 모바일(PDA, 스마트폰)기반으로 구성하고 서버에 해당하는 PC기반 수목관리 시스템은 GIS를 활용한다. 또한 C/S 간의 수목 데이터 통신을 위해 기존 연구에서 활용된 CDMA방식이 아닌 Web Service방식을 활용한다. 그리고 기존 연구의 문제점인 과도한 시스템 유지보수 비용과 다양한 사용자의 접근성 부족, 지리정보 시스템과의 연계 부족 현상을 본 논문에서 제안하는 시스템 개발 방식과 GIS 시스템, 스마트기기의 접목을 통해 해결한다. 이를 위해 본 논문에서는 시스템 단위테스트와 정성적인 평가를 통하여 기존 수목관리 시스템의 해결방안을 평가함으로써 제안하는 시스템의 효율성 및 확장성에서 우수함을 보인다.