• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.43-47
• /
• 1997

A procedure presented in this paper generates test sequences to check the conformity of an implementation with a protocol specification, which is modeled as a deterministic finite state machine (FSM). Given a FSM, a common procedure of test sequence generation, first, constructs a directed graph which edges include the state check after each transition, and produces a symmetric graph G* from and, finally, finds a Euler tour of G*. We propose a technique to determine a minimum-cost tour of the transition graph of the FSM. The proposed technique using Multiple Unique State Signature (MUSS) solves an open issue that one MUIO sequence assignment may lead to two more edges of unit cost being replicated to from G* while an optimal assignment may lead to the replication of a single edge of high cost. In this paper, randomly generated FSMs have been studied as test cases. The result shows that the proposed technique saves the cost 4∼28% and 2∼21% over the previous approach using MUIO and MUSP, respectively.

• Genomics & Informatics
• /
• v.8 no.2
• /
• pp.97-99
• /
• 2010

To allow for a quick conversion of the proprietary sequence data from various sequencing platforms, sequence format conversion toolkits are required that can be easily integrated into workflow systems. In this respect, a format conversion tool, as well as quality conversion tool would be the minimum requirements to integrate reads from different platforms. We have developed the Pyrus NGS Sequencing Format Converter, a simple software toolkit which allows to convert three kinds of Next Generation Sequencing reads, into commonly used fasta or fastq formats. The converter modules are all implemented, uniformly, in Java GUI modules that can be integrated in software applications for displaying the data content in the same format.

• Genomics & Informatics
• /
• v.11 no.4
• /
• pp.191-199
• /
• 2013

High-throughput next-generation sequencing (NGS) technology produces a tremendous amount of raw sequence data. The challenges for researchers are to process the raw data, to map the sequences to genome, to discover variants that are different from the reference genome, and to prioritize/rank the variants for the question of interest. The recent development of many computational algorithms and programs has vastly improved the ability to translate sequence data into valuable information for disease gene identification. However, the NGS data analysis is complex and could be overwhelming for researchers who are not familiar with the process. Here, we outline the analysis pipeline and describe some of the most commonly used principles and tools for analyzing NGS data for disease gene identification.

• Proceedings of the KIEE Conference
• /
• 2005.10c
• /
• pp.317-319
• /
• 2005

In this paper, control algorithm for torque ripple compensation in DFIG wind power generation system is proposed. A simple PI controller is designed for the negative sequence voltage cancellation using negative sequence currents in the grid-side converter. As a result, the stator voltage contains only the positive sequence components and the torque pulsation of the generator is effectively compensated. Propose algorithm is confirmed with PSCAD simulation model.

• Journal of Species Research
• /
• v.13 no.2
• /
• pp.127-130
• /
• 2024

The first complete mitogenome sequence of the Red-tongue Pit Viper (Gloydius ussuriensis) from Korea was characterized using next-generation sequencing. The mitogenome is a circular molecule (17,209 bp) with a typical vertebrate mitogenome arrangement, which consists of 2 ribosomal RNA genes (rRNA), 22 transfer RNA genes (tRNA), two non-coding regions (D-loop), and 13 protein-coding genes (PCGs). The base composition of the mitogenome is 32.7% of A, 27.5% of C, 13.9% of G, and 25.9% of T, with a slight AT bias(58.6%). This phylogenetic analysis infers that G. ussuriensis is in the same group as the Chinese G. ussuriensis (Accession No. KP262412) and is closely related to G. blomhoffi and other species of the genus Gloydius. In our study, the complete mitogenome sequence of Korean G. ussuriensis was characterized and we provided basic genetic information on this species.

• Journal of Institute of Control, Robotics and Systems
• /
• v.1 no.2
• /
• pp.112-118
• /
• 1995

In designing assembly lines, it is required that the lines should not only meet the demand of the product, but also minimize the assembly cost associated with the line. For such a purpose, numerous research efforts have been made on either the assembly sequence generation or the assembly line balancing. However, the works dealing with both the research problems have been seldom reported in literature. When assembly sequences are generated without consideration of line balancing, additional cost may be incurred, because the sequences may not guarantee the minimum number of workstations. Therefore, it is essential to consider line balancing in the generation of cost-effective assembly sequences. To incorporate the two research problems into one, this paper treats a single-model and deterministic (SMD) assembly line balancing (ALB) problem, and proposes a new method for generating line-balanced robotic assembly sequences by using a simulated annealing. In this method, an energy function is derived in consideration of the satisfaction of assembly constraints, and the minimization of both the assembly cost and the idle time. Then, the energy function is iteratively minimized and occasionally perturbed by the simulated annealing. When no further change in energy occurs, an assembly sequence with consideration of line balancing is finally found. To show the effectiveness of the proposed scheme, a case study for an electrical relay is presented.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.2
• /
• pp.222-227
• /
• 2006

Recently the research for Traveling Salesman Problem (TSP) using DNA computing with massive parallelism has been. However, there were difficulties in real biological experiments because the conventional method didn't reflect the precise characteristics of DNA when it express graph. Therefore, we need DNA sequence generation algorithm which can reflect DNA features and reduce biological experiment error. In this paper we proposed a DNA sequence generation algorithm that applied DNA coding method of evolution model to DNA computing. The algorithm was applied to TSP, and compared with a simple genetic algorithm. As a result, the algorithm could generate good sequences which minimize error and reduce the biologic experiment error rate.

• Journal of Veterinary Science
• /
• v.22 no.6
• /
• pp.66.1-66.9
• /
• 2021

Background: Maedi/Visna virus (MVV) is a contagious viral pathogen that causes considerable economic losses to the sheep industry worldwide. Objectives: In China, MVV has been detected in several regions, but its molecular characteristics and genetic variations were not thoroughly investigated. Methods: Therefore, in this study, we conducted next-generation sequencing on an MVV strain obtained from northwest China to reveal its genetic evolution via phylogenetic analysis. Results: A MVV strain obtained from Inner Mongolia (NM) of China was identified. Sequence analysis indicated that its whole-genome length is 9193 bp. Homology comparison of nucleotides between the NM strain and reference strains showed that the sequence homology of gag and env were 77.1%-86.8% and 67.7%-75.5%, respectively. Phylogenetic analysis revealed that the NM strain was closely related to the reference strains isolated from America, which belong to the A2 type. Notably, there were 5 amino acid insertions in variable region 4 and a highly variable motif at the C-terminal of the surface glycoprotein (SU5). Conclusions: The present study is the first to show the whole-genome sequence of an MVV obtained from China. The detailed analyses provide essential information for understanding the genetic characteristics of MVV, and the results enrich the MVV library.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.7
• /
• pp.1794-1806
• /
• 2023

This study presents a method for capturing photographs of users as input and converting them into 2D character animation sprites using a generative adversarial network-based artificial intelligence network. Traditionally, 2D character animations have been created by manually creating an entire sequence of sprite images, which incurs high development costs. To address this issue, this study proposes a technique that combines motion videos and sample 2D images. In the 2D sprite generation process that uses the proposed technique, a sequence of images is extracted from real-life images captured by the user, and these are combined with character images from within the game. Our research aims to leverage cutting-edge deep learning-based image manipulation techniques, such as the GAN-based motion transfer network (impersonator) and background noise removal (U² -Net), to generate a sequence of animation sprites from a single image. The proposed technique enables the creation of diverse animations and motions just one image. By utilizing these advancements, we focus on enhancing productivity in the game and animation industry through improved efficiency and streamlined production processes. By employing state-of-the-art techniques, our research enables the generation of 2D sprite images with various motions, offering significant potential for boosting productivity and creativity in the industry.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.201-204
• /
• 2005

Recently, the generation of panoramic images and high quality mosaic images from video sequences has been attempted by a variety of investigations. Among a matter of investigation, in this paper, left and right stereo mosaic image generation utilizing airborne-video sequence images is focused upon. The stereo mosaic image is generated by creating left and right mosaic image which is generated by front and rear slit having different viewing angle in consecutive video frame images. The generation of stereo mosaic image proposed in this paper consists of several processes: camera parameter estimation for each video frame image, rectification, slicing, motion parallax elimination and image mosaicking. However it is necessary to check the feasibility on generating stereo mosaic image as explained processes. Therefore, in this paper, we performed the feasibility test on generating stereo mosaic image using video frame images. In doing so, anaglyphic image for stereo mosaic images is generated and tested for feasibility check.