• Title/Summary/Keyword: Genetic Architecture

Search Result 346, Processing Time 0.041 seconds

Current status and prospects of chrysanthemum genomics (국화 유전체 연구의 동향)

  • Won, So Youn;Kim, Jung Sun;Kang, Sang-Ho;Sohn, Seong-Han
    • Journal of Plant Biotechnology
    • /
    • v.43 no.3
    • /
    • pp.272-280
    • /
    • 2016
  • Chrysanthemum is one of the top floriculture species with ornamental and medicinal value. Although chrysanthemum breeding program has contributed to the development of various cultivars so far, it needs to be advanced from the traditional phenotype-based selection to marker-assisted selection (molecular breeding) as shown in major cereal and vegetable crops. Molecular breeding relies on trait-linked molecular markers identified from genetic, molecular, and genomic studies. However, these studies in chrysanthemum are significantly hampered by the reproductive, genetic, and genomic properties of chrysanthemum such as self-incompatibility, inbreeding depression, allohexaploid, heterozygosity, and gigantic genome size. Nevertheless, several genetic studies have constructed genetic linkage maps and identified molecular markers linked to important traits of flower, leaf, and plant architecture. With progress in sequencing technology, chrysanthemum transcriptome has been sequenced to construct reference gene set and identify genes responsible for developments or induced by biotic or abiotic stresses. Recently, a genome sequencing project has been launched on a diploid wild Chrysanthemum species. The massive sequencing information would serve as fundamental resources for molecular breeding of chrysanthemum. In this review, we summarized the current status of molecular genetics and genomics in chrysanthemum and briefly discussed future prospects.

An Iterative Data-Flow Optimal Scheduling Algorithm based on Genetic Algorithm for High-Performance Multiprocessor (고성능 멀티프로세서를 위한 유전 알고리즘 기반의 반복 데이터흐름 최적화 스케줄링 알고리즘)

  • Chang, Jeong-Uk;Lin, Chi-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.6
    • /
    • pp.115-121
    • /
    • 2015
  • In this paper, we proposed an iterative data-flow optimal scheduling algorithm based on genetic algorithm for high-performance multiprocessor. The basic hardware model can be extended to include detailed features of the multiprocessor architecture. This is illustrated by implementing a hardware model that requires routing the data transfers over a communication network with a limited capacity. The scheduling method consists of three layers. In the top layer a genetic algorithm takes care of the optimization. It generates different permutations of operations, that are passed on to the middle layer. The global scheduling makes the main scheduling decisions based on a permutation of operations. Details of the hardware model are not considered in this layer. This is done in the bottom layer by the black-box scheduling. It completes the scheduling of an operation and ensures that the detailed hardware model is obeyed. Both scheduling method can insert cycles in the schedule to ensure that a valid schedule is always found quickly. In order to test the performance of the scheduling method, the results of benchmark of the five filters show that the scheduling method is able to find good quality schedules in reasonable time.

Layered Classifier System by Classification of Environment

  • Kim, Ji-Yoon;Lee, Dong-Wook;Sim, Kwee-Bo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1517-1520
    • /
    • 2003
  • Generally, the environment we want to apply classifier system to is composed of several state spaces. So in this paper, we propose the layered classifier system having multifarious rule bases. From sensor's inputs, the lower layer of the layered classifier system learns strategies for each environmental state space. The higher layer learns how to allot each rule base of the strategy for environmental state space properly. To evaluate the proposed architecture of classifier system, we designed virtual environment having multifarious state spaces and from the analysis of the experimental results, we affirm that layered classifier system could find better strategies during a little time than other established classifier system's findings.

  • PDF

The Derivation of Rating Curve using GRNNM and GA (GRNNM과 GA를 이용한 Rating Curve의 유도)

  • Kim, Seong-Won
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2005.05b
    • /
    • pp.679-683
    • /
    • 2005
  • The technique which connects Generalized Regression Neural Networks Model(GRNNM) with Genetic Algorithm (CA) is used to derive rating curve in the river basin. GRNNM architecture consists of 4 layers ; input, hidden, summation and output layer. GA method is applied to estimate the optimal smoothing factor when GRNNM is trained. The derivation of rating curve using GRNNM is considered different kinds of hydraulic characteristics such as water stage, area and mean velocity and is applied two stage stations; Sunsan and Jungam. Furthermore, it is compared with conventional curve-fitting method. Through the training and validation performance, the results show that GRNNM is much superior as compared to the conventional curve-fitting method.

  • PDF

Design and Performance Analysis of BLSR/4 WDM/SHR in All-Optical Transport Network (완전 광전달망에서 BLSR/4 WMD/SHR의 설계 및 성능 분석)

  • 강안구;최한규;김지홍;김광현;김호건;조규섭
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.10B
    • /
    • pp.1832-1840
    • /
    • 1999
  • This paper proposed a network to implement all optical bidirectional BLSR/4 WDM/SHR allowing restoration in the event of a failure. The proposed network can provide a high degree of transparency using all-optical components with no electric implementation and effective failure restoration due to BLSR/4 WDM/SHR architecture. This paper also presented a genetic simulation model for the survivability analysis of the proposed BLSR/4 WDM/SHR under failure scenarios, the restoration performance of the proposed network is analyzed in terms of performance parameters such as propagation time, processing time, optical switch time.

  • PDF

Input-Output Linearization of Nonlinear Systems via Dynamic Feedback (비선형 시스템의 동적 궤환 입출력 선형화)

  • Cho, Hyun-Seob
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.6 no.4
    • /
    • pp.238-242
    • /
    • 2013
  • We consider the problem of constructing observers for nonlinear systems with unknown inputs. Connectionist networks, also called neural networks, have been broadly applied to solve many different problems since McCulloch and Pitts had shown mathematically their information processing ability in 1943. In this thesis, we present a genetic neuro-control scheme for nonlinear systems. Our method is different from those using supervised learning algorithms, such as the backpropagation (BP) algorithm, that needs training information in each step. The contributions of this thesis are the new approach to constructing neural network architecture and its training.

Robust control of Nonlinear System Using Multilayer Neural Network (다층 신경회로망을 이용한 비선형 시스템의 견실한 제어)

  • Cho, Hyun-Seob
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.6 no.4
    • /
    • pp.243-248
    • /
    • 2013
  • In this thesis, we have designed the indirect adaptive controller using Dynamic Neural Units(DNU) for unknown nonlinear systems. Proposed indirect adaptive controller using Dynamic Neural Unit based upon the topology of a reverberating circuit in a neuronal pool of the central nervous system. In this thesis, we present a genetic DNU-control scheme for unknown nonlinear systems. Our method is different from those using supervised learning algorithms, such as the backpropagation (BP) algorithm, that needs training information in each step. The contributions of this thesis are the new approach to constructing neural network architecture and its training.

Optimization Algorithms for Site Facility Layout Problems Using Self-Organizing Maps

  • Park, U-Yeol;An, Sung-Hoon
    • Journal of the Korea Institute of Building Construction
    • /
    • v.12 no.6
    • /
    • pp.664-673
    • /
    • 2012
  • Determining the layout of temporary facilities that support construction activities at a site is an important planning activity, as layout can significantly affect cost, quality of work, safety, and other aspects of the project. The construction site layout problem involves difficult combinatorial optimization. Recently, various artificial intelligence(AI)-based algorithms have been applied to solving many complex optimization problems, including neural networks(NN), genetic algorithms(GA), and swarm intelligence(SI) which relates to the collective behavior of social systems such as honey bees and birds. This study proposes a site facility layout optimization algorithm based on self-organizing maps(SOM). Computational experiments are carried out to justify the efficiency of the proposed method and compare it with particle swarm optimization(PSO). The results show that the proposed algorithm can be efficiently employed to solve the problem of site layout.

Design of GA-based Fuzzy Polynomial Neural Networks Architecture (유전자 기반 퍼지다항식 뉴럴네트워크 구조의 설계)

  • 박병준;오성권
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2004.04a
    • /
    • pp.442-445
    • /
    • 2004
  • 본 논문은 유전자 기반 퍼지다항식 뉴럴네트워크(Genetic based fuzzy polynomial neural networks: gFPNN)를 제안한다. gFPNN 구조는 퍼지집합을 기반으로 설계되며, 유전자 알고리즘에 의해 구조 및 파라미터를 최적화한 구조이다. 퍼지집합을 기반으로 설계되어진 퍼지뉴럴네트워크는 간략추론 구조와 선형추론 구조로 설계된다. 본 논문에서는 간략추론 및 선형추론 구조를 통합 및 확장한 퍼지다항식 뉴럴네트워크를 설계한다. 이 구조는 연결가중치를 이용하여 회귀다항식을 네트워크 구조로 표현하며, 간략추론(Type 0), 선형추론(Type 1), 회귀다항식추론(Type 2)을 모두 포함한다. 또한 퍼지규칙 후반부의 다항식 차수를 각 규칙에 대해 다르게 선택할 수 있으며, 일률적인 형식의 구조를 벗어나 주어진 시스템의 특성에 따라 유연한 구조를 설계할 수 있도록 한다. 여기에 더하여, 네트워크 구조와 파라미터 동조에 유전자 알고리즘을 적용하며, 구조와 파라미터 동정에 대한 효율적인 방법을 논의한다. 제안된 모델의 평가를 위해 수치예제를 이용한다.

  • PDF

Processor-Architecture for the Faster Processing of Genetic Algorithm (유전 알고리듬 처리속도 향상을 위한 프로세서 구조)

  • 윤한얼;정재원;심귀보
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2004.10a
    • /
    • pp.169-172
    • /
    • 2004
  • 유전 알고리듬은 NP-Hard 문제의 해결이나, 함수 최적화, 복잡한 제어기의 파라미터 값 추적 등, 광범위한 분야에 걸쳐 이용되고 있다 일반적인 유전 알고리듬은 적합도 함수를 통해 해들의 품질을 결정하고, 해들의 품질에 따라 선택 연산을 거쳐, 교차나 돌연변이를 통해 우수한 품질의 해를 찾는 과정을 가진다 현재 이 과정은 대부분 소프트웨어적으로 구현되어 범용 프로세서를 통해 수행된다. 그러나 높은 소프트웨어 의존성은 해집단의 크기가 커질수록 교차/변이 연산과 해들의 품질비교에 수행되는 시간을 크게 증가시키는 약점이 있다. 따라서 본 논문에서는 순위 기반 선택과 일점 교차(one-point crossover)를 사용한다는 제약하에, 해들의 순위를 정렬 네트워크를 통해 결정하고 해들을 Residue Number System(RNS)로 표현하여 하드웨어적으로 교차연산을 처리하는 프로세서 구조를 제안한다 이러한 접근을 통해 해들의 품질비교에 걸리는 시간을 크게 줄이고 교차/변이 연산의 효율을 높일 수 있다.

  • PDF