• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.6
• /
• pp.197-208
• /
• 1999

This paper presents an operation sequence-based approach for determining machine cell layout in a cellular manufacturing environment. The proposed model considers the sequence of operations in evaluating the intercell and intracell movements. In this paper, design of cellular layout has an objective of minimization of total material flow among facilities, where the total material flow is defined as a weighted sum of both intercell and intracell part movements. The proposed algorithm is developed by using genetic algorithm and can be used to design an optimal cellular layout which can cope with changes of shop floor situation by considering constraints such as the number of machine cells and the number of machines in a machine cell.

• Journal of Korean Society for Quality Management
• /
• v.17 no.1
• /
• pp.35-47
• /
• 1989

This paper is concerned with a development and evaluation of heuristic algorithms for the n-job, M-stage flowshop with sequence dependent setup times. Three heuristic algorithms, CAIDAN, DANNEN and PETROV, are proposed. The makespan is taken as a performance measure for the algorithms. The experiment for each algorithm is designed for a $4{\times}3{\times}3$ factorial design with 360 observations. The experimental factors are PS (ratio of processing times to setup times), M (number of machines), and N (number of jobs). The makespan of the proposed heuristic algorithms is compared with the optimal makespan obtained by the complete enumeration method. The result of comparision of performance measure is called a relative error. The mean relative errors of CAIDAN, DANNEN and PETROV algorithms are 4.488%. 6.712% and 7.282%, respectively. The computational results are analysed using SPSS. The experimental results show that the three factors are statistically signiticant at 5% level.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.229-232
• /
• 2007

This paper investigates on the use of constant-amplitude zero-autocorrelation (CAZAC) sequence for channel estimation in multiple-input multiple-output (MIMO) system over indoor wireless channel. Since the symbol-length of the conventional 4-phase CAZAC sequence is short, there is a limitation to use it for MIMO system in multipath environments. An algorithm which generates longer CAZAC sequences is proposed to overcome that problem. Flexible symbol-length of 4-phase CAZAC sequences can be made by the proposed algorithm. Therefore appropriate symbol-length of CAZAC sequences could be utilized as preambles in accordance with the number of transmit antennas and channel condition. The effect of the number of CAZAC sequences for channel estimation is presented in terms of mean square error (MSE).

• Genomics & Informatics
• /
• v.3 no.3
• /
• pp.94-97
• /
• 2005

We have built a database server called Patome which contains the annotation information for patented bio-sequences from the Korean Intellectual Property Office (KIPO). The aims of the Patome are to annotate Korean patent bio-sequences and to provide information on patent relationship of public database entries. The patent sequences were annotated with Reference Sequence (RefSeq) or NCBI's nr database. The raw patent data and the annotated data were stored in the database. Annotation information can be used to determine whether a particular RefSeq ID or NCBI's nr ID is related to Korean patent. Patome infrastructure consists of three components­the database itself, a sequence data loader, and an online database query interface. The database can be queried using submission number, organism, title, applicant name, or accession number. Patome can be accessed at http://www.patome.net. The information will be updated every two months.

• Journal of The Korean Radiological Technologist Association
• /
• v.30 no.1
• /
• pp.7-10
• /
• 2004

It is number that statistics is received by sequence of mass observation. This observes by large quantity about its part of element or one part and projects when is fixed and fixed congregate existing circumstances in place. And it is work which figure it

• Bulletin of the Korean Mathematical Society
• /
• v.36 no.4
• /
• pp.661-669
• /
• 1999

L. Degui introduced an upper bound of Reidemeister number. In this paper we give a simple proof of Degui's Theorem.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.7-7
• /
• 2003

We studied closed set-valued Choquet integrals in two papers(1997, 2000) and convergence theorems under some sufficient conditions in two papers(2003), for examples : (i) convergence theorems for monotone convergent sequences of Choquet integrably bounded closed set-valued functions, (ii) covergence theorems for the upper limit and the lower limit of a sequence of Choquet integrably bounded closed set-valued functions. In this presentation, we consider fuzzy number-valued functions and define Choquet integrals of fuzzy number-valued functions. But these concepts of fuzzy number-valued Choquet inetgrals are all based on the corresponding results of interval-valued Choquet integrals. We also discuss their properties which are positively homogeneous and monotonicity of fuzzy number-valued Choquet integrals. Furthermore, we will prove convergence theorems for fuzzy number-valued Choquet integrals. They will be used in the following applications : (1) Subjectively probability and expectation utility without additivity associated with fuzzy events as in Choquet integrable fuzzy number-valued functions, (2) Capacity measure which are presented by comonotonically additive fuzzy number-valued functionals, and (3) Ambiguity measure related with fuzzy number-valued fuzzy inference.

• Journal of Ginseng Research
• /
• v.38 no.2
• /
• pp.130-135
• /
• 2014

Background: Panax ginseng, the most famous medicinal herb, has a highly duplicated genome structure. However, the genome duplication of P. ginseng has not been characterized at the sequence level. Multiple band patterns have been consistently observed during the development of DNA markers using unique sequences in P. ginseng. Methods: We compared the sequences of multiple bands derived from unique expressed sequence tagsimple sequence repeat (EST-SSR) markers to investigate the sequence level genome duplication. Results: Reamplification and sequencing of the individual bands revealed that, for each marker, two bands around the expected size were genuine amplicons derived from two paralogous loci. In each case, one of the two bands was polymorphic, showing different allelic forms among nine ginseng cultivars, whereas the other band was usually monomorphic. Sequences derived from the two loci showed a high similarity, including the same primer-binding site, but each locus could be distinguished based on SSR number variations and additional single nucleotide polymorphisms (SNPs) or InDels. A locus-specific marker designed from the SNP site between the paralogous loci produced a single band that also showed clear polymorphism among ginseng cultivars. Conclusion: Our data imply that the recent genome duplication has resulted in two highly similar paralogous regions in the ginseng genome. The two paralogous sequences could be differentiated by large SSR number variations and one or two additional SNPs or InDels in every 100 bp of genic region, which can serve as a reliable identifier for each locus.

• Korean Journal of Veterinary Research
• /
• v.48 no.4
• /
• pp.441-449
• /
• 2008

The genus Lactobacillus is the largest of the genera included in lactic acid bacteria and is associated with mucosal membranes of human and animal. Only a few Lactobacillus plasmid-encoded functions have been discovered and used. In this study, a novel plasmid (pILR091) was isolated from a wild L. reuteri isolated from pig and described the characteristics of its replicons, genetic organization, and relationship with other plasmids. After digestion of the plasmid, pILR091, with SalI, plasmid DNA was cloned into the pQE-30Xa vector and sequenced. The complete sequence was confirmed by the sequencing of PCR products and analyzed with the Genbank database. The isolate copy number and stability were determined by quantitative-PCR. The complete sequence of L. reuteri contained 7,185 nucleotides with 39% G-C content and one cut site by two enzymes, SalI and HindIII. The similar ori sequence of the pC194- rolling circle replication family (TTTATATTGAT) was located 63 bp upstream of the protein replication sequence, ORF 1. Total of five ORFs was identified and the coding sequence represented 4,966 nucleotides (70.4%). ORF1 of pILR091 had a low similarity with the sequence of pTE44. Other ORFs also showed low homology and E-values. The average G-C content of pILR091 was 39%, similar with that of genomic DNA. The copy number of pILR091 was determined at approximately 24 to 25 molecules per genomic DNA. These results suggested that pILR091 might be a good candidate to construct a new vector, which could be used for cloning and expression of foreign genes in lactobacilli.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.693-707
• /
• 2006

To improve performance using a multidimensional index in similar sequence matching, we transform a high-dimensional sequence to a low-dimensional sequence, and then construct a low-dimensional MBR that contains multiple transformed sequences. In this paper we propose a formal method that transforms a high-dimensional MBR itself to a low-dimensional MBR, and show that this method significantly reduces the number of lower-dimensional transformations. To achieve this goal, we first formally define the new notion of MBR-safe. We say that a transform is MBR-safe if a low-dimensional MBR to which a high-dimensional MBR is transformed by the transform contains every individual low-dimensional sequence to which a high-dimensional sequence is transformed. We then propose two MBR-safe transforms based on DFT and DCT, the most representative lower-dimensional transformations. For this, we prove the traditional DFT and DCT are not MBR-safe, and define new transforms, called mbrDFT and mbrDCT, by extending DFT and DCT, respectively. We also formally prove these mbrDFT and mbrDCT are MBR-safe. Moreover, we show that mbrDFT(or mbrDCT) is optimal among the DFT-based(or DCT-based) MBR-safe transforms that directly convert a high-dimensional MBR itself into a low-dimensional MBR. Analytical and experimental results show that the proposed mbrDFT and mbrDCT reduce the number of lower-dimensional transformations drastically, and improve performance significantly compared with the $na\"{\i}ve$ transforms. These results indicate that our MBR- safe transforms provides a useful framework for a variety of applications that require the lower-dimensional transformation of high-dimensional MBRs.