• Journal of Ginseng Research
• /
• v.35 no.3
• /
• pp.368-374
• /
• 2011

American ginseng (Panax quinquefolius L.) is grown in some regions of the USA and Canada and marketed for its health promoting attributes. While cultivation of this plant species has taken place in North America for over 100 years, there are many challenges that need to be addressed. In this article, the current production method used by growers is described and the challenges and opportunities for research on this valuable plant are discussed. These include studies on pharmacological activity, genetic diversity within the species, genetic improvement of currently grown plants, molecular characterization of gene expression, and management of diseases affecting plant productivity. The current research developments in these areas are reviewed and areas requiring further work are summarized. Additional research should shed light on the nature of the bioactive compounds and their clinical effects, and the molecular basis of active ingredient biosynthesis, and provide more uniform genetic material as well as improved plant growth, and potentially reduce losses due to pathogens.

• Journal of Advanced Navigation Technology
• /
• v.12 no.5
• /
• pp.412-419
• /
• 2008

Genetic algorithms are efficient techniques for searching optimum solution but have the premature convergence problem getting stuck in the local optimum according to the evolutionary operator. In this paper we analyzed the reason for converging to the local optimum and proposed the method which able transit to the global optimum from the local optimum. In these methods we used the variable evolutionary operator with the average hamming distance, to maintain the genetic diversity of the population for getting out of the local optimum. The theoretical results are proved by the simulation experiments.

• Structural Engineering and Mechanics
• /
• v.23 no.4
• /
• pp.325-337
• /
• 2006

A hybrid structural design and optimization methodology that combines the strengths of genetic algorithms, local search techniques, and parallel computing is developed to evolve optimal truss systems in this research effort. The primary objective that is met in evolving near-optimal or optimal structural systems using this approach is the capability of satisfying user-defined design criteria while minimizing the computational time required. The application of genetic algorithms to the design and optimization of truss systems supports conceptual design by facilitating the exploration of new design alternatives. In addition, final shape optimization of the evolved designs is supported through the refinement of member sizes using local search techniques for further improvement. The use of the hybrid approach, therefore, enhances the overall process of structural design. Parallel computing is implemented to reduce the total computation time required to obtain near-optimal designs. The support of human-computer interaction during layout optimization and local optimization is also discussed since it assists in evolving optimal truss systems that better satisfy a user's design requirements and design preferences.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.4
• /
• pp.265-276
• /
• 2004

Genetic Algorithm(GA), that is shown stable performance to find an optimal solution, has been used as a method of solving large-scaled optimization problems with complex constraints in various applications. Since it takes so much time to execute a long computation process for iterative evolution and adaptation. In this paper, a hardware-based adaptive GA was proposed to reduce the serious computation time of the evolutionary process and to improve the accuracy of convergence to optimal solution. The proposed GA, based on steady-state model among continuos generation model, performs an adaptive mutation process with consideration of the evolution flow and the population diversity. The drawback of the GA, premature convergence, was solved by the proposed adaptation. The Performance improvement of convergence accuracy for some kinds of problem and condition reached to 5-100% with equivalent convergence speed to high-speed algorithm. The proposed adaptive GAP(Genetic Algorithm Processor) was implemented on FPGA device Xilinx XCV2000E of EHW board for face recognition.

• Molecules and Cells
• /
• v.40 no.11
• /
• pp.814-822
• /
• 2017

Meiotic homologous recombination generates new combinations of preexisting genetic variation and is a crucial process in plant breeding. Within the last decade, our understanding of plant meiotic recombination and genome diversity has advanced considerably. Innovation in DNA sequencing technology has led to the exploration of high-resolution genetic and epigenetic information in plant genomes, which has helped to accelerate plant breeding practices via high-throughput genotyping, and linkage and association mapping. In addition, great advances toward understanding the genetic and epigenetic control mechanisms of meiotic recombination have enabled the expansion of breeding programs and the unlocking of genetic diversity that can be used for crop improvement. This review highlights the recent literature on plant meiotic recombination and discusses the translation of this knowledge to the manipulation of meiotic recombination frequency and location with regards to crop plant breeding.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.8
• /
• pp.63-67
• /
• 2000

This paper deals with text-prompt speaker recognition based on dynamic time warping (DTW). The Genetic Algorithm was applied to the creation of reference patterns for suitable reflection of the speaker characteristics, one of the most important determinants in the fields of speaker recognition. In order to overcome the weakness of text-dependent and text-independent speaker recognition, the text-prompt type was suggested. Performed speaker identification and verification in close and open set respectively, hence the Genetic algorithm-based reference patterns had been proven to have better performance in both recognition rate and speed than that of conventional reference patterns.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.59
• /
• pp.11-20
• /
• 2000

The Job Shop Scheduling Problem(JSSP) is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to develop an efficient scheduling method based on single genetic algorithm(SGA) and parallel genetic algorithm (PGA) to address JSSP. In this scheduling method, new genetic operator, generating method of initial population are developed and island model PGA are proposed. The scheduling method based on PGA are tested on standard benchmark JSSP. The results were compared with SGA and another GA-based scheduling method. The PGA search the better solution or improves average of solution in benchmark JSSP. Compared to traditional GA, the proposed approach yields significant improvement at a solution.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.252-254
• /
• 2006

The recent improvement in the performance of digital processor, the application of control technology, which used in the HVDC(High Voltage Direct Current) system with the digital processors, has increased. Having this research development as the basis, this paper presents an achievement of progression by tuning the parameter of PI controller based on Genetic Algorithms(GAs) and by controlling with PI controller with a developed simulator by applying the Matrix operating function, voltage source switching element, modified nodal analysis which can include transformer and the backward Euler which does not create the problem of numerical oscillation. As a result, I expect this development in the simulator HVDC System to bring more application in the field of control technology research with an expanded practicality.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.6
• /
• pp.573-579
• /
• 2008

This paper introduces a new approach to develop a fast gait for quadruped robot using GP(genetic programming). Planning gaits for legged robots is a challenging task that requires optimizing parameters in a highly irregular and multidimensional space. Several recent approaches have focused on using GA(genetic algorithm) to generate gait automatically and shown significant improvement over previous results. Most of current GA based approaches used pre-selected parameters, but it is difficult to select the appropriate parameters for the optimization of gait. To overcome these problems, we proposed an efficient approach which optimizes joint angle trajectories using genetic programming. Our GP based method has obtained much better results than GA based approaches for experiments of Sony AIBO ERS-7 in Webots environment.

• 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.