• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.12
• /
• pp.2364-2375
• /
• 1994

For the efficient recognition of printed Korean characters, a multiplexed minimum average correlation energy(MMACE) filter is proposed. Proposed method solved the disadvantages of the tree structure algorithm which recognition system is very huge and recognition method is sophisticated. Using only one consonant MMACE filter and one vowel one, we recognized the full Korean character. Each MMACE filter is multiplexed by 4 K-tuple MACE filters which are synthesized by 24 consonants and vowels. Hence the proposed MMACE filter and the correlation distribution plane are divided by 4 subregion. We obtained the binary codes for the Korean character recognition from each correlation distribution subplane. And the obtained codes are compared with the truth table for consonants and vowels in computer. We can recognize the full Korean characters when substitute the corresponded consonant or vowel font of the consistent code to the correlation peak place in the output correlation plane. The computer simulation and optical experiment results show that the proposed compact Korean character recognition system using the MMACE filters has high discrimination capability.

• The KIPS Transactions:PartA
• /
• v.19A no.4
• /
• pp.187-194
• /
• 2012

This paper proposes a string analysis based system for classifying Android Apps that may access so called harmful sites, and shows an experiment result for real Android apps on the market. The system first transforms Android App binary codes into Java byte codes, it performs string analysis to compute a set of strings at all program points, and it classifies the Android App as bad ones if the computed set contains URLs that are classified because the sites provide inappropriate contents. In the proposed approach, the system performs such a classification in the stage of distribution before installing and executing the Apps. Furthermore, the system is suitable for the automatic management of Android Apps in the market. The proposed system can be combined with the existing methods using DNS servers or monitoring modules to identify harmful Android apps better in different stages.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.5
• /
• pp.869-879
• /
• 2022

Through this study, we discovered that among three types of compressed data blocks generated through the Deflate algorithm, No-Payload Non-Compressed Block type (NPNCB) which has no literal data can be randomly generated and inserted between normal compressed blocks. In the header of the non-compressed block, there is a data area that exists only for byte alignment, and we called this area as DBA (Disposed Bit Area), where an attacker can hide various malicious codes and data. Finally we found the vulnerability that hides malicious codes or arbitrary data through inserting NPNCBs with infected DBA between normal compressed blocks according to a pre-designed attack scenario. Experiments show that even though contaminated NPNCB blocks were inserted between normal compressed blocks, commercial programs decoded normally contaminated zip file without any warning, and malicious code could be executed by the malicious decoder.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.1
• /
• pp.1-9
• /
• 2013

This paper proposes a matching algorithm to find corresponding polygon feature sets between heterogeneous digital maps. The algorithm finds corresponding sets in terms of optimizing their shape similarities based on the assumption that the feature sets describing the same entities in the real world are represented in similar shapes. Then, by using a binary code, it is represented that a polygon feature is chosen for constituting a corresponding set or not. These codes are combined into a binary string as a candidate solution of the matching problem. Starting from initial candidate solutions, a genetic algorithm iteratively optimizes the candidate solutions until it meets a termination condition. Finally, it presents the solution with the highest similarity. The proposed method is applied for the topographical and cadastral maps of an urban region in Suwon, Korea to find corresponding polygon feature sets for block areas, and the results show its feasibility. The results were assessed with manual detection results, and showed overall accuracy of 0.946.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.3
• /
• pp.134-142
• /
• 2002

Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The window operation is one of important geometry operations in image processing, which extracts a sub-image indicated by a window in the image. In this paper, we present an algorithm to perform the window operation of binary images represented by quadtrees, using three-dimensional $n{\times}n{\times}n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of $n{\times}n{\times}n$ RMESH.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.741-743
• /
• 2017

The visible light communication is a communication method of outputting binary data based on the illumination threshold value at the light receiving diode of the receiving unit, when the LED of the transmitting unit transmits light. However, separate receiver is necessary to receive the optical signal, there is a problem that a device not equipped with such a receiver can not utilize visible light communication. To solve this problem, this paper proposes a portable visible light receiver applicable to devices using USB OTG. Implemented portable visible light receiver converts the binary data received from the LED into a character string of ASCII code and transmits it to another device. Through data transmission experiments using smart phone confirmed that it is possible to transmit ASCII codes in the proposed method.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.10 no.7
• /
• pp.1085-1094
• /
• 1999

In the global system for the mobile communication (GSM) system, the class of training sequences used in a TDMA frame is a preamble sequence with a period of 16 bits for the channel impulse response measurement and the start up equalization during the training period. If the transmitted preamble sequence and the binary sequence in the receiver properly satisfy a condition, this training sequences used for fastly adjusting the tap coefficients and impulse response can be measured by calculating the crosscorrelation function. In this paper, it is used that training sequences have zero values of the autocorrelation at all delays except zero and middle shifts. A comparison of convergence rate, a mathematical approach for fast start-up equalization and correctly channel impulse response measurement are proposed.

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

With the growth of the IoT market, malware security threats are steadily increasing for devices that use the linux architecture. However, except for the major malware causing serious security damage such as Mirai, there is no related technology or research of security community about linux malware. In addition, the diversity of devices, vendors, and architectures in the IoT environment is further intensifying, and the difficulty in handling linux malware is also increasing. Therefore, in this paper, we propose an analysis system based on ELF which is the main format of linux architecture, and a binary based analysis system considering IoT environment. The ELF-based analysis system can be pre-classified for a large number of malicious codes at a relatively high speed and a relatively low-speed binary-based analysis system can classify all the data that are not preprocessed. These two processes are supposed to complement each other and effectively classify linux-based malware.

• Journal of the Korean Society of Combustion
• /
• v.18 no.2
• /
• pp.32-41
• /
• 2013

This study presents both experimental and numerical investigation of ignition delay time of n-heptane and n-butanol binary fuel. The $O_2$ concentration in the mixture was set to 9-10% to make high exhaust gas recirculation( EGR) rate condition which leads low NOx and soot emission. Experiments were performed using a rapid compression machine(RCM) at compressed pressure 20bar, several compressed temperature and three equivalence ratios(0.4, 1.0, 1.5). In addition, a numerical study on the ignition delay time was performed using CHEMKIN codes to validate experimental results and predict chemical species in the combustion process. The results showed that the ignition delay time increased with increasing the n-butanol fraction due to a decrease of oxidation of n-heptane at the low temperature. Moreover, all of the binary fuel mixtures showed the combustion characteristics of n-heptane such as cool flame mode at low temperature and negative-temperature-coefficient(NTC) behavior. Due to the effect of high EGR rate condition, the operating region is reduced at lean condition and the ignition delay time sharply increased compared with no EGR condition.

• The KIPS Transactions:PartA
• /
• v.10A no.3
• /
• pp.207-214
• /
• 2003

Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The linear translation is one of important operations in image processing, which moves the image by a given distance. In this paper, we present an algorithm to perform the linear translation of binary images represented by quadtrees, using three-dimensional $n{\times}n{\times}n$ processors on RMESH (Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of n${\times}$n${\times}$n RMESH.