• Biomolecules & Therapeutics
• /
• 제11권2호
• /
• pp.139-144
• /
• 2003

Ganoderma lucidum is commonly known as medically potent mushroom, which has been widely used in China and other oriental countries for the treatment of various diseases, including cancer. In this report, we investigated the anti-oxidant and protective effect of Ganodema lucidum extract (GLE) against the DNA damage induced by free radical and U.V. In the assay of cell growth inhibition, the inhibitory cell growth rate induced by hydroxyl radical was dose-dependently decreased by GLE. This results support that GLE has a detoxifying activity against cytotoxicity of hydroxyl radical in E. coli cell. GLE also protected ColE1 plasmid DNA damage in the concentration of 200$\mu\textrm{g}$ per reaction on the DNA fragmentation assay. The nuclear tailing by hydrogen peroxide in single cell gel electrophoresis(SCGE) was decreased by GLE in the concentration of 50$\mu\textrm{g}$/ml. These data indicate that Ganoderma lucidum has an anti-oxidative activity to hydrogen peroxide. The mutation rate after irradiation of U.V. was reduced by 50$\mu\textrm{g}$/ml GLE and total number of Rif (Rifampicin) resistant mutants was decreased in a concentration dependent manner when added the GLE exogenously in a culture media. According to the results, it is likely that GLE has not only an anti-oxidative activity to hydroxyl radical but also an anti-mutagenic activity to U.V. mutagenesis.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2000년도 추계학술대회 및 정기총회
• /
• pp.113-116
• /
• 2000

The purpose of this study is to present a method for determining the k most vital arcs in shortest path problem using an evolutionary algorithm. The problem of finding the k most vital arcs in shortest path problem is to find a set of k arcs whose simultaneous removal from the network causes the greatest increase in the total length of shortest path. The problem determining the k most vital arcs in shortest path problem has known as NP-hard. Therefore, in order to deal with the problem of real world the heuristic algorithm is needed. In this study we propose to the method of finding the k-MVA in shortest path problem using an evolutionary algorithm which known as the most efficient algorithm among heuristics. For this, the expression method of individuals compatible with the characteristics of shortest path problem, the parameter values of constitution gene, size of the initial population, crossover rate and mutation rate etc. are specified and then the effective genetic algorithm will be proposed. The method presented in this study is developed using the library of the evolutionary algorithm framework (EAF) and then the performance of algorithm is analyzed through the computer experiment.

• 대한원격탐사학회지
• /
• 제34권1호
• /
• pp.151-166
• /
• 2018

This paper compares the four selections of performance used in the application of genetic algorithms (GAs) to automatically optimize multispectral pixel cluster for unsupervised classification from KOMPSAT-3 data, since the selection among three main types of operators including crossover and mutation is the driving force to determine the overall operations in the clustering GAs. Experimental results demonstrate that the tournament selection obtains a better performance than the other selections, especially for both the number of generation and the convergence rate. However, it is computationally more expensive than the elitism selection with the slowest convergence rate in the comparison, which has less probability of getting optimum cluster centers than the other selections. Both the ranked-based selection and the proportional roulette wheel selection show similar performance in the average Euclidean distance using the pixel clustering, even the ranked-based is computationally much more expensive than the proportional roulette. With respect to finding global optimum, the tournament selection has higher potential to reach the global optimum prior to the ranked-based selection which spends a lot of computational time in fitness smoothing. The tournament selection-based clustering GA is used to successfully classify the KOMPSAT-3 multispectral data achieving the sufficient the matic accuracy assessment (namely, the achieved Kappa coefficient value of 0.923).

• Journal of Chest Surgery
• /
• 제38권12호
• /
• pp.835-843
• /
• 2005

배경: 분자학적 표지자들과 식도암과의 관련성에 대해서 아직 뚜렷하게 밝혀진 바가 없다. 본 연구에서는 먼저 p53, Cyclin D1과 Ki67 지수 등 종양 표식자가 국내 식도암 환자에서 수술 후 얻어진 식도암 조직의 병기, 악성도, 임파선 전이 여부 등과 어떠한 관련성이 있는가를 알아보고 이를 이용해 향후 국내 식도암 환자에 대한 예후 분석 및 치료방침 결정 그리고 조기발견에 이용할 수 있는지 알아보았다. 또한 본 연구는 분자학적 표지자들의 임상적용의 기초를 마련하고자 하는 목적으로 시행하였다. 대상 및 방법: 1992년 3월부터 수술 후 조직절편이 보존된 124명의 환자를 대상으로 하였다. 조직절편의 파라핀을 제거한 뒤에 p53 변이, Cyclin D1의 과발현, Ki67 지수에 대한 면역조직화학 염색법을 시행하였으며 조직슬라이드상에서 세포분열지수를 구하였다. 이 결과와 임상적인 변수들과의 상관관계를 분석하였고, 환자의 생존 및 재발 결과와 비교하였다. 결과: 환자의 성별, 나이, 병기, 종양 크기, 타장기 전이 여부, 국소적인 재발 여부와 p53의 변이, Cyclin D1의 과발현, Ki67 지수, 세포분열 지수에 따른 통계적으로 유의한 차이는 없었다. Ki67 지수는 40 미만인 경우와 40 이상인 경우로 나누었을 경우 통계적으로 유의하게 생존기간에 있어서 차이가 나는 것으로 나타났으나(p=0.011) 다른 표지자들은 생존기간에 유의한 차이를 보이지 않았다. 결론: 높은 Ki67지수는 식도의 편평상피암의 예후에 나쁜 영향을 미치는 것으로 나타났으나 다른 표지자들은 영향을 미치지 않았다 이번의 연구를 통해 분자학적인 지표들이 임상적으로 가치 있는 인자가 될 수 있다고 판단되었다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 하계학술대회 논문집 B
• /
• pp.1155-1157
• /
• 2002

This paper presents the use of a simple genetic algorithm for the tuning of a proportional-integral speed controller for an induction motor drive. The influence of population size, generation number and rate of mutation on the convergence of the genetic algorithm is investigated. On Matlab/Simulink environment, this paper proposes an optimal GA-PI controller of indirect vector control for induction motor drive system. The simulation results verify that the system has a more robust to the parameter variation than classical PI controller.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권3호
• /
• pp.735-748
• /
• 2014

The fault-tolerance routing problem is one of the most important issues in the application of the Internet of Things, and has been attracting growing research interests. In order to maintain the communication paths from source sensors to the macronodes, we present a hybrid routing scheme and model, in which alternate paths are created once the previous routing is broken. Then, we propose an improved efficient and intelligent fault-tolerance algorithm (IEIFTA) to provide the fast routing recovery and reconstruct the network topology for path failure in the Internet of Things. In the IEIFTA, mutation direction of the particle is determined by multi-swarm evolution equation, and its diversity is improved by the immune mechanism, which can improve the ability of global search and improve the converging rate of the algorithm. The simulation results indicate that the IEIFTA-based fault-tolerance algorithm outperforms the EARQ algorithm and the SPSOA algorithm due to its ability of fast routing recovery mechanism and prolonging the lifetime of the Internet of Things.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.388-391
• /
• 2003

We've been following research on the obstacle avoidance that is based on fuzzy control. We previously proposed a new method of automatically generating membership functions, which play an important role in improving accuracy of fuzzy control, by using genetic programming (GP). In this paper, we made two improvements to our proposed method, for the purpose of achieving better intelligence in fuzzy robots. First, the mutation rate is made to change dynamically, according to the coupled chaotic system. Secondly, the population partitioning using deme is introduced by parallel processing. The effectiveness of these improvements is demonstrated through several computer simulations.

• 산업공학
• /
• 제17권spc호
• /
• pp.28-36
• /
• 2004

The main purpose of this study is to find out the optimal solution of the vehicle routing problem considering heterogeneous vehicle(s), double-trips, and multi depots. This study suggests a mathematical programming model with new numerical formula which considers the amount of delivery and sub-tour elimination and gives optimal solution by using OPL-STUDIO(ILOG). This study also suggests modified genetic algorithm which considers the improvement of the creation method for initial solution, application of demanding point, individual and last learning method in order to find excellent solution, survival probability of infeasible solution for allowance, and floating mutation rate for escaping from local solution. The suggested modified genetic algorithm is compared with optimal solution of the existing problems. We found the better solution rather than the existing genetic algorithm. The suggested modified genetic algorithm is tested by Eilon and Fisher data(Eilon 22, Eilon 23, Eilon 30, Eilon 33, and Fisher 10), respectively.

• Journal of Microbiology and Biotechnology
• /
• 제14권6호
• /
• pp.1163-1169
• /
• 2004

An unstructured mathematical model is presented for lactic acid fermentation based on the energy balance. The proposed model reflects the energy metabolic state and then predicts the cell growth, lactic acid production, and glucose consumption rates by relating the above rates with the energy metabolic rate. Fermentation experiments were conducted under various initial lactic acid concentrations of 0, 30, 50, 70, and 90 g/l. Also, a genetic algorithm was used for further optimization of the model parameters and included the operations of coding, initialization, hybridization, mutation, decoding, fitness calculation, selection, and reproduction exerted on individuals (or chromosomes) in a population. The simulation results showed a good fit between the model prediction and the experimental data. The genetic algorithm proved to be useful for model parameter optimization, suggesting wider applications in the field of biological engineering.

• Journal of Microbiology and Biotechnology
• /
• 제20권6호
• /
• pp.1006-1010
• /
• 2010

Pseudomonas putida JM37 metabolized glyoxylate at a specific rate of 55 g/g dry biomass/day. In order to investigate their role, three genes encoding enzymes that are potentially involved in the conversion of glyoxylate were disrupted; namely, tartronate semialdehyde synthase (gcl), malate synthase (glcB), and isocitrate lyase (aceA). Strains with transposon insertion in either of these genes were isolated from a 50,000 clone library employing a PCR-guided enrichment strategy. In addition, all three double mutants were constructed via targeted insertion of a knock-out plasmid. Neither mutation of gcl, glcB, and aceA nor any of the respective double mutations influenced glyoxylic acid conversion, indicating that P. putida JM37 may possess other enzymes and pathways for glyoxylate metabolism.