• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6145-6158
• /
• 2019

It is a challenge for the current security industry to respond to a large number of malicious codes distributed indiscriminately as well as intelligent APT attacks. As a result, studies using machine learning algorithms are being conducted as proactive prevention rather than post processing. The k-NN algorithm is widely used because it is intuitive and suitable for handling malicious code as unstructured data. In addition, in the malicious code analysis domain, the k-NN algorithm is easy to classify malicious codes based on previously analyzed malicious codes. For example, it is possible to classify malicious code families or analyze malicious code variants through similarity analysis with existing malicious codes. However, the main disadvantage of the k-NN algorithm is that the search time increases as the learning data increases. We propose a fast k-NN algorithm which improves the computation speed problem while taking the value of the k-NN algorithm. In the test environment, the k-NN algorithm was able to perform with only the comparison of the average of similarity of 19.71 times for 6.25 million malicious codes. Considering the way the algorithm works, Fast k-NN algorithm can also be used to search all data that can be vectorized as well as malware and SSDEEP. In the future, it is expected that if the k-NN approach is needed, and the central node can be effectively selected for clustering of large amount of data in various environments, it will be possible to design a sophisticated machine learning based system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.92-96
• /
• 2008

Practical communication systems need to operate at various different rates. This paper describes and analyzes low-density parity check codes for various different rates. From a specific mother code, it allows LDPC codes for different rate. The advantage of this technique is that each different rate LDPC codes have a same block length as mother code though the rate changes so it can make up for the weak points of puncturing and shortening which reduce their block length as the rate changes. Row-splitting method is to split the row, so that the rate changes from a higher rate to lower rate and cause of its own property, it can overcome the defect of row-combining method.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.2
• /
• pp.83-92
• /
• 2009

As the innovative internet technologies and multimedia are being rapidly developed, malicious codes are a remarkable new growth part and supplied by various channel. This project presents a classification methodology for malicious codes in Windows OS (Operating System) environment, develops a test classification system. Thousands of malicious codes are brought in every day. In a result, classification system is needed to analyzers for supporting information which newly brought malicious codes are a new species or a variety. This system provides the similarity for analyzers to judge how much a new species or a variety is different to the known malicious code. It provides to save time and effort, to less a faulty analysis. This research includes the design of classification system and test system. We classify the malicious codes to 9 groups and then 9 groups divide the clusters according to the each property.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.1
• /
• pp.13-20
• /
• 2006

In this paper, we constructed a spam-mail filtering system based on the lexical and conceptual information. There are two kinds of information that can distinguish the spam mail from the legitimate mil. The definite information is the mail sender's information, URL, a certain spam keyword list, and the less definite information is the word lists and concept codes extracted from the mail body. We first classified the spam mail by using the definite information, and then used the less definite information. We used the lexical information and concept codes contained in the email body for SVM learning. According to our results the spam precision was increased if more lexical information was used as features, and the spam recall was increased when the concept codes were included in features as well.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.74-89
• /
• 2021

For higher-level requirements of urban planning and management and the recent development of "digital earth" and "digital city", it is urgent to establish protocols for the construction of three-dimensional digital city models. However, some problems still exist in the digital technology of the three-dimensional city model, such as insufficient precision of the three-dimensional model, not optimizing the scene and not considering the constraints of building codes. In view of those points, a method to interactively simulate a virtual city scene based on building codes is proposed in this paper. Firstly, some constraint functions are set up to restrict the models to adhere to the building codes, and an improved directional bounding box technique is utilized to solve the problem that geometric objects may intersect in a virtual city scene. The three-dimensional model invocation strategy is designed to convert two-dimensional layouts to a three-dimensional urban scene. A Leap Motion hardware device is used to interactively place the 3D models in a virtual scene. Finally, the design and construction of the three-dimensional scene are completed by using Unity3D. The experiment shows that this method can simulate urban virtual scenes that strictly adhere to building codes in a virtual scene of the city environment, but also provide information and decision-making functions for urban planning and management.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.3
• /
• pp.11-20
• /
• 2022

Currently, the black-white QR (Quick Response) codes have been used widely in consumer advertising fields and the study of color QR codes have received a growing demand because of much higher data encoding capacity. Color QR codes can be reproduced by the printing and scanning processes, however, these encounter colors distortion caused by insufficient lighting, low resolution of camera and geometric deformation during the capturing processes. In order to overcome these problems, this paper proposes an efficient decoding algorithm for color QR codes with inserted patterns, which are dealt with conventional studies. These are evaluated in view of the recognition rate under different noise conditions, for example, Gaussian noises/blurring and geometric deformation. Experimental results demonstrate that the color QR codes with simple pattern can resist the distortion of Gaussian noises/blurrings.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.10
• /
• pp.852-857
• /
• 2013

In this paper we propose a design algorithm for nonbinary LDPC (low-density parity-check) codes with low error-floors. The proposed algorithm determines the nonbinary values of the nonzero entries in the parity-check matrix in order to maximize the binary minimum distance of the designed nonbinary LDPC codes. We verify the performance of the designed nonbinary LDPC codes in the error-floor region by Monte Carlo simulation and importance sampling over BPSK (binary phase-shift keying) modulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6C
• /
• pp.570-579
• /
• 2003

The performance of turbo codes is investigated in the direct detection optical PPM channel. We assume that an ideal photon counter is used as an optical detector and that the channel has background noise as well as quantum noise. Resulting channel model is M-ary PPM Poisson channel. We propose the structure of the transmitter and receiver for applying turbo codes to this channel. We also derive turbo decoding algorithm for the proposed coding system, by modifying the calculation of the branch metric inherent in the original turbo decoding algorithm developed for the AWGN channel. Analytical bounds are derived and computer simulation is performed to analyze the performance of the proposed coding scheme, and the results are compared with the performances of Reed-Solomon codes and convolutional codes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.11
• /
• pp.2397-2404
• /
• 2012

Underwater acoustic communication has multipath error because of reflection by sea-level and sea-bottom. The multipath of underwater channel causes signal distortion and error floor. In order to improve the performance, it is necessary to employ an iterative coding scheme. Among the iterative coding scheme, turbo codes and LDPC codes are dominant channel coding schemes in recent. This paper concluded that turbo coding scheme is optimal for underwater communications system in aspect to performance, coded word length, and equalizer combining. Also, decision directed phase recovery was used for correcting phase offset induced by multipath. Based on these algorithms, we confirmed the performance in the environment of oceanic experimentation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6C
• /
• pp.575-581
• /
• 2006

In this paper, we first define one-dimensional component symbol error function (ODSEF) from the exact expression of the pairwise error probability of orthogonal space-time block codes (OSTBC). Using the ODSEF and the general bit error probability (BEP) expression for quadrature amplitude modulation (QAM) introduced by Cho and Yoon, the exact closed form expressions for the BEP of linear OSTBCs with QAM in slow-varying Rayleigh fading channel are derived.