• Korean Journal of Environmental Biology
• /
• v.19 no.1
• /
• pp.49-58
• /
• 2001

This study aims to compare and analyze the environment of natural parks and Ulleung island using the plant taxa classified by five degrees based on their distributional ranges. The scores differentially given based on the importance of each degree; taxa belonging to the fifth degree are given to 20 scores each, fourth 10, third 5, second 3.3, and first 2.5, respectively. The total assessed scores were ranked as Mt. Halla, Seorak, Jiri, Deokyu, Is. Ulleung, Mt. Sobaek, Odae, Palgong, Chink, Taebaek, Songni, Juwang, Gaya, Duryun, Gaeryong, Bukhan, Naebyeon, Worak, Naejang, Cheongryang, Naeyeon, Myeongii, Jokye, Mudeung, Wolchul, Geumo, Juheul, Biseul, Hwangmae, Jangan, Seonun, Moak, Seonam, Chilgap, and Gibaek, in order, respectively. It is suggested that the natural environments assessing more than 1,000 of total scores such as Mt. Halla and Mt. Deokyu are regarded as the most excellent ones, and those between 700 to 1,000 of total scores such as Is. Ulleung and Mt. Odae are regarded as relatively excellent ones. Natural parks scored between 500 to 700 such as Mt. Palgong and Mt. Gaya are regarded as good ones and parks scored between 300 to 500 such as Mt. Duryun and Mt. Mudeung are regarded as normal ones. The area assessed less than 300 of total scores such as Mt. Wolchul and Mt. Gibaek are regarded as the most inferior ones. The total scores of the national parks are generally higher than those of the provincial and county parks. In addition, Ulleung island has a total of 882.9 scores. Therefore, according to the IUCN the Ulleung island should be included in the criterion of the preservative model of natural ecosystem, suggested by Ministry of Environment. At the same time, Ulleung island should be included to the superior model of natural scenery resources by its uniqueness of topography, geography and natural environments. Ulleung island is assessed as having relatively excellent natural environments as compared with other national parks, suggesting that the island should be designated as a new national park.

• Journal of Internet Computing and Services
• /
• v.16 no.1
• /
• pp.67-74
• /
• 2015

In recent years, frequent itemset mining for considering the importance of each item has been intensively studied as one of important issues in the data mining field. According to strategies utilizing the item importance, itemset mining approaches for discovering itemsets based on the item importance are classified as follows: weighted frequent itemset mining, frequent itemset mining using transactional weights, and utility itemset mining. In this paper, we perform empirical analysis with respect to frequent itemset mining algorithms based on transactional weights. The mining algorithms compute transactional weights by utilizing the weight for each item in large databases. In addition, these algorithms discover weighted frequent itemsets on the basis of the item frequency and weight of each transaction. Consequently, we can see the importance of a certain transaction through the database analysis because the weight for the transaction has higher value if it contains many items with high values. We not only analyze the advantages and disadvantages but also compare the performance of the most famous algorithms in the frequent itemset mining field based on the transactional weights. As a representative of the frequent itemset mining using transactional weights, WIS introduces the concept and strategies of transactional weights. In addition, there are various other state-of-the-art algorithms, WIT-FWIs, WIT-FWIs-MODIFY, and WIT-FWIs-DIFF, for extracting itemsets with the weight information. To efficiently conduct processes for mining weighted frequent itemsets, three algorithms use the special Lattice-like data structure, called WIT-tree. The algorithms do not need to an additional database scanning operation after the construction of WIT-tree is finished since each node of WIT-tree has item information such as item and transaction IDs. In particular, the traditional algorithms conduct a number of database scanning operations to mine weighted itemsets, whereas the algorithms based on WIT-tree solve the overhead problem that can occur in the mining processes by reading databases only one time. Additionally, the algorithms use the technique for generating each new itemset of length N+1 on the basis of two different itemsets of length N. To discover new weighted itemsets, WIT-FWIs performs the itemset combination processes by using the information of transactions that contain all the itemsets. WIT-FWIs-MODIFY has a unique feature decreasing operations for calculating the frequency of the new itemset. WIT-FWIs-DIFF utilizes a technique using the difference of two itemsets. To compare and analyze the performance of the algorithms in various environments, we use real datasets of two types (i.e., dense and sparse) in terms of the runtime and maximum memory usage. Moreover, a scalability test is conducted to evaluate the stability for each algorithm when the size of a database is changed. As a result, WIT-FWIs and WIT-FWIs-MODIFY show the best performance in the dense dataset, and in sparse dataset, WIT-FWI-DIFF has mining efficiency better than the other algorithms. Compared to the algorithms using WIT-tree, WIS based on the Apriori technique has the worst efficiency because it requires a large number of computations more than the others on average.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.3
• /
• pp.1-40
• /
• 1965

To measure variations in some of the important agronomic characteristics of rice varieties under shifting of seedling dates, this study has been carried out at the Paddy Crop Division of Crop Experiment Station(then Agricultural Experiment Station) in Suwon for the period of three years 1958 to 1960. The varieties used in this study were Kwansan, Suwon ＃82, Mojo, Paltal and Chokwang, which have the different agronomic characteristics such as earliness and plant type. Seeds of each variety were sown at 14 different dates in 10-day interval starting on March 2. The seedlings were grown on seed bed for 30, 40, 50, 60, 70 and 80 days, respectively. The results of this study are as follows: A. Heading dates. 1. As the seeding date was delayed, the heading dates was almost proportionally delayed. The degree of delay was higher in early varieties and lower in late varieties and the longer the seedling stage, the more delayed the heading date. 2. Number of days to heading was proportionally lessened as seeding was delayed in all the varieties but the magnitude varied depending upon variety. In other words, the required period for heading in case of late planting was much shortened in late variety compared with early one. Within a variety, the number of days to heading was less shortened as the seedling stage was prolonged. Early variety reached earlier than late variety to the marginal date for the maximum shortening of days to heading and the longer the seeding stage, the limitted date came earlier. There was a certain limit in seeding date for shortening of days to heading as seeding was delayed, and days to heading were rather prolonged due to cold weather when seeded later than that date. 3. In linear regression equation, Y=a+bx obtained from the seeding dates and the number of days to heading, the coefficient b(shortening rate of days to heading) was closely correlated with the average number of days to heading. That is, the period from seeding to heading was more shortened in late variety than early one as seeding was delayed. 4. To the extent that the seedling stage is not so long and there is a linear relationship between delay of seeding and shortening of days to heading, it might be possible to predict heading date of a rice variety to be sown any date by using the linear regression obtained from variation of heading dates under the various seeding dates of the same variety. 5. It was found out that there was a close correlation between the numbers of days to heading in ordinary culture and the other ones. When a rice variety was planted during the period from the late part of March to the middle of June and the seedling ages were within 30 to 50 days, it could be possible to estimate heading date of the variety under late or early culture with the related data of ordinary culture. B. Maturing date. 6. Within (he marginal date for maturation of rice variety, maturing date was proportionally delayed as heading was delayed. Of course, the degree of delay depended upon varieties and seedling ages. The average air temperature (Y) during the ripening period of rice variety was getting lower as the heading date. (X) was delayed. Though there was a difference among varieties, in general, a linear regression equation(y=25.53-0.182X) could be obtained as far as heading date were within August 1 to September 13. 7. Depending upon earliness of a rice variety, the average air temperature during the ripening period were greatly different. Early variety underwent under 28$^{\circ}C$ in maximum while late variety matured under as low as 22$^{\circ}C$. 8. There was a highly significant correlation between the average air temperature (X) during the ripening period, and number of day (Y) for the maturation. And the relationship could be expressed as y=82.30-1.55X. When the average air temperature during the period was within the range of 18$^{\circ}C$ to 28$^{\circ}C$, the ripening period was shortened by 1.55 days with increase of 1$^{\circ}C$. Considering varieties, Kwansan was the highest in shortening the maturing period by 2.24 days and Suwon ＃82 was the lowest showing 0.78 days. It is certain that ripening of rice variety is accelerated at Suwon as the average air temperature increases within the range of 18$^{\circ}C$ to 28$^{\circ}C$. 9. Between number of days to heading (X) related to seeding dates and the accumulated average air temperature (Y) during the ripening period, a positive correlation was obtained. However, there was a little difference in the accumulated average air temperature during the ripening period even seeding dates were shifted to a certain extent. C. Culm- and ear-lengths. 10. In general all the varieties didn't show much variation in their culm-lengths in case of relatively early seeding but they trended to decrease the lengths as seeding was delayed. The magnitude of decreasing varied from young seedlings to old ones. Young seedlings which were seeded during May 21 to June 10 didn't decrease their culm-lengths, while seedlings old as 80 days decreased the length though under ordinary culture. 11. Variation in ear-length of rice varieties show the same trend as the culm-length subjected to the different seeding dates. When rice seedlings aged from 30 to 40 days, the ear-length remained constant but rice plants older than 40 days obviously decreased their ear-lengths. D. Number of panicles per hill. 12. The number of panicles per hill decreased up to a certain dates as seeding was delayed and then again increased the panicles due to the development of numerous tillers at the upper internodes. The seeding date to reach to the least number of panicles of rice variety depended upon the seedling ages. Thirty- to 40-day seedlings which were seeded during May 31 to June 10 developed the lowest number of panicles and 70- to 80-day seedlings sown for the period from April 11 to April 21 reached already to the minimum number of panicles. E. Number of rachillae. 13. To a certain seeding date, the number of rachillae didn't show any variation due to delay of seeding but it decreased remarkably when seeded later than the marginal date. 14. Variation in number of rachillae depended upon seedling ages. For example, 30- to 40-day old seedlings which, were originally seeded after May 31 started to decrease the rachillae. On the other hand, 80-day old seedlings which, were seeded on May 1 showed a tendency to decrease rachillae and the rice plant sown on May 31 could develop narrowly 3 or 4 panicles. F. Defective grain and 1.000-grain weights. 15. Under delay of the seeding dates, weight of the defective grains gradually increased till a certain date and then suddenly increased. These relationships could be expressed with two different linear regressions. 16. If it was assumed that the marginal date for ripening was the cross point of these two lines, the date seemed. closely related with seedling ages. The date was June 10- in 30- to 40-day old seedlings but that of 70- to 80-day old seedlings was May 1. Accordingly, the marginal date for ripening was getting earlier as the seedling stage was prolonged. 17. The 1.000-grain weight in ordinary culture was the heaviest and it decreased in both early and late cultures. G. Straw and rough rice weights. 18. Regardless of earliness of variety, rice plants under early culture which were seeded before March 22 or April 1 did not show much variation in straw weight due to seedling ages but in ordinary culture it gradually decreased and the degree was became greater in late culture. 19. Relationship between seeding dates (X) and grain weight related to varieties and seedling ages, could be expressed as a parabola analogous to a line (Y=77.28-7.44X$_1$-1.00lX$_2$). That is, grain yield didn't vary in early culture but it started to decrease when seeded later than a certain date, as seeding was delayed. The variation was much greater in cases of late planting and prolongation of seedling age. 20. Generally speaking, the relationship between grain yield (Y) and number of days to heading (X) was described with linear regression. However, the early varieties were the highest yielders within the range of 60 to 110, days to heading but the late variety greatly decreased its yield since it grows normally only under late culture. The grain yield, on the whole, didn't increase as number of days to heading exceeded more than 140 days.

• Journal of the Korean earth science society
• /
• v.21 no.5
• /
• pp.595-610
• /
• 2000

This study has been designed to elucidate the petrography and geochemical characteristics of the volcanic rocks and focused on petrogenesis and tectonic environment of the Bokyeongsa volcanics in the northeast Gyeongsang Basin. The Bokyeongsa volcanics consist of the Naeyeonsan tuff which include rock fragment plagioclase, quartz and hornblende and pumice showing welded structures, and felsite. According to the petrochemical data, the Naeyeonsan tuff and felsite are in the range of 68${\sim}$71wt% and 77wt% SiO$_2$ content respectively. The Naeyeonsan tuff belongs to dacite/rhyodacite, and felsite to rhyolite. These volcanics rocks belong to the calc-alkaline rock series on the TAS diagram and the AFM diagram. The variations of major elements of the volcanic rocks show that contene of TiO$_2$, Al$_2$ O$_3$, FeO$^T$, MnO, MgO, CaO are inversely proportional to those of SiO$_2$, but contents of K$_2$O are positively. They represent differentiation trend of calc-alkaline rocks series. In spider disgram of MORB-normalized trace element partterns, contents of K, Rb, Th and Ta are relatively high, but those of Nb, Zr, Hf, Ti, Y and Yb are nearly similar to MORB. In the chondrite-normalized REE patterns, light REEs are more enriched than heavy REEs. The trace element composition and REE patterns suggest that they are typical island-arc calc-akaline volcanic rocks formed in the tectonomagmatic environment of subduction zone under continental margin.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.2
• /
• pp.311-326
• /
• 2018

This paper has experimented using News sample video with QCIF ($176{\times}144$) resolution in JM v10.2 code of H.264/AVC-MPEG. The region of interest (ROI) to be encrypted occurred the drift by unnecessarily referring to each frame continuously in accordance with the characteristics of the motion prediction and compensation of the H.264 standard. In order to mitigate the drift, the latest related research method of re-inserting encrypted I-picture into a certain period leads to an increase in the amount of additional computation that becomes the factor increasing the bit-rate overhead of the entire video. Therefore, the reference search range of the block and the frame in the ROI to be encrypted is restricted in the motion prediction and compensation for each frame, and the reference search range in the non-ROI not to be encrypted is not restricted to maintain the normal encoding efficiency. In this way, after encoding the video with restricted reference search range, this article proposes a method of RC4 bit-stream encryption for the ROI such as the face to be able to identify in order to protect personal information in the video. Also, it is compared and analyzed the experimental results after implementing the unencrypted original video, the latest related research method, and the proposed method in the condition of the same environment. In contrast to the latest related research method, the bit-rate overhead of the proposed method is 2.35% higher than that of the original video and 14.93% lower than that of the latest related method, while mitigating temporal drift through the proposed method. These improved results have verified by experiments of this study.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.6
• /
• pp.6-15
• /
• 2009

In this paper, a new 4-way search window is designed for the high-performance 2D PE architecture in H.264 Motion Estimation(ME) to improve the memory bandwidth. While existing 2D PE architectures reuse the overlapped data of adjacent search windows scanned in 1 or 3-way, the new window utilizes the overlapped data of adjacent search windows as well as adjacent multiple scanning (window) paths to enhance the reusage of retrieved search window data. In order to scan adjacent windows and multiple paths instead of single raster and zigzag scanning of adjacent windows, bidirectional row and column window scanning results in the 4-way(up. down, left, right) search window. The proposed 4-way search window could improve the reuse of overlapped window data to reduce the redundancy access factor by 3.1, though the 1/3-way search window redundantly requires $7.7{\sim}11$ times of data retrieval. Thus, the new 4-way search window scheme enhances the memory bandwidth by $70{\sim}58%$ compared with 1/3-way search window. The 2D PE architecture in H.264 ME for 4-way search window consists of $16{\times}16$ pe array. computing the absolute difference between current and reference frames, and $5{\times}16$ reusage array, storing the overlapped data of adjacent search windows and multiple scanning paths. The reference data could be loaded upward and downward into the new 2D PE depending on scanning direction, and the reusage array is combined with the pe array rotating left as well as right to utilize the overlapped data of adjacent multiple scan paths. In experiments, the new implementation of 4-way search window on Magnachip 0.18um could deal with the HD($1280{\times}720$) video of 1 reference frame, $48{\times}48$ search area and $16{\times}16$ macroblock by 30fps at 149.25MHz.

• Korean Journal of Remote Sensing
• /
• v.37 no.6_3
• /
• pp.2035-2046
• /
• 2021

Glacier movement speed is the most basic measurement for glacial dynamics research and is a very important indicator in predicting sea level rise due to climate change. In this study, the two-dimensional velocity measurements of Campbell Glacier located in Terra Nova Bay in East Antarctica were observed through the SAR offset tracking technique. For this purpose, domestic KOMPSAT-5 SAR satellite images taken on July 9, 2021 and August 6, 2021 were acquired. The Multi-kernel SAR offset tracking proposed through previous studies is a technique to obtain the optimal result that satisfies both resolution and precision. However, since offset tracking is repeatedly performed according to the size of the kernel, intensive computational power and time are required. Therefore, in this study, we strategically proposed a coarse-to-fine offset tracking approach. Through coarse-to-fine SAR offset tracking, it is possible to obtain a result with improved observation precision (especially, about 4 times in azimuth direction) while maintaining resolution compared to general offset tracking results. Using this proposed technique, a two-dimensional velocity measurements of Campbell Glacier were generated. As a result of analyzing the two-dimensional movement velocity image, it was observed that the grounding line of Campbell Glacier exists at approximately latitude -74.56N. The flow velocity of Campbell Glacier Tongue analyzed in this study (185-237 m/yr) increased compared to that of 1988-1989 (140-240 m/yr). And compared to the flow velocity (181-268 m/yr) in 2010-2012, the movement speed near the ground line was similar, but it was confirmed that the movement speed at the end of the Campbell Glacier Tongue decreased. However, there is a possibility that this is an error that occurs because the study result of this study is an annual rate of glacier movement that occurred for 28 days. For accurate comparison, it will be necessary to expand the data in time series and accurately calculate the annual rate. Through this study, the two-dimensional velocity measurements of the glacier were observed for the first time using the KOMPSAT-5 satellite image, a domestic X-band SAR satellite. It was confirmed that the coarse-to-fine SAR offset tracking approach of the KOMPSAT-5 SAR image is very useful for observing the two-dimensional velocity of glacier movements.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.1-10
• /
• 2013

RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.

• Journal of Intelligence and Information Systems
• /
• v.18 no.1
• /
• pp.1-21
• /
• 2012

In recent years, mobile phone has experienced an extremely fast evolution. It is equipped with high-quality color displays, high resolution cameras, and real-time accelerated 3D graphics. In addition, some other features are includes GPS sensor and Digital Compass, etc. This evolution advent significantly helps the application developers to use the power of smart-phones, to create a rich environment that offers a wide range of services and exciting possibilities. To date mobile AR in outdoor research there are many popular location-based AR services, such Layar and Wikitude. These systems have big limitation the AR contents hardly overlaid on the real target. Another research is context-based AR services using image recognition and tracking. The AR contents are precisely overlaid on the real target. But the real-time performance is restricted by the retrieval time and hardly implement in large scale area. In our work, we exploit to combine advantages of location-based AR with context-based AR. The system can easily find out surrounding landmarks first and then do the recognition and tracking with them. The proposed system mainly consists of two major parts-landmark browsing module and annotation module. In landmark browsing module, user can view an augmented virtual information (information media), such as text, picture and video on their smart-phone viewfinder, when they pointing out their smart-phone to a certain building or landmark. For this, landmark recognition technique is applied in this work. SURF point-based features are used in the matching process due to their robustness. To ensure the image retrieval and matching processes is fast enough for real time tracking, we exploit the contextual device (GPS and digital compass) information. This is necessary to select the nearest and pointed orientation landmarks from the database. The queried image is only matched with this selected data. Therefore, the speed for matching will be significantly increased. Secondly is the annotation module. Instead of viewing only the augmented information media, user can create virtual annotation based on linked data. Having to know a full knowledge about the landmark, are not necessary required. They can simply look for the appropriate topic by searching it with a keyword in linked data. With this, it helps the system to find out target URI in order to generate correct AR contents. On the other hand, in order to recognize target landmarks, images of selected building or landmark are captured from different angle and distance. This procedure looks like a similar processing of building a connection between the real building and the virtual information existed in the Linked Open Data. In our experiments, search range in the database is reduced by clustering images into groups according to their coordinates. A Grid-base clustering method and user location information are used to restrict the retrieval range. Comparing the existed research using cluster and GPS information the retrieval time is around 70~80ms. Experiment results show our approach the retrieval time reduces to around 18~20ms in average. Therefore the totally processing time is reduced from 490~540ms to 438~480ms. The performance improvement will be more obvious when the database growing. It demonstrates the proposed system is efficient and robust in many cases.