• 제목/요약/키워드: Mutation Operator

Search Result 67, Processing Time 0.02 seconds

The Optimization Of SS-Type Deflection Yoke By Using Genetic Algorithm (유전 알고리즘을 이용한 SS형 편향코일의 형상 최적화)

  • Joo, K.J.;Yoon, I.G.;Kang, B.H.;Joe, M.C.;Hahn, S.Y.;Lee, H.B.
    • Proceedings of the KIEE Conference
    • /
    • 1993.07b
    • /
    • pp.971-973
    • /
    • 1993
  • Deflection Yoke(the following, DY) is the important electric device of CRT which deflects R, G, B beans influencing magnetic field produced by yoke coils. Recently, DY is designed to the saddle/saddle type of coils, being proposed for high-definite and high-efficient CRT. This paper presents the optimization of pin-sectioned saddle coil's shape for minimizing gap between desired and practical deflections of electron beams by using Genetic Algorithm. Evolution Startegy is utilized in this paper, since evolution strategy is a kind of genetic algorithms finding the optimized values by choicing the better generation with comparing the parents and their children. Here, the children are generated by only mutations from the normal random variables. Evolution strategy has shown better powerful converge rate than the other genetic algorithms becuase of using only the mutation-operator.

  • PDF

A Novel Multi-focus Image Fusion Scheme using Nested Genetic Algorithms with "Gifted Genes" (재능 유전인자를 갖는 네스티드 유전자 알고리듬을 이용한 새로운 다중 초점 이미지 융합 기법)

  • Park, Dae-Chul;Atole, Ronnel R.
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.1
    • /
    • pp.75-87
    • /
    • 2009
  • We propose in this paper a novel approach to image fusion in which the fusion rule is guided by optimizing an image clarity function. A Genetic Algorithm is used to stochastically select, comparative to the clarity function, the optimum block from among the source images. A novel nested Genetic Algorithm with gifted individuals found through bombardment of genes by the mutation operator is designed and implemented. Convergence of the algorithm is analytically and empirically examined and statistically compared (MANOVA) with the canonical GA using 3 test functions commonly used in the GA literature. The resulting GA is invariant to parameters and population size, and a minimal size of 20 individuals is found to be sufficient in the tests. In the fusion application, each individual in the population is a finite sequence of discrete values that represent input blocks. Performance of the proposed technique applied to image fusion experiments, is characterized in terms of Mutual Information (MI) as the output quality measure. The method is tested with C=2 input images. The results of the proposed scheme indicate a practical and attractive alternative to current multi-focus image fusion techniques.

  • PDF

A Distributed Nearest Neighbor Heuristic with Bounding Function (분기 함수를 적용한 분산 최근접 휴리스틱)

  • Kim, Jung-Sook
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.7
    • /
    • pp.377-383
    • /
    • 2002
  • The TSP(Traveling Salesman Problem) has been known as NP-complete, there have been various studies to find the near optimal solution. The nearest neighbor heuristic is more simple than the other algorithms which are to find the optimal solution. This paper designs and implements a new distributed nearest neighbor heuristic with bounding function for the TSP using the master/slave model of PVM(Parallel Virtual Machine). Distributed genetic algorithm obtains a near optimal solution and distributed nearest neighbor heuristic finds an optimal solution for the TSP using the near optimal value obtained by distributed genetic algorithm as the initial bounding value. Especially, we get more speedup using a new genetic operator in the genetic algorithm.

A hybrid identification method on butterfly optimization and differential evolution algorithm

  • Zhou, Hongyuan;Zhang, Guangcai;Wang, Xiaojuan;Ni, Pinghe;Zhang, Jian
    • Smart Structures and Systems
    • /
    • v.26 no.3
    • /
    • pp.345-360
    • /
    • 2020
  • Modern swarm intelligence heuristic search methods are widely applied in the field of structural health monitoring due to their advantages of excellent global search capacity, loose requirement of initial guess and ease of computational implementation etc. To this end, a hybrid strategy is proposed based on butterfly optimization algorithm (BOA) and differential evolution (DE) with purpose of effective combination of their merits. In the proposed identification strategy, two improvements including mutation and crossover operations of DE, and dynamic adaptive operators are introduced into original BOA to reduce the risk to be trapped in local optimum and increase global search capability. The performance of the proposed algorithm, hybrid butterfly optimization and differential evolution algorithm (HBODEA) is evaluated by two numerical examples of a simply supported beam and a 37-bar truss structure, as well as an experimental test of 8-story shear-type steel frame structure in the laboratory. Compared with BOA and DE, the numerical and experimental results show that the proposed HBODEA is more robust to detect the reduction of stiffness with limited sensors and contaminated measurements. In addition, the effect of search space, two dynamic operators, population size on identification accuracy and efficiency of the proposed identification strategy are further investigated.

A Bi-objective Game-based Task Scheduling Method in Cloud Computing Environment

  • Guo, Wanwan;Zhao, Mengkai;Cui, Zhihua;Xie, Liping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.11
    • /
    • pp.3565-3583
    • /
    • 2022
  • The task scheduling problem has received a lot of attention in recent years as a crucial area for research in the cloud environment. However, due to the difference in objectives considered by service providers and users, it has become a major challenge to resolve the conflicting interests of service providers and users while both can still take into account their respective objectives. Therefore, the task scheduling problem as a bi-objective game problem is formulated first, and then a task scheduling model based on the bi-objective game (TSBOG) is constructed. In this model, energy consumption and resource utilization, which are of concern to the service provider, and cost and task completion rate, which are of concern to the user, are calculated simultaneously. Furthermore, a many-objective evolutionary algorithm based on a partitioned collaborative selection strategy (MaOEA-PCS) has been developed to solve the TSBOG. The MaOEA-PCS can find a balance between population convergence and diversity by partitioning the objective space and selecting the best converging individuals from each region into the next generation. To balance the players' multiple objectives, a crossover and mutation operator based on dynamic games is proposed and applied to MaPEA-PCS as a player's strategy update mechanism. Finally, through a series of experiments, not only the effectiveness of the model compared to a normal many-objective model is demonstrated, but also the performance of MaOEA-PCS and the validity of DGame.

Role of CopA to Regulate repABC Gene Expression on the Transcriptional Level (전사 수준에서 repABC 유전자 발현을 조절하는 CopA 단백질의 역할)

  • Sam Woong Kim;Sang Wan Gal;Won-Jae Chi;Woo Young Bang;Tae Wan Kim;In Gyu Baek;Kyu Ho Bang
    • Journal of Life Science
    • /
    • v.34 no.2
    • /
    • pp.86-93
    • /
    • 2024
  • Since replication of plasmids must be strictly controlled, plasmids that generally perform rolling circle replication generally maintain a constant copy number by strictly controlling the replication initiator Rep at the transcriptional and translational levels. Plasmid pJB01 contains three orfs (copA, repB, repC or repABC) consisting of a single operon. From analysis of amino acid sequence, pJB01 CopA was homologous to the Cops, as a copy number control protein, of other plasmids. When compared with a CopG of pMV158, CopA seems to form the RHH (ribbon-helix-helix) known as a motif of generalized repressor of plasmids. The result of gel mobility shift assay (EMSA) revealed that the purified fusion CopA protein binds to the operator region of the repABC operon. To examine the functional role of CopA on transcriptional level, 3 point mutants were constructed in coding frame of copA such as CopA R16M, K26R and E50V. The repABC mRNA levels of CopA R16M, K26R and E50V mutants increased 1.84, 1.78 and 2.86 folds more than that of CopA wt, respectively. Furthermore, copy numbers owing to mutations in three copA genes also increased 1.86, 1.68 and 2.89 folds more than that of copA wt, respectively. These results suggest that CopA is the transcriptional repressor, and lowers the copy number of pJB01 by reducing repABC mRNA and then RepB, as a replication initiator.

Optimization of Multiclass Support Vector Machine using Genetic Algorithm: Application to the Prediction of Corporate Credit Rating (유전자 알고리즘을 이용한 다분류 SVM의 최적화: 기업신용등급 예측에의 응용)

  • Ahn, Hyunchul
    • Information Systems Review
    • /
    • v.16 no.3
    • /
    • pp.161-177
    • /
    • 2014
  • Corporate credit rating assessment consists of complicated processes in which various factors describing a company are taken into consideration. Such assessment is known to be very expensive since domain experts should be employed to assess the ratings. As a result, the data-driven corporate credit rating prediction using statistical and artificial intelligence (AI) techniques has received considerable attention from researchers and practitioners. In particular, statistical methods such as multiple discriminant analysis (MDA) and multinomial logistic regression analysis (MLOGIT), and AI methods including case-based reasoning (CBR), artificial neural network (ANN), and multiclass support vector machine (MSVM) have been applied to corporate credit rating.2) Among them, MSVM has recently become popular because of its robustness and high prediction accuracy. In this study, we propose a novel optimized MSVM model, and appy it to corporate credit rating prediction in order to enhance the accuracy. Our model, named 'GAMSVM (Genetic Algorithm-optimized Multiclass Support Vector Machine),' is designed to simultaneously optimize the kernel parameters and the feature subset selection. Prior studies like Lorena and de Carvalho (2008), and Chatterjee (2013) show that proper kernel parameters may improve the performance of MSVMs. Also, the results from the studies such as Shieh and Yang (2008) and Chatterjee (2013) imply that appropriate feature selection may lead to higher prediction accuracy. Based on these prior studies, we propose to apply GAMSVM to corporate credit rating prediction. As a tool for optimizing the kernel parameters and the feature subset selection, we suggest genetic algorithm (GA). GA is known as an efficient and effective search method that attempts to simulate the biological evolution phenomenon. By applying genetic operations such as selection, crossover, and mutation, it is designed to gradually improve the search results. Especially, mutation operator prevents GA from falling into the local optima, thus we can find the globally optimal or near-optimal solution using it. GA has popularly been applied to search optimal parameters or feature subset selections of AI techniques including MSVM. With these reasons, we also adopt GA as an optimization tool. To empirically validate the usefulness of GAMSVM, we applied it to a real-world case of credit rating in Korea. Our application is in bond rating, which is the most frequently studied area of credit rating for specific debt issues or other financial obligations. The experimental dataset was collected from a large credit rating company in South Korea. It contained 39 financial ratios of 1,295 companies in the manufacturing industry, and their credit ratings. Using various statistical methods including the one-way ANOVA and the stepwise MDA, we selected 14 financial ratios as the candidate independent variables. The dependent variable, i.e. credit rating, was labeled as four classes: 1(A1); 2(A2); 3(A3); 4(B and C). 80 percent of total data for each class was used for training, and remaining 20 percent was used for validation. And, to overcome small sample size, we applied five-fold cross validation to our dataset. In order to examine the competitiveness of the proposed model, we also experimented several comparative models including MDA, MLOGIT, CBR, ANN and MSVM. In case of MSVM, we adopted One-Against-One (OAO) and DAGSVM (Directed Acyclic Graph SVM) approaches because they are known to be the most accurate approaches among various MSVM approaches. GAMSVM was implemented using LIBSVM-an open-source software, and Evolver 5.5-a commercial software enables GA. Other comparative models were experimented using various statistical and AI packages such as SPSS for Windows, Neuroshell, and Microsoft Excel VBA (Visual Basic for Applications). Experimental results showed that the proposed model-GAMSVM-outperformed all the competitive models. In addition, the model was found to use less independent variables, but to show higher accuracy. In our experiments, five variables such as X7 (total debt), X9 (sales per employee), X13 (years after founded), X15 (accumulated earning to total asset), and X39 (the index related to the cash flows from operating activity) were found to be the most important factors in predicting the corporate credit ratings. However, the values of the finally selected kernel parameters were found to be almost same among the data subsets. To examine whether the predictive performance of GAMSVM was significantly greater than those of other models, we used the McNemar test. As a result, we found that GAMSVM was better than MDA, MLOGIT, CBR, and ANN at the 1% significance level, and better than OAO and DAGSVM at the 5% significance level.