• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2542-2547
• /
• 2005

In this paper, we propose a support vector machine (SVM) hyper and kernel parameter optimization method which is based on minimizing radius/margin bound which is a kind of estimation of leave-one-error. This method uses dynamic encoding algorithm for search (DEAS) and gradient information for better optimization performance. DEAS is a recently proposed optimization algorithm which is based on variable length binary encoding method. This method has less computation time than genetic algorithm (GA) based and grid search based methods and better performance on finding global optimal value than gradient based methods. It is very efficient in practical applications. Hand-written letter data of MNI steel are used to evaluate the performance.

• Journal of Ocean Engineering and Technology
• /
• v.20 no.1 s.68
• /
• pp.69-76
• /
• 2006

The design of efficient search path to maximize the Cumulative Detection Probability(CDP) is mainly dependent on experience and intuition when searcher detect the target using SONAR in the ocean. Recently with the advance of modeling and simulation method, it has been possible to access the optimization problems more systematically. In this paper, a method for the optimal search path calculation is developed based on the combination of the genetic algorithm and the calculation algorithm for detection range. We consider the discrete system for search path, space, and time, and use the movement direction of the SONAR for the gene of the genetic algorithm. The developed algorithm, OASPP(Optimal Acoustic Search Path Planning), is shown to be effective, via a simulation, finding the optimal search path for the case when the intuitive solution exists. Also, OASPP is compared with other algorithms for the measure of efficiency to maximize CDP.

• Journal of Drive and Control
• /
• v.21 no.1
• /
• pp.1-7
• /
• 2024

The locking performance of a multi-plate clutch with a mechanical lock-up system is governed by the engagement algorithm. In this paper, a control algorithm to improve the locking performance of the clutch was studied. A 1D dynamic model was constructed and simulated according to the developed algorithm. The developed algorithm was composed of a method in which the locking device is engaged while generating artificial slip on the friction plate by controlling the piston pressure of the clutch. Furthermore, a case study of the parameters within the developed algorithm was conducted to explore combinations that maximize locking performance and analyze trends according to these parameters.

• School Mathematics
• /
• v.9 no.1
• /
• pp.13-28
• /
• 2007

Division of fractions can be categorized as measurement division, partitive or sharing division, the inverse of multiplication, and the inverse of Cartesian product. Division algorithm for fractions has been interpreted with manipulative aids or models mainly in the contexts of measurement division and partitive division. On the contrary, there are few interpretations for the context of the inverse of a Cartesian product. In this paper the significance and the limits of existing interpretations of division of fractions in the context of the inverse of a Cartesian product were discussed. And some new easier interpretations of division algorithm in the context of a Cartesian product are developed. The problem to determine the length of a rectangle where the area and the width of it are known can be solved by various approaches: making the width of a rectangle be equal to one, making the width of a rectangle be equal to some natural number, making the area of a rectangle be equal to 1. These approaches may help students to understand the meaning of division of fractions and the meaning of the inverse of the divisor. These approaches make the inverse of a Cartesian product have many merits as an introductory context of division algorithm for fractions.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.229-232
• /
• 2001

Recently, several promising multiobjective evolutionary algorithms, e,g, SPEA, NSGA-ll, PESA, and SPEA2, have been developed. In this paper, we also propose a new multiobjective evolutionary algorithm that compares to them. In the algorithm proposed in this paper, we introduce a novel concept, "inherited age" and total algorithm is executed based on the inherited age concept. Also, we propose a new sharing algorithm, called objective classication sharing algorithm(OCSA) that can preserve the diversity of the population. We will show the superior performance of the proposed algorithm by comparing the proposed algorithm with other promising algorithms for the test functions.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.521-523
• /
• 1999

In this paper, we propose the hybrid fuzzy controller(HFC) and the hybrid auto-tuning algorithm. The proposed HFC combined a PID controller with a fuzzy controller concurrently produces the better output performance such as sensitivity improvement in steady state and robustness in transient state than any other controller. In addition, a hybrid auto-tuning algorithm which consists of genetic algorithm and complex algorithm to automatically generate weighting factor, scaling factors and PID control gains optimizes the output of HFC. As an typical example of non-linear system in control theory an inverted pendulum will be controlled by the suggested HFC and illustrated the performance and applicability of this proposed method by simulation.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.433-439
• /
• 2019

Artificial bee colony algorithm is a strong global search algorithm which exhibits excellent exploration ability. The conventional ABC algorithm adopts employed bees, onlooker bees and scouts to cooperate with each other. However, its one dimension and greedy search strategy causes slow convergence speed. To enhance its performance, in this paper, we abandon the greedy selection method and propose an artificial bee colony algorithm with special division and intellective search (ABCIS). For the purpose of higher food source research efficiency, different search strategies are adopted with different employed bees and onlooker bees. Experimental results on a series of benchmarks algorithms demonstrate its effectiveness.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2005.07b
• /
• pp.1269-1272
• /
• 2005

We propose a simple and efficient driving algorithm to reduce Dynamic False Contour(DFC) in Plasma Display Panels(PDPs) by using both accumulation and combination of light emission periods. Although the accumulative way of light emission in sustain period is regarded as more effective than combinational way to reduce DFC, it takes much addressing time to express high gray-scale. Therefore, we combine accumulative and combinational light emission methods to reduce DFC. In the proposed method, one TV field (16.7ms) is composed of four combinational subfields for expressing small gray scales and fifteen accumulative subfields for large gray scales. In addition, we use some Graphic Signal Processing(GSP) algorithm to get more natural images by reducing DFC.

• ETRI Journal
• /
• v.26 no.1
• /
• pp.48-52
• /
• 2004

In this letter, we consider a new packet scheduling algorithm for an orthogonal frequency division multiplexing access/frequency division duplex (OFDMA/FDD)-based system, e.g., mobile broadband wireless access or high-speed portable internet systems, in which the radio resources of both time and frequency slots are dynamically shared by all users under a proper scheduling policy. Our design objective is to increase the number of non-realtime service (e.g., WWW) users that can be supported in the system, especially when the minimum bit rate requirement is imposed on them. The simulation results show that our proposed algorithm can provide a significant improvement in the average outage probability performance for the NRT service, i.e., significantly increasing the number of NRT users without much compromising of the cell throughput.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.5
• /
• pp.81-87
• /
• 1994

This paper proposes a divider structure that combines a carry-propagation-free division algorithm using RSD number system and a self-timed ring structure. The self-timed ring structure enables the divider to compute at a speed comparable to that of combinational array dividers with less silicon area. By exploiting the carry-propagation-free division algorithm, we can achieve further reduction of silicon area and computation time. The algorithm and structure of the proposed divider have been successfully verified through VHDL modeling and simulation. Preliminary experimental results show the effectiveness of the algorithm and structure.