• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.161-164
• /
• 2000

Given the frame size and constituent encoders, interleaver plays a central role in a turbo code performance. Interleaver should be designed to generate a heavy weight codeword in the second encoder if the first encoder generates a low weight codeword. In this paper we present a search procedure for high performace interleaver whose performance is measured by computing union bound using the weight spectrum of all the weight 2, 3

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.391-391
• /
• 2004

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1083-1088
• /
• 2007

In this paper, We investigate the search patterns that are applied to the character based word search and make the search algorithm. We used to various hangout coded set that are KS X 1001 hangeul coded set and unicode 3.0 for the character based word search algorithm. In each case, We study of efficiency of algorithms that are related to hangeul coded set.

• Journal of Digital Contents Society
• /
• v.17 no.6
• /
• pp.461-469
• /
• 2016

A novel steganography based on ternary BCH code with t = 2 is presented in this paper. Proposed method utilizes powerful BCH code with t = 2 for data hiding to the DCT coefficients from JPEG images. The presented data hiding technique uses a proposed look up table approach for searching multiple solutions for ternary BCH code with t = 2. The proposed look up table approach enables fast and efficient search for locations of DCT coefficients, which are necessary to modify for hiding data. Presented data hiding technique is the first steganography technique based on ternary BCH code. Experimental results clearly indicate advantages of using ternary BCH compared to binary BCH.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.1
• /
• pp.7-12
• /
• 2008

A GNSS(Global Navigation Satellite System) using GPS provides us with very useful information concerning the positioning of users in many sectors such as transportation, social services, the justice system and customs services, public works, search and rescue systems and leisure. A GNSS using the Galileo satellite is due to work in 2008 and expected to be used in various fields such as aviation, marine transportation, land surveying, resources development precise agriculture, telemetics, and so on. In this paper, we discuss the implementation and testing of a combined GPS/Galileo receiver which we named KSTAR V1.0. Each tracking module of GPS/Galileo dual mode correlator has the five track arms which consist of Very Early code, Early code, Prompt code, late code, and Very late code. Each of 24 tracking modules can be assigned to GPS and/or Galileo signal by changing mode selection register. The basic correlator integration dump period is set to 1ms for GPS C/A code and fast Galileo signal tracking. The performance of the developed combined GPS/Galileo receiver was tested and evaluated using the IF (Intermediated Frequency)-level GPS/Galileo signal generator.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4560-4575
• /
• 2018

Since smartphone contains various personal data, security is one of the important aspects in smartphone technologies. Up to now, various authentication techniques have been proposed to protect smartphones. The pattern lock on the Android system is one of the most widely used authentication methods for low-cost devices but it is known to be vulnerable to smudge attack or shoulder surfing attack. LG's smartphone uses its own technique, which is called "Knock Code." The knock code completes the authentication by touching the user defined area in turn on the screen. In this paper, we propose the new, enhanced version of knock code by adding the sliding operation and by using flexible area recognition. We conducted security analysis, which shows that under the same password size, the search space is overwhelmingly larger than the original algorithm. Also, by using the sliding operation, the proposed scheme shows resilience against smudge attacks. We implemented the prototype of our scheme. Experimental results show that compared with the original Knock Code and Android pattern lock, our scheme is more convenient while providing better security.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1271-1277
• /
• 2008

This paper proposes the code acquisition scheme on a MIMO channel for preamble search in a CDMA-MIMO uplink system. The multiple transmit/receive antennas are used for beamforming. The performance of a ML code acquisition technique based on transmit and receive beamforming is analyzed by considering rho detection probability. The acquisition performance and MAT for a MIMO code acquisition system are numerically evaluated. It is shown that multiple transmit antennas can give the code acquisition system a transmit beamforming gain and result in much better performance than a SIMO case.

• 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.

• Magazine of the Korea Concrete Institute
• /
• v.9 no.1
• /
• pp.133-141
• /
• 1997

This work presents a method of optimum design for reinforced concrete building frames with rectangular cross sections. To overcome difficulties arising from the presence of two materials in one element(concrete and steel) , the principle of divided parameters is adopted. The design variable parameters are divided into two groups - external and internal. The optimization is also divided into external and internal procedure. Several scarxh algorithms are tested to verify their accuracy for the external optimization. This work proposes a new search method, a modified pattern search, and sample problems prove its accuracy and uscf'ulness. The design obtained by this method is an optimum and in full accord with ACI Building Code Ftequirements(ACI'318-89).

• The Journal of Korea Robotics Society
• /
• v.14 no.1
• /
• pp.40-49
• /
• 2019

Reinforcement learning has been applied to various problems in robotics. However, it was still hard to train complex robotic manipulation tasks since there is a few models which can be applicable to general tasks. Such general models require a lot of training episodes. In these reasons, deep neural networks which have shown to be good function approximators have not been actively used for robot manipulation task. Recently, some of these challenges are solved by a set of methods, such as Guided Policy Search, which guide or limit search directions while training of a deep neural network based policy model. These frameworks are already applied to a humanoid robot, PR2. However, in robotics, it is not trivial to adjust existing algorithms designed for one robot to another robot. In this paper, we present our implementation of Guided Policy Search to the robotic arms of the Baxter Research Robot. To meet the goals and needs of the project, we build on an existing implementation of Baxter Agent class for the Guided Policy Search algorithm code using the built-in Python interface. This work is expected to play an important role in popularizing robot manipulation reinforcement learning methods on cost-effective robot platforms.