• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.55-79
• /
• 2013

In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.

• Journal of Microbiology and Biotechnology
• /
• v.23 no.11
• /
• pp.1519-1528
• /
• 2013

Bacillus pumilus SG2, a halotolerant strain, expresses two major chitinases designated ChiS and ChiL that were induced by chitin and secreted into the supernatant. The present work aimed to obtain a mutant with higher chitinolytic activity through mutagenesis of Bacillus pumilus SG2 using a combination of UV irradiation and nitrous acid treatment. Following mutagenesis and screening on chitin agar and subsequent formation of halos, the mutated strains were examined for degradation of chitin under different conditions. A mutant designated AV2-9 was selected owing to its higher chitinase activity. To search for possible mutations in the whole operon including ChiS and ChiL, the entire chitinase operon, including the intergenic region, promoter, and two areas corresponding to the ChiS and ChiL ORF, was suquenced. Nucleotide sequence analysis of the complete chitinase operon from the SG2 and AV2-9 strains showed the presence of a mutation in the catalytic domain (GH18) of chitinase (ChiL). The results demonstrated that a single base change had occurred in the ChiL sequence in AV2-9. The wild-type chitinase, ChiL, and the mutant (designated ChiLm) were cloned, expressed, and purified in E. coli. Both enzymes showed similar profiles of activity at different ranges of pH, NaCl concentration, and temperature, but the mutant enzyme showed approximately 30% higher catalytic activity under all the conditions tested. The results obtained in this study showed that the thermal stability of chitinase increased in the mutant strain. Bioinformatics analysis was performed to predict changes in the stability of proteins caused by mutation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.4
• /
• pp.537-544
• /
• 2020

Advances in detection techniques, such as mutation and obfuscation, are being advanced with the development of malware technology. In the malware detection technology, unknown malware detection technology is important, and a method for Malware Authorship Attribution that detects an unknown malicious code by identifying the author through distributed malware is being studied. In this paper, we try to extract the compiler information affecting the binary-based author identification method and to investigate the sensitivity of feature selection, probability and non-probability models, and optimization to classification efficiency between studies. In the experiment, the feature selection method through information gain and the support vector machine, which is a non-probability model, showed high efficiency. Among the optimization studies, high classification accuracy was obtained through feature selection and model optimization through the proposed framework, and resulted in 48% feature reduction and 53 faster execution speed. Through this study, we can confirm the sensitivity of feature selection, model, and optimization methods to classification efficiency.

• Journal of Microbiology and Biotechnology
• /
• v.16 no.4
• /
• pp.576-583
• /
• 2006

The alkali-soluble glucan of the yeast cell wall contains $\beta-(1,3)-$ and (1,6)-D-linkages and is known to systemically enhance the immune system. In the previous study [6], in order to isolate cell wall mutants, a wild-type strain was mutagenized by exposure to ultraviolet light, and the mutants were then selected via treatment with laminarinase $(endo-\beta-(1,3)-D-glucanase)$. The mass of alkali- and water-soluble glucans produced by the mutant was measured to be 33.8 mg/g of the dry mass of the yeast cell. Our results showed that the mutants generated the amount of alkali-soluble glucan 10-fold higher than that generated by the wild-type. Structural analysis showed that the alkali-soluble glucan from the mutants was associated with a higher degree of $\beta-(1,6)-D-linkage$ than was observed in conjunction with the wild-type. Yeast cell wall $\beta-glucan$ was shown to interact with macrophages via receptors, thereby inducing the release of tumor necrosis factor alpha $(TNF-\alpha)$ and nitric oxide. Alkali-soluble $\beta-glucans$, both from water-soluble and water-insoluble glucan, exhibited a higher degree of macrophage activity with regard to both the secretion of tumor necrosis factor alpha $(TNF-\alpha)$ and nitric oxide and direct phagocytosis, than did the positive control ($1{\mu}g$ of lipopolysaccharide).

• Asian-Australasian Journal of Animal Sciences
• /
• v.31 no.10
• /
• pp.1558-1564
• /
• 2018

Objective: We report monitoring conservation effect for a Chinese indigenous chicken (Langshan) breed using major histocompatibility complex (MHC) and DNA barcords. Methods: The full length of MHC B-G gene and mitochondrial cytochrome oxidase I (COI) gene in generations 0, 5, 10, 15, 16, and 17 was measured using re-sequencing and sequencing procedures, respectively. Results: There were 292 single nucleotide polymorphisms of MHC B-G gene identified in six generations. Heterozygosity (He) and polymorphic information content (PIC) of MHC B-G gene in generations 10, 15, 16, and 17 remained stable. He and PIC of MHC B-G gene were different in six generations, with G10, G15, G16, G17 >G5>G0 (p<0.05). For the COI gene, there were five haplotypes in generations 0, 5, 10, 15, 16, and 17. Where Hap2 and Hap4 were the shared haplotypes, 164 individuals shared Hap2 haplotypes, while Hap1 and Hap3 were the shared haplotypes in generations 0 and 5 and Hap5 was a shared haplotype in generations 10, 15, 16, and 17. The sequence of COI gene in 6 generations was tested by Tajima's and D value, and the results were not significant, which were consistent with neutral mutation. There were no differences in generations 10, 15, 16, and 17for measured phenotypic traits. In other generations, for annual egg production, with G5, G10, G15, G16, G17>G0 (p<0.05). For age at the first egg and age at sexual maturity, with G10, G15, G16, G17>G5>G0 (p<0.05). Conclusion: Combined with the results of COI gene DNA barcodes, MHC B-G gene, and phenotypic traits we can see that genetic diversity remained stable from generations 10 to 17 and the equimultiple random matching pedigrees conservation population conservation effect of Langshan chicken was effective as measured by these criteria.

• Journal of Microbiology and Biotechnology
• /
• v.18 no.1
• /
• pp.35-42
• /
• 2008

Vibrio vulnificus produces siderophores, low-molecular-weight iron-chelating compounds, to obtain iron under conditions of iron deprivation. To identify genes associated with the biosynthesis of siderophore in V. vulnificus MO6-24/O, we screened clones with mini-Tn5 random insertions for those showing decreased production of siderophore. Among 6,000 clones screened, nine such clones were selected. These clones contain the transposon inserted in VV2_0830 (GenBank accession number) that is a homolog of a nonribosomal peptide synthase (NRPS). There is an another NRPS module, VV2_0831, 49-bp upstream to VV2_0830. We named these two genes vvs (Vibrio vulnificus siderophore synthase) A and B, respectively. Mutation of either vvsA or vvsB showed a decreased production of siderophore. The expression of an NRPS-lux fusion was negatively modulated by the presence of iron, and the regulation was dependent on Fur (ferric uptake regulator). However, the expression of the NRPS genes was still not fully derepressed in the iron-rich condition, even in furnull mutant cells, suggesting that some other unknown factors are involved in the regulation of the genes. We also demonstrated that the NRPS genes are important for virulence of the pathogen in a mice model.

• Journal of Microbiology and Biotechnology
• /
• v.16 no.2
• /
• pp.247-255
• /
• 2006

Yeast cell wall matrix particles are composed entirely of mannoprotein and ${\beta}-glucan$. The mannoproteins of yeast cell wall can systemically enhance the immune system. We previously purified and analyzed alkali-soluble ${\beta}-glucans$ [${\beta}$-(1,3)- and ${\beta}$-(1,6)-glucans] [10]. In the present study, a wild-type strain was first mutagenized with ultraviolet light, and the cell wall mutants were then selected by treatment with 1.0 mg/ml laminarinase (endo-${\beta}$-(1,3)-D-glucanase). Mannoproteins of Saccharomyces cerevisiae were released by laminarinase, purified by concanavalin-A affinity and ion-exchange chromatography. The results indicated that the mutants yielded 3-fold more mannoprotein than the wild-type. The mannoprotein mass of mutant K48L3 was 2.25 mg/100 mg of yeast cell dry mass. Carbohydrate analysis revealed that they contained mannose, glucose, and N-acetylglucosamine. Saccharomyces cerevisiae cell wall components, mannoproteins, are known to interact with macrophages through receptors, thereby inducing release of tumor necrosis factor alpha ($TNF-{\alpha}$) and nitric oxide. Mannoprotein tractions in the present study had a higher macrophage activity of secretion of $TNF-{\alpha}$ and nitric oxide and direct phagocytosis than positive control ($1{\mu}g$ of lipopolysaccharide). In particular, F1 and F3 fractions in mannoproteins of K48L3 enhanced and upregulated the activity of nitric oxide secretion and macrophage phagocytosis by approximately two- and four-fold, respectively.

• Horticultural Science & Technology
• /
• v.29 no.3
• /
• pp.232-239
• /
• 2011

The genus Acorus is known as an indigenous medicinal plant. Genetic diversity of thirteen accessions of A. calamus and eight of A. gramineus, with an accession of Colocasia antiquorum and two of Iris pseudacorus as outgroups, were evaluated using RAPD markers for cluster analysis and principal coordinate analysis, and NIR spectroscopic profiles for principal component analysis.A total of 371 polymorphic bands were obtained by using the selected 12 random primers. The genetic distances were estimated from 0.03 to 0.31 within A. calamus and from 0.03 to 0.51 within A. gramineus. The dendrogram and three-dimensional plot separated the accessions into four distinct groups (A. calamus, A. gramineus, C. antiquorum, and I. pseudacorus). Moreover, for the diversity among genus Acorus, eleven A. calamus accessions, one A. gramineus accession, and two I. pseudacorus accessions were non-destructively analyzed from their leaves by NIR spectroscopy, which discriminated Acorus accessions like the RAPD analysis. Interestingly, thirteen accessions of A. calamus were clustered into two groups based on RAPD and NIR analyses, which indicates that there are two ecotypes of A. calamus in Korea. An accession (CZ) of A. calamus with yellow stripe on leaves was closely grouped with another (CX) at a genetic distance (GD) of 0.03, which shows that the stripe trait might be generated by chimeric mutation. The genetic distance between A. calamus and A. gramineus was revealed to be farthest from 0.80 to 0.88 GD. In genus Acorus the genetic diversity and genetic variation were identified by using RAPD marker technique and non-destructive NIRs.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.2
• /
• pp.111-120
• /
• 2017

This paper proposes an improved standard genetic algorithm (GA) of making a near optimal schedule for integrated process planning and scheduling problem (IPPS) considering tool flexibility and tool related constraints. Process planning involves the selection of operations and the allocation of resources. Scheduling, meanwhile, determines the sequence order in which operations are executed on each machine. Due to the high degree of complexity, traditionally, a sequential approach has been preferred, which determines process planning firstly and then performs scheduling independently based on the results. The two sub-problems, however, are complicatedly interrelated to each other, so the IPPS tend to solve the two problems simultaneously. Although many studies for IPPS have been conducted in the past, tool flexibility and capacity constraints are rarely considered. Various meta-heuristics, especially GA, have been applied for IPPS, but the performance is yet satisfactory. To improve solution quality against computation time in GA, we adopted three methods. First, we used a random circular queue during generation of an initial population. It can provide sufficient diversity of individuals at the beginning of GA. Second, we adopted an inferior selection to choose the parents for the crossover and mutation operations. It helps to maintain exploitation capability throughout the evolution process. Third, we employed a modification of the hybrid scheduling algorithm to decode the chromosome of the individual into a schedule, which can generate an active and non-delay schedule. The experimental results show that our proposed algorithm is superior to the current best evolutionary algorithms at most benchmark problems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.7
• /
• pp.943-948
• /
• 2018

In this paper, we propose a hybrid approach of combining $A^*$ and Genetic algorithm in the path search problem. In $A^*$, the cost from a start node to the intermediate node is optimized in principle but the path from that intermediate node to the goal node is generated and tested based on the cumulated cost and the next node in a priority queue is chosen to be tested. In that process, we adopt the genetic algorithm principle in that the group of nodes to generate the next node from an intermediate node is tested by its fitness function. Top two nodes are selected to use crossover or mutation operation to generate the next generation. If generated nodes are qualified, those nodes are inserted to the priority queue. The proposed method is compared with the original sequential selection and the random selection of the next searching path in $A^*$ algorithm and the result verifies the superiority of the proposed method.