• Title/Summary/Keyword: Mutation process

Search Result 215, Processing Time 0.032 seconds

ON THE REPRESENTATION OF PROBABILITY VECTOR WITH SPECIAL DIFFUSION OPERATOR USING THE MUTATION AND GENE CONVERSION RATE

  • Choi, Won
    • Korean Journal of Mathematics
    • /
    • v.27 no.1
    • /
    • pp.1-8
    • /
    • 2019
  • We will deal with an n locus model in which mutation and gene conversion are taken into consideration. Also random partitions of the number n determined by chromosomes with n loci should be investigated. The diffusion process describes the time evolution of distributions of the random partitions. In this paper, we find the probability of distribution of the diffusion process with special diffusion operator $L_1$ and we show that the average probability of genes at different loci on one chromosome can be described by the rate of gene frequency of mutation and gene conversion.

Polymorphic Path Transferring for Secure Flow Delivery

  • Zhang, Rongbo;Li, Xin;Zhan, Yan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.8
    • /
    • pp.2805-2826
    • /
    • 2021
  • In most cases, the routing policy of networks shows a preference for a static one-to-one mapping of communication pairs to routing paths, which offers adversaries a great advantage to conduct thorough reconnaissance and organize an effective attack in a stress-free manner. With the evolution of network intelligence, some flexible and adaptive routing policies have already proposed to intensify the network defender to turn the situation. Routing mutation is an effective strategy that can invalidate the unvarying nature of routing information that attackers have collected from exploiting the static configuration of the network. However, three constraints execute press on routing mutation deployment in practical: insufficient route mutation space, expensive control costs, and incompatibility. To enhance the availability of route mutation, we propose an OpenFlow-based route mutation technique called Polymorphic Path Transferring (PPT), which adopts a physical and virtual path segment mixed construction technique to enlarge the routing path space for elevating the security of communication. Based on the Markov Decision Process, with considering flows distribution in the network, the PPT adopts an evolution routing path scheduling algorithm with a segment path update strategy, which relieves the press on the overhead of control and incompatibility. Our analysis demonstrates that PPT can secure data delivery in the worst network environment while countering sophisticated attacks in an evasion-free manner (e.g., advanced persistent threat). Case study and experiment results show its effectiveness in proactively defending against targeted attacks and its advantage compared with previous route mutation methods.

Immunological Studies on Mutation Process and Substrate Induction of Trichoderma viride Cellulase (Trichoderma viride Cellulase의 돌연변이 과정 및 기질유도의 면역학적 연구)

  • 오태광;권기석
    • Microbiology and Biotechnology Letters
    • /
    • v.19 no.3
    • /
    • pp.248-252
    • /
    • 1991
  • - Mutation process and substrate induction of 7i-ichoderma viride cellobiohydrolase were investigated by immunological techniques. Since mutants of Trichodemza uiride such as QM9123, QM9414, TKO41 and MCG77 produced immunologically same cellobiohydrolase, it may be that the mutation be occurred in the reguratory gene rather than in the structural gene of cellobiohydrolase. a-Cellulose and Solka Floc were found to be the best inducer for the production of cellobiohydrolase in Trichodemza viride culture compared to low molecular weight inducer such as carboxylmethyl cellulose and cellobiose.

  • PDF

Implementation of Engine Generating Mutation Worm Signature Using LCSeq (LCSeq를 이용한 변형 웜 시그니쳐 생성 엔진 구현)

  • Ko, Joon-Sang;Lee, Jae-Kwang;Kim, Bong-Han
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.11
    • /
    • pp.94-101
    • /
    • 2007
  • We introduce the way to detect the mutation worm. We implemented the program that can generate signature using LCSeq(Longest Common Subsequence) technique in Suffix Tree studied as pattern recognition algorithm. We also showed the process to detect the mutation of CodeRed worm and Nimda worm and evaluated signatures generated by snort and LCSeq.

Global Optimization Using Differential Evolution Algorithm (차분진화 알고리듬을 이용한 전역최적화)

  • Jung, Jae-Joon;Lee, Tae-Hee
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.11
    • /
    • pp.1809-1814
    • /
    • 2003
  • Differential evolution (DE) algorithm is presented and applied to global optimization in this research. DE suggested initially fur the solution to Chebychev polynomial fitting problem is similar to genetic algorithm(GA) including crossover, mutation and selection process. However, differential evolution algorithm is simpler than GA because it uses a vector concept in populating process. And DE turns out to be converged faster than CA, since it employs the difference information as pseudo-sensitivity In this paper, a trial vector and its control parameters of DE are examined and unconstrained optimization problems of highly nonlinear multimodal functions are demonstrated. To illustrate the efficiency of DE, convergence rates and robustness of global optimization algorithms are compared with those of simple GA.

A Missense Variant (R239Q) in CCN3 Induces Aberrant Apoptosis in the Developing Mouse Brain

  • Kim, Hyunduk;Yang, Hayoung;Woo, Dong Kyun;Jang, Sung-Wuk;Shim, Sungbo
    • Biomedical Science Letters
    • /
    • v.24 no.2
    • /
    • pp.64-75
    • /
    • 2018
  • CCN3 (also known as NOV, Nephroblastoma overexpressed) proteins are involved in various pathologies during different developmental stages. We have previously shown that intracellular levels and normal extracellular secretion of CCN3 are important for neuronal differentiation. Furthermore, we demonstrated that a single amino acid in the CCN3 TSP-1 domain is important for extracellular secretion and that palmitoylation of CCN3 is required in this process. However, the effect of abnormal CCN3 accumulation on cells remains to be studied. Here, we found mutations in the TSP-1 domain of CCN3 that led to intracellular accumulation and abnormal aggregation of CCN3. It was observed that this mutation resulted in a phenomenon similar to neurodegeneration when overexpressed in the developing mouse cortex. This mutation also confirmed the activation of apoptotic gene expression in Neuro2a cells. In addition, we confirmed the in vivo transcriptional changes induced by this mutation using microarray analysis. We observed a significant increase in the expression of Anp32a, an apoptosis-related gene. Collectively, these results indicate that a single mutation in CCN3 can lead to abnormal cell death if it shows intracellular accumulation and abnormal aggregation.

Applications of Goods Mutation Control Form in Accounting Information System: A Case Study in Sumber Indah Perkasa Manufacturing, Indonesia

  • ARIF, Donny;YUCHA, Nikma;SETIAWAN, Setiawan;OKTARINA, Dian;MARTAH, Varid;MUTTAQIIN, Ninnasi
    • The Journal of Asian Finance, Economics and Business
    • /
    • v.7 no.8
    • /
    • pp.419-424
    • /
    • 2020
  • This study analyzes the new GMCF method applied by the company with the aim to find out how the production of Accounting Information Systems (AIS) implemented by the company can be managed properly. The study also seeks to find out whether the company needs new system support facilities to facilitate the production performance reporting process of each division and evaluate the performance of GMCF systems in the company. The methods used are descriptive analysis techniques and statistical tests of Paired Sample T-Test comparison; this study uses production data of each unit of a product with random sampling to determine the level of product damage and compare production with the GMCF system and prior to using it. The results of the analysis found that the application of goods mutation control forms (GMCF) greatly influenced the smooth production reporting process, which resulted in an increase in achieving production targets and reducing the risk of product damage during the production process. The company also benefits from the efficiency of production costs when using the GMCF system and can quickly design policies for products that are damaged during the production process. In addition, the company can have damaged products repaired faster than before.

Implementation of an Adaptive Genetic Algorithm Processor for Evolvable Hardware (진화 시스템을 위한 유전자 알고리즘 프로세서의 구현)

  • 정석우;김현식;김동순;정덕진
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.53 no.4
    • /
    • pp.265-276
    • /
    • 2004
  • Genetic Algorithm(GA), that is shown stable performance to find an optimal solution, has been used as a method of solving large-scaled optimization problems with complex constraints in various applications. Since it takes so much time to execute a long computation process for iterative evolution and adaptation. In this paper, a hardware-based adaptive GA was proposed to reduce the serious computation time of the evolutionary process and to improve the accuracy of convergence to optimal solution. The proposed GA, based on steady-state model among continuos generation model, performs an adaptive mutation process with consideration of the evolution flow and the population diversity. The drawback of the GA, premature convergence, was solved by the proposed adaptation. The Performance improvement of convergence accuracy for some kinds of problem and condition reached to 5-100% with equivalent convergence speed to high-speed algorithm. The proposed adaptive GAP(Genetic Algorithm Processor) was implemented on FPGA device Xilinx XCV2000E of EHW board for face recognition.

Automatic Discrete Optimum Design of Space Trusses using Genetic Algorithms (유전자알고리즘에 의한 공간 트러스의 자동 이산화 최적설계)

  • Park, Choon-Wook;Youh, Baeg-Yuh;Kang, Moon-Myung
    • Journal of Korean Association for Spatial Structures
    • /
    • v.1 no.1 s.1
    • /
    • pp.125-134
    • /
    • 2001
  • The objective of this study is the development of size discrete optimum design algorithm which is based on the GAs(genetic algorithms). The algorithm can perform size discrete optimum designs of space trusses. The developed algorithm was implemented in a computer program. For the optimum design, the objective function is the weight of space trusses and the constraints are limite state design codes(1998) and displacements. The basic search method for the optimum design is the GAs. The algorithm is known to be very efficient for the discrete optimization. This study solves the problem by introducing the GAs. The GAs consists of genetic process and evolutionary process. The genetic process selects the next design points based on the survivability of the current design points. The evolutionary process evaluates the survivability of the design points selected from the genetic process. In the genetic process of the simple GAs, there are three basic operators: reproduction, cross-over, and mutation operators. The efficiency and validity of the developed discrete optimum design algorithm was verified by applying GAs to optimum design examples.

  • PDF

Recent Advanced Toxicological Methods for Environmental Hazardous Chemicals (환경 오염물질의 진보된 독성 평가 기법)

  • 류재천;최윤정;김연정;김형태;방형애;송윤선
    • Environmental Analysis Health and Toxicology
    • /
    • v.14 no.1_2
    • /
    • pp.1-12
    • /
    • 1999
  • Recently, several new methods for the detection of genetic damages in vitro and in vivo based on molecular biological techniques were introduced according to the rapid progress in toxicology combined with cellular and molecular biology. Among these methods, mouse lymphoma thymidine kanase (tk) gene forward mutation assay, single cell gel electrophoresis (comet assay) and transgenic animal and cell line model as a target gene of lac I (Big Blue) and lac Z (Muta Mouse) gene mutation are newly introduced based on molecular toxicological approaches. The mouse lymphoma tk$\^$+/-/ gene assay (MOLY) using L5178Y tk$\^$+/-/ mouse lymphoma cell line is one of the mammalian forward mutation assays, and has many advantages and more sensitive than hprt assay. The target gene of MOLY is a heterozygous tk$\^$+/-/ gene located in 11 chromosome, so it is able to detect the wide range of genetic changes like point mutation, deletion, rearrangement, and mitotic recombination within tk gene or deletion of entire chromosome 11. The comet assay is a rapid, simple, visual and sensitive technique for measuring and analysing DNA breakages in mammalian cells, Also, transgenic animal and cell line models, which have exogenous DNA incorporated into their genome, carry recoverable shuttle vector containing reporter genes to assess endogenous effects or alteration in specific genes related to disease process, are powerful tools to study the mechanism of mutation in vivo and in vitro, respectively. Also in vivo acridine orange supravital staining micronucleus assay by using mouse peripheral reticulocytes was introduced as an alternative of bone marrow micronucleus assay. In this respect, there was an International workshop on genotoxicity procedure (IWGTP) supported by OECD and EMS (Environmental Mutagen Society) at Washington D. C. in March 25-26, 1999. The objective of IWGTP is to harmonize the testing procedures internationally, and to extend to finalization of OECD guideline, and to the agreement of new guidelines under the International Conference of Harmonization (ICH) for these methods mentioned above. Therefore, we introduce and review the principle, detailed procedure, and application of MOLY, comet assay, transgenic mutagenesis assay and supravital staining micronucleus assay.

  • PDF