• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.4
• /
• pp.319-324
• /
• 2018

In this paper, we designed and implemented a code conversion method between ISO/IEC 10646 and the multi-byte code set. The Universal Multiple-Octet Coded Character Set(UCS) provides codes for more than 65,000 characters, huge increase over ASCII's code capacity of 128 characters. It is applicable to the representation, transmission, interchange, processing, storage, input and presentation of the written form of the language throughout the world. Therefore, it is so important to guide on code conversion methods to their customers during customer systems are migrated to the environment which the UCS code system is used and/or the current code systems, i.e., ASCII PC code and EBCDIC host code, are used with the UCS together. Code conversion utility including the mapping table between the UCS and IBM new host code is shown for the purpose of the explanation of code conversion algorithm and its implementation in the system. The programs are successfully executed in the real system environments and so can be delivered to the customer during its migration stage from the UCS to the current IBM code system and vice versa.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.2
• /
• pp.171-179
• /
• 2022

Self-Modifying-Code is a code that changes the code by itself during execution time. This technique is particularly abused by malicious code to bypass static analysis. Therefor, in order to effectively detect such malicious codes, it is important to identify self-modifying-codes. In the meantime, Self-modify-codes have been analyzed using dynamic analysis methods, but this is time-consuming and costly. If static analysis can detect self-modifying-code it will be of great help to malicious code analysis. In this paper, we propose a static analysis method to detect self-modified code for binary executable programs converted to LLVM IR and apply this method by making a self-modifying-code benchmark. As a result of the experiment in this paper, the designed static analysis method was effective for the standardized LLVM IR program that was compiled and converted to the benchmark program. However, there was a limitation in that it was difficult to detect the self-modifying-code for the unstructured LLVM IR program in which the binary was lifted and transformed. To overcome this, we need an effective way to lift the binary code.

• Journal of The Korean Astronomical Society
• /
• v.34 no.4
• /
• pp.255-259
• /
• 2001

PMDSPH is a combined 3D particle-mesh and SPH code aimed to simulate the self-consistent dynamical evolution of spiral galaxies including live stellar and collisionless dark matter components, as well as an isothermal gas component. This paper describes some aspects of this code and shows how its application to the Milky Way helps to recover the gas flow within the Galactic bar region from the observed HI and CO longitude-velocity distributions.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1996.05a
• /
• pp.28-33
• /
• 1996

A transport theory code CRX-Hex based on characteristic methods with a general geometric tracking routine is developed for the heterogeneous hexagonal geometry. With the general geometric tracking routine, the formulation of the characteristic method is not changed. To test the code, it was applied to two benchmark problems which consist of complex meshes and compared with other codes (HELIOS, TWOHEX).

• Journal of IKEEE
• /
• v.2 no.1 s.2
• /
• pp.150-159
• /
• 1998

This paper described the recognition of the Off-line handwritten Hangul based on neural network using a feature extraction method. Features of Hangul can be extracted by a $5{\times}5$ window method which is the modified $3{\times}3$ mask method. These features are coded to binary patterns in order to use neural network's inputs efficiently. Hangul character is recognized by the consonant, the vertical vowel, and the horizontal vowel, separately. In order to verify the recognition rate, three different coding methods were used for neural networks. Three methods were the fixed-code method, the learned-code I method, and the learned-code II method. The result was shown that the learned-code II method was the best among three methods. The result of the learned-code II method was shown 100% recognition rate for the vertical vowel, 100% for the horizontal vowel, and 98.33% for the learned consonants and 93.75% for the new consonants.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.11
• /
• pp.123-129
• /
• 2020

Recently, cybercrime has become increasingly difficult to track by applying new technologies such as virtualization technology and distribution tracking avoidance. etc. Therefore, there is a limit to the technology of tracking distributors based on malicious code information through static and dynamic analysis methods. In addition, in the field of cyber investigation, it is more important to track down malicious code distributors than to analyze malicious codes themselves. Accordingly, in this paper, we propose a next-generation malicious code information collection architecture to efficiently track down malicious code distributors by converging traditional analysis methods and recent information collection methods such as OSINT and Intelligence. The architecture we propose in this paper is based on the differences between the existing malicious code analysis system and the investigation point's analysis system, which relates the necessary elemental technologies from the perspective of cybercrime. Thus, the proposed architecture could be a key approach to tracking distributors in cyber criminal investigations.

• Korean Management Science Review
• /
• v.21 no.2
• /
• pp.43-60
• /
• 2004

Every iteration of interior-point methods of large scale optimization requires computing at least one orthogonal projection. In the practice, symmetric variants of the Gaussian elimination such as Cholesky factorization are accepted as the most efficient and sufficiently stable method. In this paper several specific implementation issues of the symmetric factorization that can be applied for solving such equations are discussed. The code called McSML being the result of this work is shown to produce comparably sparse factors as another implementations in the $MATLAB^{***}$ environment. It has been used for computing projections in an efficient implementation of self-regular based interior-point methods, McIPM. Although primary aim of developing McSML was to embed it into an interior-point methods optimizer, the code may equally well be used to solve general large sparse systems arising in different applications.

• Journal of Convergence Society for SMB
• /
• v.2 no.1
• /
• pp.1-9
• /
• 2012

This work focuses on reducing claims by improving the existing receipt process, and proposed an executable Claims solving method used QR code. We propose a effected claim process methods after introduced claim process based on bar code, RFID. Also, we illustrated proposed claim solving method to M company and verified the useful and effectiveness by a survey.

• Journal of The Korean Astronomical Society
• /
• v.28 no.2
• /
• pp.223-243
• /
• 1995

We describe the implementation of a multi-dimensional numerical code to solve the equations for idea! magnetohydrodynamics (MHD) in cylindrical geometry. It is based on an explicit finite difference scheme on an Eulerian grid, called the Total Variation Diminishing (TVD) scheme, which is a second-order-accurate extension of the Roe-type upwind scheme. Multiple spatial dimensions are treated through a Strang-type operator splitting. Curvature and source terms are included in a way to insure the formal accuracy of the code to be second order. The constraint of a divergence-free magnetic field is enforced exactly by adding a correction, which involves solving a Poisson equation. The Fourier Analysis and Cyclic Reduction (FACR) method is employed to solve it. Results from a set of tests show that the code handles flows in cylindrical geometry successfully and resolves strong shocks within two to four computational cells. The advantages and limitations of the code are discussed.

• Journal of Satellite, Information and Communications
• /
• v.5 no.1
• /
• pp.54-57
• /
• 2010

The navigation system like GPS which is core technology is based on Code Division Multiple Access(CDMA) techniques. To receive satellite signal smoothly in CDMA, received signals have to synchronize with spread code. In this paper, we focus on the code tracking methods among synchronization techniques. The conventional delay lock loop(DLL) is unsuitable for multi-path channel. We will introduce how it overcomes distortion by multi-path. We will propose method that separates out multi-path signals and tracks the each path signals. And we will confirm performance of proposed method using Spirent simulator.