• Title/Summary/Keyword: Global Method

Search Result 5,415, Processing Time 0.069 seconds

Development of the Meta-heuristic Optimization Algorithm: Exponential Bandwidth Harmony Search with Centralized Global Search (새로운 메타 휴리스틱 최적화 알고리즘의 개발: Exponential Bandwidth Harmony Search with Centralized Global Search)

  • Kim, Young Nam;Lee, Eui Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.2
    • /
    • pp.8-18
    • /
    • 2020
  • An Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS) was developed to enhance the performance of a Harmony Search (HS). EBHS-CGS added two methods to improve the performance of HS. The first method is an improvement of bandwidth (bw) that enhances the local search. This method replaces the existing bw with an exponential bw and reduces the bw value as the iteration proceeds. This form of bw allows for an accurate local search, which enables the algorithm to obtain more accurate values. The second method is to reduce the search range for an efficient global search. This method reduces the search space by considering the best decision variable in Harmony Memory (HM). This process is carried out separately from the global search of the HS by the new parameter, Centralized Global Search Rate (CGSR). The reduced search space enables an effective global search, which improves the performance of the algorithm. The proposed algorithm was applied to a representative optimization problem (math and engineering), and the results of the application were compared with the HS and better Improved Harmony Search (IHS).

Improved Global-Soft Decision Incorporating Second-Order Conditional MAP for Speech Enhancement (음성향상을 위한 2차 조건 사후 최대 확률기법 기반 Global Soft Decision)

  • Kum, Jong-Mo;Chang, Joon-Hyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.6C
    • /
    • pp.588-592
    • /
    • 2009
  • In this paper, we propose a novel method to improve the performance of the global soft decision which is based on the second-order conditional maximum a posteriori (CMAP). Conventional global soft decision scheme has an disadvantage in that the speech absence probability adjusted by a fixed-parameter was sensitive to the various noise environments. In proposed approach using the second-order CMAP, speech absence probability value is more flexible which exploit not only the current observation but also the speech activity decisions in the previous two frames. Experimental results show that the proposed improved global soft decision method based on second-order conditional MAP yields better results compared to the conventional global soft decision technique with the performance criteria of the ITU-T P. 862 perceptual evaluation of speech quality (PESQ).

A Computer Aided Drawing Check System (Global Dimension Check) (컴퓨터 지원에 의한 설계도면 검증시스템)

  • ;Ono, T.;Tsujio, S.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • pp.1102-1107
    • /
    • 1992
  • Existing CAD systems do nto provide the advanced function for systematic checking of design and drafting errors in mechanical drawings. This paper describes a method for sytematic checking of global parts in mechanical drawings. The checking items are deficiency and redundancy of dimensions, input-errors in dimension figures and symbols, etc. Checking for deficiency and redundancy of global dimensions has been performed applying Graph Theory. This system has been applied to several examples and we have confirmed the feasibility of this checing method.

  • PDF

GLOBAL CONVERGENCE PROPERTIES OF THE MODIFIED BFGS METHOD ASSOCIATING WITH GENERAL LINE SEARCH MODEL

  • Liu, Jian-Guo;Guo, Qiang
    • Journal of applied mathematics & informatics
    • /
    • v.16 no.1_2
    • /
    • pp.195-205
    • /
    • 2004
  • To the unconstrained programme of non-convex function, this article give a modified BFGS algorithm. The idea of the algorithm is to modify the approximate Hessian matrix for obtaining the descent direction and guaranteeing the efficacious of the quasi-Newton iteration pattern. We prove the global convergence properties of the algorithm associating with the general form of line search, and prove the quadratic convergence rate of the algorithm under some conditions.

Global Bifurcations in the Asymmetric Vibrations of a Circular Plate (원판의 비대칭진동의 대역분기해석)

  • 여명환;이원경
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2003.11a
    • /
    • pp.504-514
    • /
    • 2003
  • We investigate global bifurcation in the subharmonic motion of a circular plate with one-to-one internal resonance. A system of autonomous equations are obtained from the partial differential equations governing the system by using Galerkin's procedure and the method of multiple scales. A perturbation method developed by Kovacic and Wiggins is used to find Silnikov type homoclinic orbits. The conditions under which the orbits occur are obtained.

  • PDF

GLOBAL CONVERGENCE PROPERTIES OF TWO MODIFIED BFGS-TYPE METHODS

  • Guo, Qiang;Liu, Jian-Guo
    • Journal of applied mathematics & informatics
    • /
    • v.23 no.1_2
    • /
    • pp.311-319
    • /
    • 2007
  • This article studies a modified BFGS algorithm for solving smooth unconstrained strongly convex minimization problem. The modified BFGS method is based on the new quasi-Newton equation $B_k+1{^s}_k=yk\;where\;y_k^*=yk+A_ks_k\;and\;A_k$ is a matrix. Wei, Li and Qi [WLQ] have proven that the average performance of two of those algorithms is better than that of the classical one. In this paper, we prove the global convergence of these algorithms associated to a general line search rule.

One Dimensional Optimization using Learning Network

  • Chung, Taishn;Bien, Zeungnam
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1995.10b
    • /
    • pp.33-39
    • /
    • 1995
  • One dimensional optimization problem is considered, we propose a method to find the global minimum of one-dimensional function with on gradient information but only the finite number of input-output samples. We construct a learning network which has a good learning capability and of which global maximum(or minimum) can be calculated with simple calculation. By teaching this network to approximate the given function with minimal samples, we can get the global minimum of the function. We verify this method using some typical esamples.

  • PDF

Global Bifurcations and Chaos in an Harmonically Excited and Undamped Circular Plate

  • Samoylenko, Sergey B.;Lee, Won-Kyoung
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2004.11a
    • /
    • pp.140-144
    • /
    • 2004
  • Global bifurcations and chaos in modal interactions of an imperfect circular plate with one-to-one internal resonance are investigated. The case of primary resonance, in which an excitation frequency is near natural frequencies, is considered. The damping force is not included in the analysis. The Melnikov's method for heteroclinic orbits of the autonomous system was used to obtain the criteria for chaotic motion.

  • PDF

GLOBAL ATTRACTOR FOR A SEMILINEAR STRONGLY DEGENERATE PARABOLIC EQUATION WITH EXPONENTIAL NONLINEARITY IN UNBOUNDED DOMAINS

  • Tu, Nguyen Xuan
    • Communications of the Korean Mathematical Society
    • /
    • v.37 no.2
    • /
    • pp.423-443
    • /
    • 2022
  • We study the existence and long-time behavior of weak solutions to a class of strongly degenerate semilinear parabolic equations with exponential nonlinearities on ℝN. To overcome some significant difficulty caused by the lack of compactness of the embeddings, the existence of a global attractor is proved by combining the tail estimates method and the asymptotic a priori estimate method.

Efficient Global Optimization of Periodic Plasmonic Nanoslit Array Based on Quality Factor Analysis

  • Jaehoon Jung
    • Current Optics and Photonics
    • /
    • v.7 no.3
    • /
    • pp.248-253
    • /
    • 2023
  • An efficient global optimization approach for a periodic plasmonic nanoslit array based on extraordinary optical transmission within an acceptable time range is proposed using 𝚀 factor analysis method. The particle swarm optimization is employed as a global optimization tool. The figure of merit is defined as a product of transmission peak value and 𝚀 factor. The design variables are the slit width, height, and period of the slit array, respectively. The optical properties such as transmission spectrum and bandwidth are calculated rigorously using the finite element method.