• Title/Summary/Keyword: 유전과 진화

Search Result 341, Processing Time 0.022 seconds

Evolutionary Genetic Models of Mental Disorders (정신장애의 진화유전학적 모델)

  • Park, Hanson
    • Korean Journal of Biological Psychiatry
    • /
    • v.26 no.2
    • /
    • pp.33-38
    • /
    • 2019
  • Psychiatric disorder as dysfunctional behavioural syndrome is a paradoxical phenomenon that is difficult to explain evolutionarily because moderate prevalence rate, high heritability and relatively low fitness are shown. Several evolutionary genetic models have been proposed to address this paradox. In this paper, I explain each model by dividing it into selective neutrality, mutation-selection balance, and balancing selection hypothesis, and discuss the advantages and disadvantages of them. In addition, the feasibility of niche specialization and frequency dependent selection as the plausible explanation about the central paradox is briefly discussed.

Fuzzy Controller Design of 2 D.O.F of Wheeled Mobile Robot using Niche Meta Genetic Algorithm (Niche Meta 유전 알고리즘을 이용한 2자유도 이동 로봇의 퍼지 제어기 설계)

  • Kim Sung-Hoe;Kim Ki-Yeoul
    • 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

  • PDF

The System Shape and Size Discrete Optimum Design of Space Trusses using Genetic Algorithms (Genetic Algorithms에 의한 입체트러스의 시스템 형상 및 단면 이산화 최적설계)

  • Park, Choon Wook;Kim, Myung Sun;Kang, Moon Myung
    • Journal of Korean Society of Steel Construction
    • /
    • v.13 no.5
    • /
    • pp.577-586
    • /
    • 2001
  • The objective of this study is the development of sizing and system shape discrete optime design algorithm which is based on the genetic algorithms (GAs). The algorithm can perform both size and shape optimum designs of space trusses. The developed algorithm was implemented in a computer program. The algorithm is known to be very efficient for the discrete optimization The genetic process selects the next design points based on the survivability of the current design points The evolutionary process evaluates the survivability of the design points selected from the genetic process in the genetic process of the simple genetic algorithms there are three basic operators : reproduction cross-over and mutation operators. The efficiency and validity of the developed discrete optimum design algorithm was verified by applying the algorithm to optimum design examples.

  • PDF

Origin and evolution of Korean ginseng revealed by genome sequence

  • Cho, Woohyeon;Shim, Hyeonah;Yang, Tae-Jin
    • Journal of Ginseng Culture
    • /
    • v.3
    • /
    • pp.1-10
    • /
    • 2021
  • Panax ginseng (Ginseng or Korean ginseng) is one of the most important medicinal herbs in the world. We made a high-quality whole genome sequence of P. ginseng using 'Chunpoong' cultivar, which is the first cultivar registered in Korea Seed and Variety Service (KSVS) with relatively similar genotypes and superior phenotypes, representing approximately 3 Gbp and 60,000 genes. Genome sequence analyses of P. ginseng and related speciesrevealed the origin of Korean ginseng and the ecological adaptation of 18 Panax species around the world. Korean ginseng and American ginseng (P. quinquefolius) are tetraploid species having 24 chromosome pairs, while the other 16 species are diploid species with 12 chromosome pairs. Panax and Aralia are the closest genera belonging to the Araliaceae family that diverged approximately 8 million years ago (MYA). All Panax species evolved as shade plants adapting to cool climates and low light conditions under the canopy of deep forests from Southeast Asia such as Vietnam to Northeast Asia such as Russia approximately 6 MYA. However, through recurrent ice ages and global warming, most diploid Panax species disappeared due to the freezing winter, while tetraploid P. ginseng may have appeared by allotetraploidization, which contributed to the adaptation to cold temperaturesin Northeast Asian countries including the Korea peninsula approximately 2 MYA. American ginseng evolved by the adaptation of P. ginseng in Northeast America after the intercontinental migration 1 MYA. Meanwhile, most of diploid Panax species survived in high-altitude mountains over 1,600 meters in Southeast Asia because they could not endure the hot temperature and freezing cold. The genome sequence provides good basisto unveil the origin and evolution of ginseng and also supports practical gene chips which is useful for breeding and the ginseng industry.

Behavior Learning and Evolution of Individual Robot for Cooperative Behavior of Swarm Robot System (군집 로봇의 협조 행동을 위한 로봇 개체의 행동학습과 진화)

  • Sim, Kwee-Bo;Lee, Dong-Wook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.2
    • /
    • pp.131-137
    • /
    • 2006
  • In swarm robot systems, each robot must behaves by itself according to the its states and environments, and if necessary, must cooperates with other robots in order to carry out a given task. Therefore it is essential that each robot has both learning and evolution ability to adapt the dynamic environments. In this paper, the new learning and evolution method based on reinforcement learning having delayed reward ability and distributed genetic algorithms is proposed for behavior learning and evolution of collective autonomous mobile robots. Reinforcement learning having delayed reward is still useful even though when there is no immediate reward. And by distributed genetic algorithm exchanging the chromosome acquired under different environments by communication each robot can improve its behavior ability. Specially, in order to improve the performance of evolution, selective crossover using the characteristic of reinforcement learning is adopted in this paper. we verify the effectiveness of the proposed method by applying it to cooperative search problem.

Reinforcement Learning Based Evolution and Learning Algorithm for Cooperative Behavior of Swarm Robot System (군집 로봇의 협조 행동을 위한 강화 학습 기반의 진화 및 학습 알고리즘)

  • Seo, Sang-Wook;Kim, Ho-Duck;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.5
    • /
    • pp.591-597
    • /
    • 2007
  • In swarm robot systems, each robot must behaves by itself according to the its states and environments, and if necessary, must cooperates with other robots in order to carry out a given task. Therefore it is essential that each robot has both learning and evolution ability to adapt the dynamic environments. In this paper, the new polygon based Q-learning algorithm and distributed genetic algorithms are proposed for behavior learning and evolution of collective autonomous mobile robots. And by distributed genetic algorithm exchanging the chromosome acquired under different environments by communication each robot can improve its behavior ability Specially, in order to improve the performance of evolution, selective crossover using the characteristic of reinforcement learning is adopted in this paper. we verify the effectiveness of the proposed method by applying it to cooperative search problem.

Evolution of Plant RNA Viruses and Mechanisms in Overcoming Plant Resistance (식물 RNA 바이러스의 진화와 병저항성 극복 기작)

  • Kim, Myung-Hwi;Kwon, Sun-Jung;Seo, Jang-Kyun
    • Research in Plant Disease
    • /
    • v.27 no.4
    • /
    • pp.137-148
    • /
    • 2021
  • Plant RNA viruses are one of the most destructive pathogens that cause a significant loss in crop production worldwide. They have evolved with high genetic diversity and adaptability due to the short replication cycle and high mutation rate during genome replication, which are characteristics of RNA viruses. Plant RNA viruses exist as quasispecies with high genetic diversity; thereby, a rapid population transition with new fitness can occur due to selective pressure resulting from environmental changes. Plant resistance can act as selective pressure and affect the fitness of the virus, which may lead to the emergence of resistance-breaking variants. In this paper, we introduced the evolutionary perspectives of plant RNA viruses and the driving forces in their evolution. Based on this, we discussed the mechanism of the emergence of variant viruses that overcome plant resistance. In addition, strategies for deploying plant resistance to viral diseases and improving resistance durability were discussed.

Oligonucleotide Probe Selection using Evolutionary Computation in Large Target Genes (다수의 목표 유전자에서 진화연산을 이용한 Oligonucleotide Probe 선택)

  • Shin, Ki-Roo;Kim, Sun;Zhang, Byung-Tak
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04c
    • /
    • pp.455-457
    • /
    • 2003
  • DNA microarray는 분자생물학에서 널리 사용되고 있는 실험 도구로써 크게 cDNA와 oligonucleotide microarray로 나뉘어진다. DNA microarray는 일련의 DNA 서열로 이루어진 probe들의 집합으로 구성되며 알려지지 않은 서열과의 hybridization 과정을 통해 특정 서열을 인식할 수 있게 된다. O1igonucieotide microarray는 cDNA 방법과는 다르게 probe를 구성하는 서열을 제작자가 임의로 구성할 수 있기 때문에 목표 서열이 가지는 고유한 부분만을 probe 서열로 사용함으로써 비용절감과 실험의 정확도를 높일 수 있다는 장점이 있다. 그러나 현재 목표 유전자 서열에 대해 probe 집합을 생성하는 결정적인 방법은 존재하지 않으며, 따라서 넓은 해 공간에서 효과적으로 최적 해를 찾아 주는 진화 연산이 probe 선택을 위한 좋은 대안으로 사용될 수 있다[1.2]. 그러나 진화연산을 이용한 probe 선택방법에 있어서 인식하고자 하는 목표 서열의 개수가 많아질 경우, 해 공간의 크기가 커짐으로 인해 문제점이 발생할 수 있다. 따라서 본 논문에서는 다수의 목표 유전자 서열을 대상으로 한 probe 선택 방법에 일어서 보다 효율적인 진화연산 접근 방법을 소개한다. 제시된 방법은 인식하고자 하는 목표 서얼의 일부를 선택해 이를 probe 집합의 후보로 사용하며. 유전 연산자를 이용한 진화과정을 통해 최적에 가까운 probe 집합을 찾는다. 본 논문은 GenBank로부터 유전자 서열을 대상으로 제안된 방법을 실험하였으며, 축소된 목표 서열만을 이용해 probe 집합을 선택하더라도 적합한 probe 집합을 찾을 수 있었다.

  • PDF

A Study On The Parameter Selection of ($1+{\lambda}$) Evolution Strategy (($1+{\lambda}$)진화 전략 알고리즘의 파라미터 선정에 대한 연구)

  • Park, Sang-Hun;An, Kwang-Ok;Cho, Sung-Mun;Cho, Dong-Hyeok;Jung, Hyun-Kyo
    • Proceedings of the KIEE Conference
    • /
    • 2001.04a
    • /
    • pp.75-77
    • /
    • 2001
  • 전기기기 최적 설계에 있어서 결정론적 최적화 방법은 국부해를 빠른 속도로 찾을 수 있지만 최적값에 대한 보장이 어려우므로 비결정론적 방법인 진화전략 알고리즘을 많이 사용한다. 전기기기 최적화에 쓰이는 많은 확률적 알고리즘 중에서 진화 전략 알고리즘은 시뮬레이티드 어닐링과 유전 알고리즘을 결합한 방법으로, 전체 최적점 탐색이 가능할 뿐만 아니라 알고리즘이 비교적 간단하면서도 빠른 수렴 특성을 갖고 있다. 그리고, 종류 또한 다양하다. 진화 전략 알고리즘 중에서 중요한 것은 수렴속도와 성공률에 기여하는 파라미터들을 잘 선정하는 것이다. 본 논문에서는, 진화 전략 알고리즘의 중요한 인자인 자식 세대의 개수인 ${\lambda}$값과 ${\alpha}$값을 변화시켜 가면서 변수 개수에 따른 최적화된 조합을 제시한다. 본 논문의 결과는 전기기기 최적 설계에 응용하는데 도움이 될 것으로 사료된다.

  • PDF