• 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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.4
• /
• pp.490-499
• /
• 1999

Vehicle routing problem(VRP) is known to be NP-hard problem, and good heuristic algorithm needs to be developed. To develop a heuristic algorithm for the VRP, this study suggests a parallel genetic algorithm(PGA), which determines each vehicle route in order to minimize the transportation costs. The PGA developed in this study uses two dimensional array chromosomes, which rows represent each vehicle route. The PGA uses new genetic operators. New mutation operator is composed of internal and external operators. internal mutation swaps customer locations within a vehicle routing, and external mutation swaps customer locations between vehicles. Ten problems were solved using this algorithm and showed good results in a relatively short time.

• Korean Journal of Remote Sensing
• /
• v.27 no.1
• /
• pp.59-68
• /
• 2011

The analysis of optimal infiltration path is one of the representative fields in which the GIS technology can be useful for the military purpose. Usually the analysis of the optimal path is done with network data. However, for military purpose, it often needs to be done with raster data. Because raster data needs far more computation than network data, it is difficult to apply the methods usually used in network data, such as Dijkstra algorithm. The genetic algorithm, which has shown great outcomes in optimization problems, was applied. It was used to minimize the detection probability of infiltration route. 2D binary array genes and its crossover and mutation were suggested to solve this problem with raster data. 30 tests were performed for each population size, 500, 1000, 2000, and 3000. With each generation, more adoptable routes survived and made their children routes. Results indicate that as the generations increased, average detection probability decreased and the routes converged to the optimal path. Also, as the population size increases, more optimal routes were found. The suggested genetic algorithm successfully finds the optimal infiltration route, and it shows better performance with larger population.

• Management Science and Financial Engineering
• /
• v.15 no.1
• /
• pp.51-69
• /
• 2009

A network model and a Genetic Algorithm (GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing a non-linear objective function with the linear constraints. In the model, the flow-conservation constraints are utilized to restrict the solution space and to force the link flows become consistent to the traffic counts. The objective of the model is to minimize the discrepancies between two sets of link flows. One is the set of link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links. The other is the set of link flows those are estimated through the trip distribution and traffic assignment using the path flow estimator in the logit-based SUE. In the proposed GA, a chromosome is defined as a real vector representing a set of Origin-Destination Matrix (ODM), link flows and route-choice dispersion coefficient. Each chromosome is evaluated by the corresponding discrepancies. The population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment technique is used during the crossover and mutation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.12C
• /
• pp.1215-1227
• /
• 2002

This paper presents a genetic algorithmic approach to shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for encoding the problem. The crossover operation that exchanges partial chromosomes (partial-routes) at positionally independent crossing sites and the mutation operation maintain the genetic diversity of the population. The proposed algorithm can cure all the infeasible chromosomes with a simple repair function. Crossover and mutation together provide a search capability that results in improved quality of solution and enhanced rate of convergence. Computer simulations show that the proposed algorithm exhibits a much better quality of solution (route optimality) and a much higher rate of convergence than other algorithms. The results are relatively independent of problem types (network sizes and topologies) for almost all source-destination pairs.

• Proceedings of the Korean Society of Toxicology Conference
• /
• 2001.05a
• /
• pp.127-127
• /
• 2001

Single-dose toxicity of a new phosphodiesterse inhibitor-5, DA -8159, was studied in rats via oral and intravenous routes and in mice via oral route. In addition, genotoxic potential of DA-8159 was investigated by using of the battery of test; reverse mutation test on bacteria, chromosomal aberration test on cultured mammalian cells and micronucleous test on mice.(omitted)

• Journal of Life Science
• /
• v.11 no.4
• /
• pp.385-391
• /
• 2001

Filamentous hemagglutinin (FHA) is considered as an essential immunogenic component for incorporation into acellular vaccines against Bordetella pertussis, the causative agent of whooping cough. Classically, antipertussis vaccination has employed an intramuscular route. An alternative approach to stimulate mucosal and systemic immune responses is oral immunization with recombinant live vaccine carrier strains of Salmonella typhimurium. An attenuated live Salmonella vaccine sgrain($\Delta$cya $\Delta$crp) expressing recombinant FHA(rFHA) was developed. Stable expressionof rFHA was achieved by the use of balanced-lethal vector-host system. which employs an asd deletion in the host chromosome to impose in obligate requirement for diaminopimelic acid. The chromosomal $\Delta$asd mutation was complemented by a plasmid vector possessing the asd$^{+}$ gene. A 3 kb DNA fragment encoding immuno dominant regionof FHA was subcloned in-frame downstream to the ATG translation initiation codon in the multicopy Asd$^{+}$ pYA3341 vector to create pYA3457. Salmonella vaccine harboring pYA3457 expressed approximately 105kDa rFHA protein. The 100% maintenance of [YA3457 in vaccine strain was confirmed by stability examinations. Additionally, a recombinant plasmid pYA3458 was constructed to overpress His(8X)-tagged rFHA in Essherichia coli. His-tagged rFHA was purified from the E. coli strain harboring pYA3458 using Ni$^{2+}$-NTA affinity purification system.>$^{2+}$-NTA affinity purification system.

• Journal of Food Hygiene and Safety
• /
• v.16 no.2
• /
• pp.145-151
• /
• 2001

EpoxidiBed soy bean oil (ESBO) is a plasticizer of PVC which is being widely used as a gaskets for the lid of glass jars including baby food. Using reverse mutation assay, chromosome aberration test and micronucleus test, ESBO were evaluated the mutagenicity. In the reverse mutation test, ESBO did not induced mutagenicity in Salmonella typhimurium TA98, TA100, TA1535, TA1537, TA102 with and without metabolic activation. In the chromosome aberration test using CHL cells, the results showed no increased structural and numerical aberrations in the concentration of sample producing cytotoxicity with and without metabolic activation. The in vivo induction of micronuclei was measured in polychromatic erythrocytes of bone marrow of young (3weeks old) and adult (6 weeks old) ddY mice of both sex. At 24 hours after treatment with ESBO 20, 10, 5, 2.5 g/B.W. kg/corn oil 10 ml by oral route animals were sacrificed and bone marrow cells were prepared for smear slides. The results showed no increased micronucleated polychromatic erythrocytes regardless of sex and age. It was concluded that water soluble ESBO did not show certain genotoxicity within our studies conducted.

• Journal of Korea Game Society
• /
• v.17 no.5
• /
• pp.123-132
• /
• 2017

The path-finding algorithm refers to an algorithm for navigating the route order from the current position to the destination in a virtual world in a game. The conventional path-finding algorithm performs graph search based on cost such as A-Star and Dijkstra. A-Star and Dijkstra require movable node and edge data in the world map, so it is difficult to apply online games with lots of map data. In this paper, we provide a Heuristic-based Genetic Algorithm Path-finding(HGAP) using Genetic Algorithm(GA). Genetic Algorithm is a path-finding algorithm applicable to game with variable environment and lots of map data. It seek solutions through mating, crossing, mutation and evolutionary operations without the map data. The proposed algorithm is based on Binary-Coded Genetic Algorithm and searches for a path by performing a heuristic operation that estimates a path to a destination to arrive at a destination more quickly.

• Asian Pacific Journal of Cancer Prevention
• /
• v.14 no.12
• /
• pp.7555-7560
• /
• 2013

Background: Beedi rollers are exposed to unburnt tobacco dust through cutaneous and pharyngeal route and it is extremely harmful to the body since it is carcinogenic in nature and can cause cancer during long exposure. This indicates that occupational exposure to tobacco imposes considerable genotoxicity among beedi workers. Materials and Methods: In the present study, 27 beedi workers and age and sex matched controls were enrolled for clinical, cytogenetics and molecular analysis. Clinical features were recorded. The workers were in the age group of 28-67 years and were workers exposure from 8-60 years. Blood samples were collected from workers and control subjects and lymphocyte cultures were carried out by using standard technique, slides were prepared and 50 metaphases were scored for each sample to find the chromosomal abnormalities. For molecular analysis the genomic DNA was extracted from peripheral blood, to screen the variations in gene, the exon 1 of CYP1A1 gene was amplified by polymerase chain reaction (PCR) and then screened with Single Strand Conformation Polymorphism (SSCP) analysis. Results: A statistically significant increase was observed in the frequencies of chromosomal aberrations in exposed groups when compared to the respective controls and variations observed in Exon 1 of CYP1A1(Cytochrome P450, family 1, subfamily A, polypeptide 1) gene. Conclusions: This study shows that, the toxicants present in the beedi that enter into human body causes disturbance to normal state and behavior of the chromosomes which results in reshuffling of hereditary material causing chromosomal aberrations and genomic variations.