• 한국통신학회논문지
• /
• 제12권6호
• /
• pp.545-553
• /
• 1987

큐 길이를 제한하는 단일 서버 탄뎀 큐의 망에 대한 수식적인 근사 해법을 제시하였다. 유한 길이 큐를 갖는 큐잉망에서는 큐 길이의 제한 때문에 블록킹이 발생하며 이 블록킹은 각 큐 간에 상호 종속적으로 발생한다. 따라서 이러한 큐잉망을 해석하는 데는 어려움이 따른다. 본 논문에서는 이러한 블록킹이 발생하는 망을 해석하기 위해 종속하는 스테이션들의 블록킹을 고려하여 현 스테이션으로의 메시지 도착률을 증가시키므로 각각의 큐를 독립 M/M/1/K시스팀으로 해석하였다. 이 근사 해법을 이용하여 각 스테이션의 상태 확률, 평균 큐 길이, 대기 시간 등을 쉽게 구하였다. 제시한 근사 해법의 정당성을 입증하기 위해 이 근사 해법의 결과와 상태 천이 연립 방정식에 의해 구한 값을 비교하였으며 컴퓨터 시뮤레이션으로 검증하였다.

• 상하수도학회지
• /
• 제35권6호
• /
• pp.507-516
• /
• 2021

In this study, the machine learning which has been widely used in prediction algorithms recently was used. the research point was the CD(chudong) point which was a representative point of Daecheong Lake. Chlorophyll-a(Chl-a) concentration was used as a target variable for algae prediction. to predict the Chl-a concentration, a data set of water quality and quantity factors was consisted. we performed algorithms about random forest and gradient boosting with Python. to perform the algorithms, at first the correlation analysis between Chl-a and water quality and quantity data was studied. we extracted ten factors of high importance for water quality and quantity data. as a result of the algorithm performance index, the gradient boosting showed that RMSE was 2.72 mg/m³ and MSE was 7.40 mg/m³ and R² was 0.66. as a result of the residual analysis, the analysis result of gradient boosting was excellent. as a result of the algorithm execution, the gradient boosting algorithm was excellent. the gradient boosting algorithm was also excellent with 2.44 mg/m³ of RMSE in the machine learning hyperparameter adjustment result.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.44.5-44
• /
• 2001

This paper proposes the algorithm which a mobile robot tracks the object captured by ultrasonic sensors of the robot and automatically generates a path according to the object In the proposed algorithm, a robot detects movements of the object as using ultrasonic sensors and then the robot follows the moving object. This algorithm simplifies robot path planning. The eight ultrasonic sensors on the robot capture distances between the robot and objects. The robot detects the movements of the object by using the changes of the distances captured by ultrasonic sensors. The target position of the robot is determined as the position of the detected moving object. The robot follows the object according to this movement strategy. The effectiveness of the proposed algorithm is verified through experiments.

• 한국음향학회지
• /
• 제12권2호
• /
• pp.5-13
• /
• 1993

The purpose of this paper is to suggest and analyze the parallel algorithm for merging two heaps, on SIMD-SM-R parallel computer. In order to create the parallel algorithm for merging two heaps, we have classified two subproblems. For the first method, to select node p as a LEVEL-FIND function, Wyllie(19) suggests the method with time complexity O(log n) while this thesis has O(log(n/k)). For the second method, to merge two subheap, our algorithm has O(log(n/k)*log(n)) using max(2**(i-1), 「(m+1)/4」)'s processors while Dekel and Sahni(4)'s method and Hong's method(18) have O(log m). Also our parallel algorithm's EPU is close to 1 and so has an optimal speed-up ratio.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.595-598
• /
• 1988

In this paper, a new folding algorithm for design of high density PLA's is proposed. This algorithm generates transform matrix so that programmed region of each row becomes narrow. Based on transform matrix, folding pair is selected. In the process of generating transform matrix, interval degree and dense degree are used to improve folding ratio. This paper also proposes an efficient folding pair graph which has short time of selection folding pair. This proposed algorithm is named PLAFOLII and implemented in C language on VAX-11/750 (UNIX) computer. Through various example, efficiency of this algorithm is verified.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• pp.803-806
• /
• 2000

The correspondence problem is known to be difficult to solve because false positives and false negatives almost always exist in real image sequences. In this paper, we propose a robust feature tracking algorithm considering incomplete trajectories such as entering and/or vanishing trajectories. We solve the correspondence problem as the optimal graph search problem, by considering false feature points and by properly reflecting motion characteristics. The proposed algorithm finds a local optimal correspondence so that the effect of false feature points can be minimized in the decision process. The time complexity of the proposed graph search algorithm is given by O(mn) in the best case and O(m$^2$n) in the worst case, where m and n are the number of feature points in two consecutive frames. The proposed algorithm can find trajectories correctly and robustly, which has been shown by experimental results.

• 한국컴퓨터정보학회논문지
• /
• 제21권6호
• /
• pp.47-53
• /
• 2016

This paper deals with the capacity constrained time slot assignment problem(CTSAP) that a satellite switches to traffic between $m{\times}n$ ground stations using on-board $k{\leq}_{min}\{m,n\}$ k-transponders switching modes in SS/TDMA time-division technology. There was no polynomial time algorithm to solve the optimal solution thus this problem classified by NP-hard. This paper suggests a heuristic algorithm with O(mn) time complexity to solve the optimal solution for this problem. Firstly, the proposed algorithm selects maximum packet lengths of $\({mn \atop c}\)$ combination and transmits the cut of minimum packet length in each switching mode(MSMC). In the case of last switching mode with inefficient transmission, we applies a compensation strategy to obtain the minimum number of switching modes and the minimum makespan. The proposed algorithm finds optimal solution in polynomial time for all of the experimental data.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2006년도 춘계종합학술대회
• /
• pp.397-401
• /
• 2006

In this paper, we proposed a high precision location estimation algorithm using an enhanced decision scheme for RTLS and analyzed its performance in point of an average estimation error distance at 2D coordinates searching area, $300m\times300m$ and LOS propagation environments. Also the performance was compared with that of conventional TDOA algorithm according to the number of available reader and received sub-blink. From the results, we confirmed that the proposed location estimation algorithm using an enhanced decision scheme was able to improve an estimation accuracy even in boundary region of searching area. Moreover, effectively reduced an error distance in entire searching area so that increased the stability of location estimation in RTLS. Therefore, we verified that the proposed algorithm provided a more higher estimation accuracy and stability than conventional TDOA.

• 한국지리정보학회지
• /
• 제12권1호
• /
• pp.106-118
• /
• 2009

1m급 전후의 고해상도 위성영상들이 지구관측 및 모니터링으로부터 국토의 디지털 지도제작에 이르기까지 폭넓게 활용되고 있다. IKONOS 영상의 경우 Pro와 Precision 제품은 상당히 고가이므로 정확한 지도를 제작하는데 저가의 Geo제품과 영상공급자에 의해 제공된 RPC계수를 이용하는 것은 바람직하다. IKONOS 고해상도 영상은 엄밀한 센서모델 대신 RF에 의해 설명되어진다. 본 연구에서는 RF 모델을 기반으로 추출되는 지상좌표의 정확도를 개선하기 위하여 대상물공간과 상공간에서 각각 정의된 4개의 모델, 즉 선형이동 모델, 축척 및 선형이동 모델, Affine 모델, 2차 다항식 모델을 제시하였다. RF 모델을 기반으로 한 지상좌표 산출 알고리즘과 산출된 지상좌표의 정확도 개선 알고리즘을 개발하고 실험을 통하여 다항식 보정모델별 개선효과를 분석하였다. 또한 지상기준점의 수와 배치유형, 측량의 정확도와 같은 여러 가지 지도제작 매개변수들이 지상좌표의 정확도에 미치는 효과를 평가하였다. 적용실험 결과, RF 모델에 의해 1차적으로 산출된 3차원 지상좌표의 RMSE는 X 방향에서 8.035m, Y 방향에서 10.020m, Z 방향에서 13.318m이었으나 다항식 보정 알고리즘을 통하여 X 방향 2.791m, Y 방향 2.520m, Z 방향 1.441m까지 RMSE를 낮춤으로써 수평위치에서 약 65%, 수직방향에서 약 89%까지 정확도를 크게 개선할 수 있었다.

• 한국산학기술학회논문지
• /
• 제11권5호
• /
• pp.1627-1632
• /
• 2010

본 논문에서는 거리별 측정오차 패턴을 적용한 보정 알고리즘(DCA1)의 위치인식 성능특성과 문제점을 분석하고 이를 개선한 알고리즘인 WPAN에서 거리별 측정오차 패턴을 적용한 위치인식 보정 알고리즘(DCA2)을 제안하였다. 위치인식 실험결과, 평균적으로 DCA1 및 DCA2는 각각 위치인식 지점의 60%이상, 75% 이상에서 SDS-TWR 보다 위치인식 성능이 더 우수하였고, 특히 $15m{\times}15m$의 실험공간에서는 DCA2는 SDS-TWR 보다 위치인식 지점의 91%에서 위치인식 정확도가 더 우수함을 확인하였다. 또한 $10m{\times}10m$ 및 $15m{\times}15m$의 실험공간에서 DCA2는 DCA1 보다 각각 16%, 22%의 위치인식 지점에서 위치인식 정확도가 더 우수하였고, DCA1 및 DCA2의 평균 위치인식 오차는 SDS-TWR보다 각각 7~12%, 20% 감소함을 확인하였다. 이와 같은 결과를 볼 때 DCA2가 SDS-TWR 및 DCA1 보다 위치인식 정확도가 가장 우수함을 알 수 있다.