• 제목/요약/키워드: parallel evolution

검색결과 140건 처리시간 0.023초

The Role of a Floral Identity Gene LFY in Plant Morphological Evolution

  • Park, Young-Doo;Yoon, Ho-Sung
    • 식물분류학회지
    • /
    • 제37권4호
    • /
    • pp.323-333
    • /
    • 2007
  • The degree to which parallel evolution utilizes the same genetic mechanisms indicates the degree to which developmental processes constrain or channel phenotypic evolution. A transgenetic strategy was used to elucidate the role of one floral meristem identity gene, LEAFY (LFY), in the evolution of rosette flowering, a plant architecture that has evolved in parallel in several lineages of the mustard family, Brassicaceae. The LFY genes from three rosette flowering species were cloned and introduced into a species with the ancestral architecture, and results indicated that changes at the LFY locus contributed to the evolution of rosette flowering in two of the three lineages, but that in each lineage a different set of genetic partners was involved. Also, LFY was shown to play a role in the evolution of flower size. Transgenetic strategy may be useful in the study of plant morphological evolution and parallelism.

Cooperative Coevolution Differential Evolution Based on Spark for Large-Scale Optimization Problems

  • Tan, Xujie;Lee, Hyun-Ae;Shin, Seong-Yoon
    • Journal of information and communication convergence engineering
    • /
    • 제19권3호
    • /
    • pp.155-160
    • /
    • 2021
  • Differential evolution is an efficient algorithm for solving continuous optimization problems. However, its performance deteriorates rapidly, and the runtime increases exponentially when differential evolution is applied for solving large-scale optimization problems. Hence, a novel cooperative coevolution differential evolution based on Spark (known as SparkDECC) is proposed. The divide-and-conquer strategy is used in SparkDECC. First, the large-scale problem is decomposed into several low-dimensional subproblems using the random grouping strategy. Subsequently, each subproblem can be addressed in a parallel manner by exploiting the parallel computation capability of the resilient distributed datasets model in Spark. Finally, the optimal solution of the entire problem is obtained using the cooperation mechanism. The experimental results on 13 high-benchmark functions show that the new algorithm performs well in terms of speedup and scalability. The effectiveness and applicability of the proposed algorithm are verified.

PESA: Prioritized experience replay for parallel hybrid evolutionary and swarm algorithms - Application to nuclear fuel

  • Radaideh, Majdi I.;Shirvan, Koroush
    • Nuclear Engineering and Technology
    • /
    • 제54권10호
    • /
    • pp.3864-3877
    • /
    • 2022
  • We propose a new approach called PESA (Prioritized replay Evolutionary and Swarm Algorithms) combining prioritized replay of reinforcement learning with hybrid evolutionary algorithms. PESA hybridizes different evolutionary and swarm algorithms such as particle swarm optimization, evolution strategies, simulated annealing, and differential evolution, with a modular approach to account for other algorithms. PESA hybridizes three algorithms by storing their solutions in a shared replay memory, then applying prioritized replay to redistribute data between the integral algorithms in frequent form based on their fitness and priority values, which significantly enhances sample diversity and algorithm exploration. Additionally, greedy replay is used implicitly to improve PESA exploitation close to the end of evolution. PESA features in balancing exploration and exploitation during search and the parallel computing result in an agnostic excellent performance over a wide range of experiments and problems presented in this work. PESA also shows very good scalability with number of processors in solving an expensive problem of optimizing nuclear fuel in nuclear power plants. PESA's competitive performance and modularity over all experiments allow it to join the family of evolutionary algorithms as a new hybrid algorithm; unleashing the power of parallel computing for expensive optimization.

병렬 적응 진화알고리즘을 이용한 발전기 기동정지계획에 관한 연구 (A Parallel Adaptive Evolutionary Algorithm for Thermal Unit Commitment)

  • 김형수;조덕환;문경준;이화석;박준호;황기현
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제55권9호
    • /
    • pp.365-375
    • /
    • 2006
  • This paper is presented by the application of parallel adaptive evolutionary algorithm(PAEA) to search an optimal solution of a thermal unit commitment problem. The adaptive evolutionary algorithm(AEA) takes the merits of both a genetic algorithm(GA) and an evolution strategy(ES) in an adaptive manner to use the global search capability of GA and the local search capability of ES. To reduce the execution time of AEA, the developed algorithm is implemented on an parallel computer which is composed of 16 processors. To handle the constraints efficiently and to apply to Parallel adaptive evolutionary algorithm(PAEA), the states of thermal unit are represented by means of real-valued strings that display continuous terms of on/off state of generating units and are involved in their minimum up and down time constraints. And the violation of other constraints are handled by repairing operator. The procedure is applied to the $10{\sim}100$ thermal unit systems, and the results show capabilities of the PAEA.

Design and Implementation of a Latency Efficient Encoder for LTE Systems

  • Hwang, Soo-Yun;Kim, Dae-Ho;Jhang, Kyoung-Son
    • ETRI Journal
    • /
    • 제32권4호
    • /
    • pp.493-502
    • /
    • 2010
  • The operation time of an encoder is one of the critical implementation issues for satisfying the timing requirements of Long Term Evolution (LTE) systems because the encoder is based on binary operations. In this paper, we propose a design and implementation of a latency efficient encoder for LTE systems. By virtue of 8-bit parallel processing of the cyclic redundancy checking attachment, code block (CB) segmentation, and a parallel processor, we are able to construct engines for turbo codings and rate matchings of each CB in a parallel fashion. Experimental results illustrate that although the total area and clock period of the proposed scheme are 19% and 6% larger than those of a conventional method based on a serial scheme, respectively, our parallel structure decreases the latency by about 32% to 65% compared with a serial structure. In particular, our approach is more latency efficient when the encoder processes a number of CBs. In addition, we apply the proposed scheme to a real system based on LTE, so that the timing requirement for ACK/NACK transmission is met by employing the encoder based on the parallel structure.

Evo-Devo of Leaf Shape Control with a Special Emphasis on Unifacial Leaves in Monocots

  • Yamaguchi, Takahiro;Tsukaya, Hirokazu
    • 식물분류학회지
    • /
    • 제37권4호
    • /
    • pp.351-361
    • /
    • 2007
  • In angiosperms, leaves typically develop as three-dimensional structure with dorsoventral, longitudinal, and lateral axes. We have shown that the control of two axes of leaves, longitudinal and lateral axis, can be genetically separable, and four classes of genes are responsible for the polar cell expansion and polar cell proliferation in Arabidopsis. In monocots, unifacial leaf, in which leaf surface consists only of abaxial identity, has been evolved in a number of divergent species. The unifacial leaves provide very unique opportunities for the developmental studies of the leaf axes formation in monocots, because their leaf polarities are highly disorganized. In addition, the mechanism of the parallel evolution of such drastic changes in leaf polarities is of interest from an evolutionary viewpoint. In this article, we describe our recent approaches to reveal the mechanism of unifacial leaf development and evolution, including recent advances in the leaf polarity specification in angiosperms.

병렬 모집단 진화프로그램을 이용한 강의시간표 작성에 관한 연구 (A Study on the Timetable Using Parallel Population Evolution Programs)

  • 박유석;김병재
    • 산업경영시스템학회지
    • /
    • 제22권52호
    • /
    • pp.275-284
    • /
    • 1999
  • The TTP(TimeTabling Problem) for a university which should be made every term is very difficult problem to schedule because each component must satisfy all fixed constraints. This TTP, therefore, is solved by several heuristic methods. In this paper, applying PPEP(Parallel Population Evolution Programs) for the TTP, we try to find the approximated optimal solution by maintaining independence of each subpopulation and by searching the wide feasible solution. In addition, we present the problem to be appeared when used PMX(Partially mapped crossover)operator for the long chromosomes and then propose GBX (Gene_Based crossover)operator which can complement it. Finally, experimental results are presented comparing EP(Evolution Programs) and PPEP, then GBX which has the random genes and the selected genes on a real TTP.

  • PDF

Development of a flux emergence simulation using parallel computing

  • 이환희;마가라 테츠야
    • 천문학회보
    • /
    • 제44권2호
    • /
    • pp.71.1-71.1
    • /
    • 2019
  • The solar magnetic field comes from the solar interior and is related to various phenomena on the Sun. To understand this process, many studies have been conducted to produce its evolution using a single flux rope. In this study, we are interested in the emergence of two flux ropes and their evolution, which takes longer than the emergence of a single flux rope. To construct it, we develop a flux emergence simulation by applying a parallel computing to reduce a computation time in a wider domain. The original simulation code had been written in Fortran 77. We modify it to a version of Fortran 90 with Message Passing Interface (MPI). The results of the original and new simulation are compared on the NEC SX-Aurora TSUBASA which is a vector engine processor. The parallelized version is faster than running on a single core and it shows a possibility to handle large amounts of calculation. Based on this model, we can construct a complex flux emergence system, such as an evolution of two magnetic flux ropes.

  • PDF

용접공정 유한요소 해석의 병렬 처리 적용 (Application for parallel computation for finite element analysis of welding processes)

  • 임세영;김주완;최강혁
    • 대한용접접합학회:학술대회논문집
    • /
    • 대한용접접합학회 2004년도 춘계 학술발표대회 개요집
    • /
    • pp.273-275
    • /
    • 2004
  • A parallel multi-frontal solver is developed for finite element analysis of an arc-welding process, which entails phase evolution, heat transfer, and deformations of structure. We verify the code via comparison to a commercial code,SYSWELD. Attention is focused on the implementation of the parallel solver using MPI library, on the speedup by parallel computation, and on the effectiveness of the solver in welding application

  • PDF

디프드로잉에 의한 알루미늄합금판재의 집합조직 발달에 관한 연구 (Texture Evolution in Aluminum Alloy Sheets during Deep Drawing Process)

  • 최시훈;조재형;정관수;오규환
    • 한국소성가공학회:학술대회논문집
    • /
    • 한국소성가공학회 1998년도 제2회 박판성형심포지엄 논문집 박판성형기술의 현재와 미래
    • /
    • pp.140-147
    • /
    • 1998
  • The texture evolution by deep drawing was investigated and the lattice rotation rate was predicted using rate sensitive model with full constraints boundary conditions. The calculated textures show different behaviors with the amount of the flange deformation and initial crystal orientations. Among the crystal orientations located parallel to RD, the crystal orientations around the D component rotated toward the Cu component, the crystal orientations along the ${\alpha}$ fiber rotated toward the {110}<001> and {110}<111> components during deep drawing. In the case of the part parallel to 45$^{\circ}$ with respect to RD, the crystal orientations around the D component rotated about ND and the crystal orientations along the ${\alpha}$ fiber also rotated toward the (110)[23] and (110)[27] components about ND. In the part parallel to TD, the crystal orientations around the D component rotated toward the Rotated Cube and the crystal orientations along the ${\alpha}$ fiber rotated toward the {110}<113> component.