• The Journal of the Convergence on Culture Technology
• /
• v.10 no.4
• /
• pp.663-668
• /
• 2024

This paper applies statistical analysis methods in the time domain to the fault diagnosis of wafer transfer robots, and proposes a methodology to discern the critical characteristics of vibration and torque signals. Subsequently, principal component analysis (PCA) is applied to diminish the data's dimensionality, followed by the development of a fault diagnosis algorithm utilizing Euclidean distance and Hotelling's T-square statistics. The algorithm establishes decision boundaries to categorize failure states based on the observed data. Our findings indicate that data classification incorporating velocity parameters enhances diagnostic accuracy. This approach serves to enhance the precision and efficacy of fault diagnosis.

• Journal of IKEEE
• /
• v.24 no.1
• /
• pp.127-131
• /
• 2020

Fuzzy C-Means(FCM) algorithm is frequently used as a representative image segmentation method using clustering. FCM divides the image space into cluster regions with similar pixel values, which requires a lot of segmentation time. In particular, the processing speed problem for analyzing various patterns of the current users of the web is more important. To solve this speed problem, this paper proposes an improved FCM (Improved FCM : IFCM) algorithm for segmenting the image into the Otsu threshold and FCM. In the proposed method, the threshold that maximizes the variance between classes of Otsu is determined, applied to the FCM, and the image is segmented. Experiments show that IFCM improves performance by shortening image segmentation time compared to conventional FCM.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2022.11a
• /
• pp.149-150
• /
• 2022

External forces acting on the mooring facilities include wave, wind, current, and ship's kinetic energy. In particular, the ship's kinetic energy is changing as the ship become larger, and larger carrying capacity. It was intended to analyze the berthing velocity measurement data at on tanker terminals equipped with a DAS (Docking Aid System) through statistical means and algorithms and use it as basic data for safer and more efficient pier design and pilotage.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.86-93
• /
• 1999

This paper proposes the multi-modular neural network and compensative input algorithm. The former is to reduce convergence speed which is one of the neural network's inveterate problems, and the latter is to improve the recognition performance of the neural network. This paper consists of two major parts and a simulation. First, it shows the structure of mu1ti-modular neural network, which is applied to the recognition of Korean, English characters and numbers. Second, it describes the compensative input algorithm and shows the steps that determine the compensative input. The proposed algorithm was tested and compared with the existing neural networks in the recognition of Korean and English characters and numbers. The convergence speed is three times or more faster than the existing neural network. In the case that compensative input was applied to neural network, the recognition rate was improved more than 10%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.4
• /
• pp.688-697
• /
• 2017

It is very difficult to solve mathematically the optimal control problem for non - linear mobile robots to move to target points with minimum energy related to velocity, acceleration and angular velocity in minimum time. This paper proposes a method to obtain optimal control gains with which mobile robots move with minimum energy related to velocity, acceleration and angular velocity in minimum time using genetic algorithms. Mobile robots are non - linear systems so that their optimal control gains depend on initial positions. Hence initial positions are divided into some partition points and optimal control gains are obtained at each partition point with genetical algorithms. These optimal control gains are used to train neural networks that generate proper control gains at arbitrary initial position. Finally computer simulation studies have been conducted to verify the effectiveness of the method proposed in this paper.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.3
• /
• pp.73-82
• /
• 2022

Driver acceptance of autonomous driving is very important. The autonomous driving longitudinal controller, which is one of the factors affecting acceptability, consists of a high-level controller and a low-level controller. The host controller decides the cruise control and the space control according to the situation and creates the required target speed. The sub-controller performs control by creating an acceleration signal to follow the target speed. In this paper, we propose an algorithm to improve the inter-vehicle distance fluctuations that occur in the cruise control and space control switching problems in the host controller. The proposed method is to add an approach algorithm to the cruise control at the time of switching from cruise control to space control so that it is switched to space control at the correct switching distance. Through this, the error was improved from 12m error to 4m, and actual vehicle verification was performed.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2008.06a
• /
• pp.25-31
• /
• 2008

본논문에서는이동형통신시스템의프로세서에대한최소전력소모를위한주파수선택알고리즘을제안하였다. 제안한 방법은 클럭 게이팅 방법을 이용하여 저전력 프로세서를 설계한다. 클럭 게이팅 방법은 내장된 클럭 블록을 이용하여 주 클럭을 제어함으로서 전력 낭비를 개선시킨다. 설계 방법은 프로세서에 대해 동적 전력을 고려하여 소모 전력을 비교하고, 설계된 프로세서에 대해 에너지 이득과 소모를 고려하여 주파수를 결정한다. 또한, 슬랙시간을 이용하여 프로세서의 속도를 낮추어 소모 전력을 감소시킨다. 이러한 기술은 클럭 게이팅 방법과 에너지, 슬랙 시간을 이용하여 이동형 시스템의사용 시간이 개선하였다. 실험결과 제안한 알고리즘은 알고리즘을 적용하지 않은 이동형 시스템의 프로세서에 비해 평균 전력이 4% 감소되었다.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2003.12a
• /
• pp.299-306
• /
• 2003

본 논문에서는 현재 사용되고 있는 소수성 검정 알고리즘의 효율성을 비교하여 효과적인 알고리즘 사용에 관한 방향을 제시하려 한다. 현재 가장 일반적으로 사용하고 있는 Miller-Rabin 소수성검정법(Miller-Rabin primality test)에 대하여, Miller-Rabin 소수성 검정법 이외에 다른 확률적 소수성 검정법으로 제안된 Frobenius-Grantham 소수성 검정법(Frobenius-Grantham primality test) 이 있다. 그러나 합성수 판별에 대한 확률적 우세함에도 불구하고, Miller-Rabin 소수성 검정법을 대체하고 있지 못하는 이유는 시간복잡도(time complexity)가 Randomized polynomial time이기 때문에 같은 확률에 대한 평균 실행 속도가 Miller-Rabin 소수성 검정법보다 크게 효율적이지 못하기 때문이다. 또한, 2002년 Manindra Agrawal이 제시한 AKS 알고리즘(AKS algorithm)은 최초의 다항식 시간내 결정적 소수성 검정법(Polynomial time deterministic primality test)이지만, 시간 복잡도에서 다항식의 차수가 높기 때문에 현재 사용되고 있는 확률적 소수성 검정법(Probabilistic primality test)을 대체하지 못할 것으로 사료된다. 본 논문에서는 최근 발표된 소수성 검정법인 Frobenius-Grantham 소수성 검정법, AKS 알고리즘과 기존의 Miller-Rabin 소수성 검정법의 장단점을 비교·분석해 보고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1409-1412
• /
• 2004

본 논문에서는 다중 공유 링크를 가진 스위치를 위한 세션 연결 설정 시 이를 어떤 링크에 할당할 것인지를 결정하는 경험적 세션할당 알고리즘을 제안한다. 제안 알고리즘은 새로운 세션이 소속된 서비스 클래스의 각 링크에 할당된 세션들의 예측된 지연들 중 가장 작은 예측 지연을 가진 링크에게 그 세션을 할당한다. 다른 세션할당 알고리즘에 비해 제안 알고리즘은 부클래스들의 예측지연 특성을 직접적으로 활용함으로써, 서비스 클래스들에게 사전에 예약된 대역폭을 제공하고, 동일한 서비스 클래스에 속한 세션들에게는 서로 다른 공유 링크를 통해 전송되어도 가능한 비슷한 지연을 제공한다는 것을 모의실험을 통해 확인했다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.1
• /
• pp.128-133
• /
• 2022

This paper deals with the graph in which the weights of edges are given the distances between two end vertices on a metric space. In particular, we will study about a path P with n vertices for these graphs. We obtain a new graph $\bar{P}$ by augmenting an edge to P. Then the length of the shortest path between two vertices on $\bar{P}$ is considered and we focus on the maximum of these lengths. This maximum is called the diameter of the graph $\bar{P}$. We wish to find the augmented edge to minimize the diameter of $\bar{P}$. Especially, for an arbitrary real number λ > 0, we should determine whether the diameter of $\bar{P}$ is less than or equal to λ and we propose an O(n)-time algorithm for this problem, which improves on the time complexity O(nlogn) previously known. Using this decision algorithm, for the length D of P, we provide an O(nlogD)-time algorithm to find the minimum of the diameter of $\bar{P}$.