• Journal of the military operations research society of Korea
• /
• v.15 no.2
• /
• pp.94-104
• /
• 1989

The concept of Algebraic-Coded Cryptosystem has been proposed recently but its application has not been developed yet. The primary object of this paper is to implement the Private-Key Algebraic-Coded Cryptosystem by using the primitive binary BCH codes. In the analysis of the cryptosystein, we find out the fact that there may exist other key pairs $S_i\;and\;P_i$ satisfying $G^*=S_{i},G_{s},P_{i}$ where $SG_{s}P$ is the original cryptosystem made by use of the systematic code generation matrix $G_{s}$.

• Journal of Astronomy and Space Sciences
• /
• v.12 no.2
• /
• pp.196-203
• /
• 1995

The UBV light curves of a close eclipsing binary SW Lyn were obtained with the observations made at the Sobaeksan Astronomy Observatory during 7 nights from September 1983 to March 1987. These light curves show asymmetry to the secondary minimum light and the asymmetry is larger at the shorter wavelength light curve. Assuming that the star sport makes the asymmetry, we employed the WD code to make the B and V light curves solution. We confirmed that SW Lyu has near contact(semi-detached) Roche configuration and has the Case A evolution.

• ETRI Journal
• /
• v.18 no.4
• /
• pp.215-227
• /
• 1997

We propose a new method to eliminate completely the redundant elements in a CDMA (code division multiple access) mobile system. First, we define multilevel logic operation (MLO), which is a new concept to deal with the multilevel logic signals. We prove that the conventional binary logic concept is a subset of the MLO concept. The multilevel logic signal can be directly controlled by using this MLO in place of the binary operation. We applied the MLO to the CDMA base station modulator (BSM) in order to reduce the hardware complexity. In the case of a 3-sectorized cell, this method helps reduce the complexity down the level of below 1% of the conventional CDMA BSM for spreading and filtering, and to 50% for Walsh covering.

• Proceedings of the IEEK Conference
• /
• 2001.06b
• /
• pp.63-66
• /
• 2001

In this paper a binary image encryption technique and decryption system based on a joint transform correlator (JTC) are Proposed. In this method, a Fourier transform of the encrypted image is used as the encrypted data and a Fourier transform of the random phase is used as the key code. The original binary image can be reconstructed on a square law device, such as a CCD camera after the joint input is inverse Fourier transformed. The proposed encryption technique does not suffer from strong auto-correlation terms appearing in the output plane. Based on computer simulations, the proposed encryption technique and decoding system were demonstrated as adequate for optical security applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.4
• /
• pp.374-387
• /
• 1989

The decoding method of Binary BCH Codes using symmetric matrix is proposed in this paper. With this method, the error-locator-polynomial is composed by symmetric matrix which consists of the powers of the unknown X plus the synfromes as its elements. The symmetric matirx can also be represented in terms of the unknown X. But the each coefficients of the error-locator polynomial represents the matirx with the syndromes as its entries. By utilizing this proposed algorithm, the device for decoding circuit of the (63, 45) BCH Code for t=3 has been implemented for demonstration.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.27-32
• /
• 2003

An efficient soft-decision decoding algorithm for binary block codes it proposed. The proposed soft-decision decoding algorithm is implemented by a series of hard-decision decoding process. By the hard-decision decoding result, the candidate codewords are efficiently searched for A new decoding method, which prevents the missing of the candidate codeword, is proposed. Also, the method fir reducing complexity is developed. This method removes the practical complexity increase caused by the improved algorithm. There facts are confirmed by the simulation results for binary (63, 36) BCH code.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2010.07a
• /
• pp.67-70
• /
• 2010

본 논문은 바이너리 코드 수준에서 정적인 프로그램 분석을 수행하는 프레임워크를 설계 및 구현한다. 정적으로 바이너리 코드 수준에서 분석을 수행하려는 이유는 일반적으로 컴퓨터에 설치되는 실행 파일은 소스 코드 없이 단지 바이너리로 된 실행 파일만 주어지는 경우가 대부분이고, 정적 제어 흐름 분석을 통해 수행 전에 동작을 파악하기 위해서이다. 본 논문에서는 바이너리 실행 파일로부터 실행 순서 및 제어 흐름 등의 정보를 표현할 수 있는 제어 흐름 그래프를 작성하여 바이너리 파일의 실행 흐름과 위험한 함수의 호출 여부를 동시에 파악할 수 있도록 하며, 그래프 시각화를 통해 바이너리 파일의 분석을 용이하게 한다. 또한 실행 흐름에 대한 자동 탐색 방법을 제공한다.

• Journal of Astronomy and Space Sciences
• /
• v.14 no.1
• /
• pp.33-43
• /
• 1997

New BVR CCD photometric observations of EB type close binary V388 Cyg were obtained at the Sobaeksan Astronomy Observatory during 10 nights from October to December 1995. We analyse new 3 color (B, V & R) light curves simultaneously using the Wilson-Devinney code. Now, it is not yet clear whether V388 Cyg is contact or semidetached system. Published epochs of times of minima to data were used to study the changes in period of the system, and calculated a new light elements with the secular terms, $-4.83{\times}10^{-10}$, which indicated the continuous decrease of the period.

• Journal of Information Processing Systems
• /
• v.15 no.6
• /
• pp.1462-1471
• /
• 2019

Real-time embedded systems have become pervasive in general industry. They also began to be applied in such domains as avionics, automotive, aerospace, healthcare, and industrial Internet. However, the system failure of such domains could result in catastrophic consequences. Runtime software testing is required in such domains that demands very high accuracy. Traditional runtime software testing based on handwork is very inefficient and time consuming. Hence, test automation methodologies in runtime is demanding. In this paper, we introduce a software testing system that translates a real-time software into a monitorable real-time software. The monitorable real-time software means the software provides the monitoring information in runtime. The monitoring target are time constraints of the input real-time software. We anticipate that our system lessens the burden of runtime software testing.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.10
• /
• pp.63-71
• /
• 1996

This paper proposes a method which analyzes facial shape and extracts positions of eyes regardless of the tilt and the size of input iamge. With the extracted feature parameters of facial element by the method, full human faces are recognized by a neural network which BP algorithm is applied on. Input image is changed into binary codes, and then labelled. Area, circumference, and circular degree of the labelled binary image are obtained by using chain code and defined as feature parameters of face image. We first extract two eyes from the similarity and distance of feature parameter of each facial element, and then input face image is corrected by standardizing on two extracted eyes. After a mask is genrated line historgram is applied to finding the feature points of facial elements. Distances and angles between the feature points are used as parameters to recognize full face. To show the validity learning algorithm. We confirmed that the proposed algorithm shows 100% recognition rate on both learned and non-learned data for 20 persons.