• Journal of Information Processing Systems
• /
• v.14 no.5
• /
• pp.1237-1253
• /
• 2018

Harmony search algorithm is an emerging meta-heuristic optimization algorithm, which is inspired by the music improvisation process and can solve different optimization problems. In order to further improve the performance of the algorithm, this paper proposes an improved harmony search algorithm. Key parameters including harmonic memory consideration (HMCR), pitch adjustment rate (PAR), and bandwidth (BW) are optimized as the number of iterations increases. Meanwhile, referring to the genetic algorithm, an improved method to generate a new crossover solutions rather than the traditional mechanism of improvisation. Four complex function optimization and pressure vessel optimization problems were simulated using the optimization algorithm of standard harmony search algorithm, improved harmony search algorithm and exploratory harmony search algorithm. The simulation results show that the algorithm improves the ability to find global search and evolutionary speed. Optimization effect simulation results are satisfactory.

• Genomics & Informatics
• /
• v.6 no.3
• /
• pp.130-135
• /
• 2008

The haplotypes of a 200 kb region in the human chromosome X terminal band (q28) were analyzed using the International HapMap Project Phasell data, which had been collected for three analysis panels (YRI, CEU, and CHB＋JPT). When multiple linkage disequilibrium blocks were encountered for a panel, the neighboring haplotypes that had crossover rate of 5% or more in the panel were combined to generate 'haploid' configurations. This resulted in 8, 7, and 5 'haploid' configurations for the panels of YRI, CEU, and CHB＋JPT, respectively. The multiple sequence alignment of these 'haploids' was used for the calculation of allele-sharing distances and the subsequent principal coordinate analysis. Two 'haploids' in CEU and CHB＋JPT were hypothesized as 'parental' in light of the observations that the successive recombinants of these haploids can model two other haploids in CEU and CHB＋JPT, and that their configurations were consistent with those in YRI. This study demonstrates the utility of haplotype phylogeny in understanding population evolution.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.420-426
• /
• 1998

Evolutionary algorithms are probabilistic optimization algorithms based on the model of natural evolution. Recently the efforts to improve the performance of evolutionary algorithms have been made extensively. In this paper, we introduce the research for improving the convergence rate and search faculty of evolution algorithms by using reinforcement learning. After providing an introduction to evolution algorithms and reinforcement learning, we present adaptive genetic algorithms, reinforcement genetic programming, and reinforcement evolution strategies which are combined with reinforcement learning. Adaptive genetic algorithms generate mutation probabilities of each locus by interacting with the environment according to reinforcement learning. Reinforcement genetic programming executes crossover and mutation operations based on reinforcement and inhibition mechanism of reinforcement learning. Reinforcement evolution strategies use the variances of fitness occurred by mutation to make the reinforcement signals which estimate and control the step length.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.10a
• /
• pp.113-116
• /
• 2000

The purpose of this study is to present a method for determining the k most vital arcs in shortest path problem using an evolutionary algorithm. The problem of finding the k most vital arcs in shortest path problem is to find a set of k arcs whose simultaneous removal from the network causes the greatest increase in the total length of shortest path. The problem determining the k most vital arcs in shortest path problem has known as NP-hard. Therefore, in order to deal with the problem of real world the heuristic algorithm is needed. In this study we propose to the method of finding the k-MVA in shortest path problem using an evolutionary algorithm which known as the most efficient algorithm among heuristics. For this, the expression method of individuals compatible with the characteristics of shortest path problem, the parameter values of constitution gene, size of the initial population, crossover rate and mutation rate etc. are specified and then the effective genetic algorithm will be proposed. The method presented in this study is developed using the library of the evolutionary algorithm framework (EAF) and then the performance of algorithm is analyzed through the computer experiment.

• 한국신재생에너지학회:학술대회논문집
• /
• 2009.06a
• /
• pp.656-659
• /
• 2009

직접메탄올형 연료전지(Direct Methanol Fuel Cell)는 휴대용으로 사용할 수 있는 소형 전원용으로 주로 개발되고 있으며, 다양한 용도로 사용이 가능하다. 하지만 직접메탄올연료전지에서 전해질로 많이 쓰이는 Nafion막은 이를 통한 메탄올 크로스오버(Crossover) 때문에 연료전지의 성능을 제한시키고 있다. 본 연구에서는 Nafion 117를 사용하여 전극 면적 100cm2 의 DFMC용 MEA를 제작하고, 공기 유량을 3ml/mim으로 고정하고, 메탄올 유량을 2,3 ml/min로 각각 공기극와 연료극에 공급하여 온도변화(50, 60, 70, $80^{\circ}C$)에 따른 성능을 확인하였다. DMFC의 적당 반응 온도는 $70^{\circ}C$로 생각되고, 유량은 메탄올 2ml/min, 공기 3ml/min유량 공급시가 성능이 높게 나오는 결과를 얻으나 일정시간 지나면 성능이 메탄올 3ml/min, 공기 3ml/min유량 공급시 보다 성능이 떨어지는 현상이 일어나기 때문에 $70^{\circ}C$ 반응온도에 메탄올 3ml/min, 공기 3ml/min의 유량 공급이 본 논문에서 최적화된 성능을 내는 조건으로 사료된다.

• Journal of Oriental Neuropsychiatry
• /
• v.20 no.4
• /
• pp.137-148
• /
• 2009

Objectives : The purpose of this study is to review the recent trends in the clinical trial studies that have been published since 2004. Methods : We reviewed the Medline & Pubmedcentral databases by using searching word of "acupuncture". Then 20 articles were selected within total 803 articles. In oriental medicine journals in Korea, we investigated 6 journals represented Korean Oriental medicine and chose 13 articles. Results & Conclusions : 1. We found 33 articles in journals. 2. The patterns of study were as follows: Randomized Controlled Trials(18), Single case series clinical study(9), Case-Control clinical study(4), Randomized crossover Trial(1) and Prospective Clinical analysis(1). 3. The fields of study were as follows: Combined anxiety, depression & other psychiatic symptoms(18), Stress & heart rate variablity(5), The single study of anxiety(5), The single study of depression(3), Stress & pupil variablity(1), Stress and heart rate & pupil variablity(1). 4. The methods of acupuncture were as follows: Acupuncture on points of 14 meridians(24), Auricular acupuncture(3), Electro acupuncture(2) and Both Auricular & Electro acupuncture(1). 5. Stomach meridian(足陽明胃經) and ST36(足三里) were used mostly.

• Journal of Chest Surgery
• /
• v.26 no.12
• /
• pp.920-925
• /
• 1993

Extra-anatomic bypass was proposed by Freeman in 1952 and has been used for patient with lower extremity arterial occlusion who had very high operative risk, especially elderly or severly illed patient.We had performed 14 cases of extra-anatomic bypasses from Jan. 1991 till July 1993 and having been following up them. Their results were summarized as follow. Among total 14 patients, 13 was male. Their mean age was 64.8 years old, ranged from 48 to 80. The most common complaint was pain on lower limb and they visited hospital 6.1 months in average after onset of symptom. Frequently, they were associated with systemic diseases such as generalized atherosclersis, hypertension, diabetes mellius, etc. Axillary artery was used as donor artery in 8 cases and crossover femoro-femoral or femoro-popliteal bypass was performed in 6 cases. Postoperative complications were notedd in 8 cases so their morbidity rate was 42.8%. Except for two contraindicated cases, one or more anticoagulants were used routinely . Among them, combined use of aspirin and persantine was most commonly applied.After bypass graft, nine cases were occluded beteween 10 and 53 months. So their average duration of freedom from reocclusion was 35.7 months and 3-year patency rate was 63%.

• Korean Journal of Remote Sensing
• /
• v.34 no.1
• /
• pp.151-166
• /
• 2018

This paper compares the four selections of performance used in the application of genetic algorithms (GAs) to automatically optimize multispectral pixel cluster for unsupervised classification from KOMPSAT-3 data, since the selection among three main types of operators including crossover and mutation is the driving force to determine the overall operations in the clustering GAs. Experimental results demonstrate that the tournament selection obtains a better performance than the other selections, especially for both the number of generation and the convergence rate. However, it is computationally more expensive than the elitism selection with the slowest convergence rate in the comparison, which has less probability of getting optimum cluster centers than the other selections. Both the ranked-based selection and the proportional roulette wheel selection show similar performance in the average Euclidean distance using the pixel clustering, even the ranked-based is computationally much more expensive than the proportional roulette. With respect to finding global optimum, the tournament selection has higher potential to reach the global optimum prior to the ranked-based selection which spends a lot of computational time in fitness smoothing. The tournament selection-based clustering GA is used to successfully classify the KOMPSAT-3 multispectral data achieving the sufficient the matic accuracy assessment (namely, the achieved Kappa coefficient value of 0.923).

• The Journal of Information Technology
• /
• v.5 no.4
• /
• pp.73-79
• /
• 2002

In this paper, I will propose the Niche-Meta Genetic Algorithm that has a multi-mutation operator for design of fuzzy controller. The gene in the proposed algorithm is formed by several parameters that represent the crossover rate, mutation rate and input-output membership functions. The optimization of fuzzy membership function is performed with local search on sub-population and the optimal structure is constructed with global search on total-population. The multi-mutation is selected under basis of the result of local evolution. A simulation for 2 D.O.F wheeled-mobile robot is showed to prove the efficiency of the proposed algorithm

• Journal of Pharmaceutical Investigation
• /
• v.10 no.1
• /
• pp.4-12
• /
• 1980

The studies of the compounding analgestic antipyretics were examined by the converted Koster's method (mice) and the converted Mac Donald's method (mice) induced on the three assumption crossover test. And the following results were found. 1. The same effect of the writhing inhibition in this compounding antipyretic dosage by it's oral administration is as follows. Aminopyrine 100mg/kg. (standard), aminopyrine 50mg/kg compounding with chlorpheniramine maleate 2mg/kg., compounding with diphenhydramine hydrochloride 8mg/kg., compounding with atropine sulfate 0.2mg/kg., or compounding with scopolamine hydrobromide 0.2mg/kg. And aspirin80mg/kg., Salicylamide 90mg/kg., sulpyrine 60mg/kg., or phenacetin 70mg/kg. compounding with the same dosage of the adjutants above. 2. The elevation-rate of the reaction threshold in this compounding antipyretic dosage by it's oral administration calculate as follows. When the elevation-rate (ER) of aminopyrine (100mg./kg.) is 1.00 (Standard), ER of aminopyrine (50mg./kg.) compounding with chlorpheniramine maleate (2mg./kg.) calculated 1.42, aspirin (80.mg./kg.) compounding with diphenhydramine hydrochloride (80mg./kg.) calculated 1.18, salicylamide (90mg./kg.) compounding with chlorpheniramine maleate (2mg./kg.) calculated 1.15, sulpyrine (60mg./kg.) compounding with chlorpheniramine maleate(2mg./kg.) calculated 1.28, and ER phenacetin (70mg./kg.) compounding with chlorpheniramine maleate (2mg./kg.) calculated 1.19.