• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06d
• /
• pp.122-125
• /
• 2011

버퍼 오버플로우(buffer overflow) 취약점은 1988년 모리스 웜(Morris worm)을 통하여 널리 알려진 이후 이를 해결하기 위한 많은 연구들이 진행되었으며, 동시에 이를 이용한 공격 역시 끊임없이 이루어지고 있다. 기존의 버퍼 오버플로우 취약점에 대한 연구는 크게 컴파일러 및 라이브러리, 커널, 하드웨어 단계로 나눌 수 있다. 하지만 이러한 방법들은 다양한 한계를 가진다. 본 논문은 이러한 문제들을 해결하기 위하여 버퍼 오버플로우 취약점을 발생시키는 코드를 바이너리에서 직접 검색하고, 이를 패치하여 버퍼 오버플로우 취약점을 제거하는 BinaryReviser를 구현하였다.

• The Bulletin of The Korean Astronomical Society
• /
• v.41 no.1
• /
• pp.78.3-78.3
• /
• 2016

The Kepler mission of NASA has enabled to discover a lot of new W UMa-type binaries with continuous light curves measured with unprecedented accuracy. Interestingly, their eclipsing time variation (hereafter ETV) diagrams show anti-correlation between primary and secondary minima, presumably occurred by continuous spot variation (Tran et al. 2013; Balaji et al. 2014). Two active Kepler binaries (KIC06118779 & KIC08682849), reported as showing the anti-correlation in ETV diagram, were investigated to see that the anti-correlations are correlated with time-variable O'connell effects appeared in their light curves. As a result, it was found that the O'connell effects for two binary stars have varied in quasi-sinusoidal ways similar to the patterns of their anti-correlation variations. In addition, our light curve syntheses of two binary stars with the latest version of the Wilson-Devinney code (Wilson & devinney 1971) show that they are very deep-contact binary system with extremely low mass ratios.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.9
• /
• pp.2317-2327
• /
• 1996

Original binary image can be reconstructed without any distortion by MS(morphological skeleton) image. Though we reduce some points in a MS image, there is no problem to reconstruct original image by it. And then, there are two methods of LMS and GMS which reduce the redundant points of a MS image. The redundancy degree of a GMS image is zero and it is less than that of LMS. And then, GMS image is the best thing of the three kinds of morphological skeleton image to enhance the compression efficienty by the Elias code. But there are continous SKF=1 points in a GMS image whenever using 2 dimensional structureing element. Those points in a GMS image gives rise to a bad compression efficiency. And then, solving this problem, this paper proposes hybrid structuring elements algorithms for binary image compression.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.952-958
• /
• 1994

In this paper a method calculates the time offset between a binary sequence and its shifted sequence based on the number theoretic approach is presented. Using this method the time offset between a binary sequence and its shifted sequence can be calculated. It has been recongnized that the defining the reference (zero-offset) sequence is important in synchronous code division multiple access(CDMA) system since the same spreading sequence are used by the all base station. The time offset of the sequence with respect to the zero offset sequence are used to distinguish signal received at a mobile station from different base stations. This paper also discusses a method that defines the reference sequence.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10A
• /
• pp.1576-1581
• /
• 2000

We investigated into the minimum distance of a primitive binary cyclic code C with a generator polynomial g(x)=$m_1(x)m_{d}(x)$. It is known that the necessary and sufficient condition for C to have minimum distance five is the fact that \ulcorner is an APN power function. In this paper we derived the new proof of minimum distance for the primitive binary cyclic codes with minimum distance five.

• Journal of the Semiconductor & Display Technology
• /
• v.8 no.3
• /
• pp.39-44
• /
• 2009

Local Binary Pattern (LBP) is becoming a popular tool for various machine vision applications such as face recognition, classification and background subtraction. In this paper, we propose a new extension of LBP, called the Diagonal LBP (DLBP), to handle the image-based gender classification problem arise in interactive display systems. Instead of comparing neighbor pixels with the center pixel, DLBP generates codes by comparing a neighbor pixel with the diagonal pixel (the neighbor pixel in the opposite side). It can reduce by half the code length of LBP and consequently, can improve the computation complexity. The Support Vector Machine is utilized as the gender classifier, and the texture profile based on DLBP is adopted as the feature vector. Experimental results revealed that our approach based on the diagonal LPB is very efficient and can be utilized in various real-time pattern classification applications.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.1
• /
• pp.111-130
• /
• 2019

The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding minimum pseudoweight equals its minimum Hamming distance. By using the value assignment of Chen and Kløve we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give several upper bounds on the pseudoredundancies of certain codes with repeated and added coordinates and of certain shortened subcodes. We also investigate several kinds of k-dimensional binary codes and compute their exact pseudocodeword redundancy.

• Communications for Statistical Applications and Methods
• /
• v.31 no.5
• /
• pp.487-496
• /
• 2024

In this paper, we propose a data-driven procedure to segment a binary sequence as an alternative to the popular hidden Markov model (HMM) based procedure. Unlike the HMM, our procedure does not make any distributional or model assumption to the data. To segment the sequence, we suggest to minimize the least square distance from the observations under total variation regularization to the solution, and develop a polynomial time algorithm for it. Finally, we illustrate the algorithm using a toy example and apply it to the Gemini boat race data between Oxford and Cambridge University. Further, we numerically compare the performance of our procedure to the HMM based segmentation through these examples.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1996.11a
• /
• pp.286-294
• /
• 1996

In a remarkable paper 〔3〕, Hammons et al. showed that, when properly defined, the binary nonlinear Preparata code can be considered as the Gray map of a linear code eve. Z$_4$, the so-called Preparata code eve. Z$_4$. Recently, Yang and Helleseth 〔12〕 considered the generalized Hamming weights d$\_$r/(m) for Preparata codes of length 2$\^$m/ over Z$_4$ and exactly determined d$\_$r/, for r = 0.5,1.0,1.5,2,2.5 and 3.0. In particular, they completely determined d$\_$r/(m) for any r in the case of m $\leq$ 6. In this paper we show that the Preparata code of length 16 over Z$_4$ does not satisfy the chain condition.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.9-11
• /
• 2009

It is well-known that the performance of turbo codes can be improved by allocating different energies per code symbol. In this paper, based on this observation, we propose a joint encoding and modulation scheme for quadrature amplitude modulated turbo code systems. In the proposed scheme, the amount of energy difference between the turbo coded symbols is optimized by optimizing the constellation of quadrature amplitude modulation(QAM). The proposed scheme offers better coding gain compared to the conventional combination of binary turbo code and QAM at the bit error rate of $10^{-5}$.