• 제목/요약/키워드: Division Algorithm

검색결과 3,039건 처리시간 0.031초

Parameter optimization for SVM using dynamic encoding algorithm

  • Park, Young-Su;Lee, Young-Kow;Kim, Jong-Wook;Kim, Sang-Woo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • 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.

  • PDF

이산 경로 시스템에서 유전알고리듬을 이용한 최적음향탐색경로 전략 (Optimal Acoustic Search Path Planning Based on Genetic Algorithm in Discrete Path System)

  • 조정홍;김정해;김재수;임준석;김성일;김영선
    • 한국해양공학회지
    • /
    • 제20권1호
    • /
    • 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.

동력절환용 클러치의 기계식 잠금장치 체결 알고리즘에 대한 연구 (Study of Locking Algorithms for a On/Off Multi-plate Clutch)

  • 김수철;김재승;문상곤;이근호
    • 드라이브 ㆍ 컨트롤
    • /
    • 제21권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.

카테시안 곱의 역 맥락에서 분수의 나눗셈 (Division of Fractions in the Contexts of the Inverse of a Cartesian Product)

  • 임재훈
    • 대한수학교육학회지:학교수학
    • /
    • 제9권1호
    • /
    • pp.13-28
    • /
    • 2007
  • 학생들이 분수 나눗셈을 이해하기 어려워하는 이유 중 하나는 분수 나눗셈의 구체화가 어렵고 불충분하기 때문이다. 측정 맥락과 분할 맥락의 구체화에 비해 곱과 인수 맥락에서의 구체화는 상대적으로 부족한 실정이다. 이 연구에서는 카테시안 곱의 역 맥락에서 분수 나눗셈 알고리즘을 구체화하였다. 카테시안 곱의 역 맥락에서 이루어져 있는 기존의 분수 나눗셈 구체화의 한계를 논의하고, 세로의 길이를 고정하고 가로의 길이를 1 또는 자연수로 만드는 방법과 넓이가 1인 직사각형을 이용하는 방법으로 분수 나눗셈을 제시하였다. 이와 같은 방법은 제수의 역수의 의미, 제수를 1로 만드는 것의 중요성, 기존 학습 내용과의 연결성, 다양한 접근 가능성 면에서 장점이 있다. 이와 같은 장점을 살려 카테시안 곱의 역 맥락에서 분수 나눗셈 알고리즘을 도입하는 것을 고려할 수 있다.

  • PDF

계승적 나이개념을 가진 다목적 진화알고리즘 개발 (The Development of a New Distributed Multiobjective Evolutionary Algorithm with an Inherited Age Concept)

  • Kang, Young-Hoon;Zeungnam Bien
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
    • /
    • 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.

  • PDF

하이브리드 자동 동조 알고리즘을 이용한 하이브리드 퍼지 제어기 (The Hybrid Fuzzy Controller using the Hybrid Auto-tuning Algorithm)

  • 이대근;김중영;오성권
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 추계학술대회 논문집 학회본부 B
    • /
    • 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.

  • PDF

An Improved Artificial Bee Colony Algorithm Based on Special Division and Intellective Search

  • Huang, He;Zhu, Min;Wang, Jin
    • Journal of Information Processing Systems
    • /
    • 제15권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.

A Novel Driving Algorithm for Reducing Dynamic False Contour in PDPs

  • Yoon, Seok-Jeong;Choi, Sang-Yoon;Lee, Seung-Yong;Choi, Byong-Deok;Kwon, Oh-Kyong
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 한국정보디스플레이학회 2005년도 International Meeting on Information Displayvol.II
    • /
    • 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.

  • PDF

Packet Scheduling Algorithm Considering a Minimum Bit Rate for Non-realtime Traffic in an OFDMA/FDD-Based Mobile Internet Access System

  • Kim, Dong-Hoi;Ryu, Byung-Han;Kang, Chung-Gu
    • ETRI Journal
    • /
    • 제26권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.

  • PDF

RSD 수 표현 체계를 이용한 셀프 타임드 제산기의 구조 (A Self-Timed Divider Structure using RSD Number System)

  • 최기영;강준우
    • 전자공학회논문지B
    • /
    • 제31B권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.

  • PDF