• ETRI Journal
• /
• 제42권1호
• /
• pp.101-107
• /
• 2020

For Korean language processing, morphological analysis is a critical component that requires extensive work. This morphological analysis can be conducted in an end-to-end manner without requiring a complicated feature design using a sequence-to-sequence model. However, the sequence-to-sequence model has a time complexity of O(n²) for an input length n when using the attention mechanism technique for high performance. In this study, we propose a linear-time Korean morphological analysis model using a local monotonic attention mechanism relying on monotonic alignment, which is a characteristic of Korean morphological analysis. The proposed model indicates an extreme improvement in a single threaded environment and a high morphometric F1-measure even for a hard attention model with the elimination of the attention mechanism formula.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 B
• /
• pp.376-379
• /
• 2003

DNA computing based DNA sequence Is operated through the biology experiment. Biology experiment used as operator causes illegal reactions through shifted hybridization, mismatched hybridization, undesired hybridization of the DNA sequence. So, it is essential to design DNA sequence to minimize the potential errors. This paper proposes method of the DNA sequence generation based evolutionary operation processor. Genetic algorithm was used for evolutionary operation and extra hardware, namely genetic algorithm processor was implemented for solving repeated evolutionary process that causes much computation time. To show efficiency of the Proposed processor, excellent result is confirmed by comparing between fitness of the DNA sequence formed randomly and DNA sequence formed by genetic algorithm processor. Proposed genetic algorithm processor can reduce the time and expense for preparing DNA sequence that is essential in DNA computing. Also it can apply design of the oligomer for development of the DNA chip or oligo chip.

• Journal of Information Processing Systems
• /
• 제19권3호
• /
• pp.370-376
• /
• 2023

Aiming at the problems of low image enhancement accuracy, long enhancement time and poor image quality in the traditional robot sequence motion image enhancement methods, an adaptive enhancement method for robot sequence motion image is proposed. The feature representation of the image was obtained by Karhunen-Loeve (K-L) transformation, and the nonlinear relationship between the robot joint angle and the image feature was established. The trajectory planning was carried out in the robot joint space to generate the robot sequence motion image, and an adaptive homomorphic filter was constructed to process the noise of the robot sequence motion image. According to the noise processing results, the brightness of robot sequence motion image was enhanced by using the multi-scale Retinex algorithm. The simulation results showed that the proposed method had higher accuracy and consumed shorter time for enhancement of robot sequence motion images. The simulation results showed that the image enhancement accuracy of the proposed method could reach 100%. The proposed method has important research significance and economic value in intelligent monitoring, automatic driving, and military fields.

• 경영과학
• /
• 제12권2호
• /
• pp.77-87
• /
• 1995

In this paper we develop an efficient heuristic algorithm for the problem of scheduling n sequence-dependent jobs on a basic processor to minimize makespan. Efficient solution methods are already known for the sequence- independent case. But for the sequence-dependent case, this problem belongs to a set of strong NP-complete problems. We present a heuristic which is similar to shortest setup time heuristic but opportunity cost of setup time rather than shortest setup time is used for choosing next job. This heuristic algorithm has same computational complexity and worst case ratio as the shortest setup time heuristic. We used Wilcoxon signed rank test to show that our heuristic is superior to nearest setup time heuristic in term of average behavior.

• 한국소음진동공학회논문집
• /
• 제16권6호
• /
• pp.627-633
• /
• 2006

The tire is considered as one of the important noise sources having an influence on vehicle's performance. The Pattern noise of a tire is the transmission sound of airborne noise. On smooth asphalt road, Pattern noise is amplified with the velocity. In recent, the study on the reduction of Pattern noise is energetically processed. Pattern noise is strongly related with pitch sequence. To reduce the pattern noise, tire's designer has to randomize the sequence of pitch. The FFT is a traditional method to evaluate the level of the randomization of the pitch sequence, but gives no information on time-varying, instantaneous frequency. In the study, we found that Time-Frequency transform is a useful method to non-stationary signal such as tire noise.

• 전기전자학회논문지
• /
• 제16권1호
• /
• pp.51-55
• /
• 2012

본 논문에서는 순환천이변조 (CCSK: cyclic code shift keying) 시퀀스로 삼진 시퀀스를 적용하는 것을 제안하였다. 그리고 순환천이변조를 적용한 주파수도약대역확산/시분할다중접속 (FHSS/TDMA: frequency hopping spread spectrum/time division multiple access) 시스템에서 성능을 모의실험 하였다. 실험에서 무선 채널은 레일레이(Rayleigh) 페이딩 채널로 모델링하였다. 모의 실험 결과로부터 순환천이변조 시퀀스로 무작위 시퀀스를 사용한 시스템보다 삼진 시퀀스를 적용한 시스템이 더 높은 성능을 보이는 것이 증명되었다.

• Geomechanics and Engineering
• /
• 제13권5호
• /
• pp.845-860
• /
• 2017

It is very important to study displacement prediction in geotechnical engineering. Nowadays, the grey system method, time series analysis method and artificial neural network method are three main methods. Based on the brief introduction, the three methods are analyzed comprehensively. Their merits and demerits, applied ranges are revealed. To solve the shortcomings of the artificial neural network method, a new prediction method based on new evolutionary neural network is proposed. Finally, through two real engineering applications, the analysis of three main methods and the new evolutionary neural network method all have been verified. The results show that, the grey system method is a kind of exponential approximation to displacement sequence, and time series analysis is linear autoregression approximation, while artificial neural network is nonlinear autoregression approximation. Thus, the grey system method can suitably analyze the sequence, which has the exponential law, the time series method can suitably analyze the random sequence and the neural network method almostly can be applied in any sequences. Moreover, the prediction results of new evolutionary neural network method is the best, and its approximation sequence and the generalization prediction sequence are all coincided with the real displacement sequence well. Thus, the new evolutionary neural network method is an acceptable method to predict the measurement displacements of geotechnical engineering.

• 전자공학회논문지SC
• /
• 제47권1호
• /
• pp.35-41
• /
• 2010

제품완성업체에서 생산성과 양품률을 향상시키기 위해서는 조립라인에서 필요로 하는 부품이 순서에 맞게 적시에 공급되어져야 하며, 이종부품의 공급으로 인한 조립라인을 멈추는 시간이 없어야 한다. 본 논문에서는 기존 바코드 기반 부품공급 시스템에서 이종부품 확인 및 서열 작업시 발생하는 수작업에 의한 불필요하게 소모되는 시간과 재사용이 불가능한 바코드 라벨 및 서열지로 인한 소모성 비용을 제거하고, RFID 기반의 부품공급 시스템이 가진 태그의 거리에 따른 인식률 저하로 인한 전송거리제한으로 발생하는 실시간 이종부품 확인 및 부품서열 관리의 어려움을 극복하는 방법으로 RFID와 USN이 융합된 형태인 스마트 파렛트기반의 직서열 부품공급 시스템을 제안하고, 간단한 구현을 통해 실현성을 입증하고자 한다.

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

• 산업공학
• /
• 제12권2호
• /
• pp.346-353
• /
• 1999

In this paper, the optimum drilling operation sequence which results into the minimum overall machining time required to produce a (multi-diameter) hole is identified. The operation sequence is defined as the set of ordered operations used for producing a (multi-diameter) hole. The overall machining time is derived by summing the minimum machining times of each operation assigned to a sequence. The operations represent the drilling actions of certain sizes to produce the related holes. The minimum machining time of each operation is obtained by solving the optimization problem. Finally, this paper will identify the effects of machining constraints on the overall machining times and their relationships to sequence selection.