The red imported fire ant (Solenopsis invicta) is a species of ant native to South America. The fire ant was inadvertently introduced into USA, Australia, New Zealand, and other Asian countries including China and Taiwan. Since the first report of the fire ant in port city of Busan, Korea in 2017, it was found in many other cities of Korea in following year. To obtain the molecular information of this invasive species, total RNA was extracted from the abdominal segment of the ants collected in Incheon, and subjected to transcriptome sequencing. By using Illumina sequencer platform, 101 base pared-end sequencing generated 2 × 50,064,081 of raw reads to obtain 2 × 45.95 Gbase of quality filtered nucleotide sequences. The in silico cDNA library was constructed by Trinity de novo assembler followed by TransDecoder ORF finder and CD-HIT clustering program to streamline the library. The final version of cDNA library contains 20,442 contigs with protein coding capability. To survey the virome of this ant, these contigs were searched against the viral reference sequences from NCBI RefSeq database with BLASTN program. As a result, contigs which showed high sequence identities with several RNA viruses including previously reported SINV-2 were found from the fire ant. This virome information might give an idea of a shift of virological environment of this newly found ant isolate or population in Korea.

This paper focuses on scheduling problems arising in the military. In planned artillery attack operations, a large number of threatening enemy targets should be destroyed to minimize fatal loss to the friendly forces. We consider a situation in which the

This dissertation focuses on scheduling problems arising in the military. In planned artillery attack operations, a large number of threatening enemy targets should be destroyed to minimize fatal loss to the friendly forces. We consider a situation in which the number of available weapons is smaller than the number of targets. Therefore it is required to develop a new sequencing algorithm for the unplanned artillery attack operation. The objective is to minimize the total loss of the targets, which is expressed as a function of the fire power potential, after artillery attack operations are finished. We develop a algorithm considering the fire power potential and the time required to destroy the targets. The algorithms suggested in this dissertation can be used in real artillery attack operations if they are modified slightly to cope with the practical situations.

This paper considers the simultaneously firing model for the artillery operations. The objective of this paper is to find the optimal fire sequence minimizing the final completion time of the firing missions of multiple artillery units for multiple target

This paper considers the simultaneously firing model for the artillery operations. The objective of this paper is to find the optimal fire sequence minimizing the final completion time of the firing missions of multiple artillery units for multiple targets. In the problem analysis, we derive several solution properties to reduce the solution space. Moreover, two lower bounds of objective are derived and tested along with the derived properties within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.