• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.68-71
• /
• 2004

Hsinchu Science Park, one of the most productive electronic sites in the world, is located at Hsinchu County. Hsinchu County Government is entitled for daily management to pursue the objectives of making every county citizen prosperous. Several web-based management information systems have been developed for county management and were widely implemented. However, forest management is one of several tasks which need development of web-based geographic information systems. The objectives of this paper are to develop GIS for forest management at Hsinchu County in order to solve problems encountered in the rapid changing circumstance. The objectives of forest management at Hsinchu County have been changed a little bit in the last decade. Now, it mainly focuses on public and private forest, tree planting, wind break forest management, and plane forest planting. The major ingredients of GIS for forest management are user-friendly, task-oriented, and direct linking to the existing GIS at Hsinchu County. AreIMS and ArcGIS were used for web-based GIS. Field operations of forest management depend on PDA and GPS such that ArcPAD is implemented both on personal computers and PDA. Computer programming is required for database management and development of application modules in forest management. Color digital orthophoto maps at scale of 1:5000 provide very useful background information. Forest management at Hsinchu County now is operated in an efficient way that GIS, remote sensing, GPS and PDA are working smoothly.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.5
• /
• pp.161-169
• /
• 2018

This study presents a time synchronization system in decentralized structure by using the blockchain, a core technology of Bitcoin introduced by Satoshi Nakamoto in 2008. In this study, Getting away from existing time synchronization system in centralized structure, A blockchain network has completely decentralized structure using public blockchain. In decentralized structure, Only certain peers among the peers that participate in a blockchain network access the NTP server. Therefore, others can synchronize time without having to go to public network. Furthermore if appropriate time synchronization cycles are established for each peer, time synchronization can be maintained even when connection to public network is completely lost. A time synchronization system in this study has advantages of p2p system and can be also guaranteed reliability and stability because it used digital signature, merkle tree, consensus algorithm which are core characteristics of block chains.

• Journal of Korean Society of Forest Science
• /
• v.95 no.3
• /
• pp.240-249
• /
• 2006

Recently, dispersion of damaged forest by pine wilt disease has been regarded as a serious social issue. Damages by pine wilt disease have been spreaded by natural area expansion of the vectors in the damaged area, while the national wide damage spread has induced by human-involved carrying infected trees out of damaged area. In this study, damaged trees were detected and located on the digital map by aerial photograph and terrestrial surveys. The spatial distribution pattern of damaged trees, and the relationship of spatial distribution of damaged trees and some geomorphological factors were geostatistically analysed. Finally, we maked natural spread pattern map of pine wilt disease using geostatistical CART(Classification and Regression Trees) model. This study verified that geostatistical analysis and CART model are useful tools for understanding spatial distribution and natural spread pattern of pine wilt diseases.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.15 no.4
• /
• pp.41-49
• /
• 2012

The objective of this study is to investigate the characteristics of the location and prospects of the bear shelves built by Asiatic black bears in the Jirisan National Park. Previous researchers have been analyzed bear shelves in terms of places for resting and eating, but we are going to analyze based on the prospect-and-refuge theory. Characteristics of the sites of bear shelves are measured through field survey and topographic analysis by using digital elevation model (DEM). The normalized difference vegetation index (NDVI) is used to evaluate the optimum location of bear shelves in terms of crown density. Man-made objects are identified by viewshed analysis based on geographical information system (GIS). Findings of this paper can be summarized as follows. First, most bear trees are located deep inside of the mountainous national park, slopes of 30~40 degrees, altitude of 400~1,200m, and relatively low vegetation density with NDVI value of 0.4~0.6 compared to the average NDVI of the park. Second, the average height of bear shelves is 12.44m, or 74% of the average height of bear trees. They are located at suitable places to observe nearby trails and other park facilities. Third, man-made objects within the 100m radius of bear trees include lodge, bear training center, beekeeping camp, and hiking trails. Thus we may temporarily conclude that one of the main criteria of the bear tree selection in the park has been to identify optimum places for the monitoring of human activities in their habitat.

• Journal of Korean Society for Geospatial Information Science
• /
• v.19 no.3
• /
• pp.41-47
• /
• 2011

Processing of the raw LiDAR data requires the high-end processor, because data form is a vector. In contrast, if LiDAR data is converted into a regular grid pattern by filltering, that has advantage of being in a low-cost equipment, because of the simple structure and faster processing speed. Especially, by using grid data classification, such as Quadtree, some of trees and cars are removed, so it has advantage of modeling. Therefore, this study presents the algorithm for automatic extraction of ground points using Quadtree and refion growing method from LiDAR data. In addition, Error analysis was performed based on the 1:5000 digital map of sample area to analyze the classification of ground points. In a result, the ground classification accuracy is over 98%. So it has the advantage of extracting the ground points. In addition, non-ground points, such as cars and tree, are effectively removed as using Quadtree and region growing method.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.10
• /
• pp.11-18
• /
• 1998

A binary line code, called MB46d, is designed by use of the BUDA(Binary Unit DSV and ASV) cell concept to retain the property of being runlength limited, DC tree, and with a power spectral null at the Nyquist frequency. This new code is a stateless line code with a simple encoding and a decoding rule and enables efficient error monitoring. The power spectrum and the eye pattern of the new line code are simulated for a minimum-bandwidth digital transmission system where the sinc function is used as a basic pulse. The obtained power null at the Nyquist frequency is wide enough to enable easy band-limiting as well as secure insertion of a clock pilot where necessary. The eye is also substantially wide to tolerate a fair amount of timing jitter in the receiver.

• Convergence Security Journal
• /
• v.15 no.7
• /
• pp.75-84
• /
• 2015

In an "NTFS Index Record Data Hiding" method messages are hidden by using file names. Windows NTFS file naming convention has some forbidden ASCII characters for a file name. When inputting Hangul with the Roman alphabet, if the forbidden characters for the file name and binary data are used, the codes are convert to a designated unicode point to avoid a file creation error due to unsuitable characters. In this paper, the problem of a file creation error due to non-admittable characters for the file name is fixed, which is used in the index record data hiding method. Using Hangul with Roman alphabet the characters cause a file creation error are converted to an arbitrary unicode point except Hangul and Roman alphabet area. When it comes to binary data, all 256 codes are converted to designated unicode area except an extended unicode(surrogate pairs) and ASCII code area. The results of the two cases, i.e. the Hangul with Roman alphabet case and the binary case, show the applicability of the proposed method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.10
• /
• pp.1887-1894
• /
• 2016

In the RFID system, the reader transmits a query message to tags in order to identify a unique ID of tags within its detection range. The procedures for arbitrating a collision is essential because the multiple tags can response simultaneously in the same to the query of the Reader. This procedure is known as conflict resolution algorithm and it is a key technology in the RFID system. In this paper, we proposed a variable bits M-ary QT algorithm based on Manchester coding techniques. The proposed algorithm use the location information of the collision bits in the reader and tags. The proposed algorithm can reduce the number of the query-response cycle because it is capable of recognizing discontinuous bits and a variable number of bits. From computer simulation, the proposed method give better performance than the conventional M-ary QT techniques in terms of response, recognition efficiency, communication overhead.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.1
• /
• pp.73-83
• /
• 2018

There has been increasing interest from NIST and other companies in studying post-quantum cryptography in order to resist against quantum computers. Multivariate polynomial based, code based, lattice based, hash based digital signature, and isogeny based cryptosystems are one of the main categories in post quantum cryptography. Among these categories, isogeny based cryptosystem is known to have shortest key length. In this paper, we implemented Supersingular Isogeny Diffie-Hellman (SIDH) protocol efficiently on low-end mobile device. Considering the device's specification, we select supersingular curve on 523 bit prime field, and generate efficient isogeny computation tree. Our implementation of SIDH module is targeted for 32bit environment.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.235-246
• /
• 2002

While the Internet is suffering from the massive data such as video stream, IP multicast can ease the load of the Internet by enabling one copy of digital information to be received by multiple computers simultaneously. But If multicast is based on UDP, packets are delivered using a best-effort Policy without any reliability, congestion control or flow control. Multicast group members can join or leave a multicast group at will, and multicast uses broadcast mechanism, it's very hard to keep security from unauthorized members. In this paper, we introduce a new reliable multicast protocol TRDMF proper for one-to-many multicast model with reliability, flow control, congestion control and key management.