• The Journal of the Acoustical Society of Korea
• /
• v.19 no.1
• /
• pp.61-66
• /
• 2000

In this paper, we are proposing an efficient 3D source localization algorithm using 3 uniform linear subarrays. The proposed algorithm replaces 3D search required in conventional 3D MUSIC algorithm with 3 1D searches, and thus reduces computational burden. The estimate of the 1D conic angle obtained from a subarray under the far-field assumption satisfies a nonlinear algebraic equation of the true source bearing angle, elevation angle, and range. The proposed algorithm estimates source location by solving 3 algebraic equations obtained from 3 subarrays. Comparing 3D MUSIC spectrums of the estimated source locations, the proposed algorithm solves pairing problem for multiple sources localization.

• Journal of Korea Water Resources Association
• /
• v.33 no.S1
• /
• pp.3-10
• /
• 2000

A newly developed heuristic algorithm, Harmony Search, is applied to the parameter calibration problem of the nonlinear Muskingum model. The Harmony Search could, mimicking the improvisation of music player, find better parameter values for in the nonlinear Muskingum model than five other methods including another heuristic method, genetic algorithm, in the aspect of SSQ(the sum of the square of the deviations between the observed and routed outflows) as well as in the aspects of SAD(the sum of the absolute value of the deviations), DPO(deviations of peak of routed and actual flows) and DPOT(deviatios of peak time of routed and actual outflow). Harmony Search also has the advantage that it does not require the process of asuming the initial values of desing parameters. The sensitivity analysis of Harmony Memory Considering Rate showed that relatively large values of Harmony Memory Considering Rate makes the Harmony Search converge to a better solution.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2000.05a
• /
• pp.3-10
• /
• 2000

A newly developed heuristic algorithm, Harmony Search, is applied to the parameter calibration problem of the nonlinear Muskingum model. The Harmony Search could, mimicking the improvisation of music players, find better parameter values for in the nonlinear Muskingum model than five other methods including another heuristic method, genetic algorithm, in the aspect of SSQ (the sum of the square of the deviations between the observed and routed outflows) as well as in the aspects of SAD (the sum of the absolute value of the deviations), DPO (deviations of peak of routed and actual flows) and DPOT (deviations of peak time of rented and actual outflow). Harmony Search also has the advantage that it does not require the process of assuming the initial values of design parameters. The sensitivity analysis of Harmony Memory Considering Rate showed that relatively large values of Harmony Memory Considering Rate makes the Harmony Search converse to a better solution.

• Journal of the Korea Convergence Society
• /
• v.10 no.2
• /
• pp.13-20
• /
• 2019

For customized education, it is essential to search the learning path for the learner. The genetic algorithm makes it possible to find optimal solutions within a practical time when they are difficult to be obtained with deterministic approaches because of the problem's very large search space. In this research, based on genetic algorithm, the learning paths to learn 200 chords in 27 music sheets were optimized to maximize the learning effect by balancing and minimizing learner's burden and learning size for each step in the learning paths. Although the permutation size of the possible learning path for 27 learning contents is more than $10^{28}$, the optimal solution could be obtained within 20 minutes in average by an implemented tool in this research. Experimental results showed that genetic algorithm can be effectively used to design complex learning path for customized education with various purposes. The proposed method is expected to be applied in other educational domains as well.

• Nuclear Engineering and Technology
• /
• v.53 no.11
• /
• pp.3665-3674
• /
• 2021

One of the important parts of the in-core fuel management is loading pattern optimization (LPO). The loading pattern optimization as a reasonable design of the in-core fuel management can improve both economic and safe aspects of the nuclear reactor. This work proposes the hybrid of fuzzy logic controller with harmony search algorithm (HS) for loading pattern optimization in a pressurized water reactor. The music improvisation process to find a pleasing harmony is inspiring the harmony search algorithm. In this work, the adjustment of the harmony search algorithm parameters such as the bandwidth and the pitch adjustment rate are increasing performance of the proposed algorithm which is done through a fuzzy logic controller. Hence, membership functions and fuzzy rules are designed to improve the performance of the HS algorithm and achieve optimal results. The objective of the method is finding an optimum core arrangement according to safety and economic aspects such as reduction of power peaking factor (PPF) and increase of effective multiplication factor (Keff). The proposed approach effectiveness has been tried in two cases, Michalewicz's bivariate function problem and NEACRP LWR core. The results show that by using fuzzy harmony search algorithm the value of the fitness function is improved by 15.35%. Finally, with regard to the new solutions proposed in this research it could be used as a trustworthy method for other optimization issues of engineering field.

• Journal of Advanced Navigation Technology
• /
• v.25 no.5
• /
• pp.403-408
• /
• 2021

Harmony Search(HS) algorithm is an emerging meta-heuristic optimization algorithm, which is inspired by the music improvisation process and has been successfully applied to solve different optimization problems. In order to further improve the performance of HS, this paper proposes a new method which is called Fast Harmony Search(FSH) algorithm. For the purpose, this paper suggest a method to unify two independent improvisation processes by newly defining the boundary value of a object variable using HM. As the result, the process time of the algorithm is shorten and explicit decision of bandwidth is no more needed. Furthermore, exploitative power of random selection is improved. The numerical results reveal that the proposed algorithm can find better solutions and is faster when compared to the conventional HS.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.5
• /
• pp.299-307
• /
• 2022

Harmony Search (HS) is a relatively recently developed meta-heuristic optimization algorithm, and various studies have been conducted on it. HS is based on the musician's improvisational performance, and the objective variables play the role of the instrument. However, each instrument is given only a sound range, and there is no concept of a scale that can be said to be the basis of music. In this study, the performance of the algorithm is improved by introducing a scale to the existing HS and quantizing the bandwidth. The introduced scale was applied to HM initialization instead of the existing method that was randomly initialized in the sound band. The quantization step can be set arbitrarily, and through this, a relatively large bandwidth is used at the beginning of the algorithm to improve the exploration of the algorithm, and a small bandwidth is used to improve the exploitation in the second half. Through the introduction of scale and bandwidth quantization, it was possible to reduce the algorithm performance deviation due to the initial value and improve the algorithm convergence speed and success rate compared to the existing HS. The results of this study were confirmed by comparing examples of optimization values for various functions with the conventional method. Specific comparative values were described in the simulation.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.725-732
• /
• 2009

Thanks to the development of the Internet, people can easily access a vast amount of music. This brings attention to application systems such as a melody-based music search service or music recommendation service. Extracting melodies from music is a crucial process to provide such services. This paper introduces a novel algorithm that can extract melodies from piano music. Since piano can produce polyphonic music, we expect that by studying melody extraction from piano music, we can help extract melodies from general polyphonic music.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.3
• /
• pp.214-220
• /
• 2004

A computationally efficient algorithm is presented for 3-D near-field source localization using a uniform circular away (UCA). Algebraic relations are demonstrated between the incident angles (elevation angle and azimuth angle) under the far-field assumption and the actual near-field location (range. elevation angle, and azimuth angle). Using these relations as paths to follow to the peak of the 3-D MUSIC spectrum, the proposed algorithm replaces the 3-D search required in the conventional 3-D MUSIC with a 1-D path following after a 2-D initialization. thereby reducing the computational burden.

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.5
• /
• pp.195-200
• /
• 2021

Due to the development of video sharing platforms, the amount of video uploads is exploding. Such videos often include various types of music, among which cover songs are included. In order to protect the copyright of music, an algorithm to find the original song of the cover song is essential. However, it is not easy to find the original song because the cover song is a modification of the composition, speed and overall structure of the original song. So far, there is no known effective algorithm for searching the original song of the cover song. In this paper, we propose an algorithm for searching the original song of the cover song using the inflection points of the melody line. Inflection points represent the characteristic points of change in the melody sequence. The proposed algorithm compares the original song and the cover song using the sequence of inflection points for the representative phrase of the original song. Since the characteristics of the representative phrase are used, even if the cover song is a song made by modifying the overall composition of the song, the algorithm's search performance is excellent. Also, since the proposed algorithm uses only the features of the inflection point sequence, the memory usage is very low. The efficiency of the algorithm was verified through performance evaluation.