• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.269-271
• /
• 2005

EMV was formed in February 1999 by Europay International, MasterCard International and Visa International to manage, maintain and enhance the EMV Integrated Circuit Card Specifications for Payment Systems as technology advances and the implementation of chip card programs become more prevalent. The formation of EMV ensures that single terminal and card approval processes are developed at a level that will allow cross payment system interoperability through compliance with the EMV specifications. A credit card environment of the domestic market adopted the standard Local-EMV to have the compatibility with EMV international standard and the EMV migration have been carried out b,# the step-by-step process. It may be possible to adopt various kinds of cryptographic algorithms, however, RSA public key algorithm is currently used. In this paper, as a public key algorithm for the authentication process, Elliptic Curve Cryptographic algorithm is applied to the EMV process. Implementation results is shown. and the possible changes necessary to accommodate Elliptic Curve Cryrtography is proposed.

• Journal of information and communication convergence engineering
• /
• v.8 no.3
• /
• pp.312-316
• /
• 2010

Conformal mapping has been a familiar tool of science and engineering for generations. The methods of numerical mapping are usually classified into those which construct the map from standard domain such as the unit disk onto the 'problem domain', and those which construct the map in the reverse direction. We treat numerical conformal mapping from the unit disk onto the Jordan regions as the problem domain in this paper. The traditional standard methods of this type are based on Theodorsen integral equation. Wegmann's method is well known as a Newton-like efficient one for solving Theodorsen equation. An improved method for convergence by applying low frequency pass filter to the Wegmann's method was proposed. In this paper we propose an effective algorithm for numerical conformal mapping based on the improved method. This algorithm is able to determine the discrete numbers and initial values automatically in accordance with the given region and the required accuracy. This results come from analyzing the shape of given domain as seen in the Fourier Transform.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.6
• /
• pp.1074-1079
• /
• 1987

We present a fast, constructive algorithm for the automatic placement of standard cells, which consists of two steps. The first step is responsible for cell-row assignment of each cell, and converts the circuit connectivity into a multi-stage graph under to constraint that sum of the cell-widths in each stage of the multi-state graph does not exceed maximum cell-row width. Generatin of feed-through cells in the final layout was shown to be drastically reduced by this step. In the second step, the position of each cell within the row is determined one by one from left to right so that the cost function such as the local channel density is minimized. Our experimental result shows that this algorithm yields near optimal results in terms of the number of feed-through cells and the horizontal tracks, while running about 100 times faster than other iterative procedures such as pairwise interchange and generalized force directed relaxation method.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.2
• /
• pp.97-102
• /
• 2015

In this paper, an extension of the standard common spatial pattern (CSP) algorithm using the strong uncorrelated transform (SUT) is used in order to extract the features for an accurate classification of the left- and right-hand motor imagery tasks. The algorithm is designed to analyze the complex data, which can preserve the additional information of the relationship between the two electroencephalogram (EEG) data from distant channels. This is based on the fact that distant regions of the brain are spatially distributed spatially and related, as in a network. The real-world left- and right-hand motor imagery EEG data was acquired through the Physionet database and the support vector machine (SVM) was used as a classifier to test the proposed method. The results showed that extracting the features of the pair-wise channel data using the strong uncorrelated transform complex common spatial pattern (SUTCCSP) provides a higher classification rate compared to the standard CSP algorithm.

• Smart Structures and Systems
• /
• v.21 no.3
• /
• pp.263-278
• /
• 2018

Thermal Exchange Optimization (TEO) is a newly developed algorithm which mimics the thermal exchange between a solid object and its surrounding fluid. In this paper, an improved version of the TEO is developed to fix the shortcomings of the standard version. To demonstrate the viability of the new algorithm, the CEC 2016's single objective problems are considered along with the discrete size optimization of benchmark skeletal structures. Problem specific constraints are handled using a fly-back mechanism. The results show the validity of the improved TEO method compared to its standard version and a number of well-known algorithms.

• Proceedings of the KSPS conference
• /
• 2003.05a
• /
• pp.79-82
• /
• 2003

In this paper, we proposed Backgorund Model Set algorithm for the speaker verification to improve the shortcoming of calculating process in conventional confidence measure(CM). CM is to display relative likelihood between recognized models and unrecognized models. Unrecognized models is known as antiphone models. Calculate probability and standard deviation using all phonemes at process that compose antiphone model. At this process, antiphone CM brought bad result. Also, recognition time increases. In order problem, we studied about method to reconstitute average and standard deviation taking BMS algorithm using antiphoneme that near phoneme of CM calculation.

• Journal of Information Processing Systems
• /
• v.10 no.2
• /
• pp.256-270
• /
• 2014

A new morphed steganographic algorithm is proposed in this paper. Image security is a challenging problem these days. Steganography is a method of hiding secret data in cover media. The Least Significant Bit is a standard Steganographic method that has some limitations. The limitations are less capacity to hide data, poor stego image quality, and imperceptibility. The proposed algorithm focuses on these limitations. The morphing concept is being used for image steganography to overcome these limitations. The PSNR and standard deviation are considered as a measure to improve stego image quality and morphed image selection, respectively. The stego keys are generated during the morphed steganographic embedding and extracting process. Stego keys are used to embed and extract the secret image. The experimental results, which are based on hiding capacity and PSNR, are presented in this paper. Our research contributes towards creating an improved steganographic method using image morphing. The experimental result indicates that the proposed algorithm achieves an increase in hiding capacity, stego image quality, and imperceptibility. The experimental results were compared with state of the art steganographic methods.

• Journal of Information Processing Systems
• /
• v.15 no.3
• /
• pp.492-499
• /
• 2019

HEVC is the high efficiency video coding standard, which provides better coding efficiency contrasted with the other video coding standard. But at the same time the computational complexity increases drastically. Thirty-five kinds of intra-prediction modes are defined in HEVC, while 9 kinds of intra prediction modes are defined in H.264/AVC. This paper proposes a fast rough mode decision (RMD) algorithm which adopts the smoothness of the up-reference pixels and the left-reference pixels to decrease the computational complexity. The three step search method is implemented in RMD process. The experimental results compared with HM13.0 indicate that the proposed algorithm can save 39.7% of the encoding time, while Bjontegaard delta bitrate (BDBR) is increased slightly by 1.35% and Bjontegaard delta peak signal-to-noise ratio (BDPSNR) loss is negligible.

• Journal of Information Processing Systems
• /
• v.14 no.5
• /
• pp.1237-1253
• /
• 2018

Harmony search algorithm is an emerging meta-heuristic optimization algorithm, which is inspired by the music improvisation process and can solve different optimization problems. In order to further improve the performance of the algorithm, this paper proposes an improved harmony search algorithm. Key parameters including harmonic memory consideration (HMCR), pitch adjustment rate (PAR), and bandwidth (BW) are optimized as the number of iterations increases. Meanwhile, referring to the genetic algorithm, an improved method to generate a new crossover solutions rather than the traditional mechanism of improvisation. Four complex function optimization and pressure vessel optimization problems were simulated using the optimization algorithm of standard harmony search algorithm, improved harmony search algorithm and exploratory harmony search algorithm. The simulation results show that the algorithm improves the ability to find global search and evolutionary speed. Optimization effect simulation results are satisfactory.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.56-58
• /
• 2004

In this paper, we propose an adaptive beamforming algorithm for array antenna. The proposed beamforming algorithm is based on EDS (Euclidean Direction Search) algorithm. Generally LMS algorithm has a much slower rate of convergence, but its low computational complexity and robustness make it a representative method of adaptive beamforming. Although the RLS algorithm is known for its fast convergence to the optimal Wiener solution, it still suffers from high computational complexity and poor performance. The proposed EDS algorithm has a rapid convergence better than LMS algorithm, and has a computational more simple complexity than RLS algorithm. In this paper we compared the efficiency of the EDS algorithm with a standard LMS algorithm.