• Title/Summary/Keyword: mutation operation

Search Result 54, Processing Time 0.028 seconds

A Greedy Genetic Algorithm for Release Planning in Software Product Lines (소프트웨어 제품라인의 출시 계획 수립을 위한 탐욕 유전자 알고리듬)

  • Yoo, Jaewook
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.36 no.3
    • /
    • pp.17-24
    • /
    • 2013
  • Release planning in a software product line (SPL) is to select and assign the features of the multiple software products in the SPL in sequence of releases along a specified planning horizon satisfying the numerous constraints regarding technical precedence, conflicting priorities for features, and available resources. A greedy genetic algorithm is designed to solve the problems of release planning in SPL which is formulated as a precedence-constrained multiple 0-1 knapsack problem. To be guaranteed to obtain feasible solutions after the crossover and mutation operation, a greedy-like heuristic is developed as a repair operator and reflected into the genetic algorithm. The performance of the proposed solution methodology in this research is tested using a fractional factorial experimental design as well as compared with the performance of a genetic algorithm developed for the software release planning. The comparison shows that the solution approach proposed in this research yields better result than the genetic algorithm.

Inflammatory Myofibroblastic Tumor Treated with Laparoscopic Proximal Gastrectomy and Double-Tract Anastomosis

  • Kim, Dong Jin;Kim, Wook
    • Journal of Gastric Cancer
    • /
    • v.15 no.1
    • /
    • pp.64-67
    • /
    • 2015
  • Inflammatory myofibroblastic tumors (IMTs) of the stomach are extremely rare in adults, and their oncologic prognosis is not well understood. We present a 28-year-old man with a proximal gastric IMT. The patient visited the emergency department of Yeouido St. Mary's Hospital with syncope and hematemesis. Hemoglobin levels were <5.5 g/dl. Gastric fibroscopy showed a protruding mass $4{\times}4cm$ in size, with central ulceration on the posterior wall of the fundus and diffuse wall thickening throughout the cardia and anterior wall of the upper body. Endoscopic biopsy revealed indeterminate spindle cells, along with inflammation. Given the risk of rebleeding, an operation was performed despite the uncertain diagnosis. Because the mass was circumferential, laparoscopic proximal gastrectomy and double-tract anastomosis were performed to ensure a safe resection margin. The pathological diagnosis was consistent with an IMT originating from the stomach, although the tumor was negative for anaplastic lymphoma kinase gene mutation.

A Study on Stabilization Control of Inverted Pendulum System using Evolving Neural Network Controller (진화 신경회로망 제어기를 이용한 도립진자 시스템의 안정화 제어에 관한 연구)

  • 김민성;정종원;성상규;박현철;심영진;이준탁
    • Proceedings of the Korean Society of Marine Engineers Conference
    • /
    • 2001.05a
    • /
    • pp.243-248
    • /
    • 2001
  • The stabilization control of Inverted Pendulum(IP) system is difficult because of its nonlinearity and structural unstability. Thus, in this paper, an Evolving Neural Network Controller(ENNC) without Error Back Propagation(EBP) is presented. An ENNC is described simply by genetic representation using an encoding strategy for types and slope values of each active functions, biases, weights and so on. By an evolutionary programming which has three genetic operation; selection, crossover and mutation, the predetermine controller is optimally evolved by updating simultaneously the connection patterns and weights of the neural networks. The performances of the proposed ENNC(PENNC) are compared with the ones of conventional optimal controller and the conventional evolving neural network controller(CENNC) through the simulation and experimental results. And we showed that the finally optimized PENNC was very useful in the stabilization control of an IP system.

  • PDF

A hybrid algorithm for the synthesis of computer-generated holograms

  • Nguyen The Anh;An Jun Won;Choe Jae Gwang;Kim Nam
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2003.07a
    • /
    • pp.60-61
    • /
    • 2003
  • A new approach to reduce the computation time of genetic algorithm (GA) for making binary phase holograms is described. Synthesized holograms having diffraction efficiency of 75.8% and uniformity of 5.8% are proven in computer simulation and experimentally demonstrated. Recently, computer-generated holograms (CGHs) having high diffraction efficiency and flexibility of design have been widely developed in many applications such as optical information processing, optical computing, optical interconnection, etc. Among proposed optimization methods, GA has become popular due to its capability of reaching nearly global. However, there exits a drawback to consider when we use the genetic algorithm. It is the large amount of computation time to construct desired holograms. One of the major reasons that the GA' s operation may be time intensive results from the expense of computing the cost function that must Fourier transform the parameters encoded on the hologram into the fitness value. In trying to remedy this drawback, Artificial Neural Network (ANN) has been put forward, allowing CGHs to be created easily and quickly (1), but the quality of reconstructed images is not high enough to use in applications of high preciseness. For that, we are in attempt to find a new approach of combiningthe good properties and performance of both the GA and ANN to make CGHs of high diffraction efficiency in a short time. The optimization of CGH using the genetic algorithm is merely a process of iteration, including selection, crossover, and mutation operators [2]. It is worth noting that the evaluation of the cost function with the aim of selecting better holograms plays an important role in the implementation of the GA. However, this evaluation process wastes much time for Fourier transforming the encoded parameters on the hologram into the value to be solved. Depending on the speed of computer, this process can even last up to ten minutes. It will be more effective if instead of merely generating random holograms in the initial process, a set of approximately desired holograms is employed. By doing so, the initial population will contain less trial holograms equivalent to the reduction of the computation time of GA's. Accordingly, a hybrid algorithm that utilizes a trained neural network to initiate the GA's procedure is proposed. Consequently, the initial population contains less random holograms and is compensated by approximately desired holograms. Figure 1 is the flowchart of the hybrid algorithm in comparison with the classical GA. The procedure of synthesizing a hologram on computer is divided into two steps. First the simulation of holograms based on ANN method [1] to acquire approximately desired holograms is carried. With a teaching data set of 9 characters obtained from the classical GA, the number of layer is 3, the number of hidden node is 100, learning rate is 0.3, and momentum is 0.5, the artificial neural network trained enables us to attain the approximately desired holograms, which are fairly good agreement with what we suggested in the theory. The second step, effect of several parameters on the operation of the hybrid algorithm is investigated. In principle, the operation of the hybrid algorithm and GA are the same except the modification of the initial step. Hence, the verified results in Ref [2] of the parameters such as the probability of crossover and mutation, the tournament size, and the crossover block size are remained unchanged, beside of the reduced population size. The reconstructed image of 76.4% diffraction efficiency and 5.4% uniformity is achieved when the population size is 30, the iteration number is 2000, the probability of crossover is 0.75, and the probability of mutation is 0.001. A comparison between the hybrid algorithm and GA in term of diffraction efficiency and computation time is also evaluated as shown in Fig. 2. With a 66.7% reduction in computation time and a 2% increase in diffraction efficiency compared to the GA method, the hybrid algorithm demonstrates its efficient performance. In the optical experiment, the phase holograms were displayed on a programmable phase modulator (model XGA). Figures 3 are pictures of diffracted patterns of the letter "0" from the holograms generated using the hybrid algorithm. Diffraction efficiency of 75.8% and uniformity of 5.8% are measured. We see that the simulation and experiment results are fairly good agreement with each other. In this paper, Genetic Algorithm and Neural Network have been successfully combined in designing CGHs. This method gives a significant reduction in computation time compared to the GA method while still allowing holograms of high diffraction efficiency and uniformity to be achieved. This work was supported by No.mOl-2001-000-00324-0 (2002)) from the Korea Science & Engineering Foundation.

  • PDF

The International Fishery Relationship in the Sea around the Korean Peninsula and Its Future Prospect (한반도(韓半島) 주변수역(周邊水域)의 국제어업관계(國際漁業關係)와 그 전망(展望))

  • Lee, Byoung-Gee;Choe, Jong-Hwa
    • Journal of Fisheries and Marine Sciences Education
    • /
    • v.3 no.1
    • /
    • pp.9-20
    • /
    • 1991
  • The authors investigated the existing international fishery relationship in the sea around the Korean Peninsula, and prospected on the reformation of the fishery order which might be followed by mutation of the international political condition and by effectuation of the U.N. Convention on the Law of the Sea in the future. It can be explained that the existing international fishery order in this sea has been constituted on the basis of restricting Japanese indiscriminate fishery expansion. But. when the South Korea and China proclaim the 200-mile EEZ in the future, a considerable part of existing fishery agreements will forfeit the role as general norms of the international fishery relationship. Accordingly a counterplan against the revision or abrogation of the Korea-Japan Fishery Agreement must be considered. And also a rational fishery relationship between Korea and China, as confronting countries, must be organized. The South-North Korea fishery relationship must be settled on the basis of co-operation. trust, and common interest. For this purpose, a political discussion on the establishment of the joint fishery zone around the military demarcation line and on the conservation for the fishery resources must be begun in earnest.

  • PDF

Design of a Water Quality Monitoring Network in the Nakdong River using the Genetic Algorithm (유전자 알고리즘을 이용한 낙동강 유역의 수질 측정망 설계에 관한 연구)

  • Park, Su-Young;Wang, Sookyun;Choi, Jung Hyun;Park, Seok Soon
    • Journal of Korean Society on Water Environment
    • /
    • v.23 no.5
    • /
    • pp.697-704
    • /
    • 2007
  • This study proposes an integrated technique of Genetic Algorishim (GA) and Geographic Information System (GIS) for designing the water quality monitoring networks. To develop solution scheme of the integrated system, fitness functions are defined by the linear combination of five criteria which stand for the operation objectives of water quality monitoring stations. The criteria include representativeness of a river system, compliance with water quality standards, supervision of water use, surveillance of pollution sources and examination of water quality changes. The fitness level is obtained through calculations of the fitness functions and input data from GIS. To find the most appropriate parameters for the problems, the sensitivity analysis is performed for four parameters such as number of generations, population sizes, probability of crossover, and probability of mutation. Using the parameters resulted from the sensitivity analysis, the developed system proposed 110 water quality monitoring stations in the Nakdong River. This study demonstrates that the integrated technique of GA and GIS can be utilized as a decision supporting tool in optimized design for a water quality monitoring network.

Intracardiac Thrombosis Involving All Four Cardiac Chambers after Extracardiac Membranous Oxygenation Associated with MTHFR Mutations

  • Kim, Bong Jun;Song, Seung Hwan;Shin, Yu Rim;Park, Han Ki;Park, Young Hwan;Shin, Hong Ju
    • Journal of Chest Surgery
    • /
    • v.49 no.3
    • /
    • pp.207-209
    • /
    • 2016
  • A 4-month-old boy diagnosed with acute myocarditis was treated with extracorporeal membrane oxygenation (ECMO). Follow-up echocardiography eight hours after ECMO revealed intracardiac thrombosis involving all four heart chambers. Because of the high risk of systemic embolization due to a pedunculated thrombus of the aortic valve, we performed an emergency thrombectomy. After the operation, the patient had a minor neurologic sequela of left upper arm hypertonia, which had almost disappeared at the last outpatient clinic two months later. He was diagnosed with a major mutation in MTHFR (methylenetetrahydrofolate reductase), which is related to thrombosis.

Optimization of parameters in mobile robot navigation using genetic algorithm (유전자 알고리즘을 이용한 이동 로봇 주행 파라미터의 최적화)

  • 김경훈;조형석
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.1161-1164
    • /
    • 1996
  • In this paper, a parameter optimization technique for a mobile robot navigation is discussed. Authors already have proposed a navigation algorithm for mobile robots with sonar sensors using fuzzy decision making theory. Fuzzy decision making selects the optimal via-point utilizing membership values of each via-point candidate for fuzzy navigation goals. However, to make a robot successfully navigate through an unknown and cluttered environment, one needs to adjust parameters of membership function, thus changing shape of MF, for each fuzzy goal. Furthermore, the change in robot configuration, like change in sensor arrangement or sensing range, invokes another adjusting of MFs. To accomplish an intelligent way to adjust these parameters, we adopted a genetic algorithm, which does not require any formulation of the problem, thus more appropriate for robot navigation. Genetic algorithm generates the fittest parameter set through crossover and mutation operation of its string representation. The fitness of a parameter set is assigned after a simulation run according to its time of travel, accumulated heading angle change and collision. A series of simulations for several different environments is carried out to verify the proposed method. The results show the optimal parameters can be acquired with this method.

  • PDF

Optimal Placement of Distributed Generators in Radial Distribution System for Reducing the Effect of Islanding

  • K, Narayanan.;Siddiqui, Shahbaz A.;Fozdar, Manoj
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.3
    • /
    • pp.551-559
    • /
    • 2016
  • The present trend of increasing the penetration levels of Distributed Generator (DG) in the distribution network has made the issue of Islanding crucial for the reliable operation of the network. The islanding, if not detected early may lead to the collapse of the system as it can drive the distribution system to the cascaded failure. In this paper, an extensive study of the effect of DG placement and sizing is performed by dividing the system into different zones to obtain a reduced effect of islanding. The siting and sizing of DG is carried out to improve the overall voltage profile or/and reduction in active power loss using two stage Genetic Algorithm (GA). In the first stage a basic knockout selection is considered and the best population is taken for next stage, where roulette selection for crossover and mutation is performed for optimal placement and sizing of DGs. The effect of the islanding, due to load variations is reduced by optimal siting and sizing of DG. The effectiveness of the proposed scheme is tested on the IEEE 33 and 69 radial bus systems and the results obtained are promising.

Optimal Capacitor Placement and Operation for Loss reduction and Improvement of Voltage Profile in Radial Distribution Systems (방사상 배전계통의 손실감소 및 전압보상을 위한 커패시터 최적 배치 및 운용)

  • Kim, Tae-Kyun;Baek, Young-Ki;Kim, Kyu-Ho;You, Seok-Ku
    • Proceedings of the KIEE Conference
    • /
    • 1997.07c
    • /
    • pp.1009-1011
    • /
    • 1997
  • This paper presents an optimization method which determines locations and size of capacitors simultaneously while minimizing power losses and improving voltage profile in radial distribution systems. Especially, the cost function associated with capacitor placement is considered as step function due to banks of standard discrete capacities. Genetic algorithms(GA) are used to obtain efficiently the solution of the cost function associated with capacitors which is non-continuous and non-differentiable function. The strings in GA consist of the node number index and size of capacitors to be installed. The length mutation operator, which is able to change the length of strings in each generation, is used. The proposed method which determines locations and size of capacitors simultaneously can reduce power losses and improve' voltage profile with capacitors of minimum size. Its efficiency is proved through the application in radial distribution systems.

  • PDF