• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.2
• /
• pp.1-7
• /
• 2016

Although the second driving device of KTX, which consists of the wheel and the axle reduction gears unit, is a mechanically integrated structure, its preventive maintenance (PM) requires two separate intervals due to the different technical requirements. In particular, these subsystems perform attaching and detaching work simultaneously according to the maintenance directive. Therefore, to reduce the unnecessary amount of PM and high logistic availability of the train, it is important to optimize PM with regard to reliability-centered maintenance toward a cost-effective solution. In this study, fault tree analysis and reliability of the subsystems, considering the criticality of the components, were performed using the data derived from field data in maintenance. The cost optimization of the PM was derived from a genetic algorithm considering the target reliability and improvement factor. The cost optimization was derived from a maximum of the fitness function of the individual in generation. The optimal TBO of them using the genetic algorithm was 2.85x106 km, which is reduced to approximately 21% compared to the conventional method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.9 no.6
• /
• pp.650-656
• /
• 1999

In this paper, we study on the convergence of the evolution strategies by introducing the Lamarckian evolution and the Baldwin effect, and propose a random local searching and a reinforcement local searching methods. In the random local searching method some neighbors generated randomly from each individual are med without any other information, but in the reinforcement local searching method the previous results of the local search are reflected on the current local search. From the viewpoint of the purpose of the local search it is suitable that we try all the neighbors of the best individual and then search the neighbors of the best one of them repeatedly. Since the reinforcement local searching method based on the Lamarckian evolution and Baldwin effect does not search neighbors randomly, but searches the neighbors in the direction of the better fitness, it has advantages of fast convergence and an improvement on the global searching capability. In other words the performance of the evolution strategies is improved by introducing the learning, reinforcement local search, into the evolution. We study on the learning effect on evolution strategies by applying the proposed method to various function optimization problems.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.13 no.3
• /
• pp.119-130
• /
• 2010

The Genetic Algorithm has been frequently applied by many researchers as one of the population surface modelling tool in estimating the regional population based on the gridded spatial system. Taking the East-Hwasung area as the case, this study first builds a gridded population data based on the KLIS and eAIS databases as well as municipal population survey data, and then constructs the attribute values of the explanatory variables by way of GIS tools. The GA model is run to maximize its fitness function measuring the correlation coefficient between the observed and predicted values of the 70 population cells. It is shown that the GA output predicted reasonably consistent and meaningful coefficient estimates for the explanatory variables of the model.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.35 no.9
• /
• pp.1039-1048
• /
• 2011

This research develops a basic design structure for scuba diving wetsuits suitable for the shape of Korean men in their 30's as well as enhances the reduction rate for underwater activity. The clothing pressure and fitness tests were performed using four different types of body suits. The usable data of the tests were coded for further statistical analysis that includes one way-ANOVA test and S-N-K Multiple Range Test by using SPSSWIN 17.0. An analysis of the results shows: (1) The results of the clothing pressure test (using a dummy) indicated that the larger the reduction rate, the stronger the clothing pressure gets (with an exception on the knee area). It has great impact on clothing pressure with regards to the different body parts. The different reduction rates should be applied to body parts accordingly. (2) In the case of test subjects, the overall mean values of the clothing pressure were lower than the ones with the dummy (attributable to the cushion function of body skin and muscle as well as the high stretch of the fabric). (3) In evaluating the subjective fit test of four types of body suits, a statistically significant difference was found in the relation between pattern reduction rates and all parts of the body. It was revealed that the reduction rate of 'B' pattern (X: 4%, Y: 3%) was the most suitable pattern and the 'B' pattern scored highest in the motion functional fit test performed by a test subject.

• Proceedings of the Korean Society for Applied Microbiology Conference
• /
• 2001.06a
• /
• pp.77-80
• /
• 2001

A variety of different methods to generate diverse proteins, including random mutagenesis and recombination, are currently available, and most of them accumulate the mutations on the target gene of a protein, whose sequence space remains unchanged. On the other hand, a pool of diverse genes, which is generated by random insertions, deletions, and exchange of the homologous domains with different lengths in the target gene, would present the protein lineages resulting in new fitness landscapes. Here we report a method to generate a pool of protein variants with different sequence spaces by employing green fluorescent protein (GFP) as a model protein. This process, designated functional salvage screen (FSS), comprises the following procedures： a defective GFP template expressing no fluorescence is firstly constructed by genetically disrupting a predetermined region(s) of the protein, and a library of GFP variants is generated from the defective template by incorporating the randomly fragmented genomic DNA from E. coli into the defined region(s) of the target gene, followed by screening of the functionally salvaged, fluorescence-emitting GFPs. Two approaches, sequence-directed and PCR-coupled methods, were attempted to generate the library of GFP variants with new sequences derived from the genomic segments of E. coli. The functionally salvaged GFPs were selected and analyzed in terms of the sequence space and functional property. The results demonstrate that the functional salvage process not only can be a simple and effective method to create protein lineages with new sequence spaces, but also can be useful in elucidating the involvement of a specific region(s) or domain(s) in the structure and function of protein.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2821-2839
• /
• 2015

Energy consumption by large computing systems has become an important research theme not only because the sources of energy are depleting fast but also due to the environmental concern. Computational grid is a huge distributed computing platform for the applications that require high end computing resources and consume enormous energy to facilitate execution of jobs. The organizations which are offering services for high end computation, are more cautious about energy consumption and taking utmost steps for saving energy. Therefore, this paper proposes a scheduling technique for Minimizing Energy consumption using Adapted Genetic Algorithm (MiE-AGA) for dependent tasks in Computational Grid (CG). In MiE-AGA, fitness function formulation for energy consumption has been mathematically formulated. An adapted genetic algorithm has been developed for minimizing energy consumption with appropriate modifications in each components of original genetic algorithm such as representation of chromosome, crossover, mutation and inversion operations. Pseudo code for MiE-AGA and its components has been developed with appropriate examples. MiE-AGA is simulated using Java based programs integrated with GridSim. Analysis of simulation results in terms of energy consumption, makespan and average utilization of resources clearly reveals that MiE-AGA effectively optimizes energy, makespan and average utilization of resources in CG. Comparative analysis of the optimization performance between MiE-AGA and the state-of-the-arts algorithms: EAMM, HEFT, Min-Min and Max-Min shows the effectiveness of the model.

• Journal of Internet Computing and Services
• /
• v.21 no.5
• /
• pp.129-137
• /
• 2020

Recently, software size and program code complexity have increased due to application to various fields of software. Accordingly, the existence of program bugs inevitably occurs, and the cost of software maintenance is increasing. In open source projects, developers spend a lot of debugging time when solving a bug report assigned. To solve this problem, in this paper, we apply SeqGAN algorithm to software bug repair. In detail, the SeqGAN model is trained based on the source code. Open similar source codes during the learning process are also used. To evaluate the suitability for the generated candidate patch, a fitness function is applied, and if all test cases are passed, software bug correction is considered successful. To evaluate the efficiency of the proposed model, it was compared with the baseline, and the proposed model showed better repair.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6C
• /
• pp.480-486
• /
• 2008

The high peak-to-average power ratio (PAPR) of the transmitted signals is one of major drawbacks of the orthogonal frequency division multiplexing (OFDM). A partial transmit sequences (PTS) technique can improve the PAPR statistics of OFDM signals. However, in a PTS technique, the search complexity to select phase weighting factors increases exponentially with the number of sub-blocks. In this paper, a PTS technique with low computational complexity is presented, which adopts micro-genetic algorithm(${\mu}$-GA) as a search algorithm. A search on the phase weighting factors starts with a population of five randomly generated individuals. An elite having the largest fitness value and the other four individuals selected through the tournament selection strategy are determined, and then the next generation members are generated through the crossover operations among those. If the new generation converges, all the four individuals except the elite are randomly generated again. The search terminates when there has been no improvements on the PAPR during the predefined number of generations, or the maximum number of generations has been reached. To evaluate the performance of the proposed PTS technique, the complementary cumulative distribution functions (CCDF) of the PAPR are compared with those of the conventional PTS techniques.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.375-381
• /
• 2005

Usually genetic algorithms are used to design optimal system. However the performance of the algorithm is determined by the fitness function and the system environment. It is expected that a co-evolutionary algorithm, two populations are constantly interact and co-evolve, is one of the solution to overcome these problems. In this paper we propose three types of co-evolutionary algorithm to solve GA-Hard problem. The first model is a competitive co-evolutionary algorithm that solution and environment are competitively co-evolve. This model can prevent the solution from falling in local optima because the environment are also evolve according to the evolution of the solution. The second algorithm is schema co-evolutionary algorithm that has host population and parasite (schema) population. Schema population supply good schema to host population in this algorithm. The third is game model-based co-evolutionary algorithm that two populations are co-evolve through game. Each algorithm is applied to visual servoing, robot navigation, and multi-objective optimization problem to verify the effectiveness of the proposed algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.4
• /
• pp.129-137
• /
• 2012

The queen-bee genetic algorithm that we made by mimicking of the reproduction of queen-bee has considerably improved the performances of genetic algorithm. However, since we used only one queen-bee in the queen-bee genetic algorithm, a problem that individuals of genetic algorithm were driven to one place where the queen-bee existed occurred. This made the performances of the queen-bee genetic algorithm degrade. In order to solve this problem, we introduce a multiple queen-bee evolution method by employing another queen-bee whose fitness is the most significantly increased than its parents as well as the original queen-bee that is the best individual in a generation. This multiple queen-bee evolution makes the probability of falling into local optimum areas decrease and allows the individuals to easily get out of the local optimum areas even if the individuals fall into a local optimum area. This results in increasing the performances of the genetic algorithm. Experimental results with four function optimization problems showed that the performances of the proposed method were better than those of the existing method in the most cases.