• Proceedings of the Materials Research Society of Korea Conference
• /
• 2008.11a
• /
• pp.12.1-12.1
• /
• 2008

• Proceedings of the KOR-KST Conference
• /
• 2007.11a
• /
• pp.843-851
• /
• 2007

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.15-17
• /
• 2005

Recently genetic algorithm techniques have widely used in adaptive and control schemes for production systems. However, generally it costs a lot of time for learning in the case applied in control system. Furthermore, the physical meaning of genetic algorithm constructed as a result is not obvious. And this method has been used as a learning algorithm to estimate the parameter of a genetic algorithm used for identification of the process dynamics of nonlinear IIR filter and it was shown that this method offered superior capability over the genetic algorithm. A genetic algorithm is used to solve the parameter identification problem for linear and nonlinear digital filters. This paper goal estimate nonlinear IIR filter parameter using the genetic algorithm.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.502-504
• /
• 2005

Recently genetic algorithm techniques have widely used in adaptive and control schemes for production systems. However, generally it costs a lot of time for learning in the case applied in control system. Furthermore, the physical meaning of genetic algorithm constructed as a result is not obvious. And this method has been used as a learning algorithm to estimate the parameter of a genetic algorithm used for identification of the process dynamics of FIR filter and it was shown that this method offered superior capability over the genetic algorithm. A genetic algorithm is used to solve the parameter identification problem for linear and nonlinear digital filters. This paper goal estimate FIR filter parameter using the genetic algorithm.

• Journal of Multimedia Information System
• /
• v.4 no.3
• /
• pp.145-150
• /
• 2017

Recently, game companies are having difficulties in exactly figuring out the right consumer groups for their games. To solve this problem, a system algorithm which recommends user-customized games based on the user information entered has been proposed in this study. Game developers will be able to clearly determine the consumer group(s) of both on and off-line games through accumulated data while consumers can find the game they desire. It is expected that the gaming culture will advance further with the proposed algorithm.

• Proceedings of the KIEE Conference
• /
• 1988.11a
• /
• pp.229-232
• /
• 1988

Induced voltage causing disturbances on the communication lines of electric train is dealt with when the AT power supply system is employed. In the paper we obtain an algorithm to calculate the induced voltages on the communication lines in the AT system and an algorithm for the induced current in case of the accident that the line falls to the ground. These algorithms are developed to a package of computer programs and their validity was checked on a simulated system.

• Journal of the Korean Statistical Society
• /
• v.25 no.3
• /
• pp.359-368
• /
• 1996

The maximum likelihood estimation is discussed for the NLAR model with Laplacian marginals. Since the explicit form of the estimates cannot be obtained due to the complicated nature of the likelihood function we utilize the automatic computer optimization subroutine using a direct search complex algorithm. The conditional least square estimates are used as initial estimates in maximum likelihood procedures. The results of a simulation study for the maximum likelihood estimates of the NLAR(1) and the NLAR(2) models are presented.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.1079-1088
• /
• 2004

Generally, the code motion algorithm accomplishes the run-time optimal connected with the computational optimifation and the register overhead This paper proposes a sparse code motion, which considers the code size, in addition to computational optimization and lifetime optimization. The BCM algorithm carries out the optimal code motion computationally and the LCM algorithm reduces the register overhead in a sparse code motion algorithm. A sparse code motion algorithm is optimum algorithm computationally and lifetime because of suppression unnecessary code motion This algorithm improves runtime and efficiency of the program than the previous work through the performance test.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2513-2515
• /
• 2005

Recently genetic algorithm techniques have widely used in adaptive and control schemes for production systems. However, generally it costs a lot of time for leaming in the case applied in control system. Furthermore, the physical meaning of genetic algorithm constructed as a result is not obvious. And this method has been used as a learning algorithm to estimate the parameter of a genetic algorithm used for identification of the process dynamics of Butter-Worth analog filter and it was shown that this method offered superior capability over the genetic algorithm. A genetic algorithm is used to solve the parameter identification problem for linear and nonlinear digital filters. This paper goal estimate Butter-Worth analog filter parameter using the genetic algorithm.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.392-394
• /
• 2003

There is a well-known simple, stable standard merge algorithm, which uses only linear time but for the price of double space. This extra space consumption has been often remarked as lack of the standard merge sort algorithm that covers a merge process as central operation. In-place merging is a way to overcome this lack and so is a topic with a long tradition of inspection in the area of theoretical computer science. We present an in-place merging algorithm that rear-ranges the elements to be merged by rotation, a special form of block interchanging. Our algorithm is novel, due to its technique of determination of the rotation-areas. Further it has a short and transparent definition. We will give a presentation of our algorithm and prove that it needs in the worst case not more than twice as much comparisons as the standard merge algorithm. Experimental work has shown that our algorithm is efficient and so might be of high practical interest.