• Molecules and Cells
• /
• v.20 no.1
• /
• pp.30-34
• /
• 2005

This study was carried out to identify a high-resolution marker for a gene conferring resistance to brown planthopper (BPH) biotype 1, using japonica type resistant lines. Bulked segregant analyses were conducted using 520 RAPD primers to identify RAPD fragments linked to the BPH resistance gene. Eleven RAPDs were shown to be polymorphic amplicons between resistant and susceptible progeny. One of these primers, OPE 18, which amplified a 923 bp band tightly linked to resistance, was converted into a sequence-tagged-site (STS) marker. The STS marker, BpE18-3, was easily detectable as a dominant band with tight linkage (3.9cM) to Bph1. It promises to be useful as a marker for assisted selection of resistant progeny in backcross breeding programs to introgress the resistance gene into elite japonica cultivars.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.4
• /
• pp.1279-1287
• /
• 2006

The purpose of this paper is to present a new algorithm for extracting the consensus pattern, or motif from sequence belonging to the same family. Two methods are considered for feature interval partitioning based on equal probability and equal width interval partitioning. C2H2 zinc finger protein and epidermal growth factor protein sequences are used to demonstrate the effectiveness of the proposed algorithm for motif extraction. For two protein families, the equal width interval partitioning method performs better than the equal probability interval partitioning method.

• International Journal of Industrial Entomology and Biomaterials
• /
• v.10 no.2
• /
• pp.79-86
• /
• 2005

Molecular markers have increasingly been used in plant genetic analysis, due to their obvious advantages over conventional phenotypic markers, as they are highly polymorphic, more in number, stable across different developmental stages, neutral to selection and least influenced by environmental factors. Among the PCR based marker techniques, ISSR is one of the simplest and widely used techniques, which involves amplification of DNA segment present at an amplifiable distance in between two identical microsatellite repeat regions oriented in opposite direction. Though ISSR markers are dominant like RAPD, they are more stable and reproducible. Because of these properties ISSR markers have recently been found using extensively for finger printing, pohylogenetic analysis, population structure analysis, varietal/line identification, genetic mapping, marker-assisted selection, etc. In mulberry (Morus spp.), ISSR markers were used for analyzing phylogenetic relationship among cultivated varieties, between tropical and temperate mulberry, for solving the vexed problem of identifying taxonomic positions of genotypes, for identifying markers associated with leaf yield attributing characters. As ISSR markers are one of the cheapest and easiest marker systems with high efficiency in generating polymorphism among closely related varieties, they would play a major role in mulberry genome analysis in the future.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.3
• /
• pp.118-126
• /
• 2009

This research investigates the problem of minimizing setup costs in resequencing jobs having first-in, first-out(FIFO) constraints at conveyorized production or assembly systems. Sequence changing at conveyor junctions in these systems is limited due to FIFO restriction. We first define the general problem of resequencing jobs to workstations satisfying precedence relationships between jobs(Generalized Sequential Ordering Problem, GSOP). Then we limit our scope to FIFO precedence relationships which is the conveyor selection problem at a diverging junction(Diverging Sequential Ordering Problem, DSOP), modeling it as a 0-1 integer program. With the capacity constraint removed, we show that the problem can be modeled as an assignment problem. In addition, we proposed and evaluated the heuristic algorithm for the case where the capacity constraint cannot be removed. Finally, we discuss the case study which motivated this research and numerical results.

• Proceedings of the Korean Society of Crop Science Conference
• /
• 2017.06a
• /
• pp.58-58
• /
• 2017

The advent of next generation sequencing technology has elicited plenty of sequencing data available in agriculturally relevant plant species. For most crop species, it is too expensive to obtain the whole genome sequence data with sufficient coverage. Thus, many approaches have been developed to bring down the cost of NGS. Genotyping-by-sequencing (GBS) is a cost-effective genotyping method for complex genetic populations. GBS can be used for the analysis of genomic selection (GS), genome-wide association study (GWAS) and constructing haplotype and genetic linkage maps in a variety of plant species. For efficiently dealing with plant GBS data, the TASSEL-GBS pipeline is one of the most popular choices for many researchers. TASSEL-GBS is JAVA based a software package to obtain genotyping data from raw GBS sequences. Here, we describe application of GBS and bioinformatics pipeline of TASSEL-GBS for analyzing plant genetics data.

• International Journal of Contents
• /
• v.8 no.4
• /
• pp.56-63
• /
• 2012

In recent decades, analyzing the activities of human brain achieved some accomplishments by using the functional Magnetic Resonance Imaging (fMRI) technique. fMRI data provide a sequence of three-dimensional images related to human brain's activity which can be used to detect instantaneous cognitive states by applying machine learning methods. In this paper, we propose a new approach for distinguishing human's cognitive states such as "observing a picture" versus "reading a sentence" and "reading an affirmative sentence" versus "reading a negative sentence". Since fMRI data are high dimensional (about 100,000 features in each sample), extremely sparse and noisy, feature selection is a very important step for increasing classification accuracy and reducing processing time. We used the Fisher Discriminant Ratio to select the most powerful discriminative features from some Regions of Interest (ROIs). The experimental results showed that our approach achieved the best performance compared to other feature extraction methods with the average accuracy approximately 95.83% for the first study and 99.5% for the second study.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2268-2283
• /
• 2013

Scalable video coding can handle peer heterogeneity of P2P streaming applications, but there is still a lack of comprehensive studies on how to use it to improve video playback quality. In this paper we propose a capacity aware scalable video coding mechanism for P2P on demand streaming system. The proposed mechanism includes capacity based neighbor selection, adaptive data scheduling and streaming layer adjustment, and can enable each peer to select appropriate streaming layers and acquire streaming chunks with proper sequence, along with choosing specific peers to provide them. Simulation results show that the presented mechanism can decrease the system's startup and playback delay, and increase the video playback quality as well as playback continuity, and thus it provides a better quality of experience for users.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.419-420
• /
• 2006

In the new video coding standard H.264/AVC, motion estimation (ME) is allowed to search multiple reference frames for improve the rate-distortion performance. The complexity of multi-frame motion estimation increases linearly with the number of used reference frame. However, the distortion gain given by each reference frame varies with the video sequence, and it is not efficient to search through all the candidate frames. In this paper, we propose a fast mult-frame selection method using all zero coefficient block (AZCB) prediction and sum of difference (SAD) of neighbor block. Simulation results show that the speed of the proposed algorithm is up to two times faster than exhaustive search of multiple reference frames with similar quality and bit-rate.

• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.2
• /
• pp.1-16
• /
• 1991

This paper deals with some critical activities of CAPP system such as generation of part description database, part feature recognition, process and operation selection, and sequencing method for turning operation of symmetric rotational parts. The part description database is generated by data conversion module from CAD data, and the part feature is recognized by using both pattern primitives and feature recognition rules. Machining processes and operations are selected based on machining surface features and its sequence is determined by rules acquired from process planning expert. AutoCAD is employed as CAD system and computer program is developed by using Turbo-C on IBM PC/AT compatible system.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.3
• /
• pp.329-343
• /
• 1995

Traditionally, machining process sequence was influenced and constrained by the design information obtained from CAD data base, i.e., class of operations, geometric shape, tooling, geometric tolerance, etc. However, even though all the constraints from design information are considered, there may exist more than one way to feasibly machine parts. This research is focused on the integrated problem of operations sequencing and machine tools selection in the presence of the product mix and their production volumes. With the transitional costs among machining operations, the operation sequencing problem can be formulated as a well-known Traveling Salesman Problem (TSP). The transitional cost between two operations is expressed as the sum of total machining time of the parts on a machine for the first operation and transportation time of the parts from the first machine to a machine for the second operation. Therefore, the operation sequencing problem formulated as TSP cannot be solved without transitional costs for all operation pairs. When solved separately or serially, their mutual optima cannot be guaranteed. Machining operations sequencing and machine tool selection problems are two core problems in process planning for discretely machined parts. In this paper, the interrelated two problems are integrated and analyzed, zero-one integer programming model for the integrated problem is formulated, and the solution methods are developed using a Tabu Search technique.