• 한국정밀공학회지
• /
• 제15권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.

• 한국컴퓨터정보학회논문지
• /
• 제23권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
• /
• 제37권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.

• 통합자연과학논문집
• /
• 제1권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.

• 한국시뮬레이션학회논문지
• /
• 제26권1호
• /
• pp.69-75
• /
• 2017

MCP(Multi-chip Package)는 두 개 이상의 Chip을 적층하여 하나의 패키지로 합친 제품이다. MCP를 만들기 위해서는 두 개 이상의 Chip이 동일한 Substrate에 적층되기 때문에 다수의 조립 공정이 필요하다. Package 공정에서는 Lot들이 동일한 특성을 가지는 Chip으로 구성되고 MCP를 구성하는 Chip의 특성은 Layer sequence에 의해 결정된다. MCP 생산 공정에서 WIP Balance 뿐만 아니라 Throughput을 달성하기 위해서는 Chip의 Layer sequence가 중요하다. 본 논문에서는 Chip들의 Layer sequence의 제약 조건을 고려한 스케쥴링 방법론을 제안한다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제25권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.

• 한국음향학회지
• /
• 제39권5호
• /
• pp.476-482
• /
• 2020

입력열과 출력열의 길이가 다른 경우 attention 기법을 이용한 sequence-to-sequence 심층 신경망이 우수한 성능을 보인다. 그러나, 출력열의 길이에 비해서 입력열의 길이가 너무 긴 경우, 그리고 하나의 출력값에 해당하는 입력열의 특성이 변화하는 경우, 하나의 문맥 벡터(context vector)를 사용하는 기존의 attention 방법은 적당하지 않을 수 있다. 본 논문에서는 이러한 문제를 해결하기 위해서 입력열의 왼쪽 부분과 오른쪽 부분을 각각 개별적으로 처리할 수 있는 두 개의 문맥 벡터를 사용하는 이중 attention 기법을 제안한다. 제안한 방법의 효율성은 TIMIT 데이터를 사용한 음성 인식 실험을 통하여 검증하였다.

• 한국시뮬레이션학회논문지
• /
• 제25권3호
• /
• pp.133-146
• /
• 2016

단일 발사대에 탑재된 다수의 유도탄이 다수의 표적과 순차적으로 교전하는 상황에서 발사대는 유도탄이 해당 표적을 타격할 수 있도록 적절한 발사각을 설정하여 구동하게 된다. 이 때, 개별 표적에 대해 할당된 순서대로 교전을 수행하게 되면 전체 교전 시간이 길어지며, 이동하는 표적이 교전 가능 영역을 벗어나게 되어 부분적으로 교전에 실패할 가능성이 있다. 따라서 다양한 표적 배치 상황에서 최적 교전을 수행할 수 있는 발사각 시퀀스(Sequence)에 대한 연구가 필수적이다. 본 연구에서는 다수의 이동하는 표적이 있는 전장 시나리오에서 시뮬레이션을 통해 모든 발사각 시퀀스에 대한 결과를 계산하고, 이 중 전체 교전 시간을 최소화 하는 최적의 발사각 시퀀스를 추출하는 과정을 통해 표적 시나리오에 따른 시퀀스 결정 논리를 모델링하였다. 그리고 그 모델링 결과를 통해 나온 교전 시퀀스와 시뮬레이션을 통해 획득한 최적 혹은 준최적 발사각 시퀀스를 비교함으로써 본 연구에서 제안한 최적 발사각 시퀀스 결정 개념을 검증하였다.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제42권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.

• 한국정보과학회 언어공학연구회:학술대회논문집(한글 및 한국어 정보처리)
• /
• 한국정보과학회언어공학연구회 2018년도 제30회 한글 및 한국어 정보처리 학술대회
• /
• pp.567-569
• /
• 2018

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