• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.4
• /
• pp.111-117
• /
• 1998

In order to increase productivity of an assembly system composed of multiple robots along a conveyer line, an efficient sequence planning is necessary because the assembly time is dependent upon the assembly sequence. In this paper, a two-robot assembly system is considered in which two robots operate simultaneously and transfer parts from the part feeders to the workpiece on the conveyer one by one. In this case, the distance from the feeder to the workpiece varies with time because the workpiece moves at a constant speed on the conveyer. Hence, the sequence programming is not a trivial problem. Also, the two robots may interfere with each other kinematically and dynamically due to the simultaneous operation, so the sequence should be programmed to avoid the interferences. In this paper, the task sequence optimization problem is formulated and is solved by employing the simulated annealing which has been shown to be effective for solving large combinatorial optimizations.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.5
• /
• pp.1-7
• /
• 2018

Reference string recognition is to extract individual reference strings from a reference section of an academic article, which consists of a sequence of reference lines. This task has been attacked by heuristic-based, clustering-based, classification-based approaches, exploiting lexical and layout characteristics of reference lines. Most classification-based methods have used sequence labeling to assign labels to either a sequence of tokens within reference lines, or a sequence of reference lines. Unlike the previous token-level sequence labeling approach, this study attempts to assign different labels to the beginning, intermediate and terminating tokens of a reference string. After that, post-processing is applied to identify reference strings by predicting their beginning and/or terminating tokens. Experimental evaluation using English and German reference string recognition datasets shows that the proposed method obtains above 94% in the macro-averaged F1.

• BMB Reports
• /
• v.37 no.2
• /
• pp.144-147
• /
• 2004

Molecular amplification and sequencing of genomic DNA that encodes camel polyubiquitin (PUBC1) was performed by a polymerase chain reaction (PCR) using various sets of primers. The amplification generated a number of DNA fragments, which were sequenced and compared with the polyubiquitin coding sequences of various species. One DNA fragment that conformed to 325 bp was found to be 95 and 88% homologous to the sequences of human polyubiquitin B and C, respectively. The DNA translated into 108 amino acids that corresponded to two fused units of ubiquitin with no intervening sequence, which indicates that it is a polyubiquitin and contains at least two units of ubiquitin. Although, variations were found in the nucleotide sequence when compared to those of other species, the amino acid sequence was 100% homologous to the polyubiquitin sequences of humans, mice, and rats. This is the first report of the polyubiquitin DNA coding sequence and its corresponding amino acid sequence from camels, amplified using direct genomic DNA preparations.

• Journal of Integrative Natural Science
• /
• v.1 no.3
• /
• pp.230-233
• /
• 2008

A simple and rapid method is described for extending the 5'- or 3'-end genomic sequence of a known partial sequence by only a single round of PCR. This method involves digesting and ligating genomic and plasmid DNAs, and amplifying the 5'-upstream or 3'-end downstream sequence of the known DNA sequence, using two primers, one gene specific and the other plasmid specific. A single round of PCR amplification is sufficient to produce gene-specific bands detectable in gels. By using this approach, 5'-end genomic sequence of the D-amoeba sams gene was extended.

• Journal of the Korea Society for Simulation
• /
• v.26 no.1
• /
• pp.69-75
• /
• 2017

An MCP(Multi-chip Package) is a package consisting of several chips. Since several chips are stacked on the same substrate, multiple assembly steps are required to make an MCP. The characteristics of the chips in the MCP are dependent on the layer sequence. In the MCP manufacturing process, it is very essential to carefully consider the layer sequence in scheduling to achieve the intended throughput as well as the WIP balance. In this paper, we propose a scheduling methodology considering the layer sequence constraint.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.25 no.4
• /
• pp.296-311
• /
• 2021

Topological Data Analysis (TDA), a relatively new field of data analysis, has proved very useful in a variety of applications. The main persistence tool from TDA is persistent homology in which data structure is examined at many scales. Representations of persistent homology include persistence barcodes and persistence diagrams, both of which are not straightforward to reconcile with traditional machine learning algorithms as they are sets of intervals or multisets. The problem of faithfully representing barcodes and persistent diagrams has been pursued along two main avenues: kernel methods and vectorizations. One vectorization is the Betti sequence, or Betti curve, derived from the persistence barcode. While the Betti sequence has been used in classification problems in various applications, to our knowledge, the stability of the sequence has never before been discussed. In this paper we show that the Betti sequence is unstable under the 1-Wasserstein metric with regards to small perturbations in the barcode from which it is calculated. In addition, we propose a novel stabilized version of the Betti sequence based on the Gaussian smoothing seen in the Stable Persistence Bag of Words for persistent homology. We then introduce the normalized cumulative Betti sequence and provide numerical examples that support the main statement of the paper.

• The Mathematical Education
• /
• v.42 no.5
• /
• pp.707-723
• /
• 2003

Teaching the notion of limit of the sequence in high school mathematics needs special attention and accurate teaching methods, for it is one of the most important bases of the advanced mathematics. Therefore it is necessary for high school students to have the right understanding of the notion of limit of the sequence. In this paper, we survey several teaching methods of the notion of limit of the sequence in high school mathematics and introduce a new method using Excell program. Also through questionnaire survey we discuss and analyse students' reaction when they learn the notion of limit of the sequence. And based on that, we suggest a method that would be believed to improve the students' understanding for the notion of limit It should be also notified that questionnaire survey was performed in order to find out which method would be appropriate to teach the notion of limit of the sequence, and that the survey result was fully reflected in the guideline that suggested.

• Annual Conference on Human and Language Technology
• /
• 2018.10a
• /
• pp.567-569
• /
• 2018

한국어의 경어체는 종결어미에 따라 구분하고, 서로 다른 경어체는 각각 고유한 경어 강도가 있다. 경어체 간의 어체 변환은 규칙기반으로 진행되어 왔다. 본 논문은 어체 변환을 위한 규칙 정의의 번거로움을 줄이고 어체 변환 데이터만을 사용한 심층 학습 기반의 어체 변환 방법을 제안한다. 본 연구는 '해요체-합쇼체' 쌍의 병렬 데이터를 이용하여 Attention-based Sequence-to-Sequence 모델을 바탕으로 한 어체 변환 모델을 학습하였다. 해당 모델을 학습하고 실험하였을 때, 정확도 91%의 우수한 성과를 얻을 수 있었다.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.24 no.5
• /
• pp.55-61
• /
• 2010

When we design the control system used Programmable Logic Controller(PLC) by Sequential Function Chart(SFC), if we use a SFC, it is easy to know the sequential flow of control, to maintenance the controller and to describe a program. We program a SFC by a unique sequence, an alternative sequence and a parallel sequence. If we program a SFC by a alternative sequence, the memory size of a alternative sequence must be larger than the memory size of a unique sequence. Therefore this thesis show an efficient method to reduce a memory size and we confirmed its feasibility through actual example.

• The Journal of the Acoustical Society of Korea
• /
• v.39 no.5
• /
• pp.476-482
• /
• 2020

Sequence-to-sequence deep neural networks with attention mechanisms have shown superior performance across various domains, where the sizes of the input and the output sequences may differ. However, if the input sequences are much longer than the output sequences, and the characteristic of the input sequence changes within a single output token, the conventional attention mechanisms are inappropriate, because only a single context vector is used for each output token. In this paper, we propose a double-attention mechanism to handle this problem by using two context vectors that cover the left and the right parts of the input focus separately. The effectiveness of the proposed method is evaluated using speech recognition experiments on the TIMIT corpus.