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

• 호남수학학술지
• /
• 제41권4호
• /
• pp.725-744
• /
• 2019

In this paper we introduce some new types of double difference sequence spaces defined by a new definition of convergence of double sequences and a double series with the help of sequence of Orlicz functions and a four dimensional bounded regular matrices A = (a_rtkl). We also make an effort to study some topological properties and inclusion relations between these sequence spaces. Finally, we compute the closed ideals in the space 𝑙²_∞.

• 한국멀티미디어학회논문지
• /
• 제4권6호
• /
• pp.554-561
• /
• 2001

워터마킹 방법 중에서 주파수 특성과 공간영역의 특성을 함께 가지고 있는 웨이브릿 변환 알고리듬이 많이 사용되고 있다. 본 논문에서는 다양한 공격에 대해 강인한 워터마킹을 갖는 시퀀스를 찾기 위해 임의난수, 가우시안 시퀀스, 카오스 시퀀, 소벨 시퀀스를 이용하여 유사도를 측정하였다. 실험 결과는 카오스 시퀀스가 다양한 공격에도 강인한 특성을 갖는 시퀀스라는 것을 검증하였다.

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

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제14권3호
• /
• pp.209-215
• /
• 2014

Sequence tagging is the task of predicting frame-wise labels for a given input sequence and has important applications to diverse domains. Conventional methods such as maximum likelihood (ML) learning matches global features in empirical and model distributions, rather than local features, which directly translates into frame-wise prediction errors. Recent probabilistic sequence models such as conditional random fields (CRFs) have achieved great success in a variety of situations. In this paper, we introduce a novel discriminative CRF learning algorithm to minimize local feature mismatches. Unlike overall data fitting originating from global feature matching in ML learning, our approach reduces the total error over all frames in a sequence. We also provide an efficient gradient-based learning method via gradient forward-backward recursion, which requires the same computational complexity as ML learning. For several real-world sequence tagging problems, we empirically demonstrate that the proposed learning algorithm achieves significantly more accurate prediction performance than standard estimators.

• 조명전기설비학회논문지
• /
• 제24권5호
• /
• pp.55-61
• /
• 2010

PLC 제어 시스템은 SFC 언어를 사용하여 설계할 경우, SFC 언어를 사용하면 제어의 흐름을 이해하기 쉽고, 유지보수가 용이하며 프로그램의 기술성이 뛰어나다. SFC 언어는 단일 시퀀스, 선택 시퀀스, 병렬 시퀀스로 나누어지며, 선택 시퀀스로 프로그래밍 하면 단일 시퀀스로 프로그램할 때보다 메모리의 크기가 커져야 한다. 본 논문에서는 선택 시퀀스의 기능을 단일 시퀀스로 구현하여 메모리의 크기를 줄여서 메모리의 효율을 향상시키는 방법을 제시하고, 실례를 통해 타당성을 확인하였다.

• 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.

• Kyungpook Mathematical Journal
• /
• 제51권4호
• /
• pp.385-393
• /
• 2011

The aim of this paper is to introduce and study the sequence spaces [w, ${\theta}$, F, p, q]$_{\infty}({\Delta}_{\upsilon}^m)$, [w, ${\theta}$, F, p, q]$_1({\Delta}_{\upsilon}^m)$ and [w, ${\theta}$, F, p, q]$_0({\Delta}_{\upsilon}^m)$, which arise from the notions of generalized difference sequence space, lacunary convergence, invariant mean and a sequence of Moduli $F=(f_k)$. We establish some inclusion relations between these spaces under some conditions.

• Journal of Mechanical Science and Technology
• /
• 제20권10호
• /
• pp.1541-1547
• /
• 2006

An efficient procedure to obtain the optimal stacking sequence and the minimum weight of stiffened laminated composite curved panels under several loading conditions and stiffener layouts has been developed based on the finite element method and the genetic algorithm that is powerful for the problem with integer variables. Often, designing composite laminates ends up with a stacking sequence optimization that may be formulated as an integer programming problem. This procedure is applied for a problem to find the stacking sequence having a maximum critical buckling load factor and the minimum weight. The object function in this case is the weight of a stiffened laminated composite shell. Three different types of stiffener layouts with different loading conditions are investigated to see how these parameters influence on the stacking sequence optimization of the panel and the stiffeners. It is noticed from the results that the optimal stacking sequence and lay-up angles vary depending on the types. of loading and stiffener spacing.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2012년도 전력전자학술대회 논문집
• /
• pp.154-155
• /
• 2012

The dynamic voltage restorer (DVR) is an effective protection device for wind turbine generator based on doubly-fed induction generator (DFIG) operated under the unbalanced voltage dip conditions. The compensating voltages of DVR depend on the voltage dips and on the influence of the zero sequence components. If the $Y_0/{\Delta}$ step-up transformers are used, there are no zero sequence components on the DFIG side. However, if the $Y_0/Y_0$ step-up transformers are used, the zero sequence components will appear during faults. The zero sequence components result in the high insulation costs and the asymmetric of the terminal voltages. This paper proposes a method for controlling zero sequence components in DVR to protect DFIG under unbalanced voltage dips. Simulation results are presented to verify the effectiveness of the proposed control method.