• Korean Journal of Remote Sensing
• /
• v.28 no.2
• /
• pp.181-189
• /
• 2012

Recently, interest in potential for estimating water quality using high resolution satellite images is increasing. However, low SNR(Signal to Noise Ratio) over inland water and radiometric errors such as non-linearity of brightness value of high resolution satellite images often lead to accuracy degradation in water quality estimation. Therefore radiometric correction should be carried out to estimate water quality for high resolution satellite images. For KOMPSAT-2 images parameters for brightness value-radiance conversion are not available and precise radiometric correction is difficult. To exploit KOMPSAT-2 images for water quality monitoring, it is necessary to investigate non-linearity of brightness value and noise over inland water. In this paper, we performed brightness value comparison between KOMPSAT-2 images and IKONOS/GeoEye-1, which are known to show the linearity. We used the images obtained over the same area and on the same date for comparison. As a result, we showed that although KOMPSAT-2 images are more noisy;the trend of brightness value and pattern of noise are almost similar to reference images. The results showed that appropriate target area to minimize the impact of noise was $5{\times}5$. Non-linearity of brightness value between KOMPSAT-2 and reference images was not observed. Therefore we could conclude that KOMPSAT-2 may be used for estimation of water quality parameters such as concentration of chlorophyll.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.28 no.2
• /
• pp.57-78
• /
• 2017

SNS is a useful tool to quickly deliver information in an emergency given their speed and expandability. Especially, SNS in the event of a disaster or an accident can offer on-site, accurate and detailed updates about essential information such as the safety of victims and the development of the situation, served as a valuable complement to the conventional media. This study aims to perform a comparative analysis on how social media are currently used by emergency management authorities in South Korea and other countries. Based on the results, this study proposed more effective ways to exploit SNS and improve efficiency of disaster management. To accomplish the goals, this study collected tweet information from various sources including the FEMA of the U. S., the FDMA and the Central Disaster Council of Japan, and the MPSS of Korea. The collected tweet information was analyzed by feedback, time series, and information types. The feedback analysis aims to quantify the number of monthly user feedback in order to assess user satisfaction about the tweet information. The time series analysis identifies the number of tweet information, feedback index and keywords by country for certain duration, examining why certain messages showed high feedback indices and what kind of contents should be offered by the authorities. Finally, the analysis of information type reviews the type of information contained in the tweet information that drew users' attention to identify the information type in which the authorities should deliver information to users. Based on these analyses, this study proposed improvement methods to use Tweeter in MPSS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3A
• /
• pp.232-239
• /
• 2011

IEEE 802.11n standard provides a framework for new link adaptation. A station can request that another station provide a Modulation and Coding Scheme (MCS) feedback, to fully exploit channel variations on a link. However, if the time elapsed between MCS feedback request and the data frame transmission using the MCS feedback becomes bigger, the previously received feedback information may be obsolete. In that case, the effectiveness of the feedback-based link adaptation is compromised. If a station can estimate how fast the channel quality to the target station changes, it can improve accuracy of the link adaptation. The contribution of this paper is twofold. First, through a thorough NS-2 simulation, we show how the coherence time affects the performance of the MCS feedback based link adaptation of 802.11n networks. Second, this paper proposes an effective algorithm for coherence time estimation. Using Allan variance information statistic, a station estimates the coherence time of the receiving link. A proposed link adaptation scheme considering the coherence time can provide better performance.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.5
• /
• pp.897-909
• /
• 2014

With the development of the Internet, the number of cyber threats is continuously increasing and their techniques are also evolving for the purpose of attacking our crucial systems. Since attackers are able to easily make exploit codes, i.e., malware, using dedicated generation tools, the number of malware is rapidly increasing. However, it is not easy to analyze all of malware due to an extremely large number of malware. Because of this, many researchers have proposed the malware classification methods that aim to identify unforeseen malware from the well-known malware. The existing malware classification methods used malicious information obtained from the static and the dynamic malware analysis as the criterion of calculating the similarity between malwares. Also, most of them used API functions and their sequences that are divided into a certain length. Thus, the accuracy of the malware classification heavily depends on the length of divided API sequences. In this paper, we propose an extraction method of optimized API sequence length and combination that can be used for improving the performance of the malware classification.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.6
• /
• pp.1259-1270
• /
• 2019

The upper bound of differential characteristic probability is mainly used to determine the number of rounds when constructing a block cipher. As the number of rounds affects the performance of block cipher, it is critical to evaluate the tight upper bound in the constructing process. In order to calculate the upper bound of differential characteristic probability, the previous searching methods for minimum number of active S-boxes constructed constraint equations for non-linear operations and linear operations, independently. However, in the case of BOGI design strategy, where linear operation is dependent on non-linear operation, the previous methods may present the less tight upper bound. In this paper, we exploit the properties of BOGI strategy to propose a new method to evaluate a tighter upper bound of differential characteristic probability than previous ones. Additionally, we mathematically proved the validity of our method. Our proposed method was applied to GIFT-64 and GIFT-128, which are based on BOGI strategy, and the upper bounds of differential characteristic probability were derived until 9 round. Previously, the upper bounds of differential characteristic probability for 7-round GIFT-64 and 9-round GIFT-128 were 2^-18.395 and 2^-26.885, respectively, while we show that the upper bounds of differential characteristic probability are more tight as 2^-19.81 and 2^-28.3, respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1311-1321
• /
• 2010

Sensor network is used to obtain sensing data in various area. The interval to sense the events depends on the type of target application and the amounts of data generated by sensor nodes are not constant. Many applications exploit long sensing interval to enhance the life time of network but there are specific applications that requires very short interval to obtain fine-grained, high-precision sensing data. If the number of nodes in the network is increased and the interval to sense data is shortened, the amounts of generated data are greatly increased and this leads to increased amount of packets to transfer to the network. To transfer large amount of packets fast, it is necessary that the delay between successive packet transmissions should be minimized as possible. In this paper, we propose SET(SendDoneEventbasedTransmission Technique)which reduces the delay between successive packet transmissions by using SendDone Event which informs that a packet transmission has been completed. In SET, the delay between successive packet transmissions is shortened very much since the transmission of next packet starts at the time when the transmission of previous packet has completed, irrespective of the transmission time. Therefore SET could provide high packet transmission rate given large amount of packets.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.357-372
• /
• 2001

In this paper, we present the concept of generalization in constructing windows for subsequence matching and propose a new subsequence matching method. GeneralMatch, based on the generalization. The earlier work of Faloutsos et al.(FRM in short) causes a lot of false alarms due to lack of the point-filtering effect. DualMatch, which has been proposed by the authors, improves performance significantly over FRM by exploiting the point filtering effect, but it has the problem of having a smaller maximum window size (half that FRM) given the minimum query length. GeneralMatch, an improvement of DualMatch, offers advantages of both methods: it can use large windows like FRM and, at the same time, can exploit the point-filtering effect like DualMatch. GeneralMatch divides data sequences into J-sliding windows (generalized sliding windows) and the query sequence into J-disjoint windows (generalized disjoint windows). We formally prove that our GeneralMatch is correct, i.e., it incurs no false dismissal. We also prove that, given the minimum query length, there is a maximum bound of the window size to guarantee correctness of GeneralMatch. We then propose a method of determining the value of J that minimizes the number of page accesses, Experimental results for real stock data show that, for low selectivities ($10^{-6}~10^{-4}$), GeneralMatch improves performance by 114% over DualMatch and by 998% iver FRM on the average; for high selectivities ($10^{-6}~10^{-4}$), by 46% over DualMatch and by 65% over FRM on the average.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1167-1175
• /
• 2016

This paper proposes an efficient page-level mapping algorithm that reduces the erase count in the FTL for flash memory systems. By maintaining the weight for each write request in the request buffer, the proposed algorithm estimates the degree of temporal locality for each incoming write request. To exploit temporal locality deliberately for determination of hot request, the degree of temporal locality should be much higher than the reference point determined experimentally. While previous LRU algorithm treats a new write request to have high temporal locality, the proposed algorithm allows write requests that are estimated to have high temporal locality to access hot blocks to store hot data intensively. The pages are more frequently updated in hot blocks than warm blocks. A hot block that has most of invalid pages is always selected as victim block at Garbage Collection, which results in delayed erase operation and in reduced erase count. Experimental results show that erase count is reduced by 9.3% for real I/O workloads, when compared to the previous LRU algorithm.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.515-522
• /
• 2005

This paper presents a method for effectively modeling inlay/onlay prostheses restoring a tooth that are partially destroyed. An inlay/onlay is composed of internal surface adhering to an abutment, and external surface revealed to the outside sight. Internal surfaces are modeled using Minkowski sum expanding the grinded surface parts of abutments so that the internal surfaces can adhere to the abutments with closer contact. In modeling external surfaces, we exploit 3D mesh deformation techniques: DMFFD(direct manipulation free-form deformation)[19] and MWD(multiple wires deformation)[17] with three kinds of informations: standard teeth models, mesh data obtained by scanning a plaster cast of a patient's tooth, FGP(functionally guided plane) measuring the occlusion of the patients's teeth. The standard teeth models are used for building up the basic shapes of external surfaces, while the plaster fast and FGP data are used for reflecting the unique properties of adjacent md occlusal surfaces of the patients's teeth, which are slightly different to each other but very important for correct functioning. With these informations as input data, the adjacent and occlusal surfaces are automatically generated as mesh data using the techniques of DMFFD and m, respectively. Our method was implemented so that inlay/onlay prostheses fan be designed more accurately by visualizing the generated mesh models with requirements by dentists.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.365-372
• /
• 2004

Recently, the studies for mesh simplification have been increased according to the application area of the complicate 3D mesh models has been expanded. This paper introduces a novel method for mesh simplification which uses the properties of the mesh model in addition to the geometric locations of the model. The information of the 3D mesh model Includes surface properties such as color, texture, and curvature information as well as geometic information of the model. The most of current simplification methods adopt such geometric information and surface properties individually for mesh simplification. However, the proposed simplification method combines the geometric information and solace properties and applies them to the simplification process simultaneously. In this paper, we exploit the extended geometry based quadric error metric(QEM) which relatively allows fast and accurate geometric simplification of mesh. Thus, the proposed mesh simplification utilizes the quadric error metric based on geometric information and the surface properties such as color, normal, and texture. The proposed mesh simplification method can be expressed as a simple quadric equation which expands the quadric error metric based on geometric information by adding surface properties such as color, normal, and texture. From the experimental results, the simplification of the mesh model based on the proposed method shows the high fidelity to original model in some respects such as global appearance rather than using current geometry based simplification.