• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1501-1502
• /
• 2010

DualCore 혹은 MultiCore 플랫폼의 보급에 따라 높은 시간복잡도를 갖는 응용들도 사용자의 컴퓨터나 단말에서 수행되어 다양한 서비스를 제공할 수 있게 되었다. 본 논문에서는 관광 스케줄을 효율적으로 결정하기 위한 다중목적지 방문 문제에 대해 이중 쓰레드에 기반한 서치 스페이스 탐색 알고리즘을 구현한다. 이는 Traveling Salesman Problem의 한 종류로서 O(n!) 시간 복잡도를 갖고 있으며 검색시의 독립성때문에 각 쓰레드는 병렬적으로 최적의 스케줄을 탐색할 수 있다. 또 현재까지 발견된 최적값을 기반으로 부분 경로의 비용이 이미 최적값을 넘는 경우는 하위 탐색을 제거하여 상당한 성능의 향상을 가져온다. 2.4 GHz Intel(R) Core DuoCPU와 3 GB 메모리로 구성된 플랫폼 상에서 구현된 서비스는 11개의 목적지에 대한 방문 스케줄을 생성함에 있어서 단일 쓰레드 버전은 14.196초, 이중 쓰레드 버전은 6.411초, 제약조건을 포함한 이중 쓰레드 버전은 0.14초에 최적의 스케줄을 찾아낼 수 있다.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.31 no.6
• /
• pp.458-467
• /
• 2019

The purpose of this study is the suggestion of optimized parameters in OI (Optimal Interpolation) by experimental study. The observation of applying optimal interpolation is ADCP (Acoustic Doppler Current Profiler) data at the southwestern sea of Korea. FVCOM (Finite Volume Coastal Ocean Model) is used for the barotropic model. OI is to the estimation of the gain matrix by a minimum value between the background error covariance and the observation error covariance using the least square method. The scaling factor and correlation radius are very important parameters for OI. It is used to calculate the weight between observation data and model data in the model domain. The optimized parameters from the experiments were found by the Taylor diagram. Constantly each observation point requires optimizing each parameter for the best assimilation. Also, a high accuracy of numerical model means background error covariance is low and then it can decrease all of the parameters in OI. In conclusion, it is expected to have prepared the foundation for research for the selection of ocean observation points and the construction of ocean prediction systems in the future.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.10
• /
• pp.2551-2561
• /
• 2014

Several algorithms have been developed to detect AFIB(Atrial Fibrillation) which either rely on the linear and frequency analysis. But they are more complex than time time domain algorithm and difficult to get the consistent rule of irregular RR interval rhythm. In this study, we propose algorithm for optimal value detection of irregular RR interval for AFIB classification based on linear analysis. For this purpose, we detected R wave, RR interval, from noise-free ECG signal through the preprocessing process and subtractive operation method. Also, we set scope for segment length and detected optimal value and then classified AFIB in realtime through liniar analysis such as absolute deviation and absolute difference. The performance of proposed algorithm for AFIB classification is evaluated by using MIT-BIH arrhythmia and AFIB database. The optimal value indicate ${\alpha}=0.75$, ${\beta}=1.4$, ${\gamma}=300ms$ in AFIB classification.

• Proceedings of the KSRS Conference
• /
• 2007.03a
• /
• pp.109-112
• /
• 2007

본 논문에서는 대축척 수치지도와 Quickbird 위성영상의 자동 보정을 영상공간에서 수행한다. 알고리즘은 보정변환식의 초기 계수값 결정과 정확한 변환계수 결정과정으로 나뉜다. 초기 계수값 결정은 보정변환식의 상수항을 결정하는 것으로 수치지형도의 지면개체와 영상에서 추출된 에지의 논리곱 연산을 적용하여 최적값을 추정하는 방식을 용한다. 보정 다항식의 정확한 변환계수를 결정하기 위하여 수치지형도의 지면 선형개체 점데이터와 영상의 에지개체 점데이터간 ICP 조정을 수행하였다. 제안된 방법의 정확도를 평가한 결과， 영상공간에서 1.72화소의 RMSE를 나타내었다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.8
• /
• pp.761-767
• /
• 2011

In this paper, to improve performance of spectrum sensing, we propose the method which can find optimal threshold based on power of PU(Primary User) signal. To find optimal threshold value, we will use mathematical method, and find threshold which can has lowest error probability. Each SU(Secondary User) use this threshold and All Su makes local decision. All Su Send local decision to FC(Fusion Center). In this paper we consider K-out-of-n rule to combining local decision. To make global decision value, FC find optimal n. In the FC. FC received local decision which has lowest error probability and using optimal n and these vaule. FC make global decision value. In this paper, to analysis performance proposed scheme, we simulate proposed scheme using matlab and compare with traditional OR Rule. As a result of simulation, we can know that preposed scheme can get a better performance than traditional OR rule.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.3
• /
• pp.401-406
• /
• 2011

In order to solve a complex optimization problem more efficiently than traditional approaches, various meta-heuristic algorithms such as genetic algorithm, ant-colony algorithm, and harmony search algorithm have been extensively researched. Compared with other meta-heuristic algorithm, harmony search algorithm shows a better result to resolve the complex optimization issues. Harmony search algorithm is inspired by the improvision process of musician for most suitable harmony. In general, the performance of harmony search algorithm is determined by the value of harmony memory considering rate, and pitch adjust rate. In this paper, modified harmony search algorithm is proposed in order to derive best harmony. If the optimal solution of a specific problem can not be found for a certain period of time, a part of original harmony memory is updated as the selected suitable harmonies. Experimental results using test function demonstrate that the updated harmony memory can induce the approximation of reliable optimal solution in the short iteration, because of a few change of fitness.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.724-732
• /
• 2013

In this paper, we analyze a performance of multiuser massive multiple-input and multiple-output (MIMO) system. We derive the ergodic cell capacity based on a downlink frame structure and analyze the ergodic cell capacity with respect to the number of base station (BS) antennas and the number of users. This paper shows that the ergodic cell capacity is a concave function with respect to the number of BS antennas and the number of users, and also derives the optimal numbers of BS antennas and users for the maximum cell capacity. The simulation results verify the derived analyses and show that the derived numbers of BS antennas and users provide the maximum cell capacity.

• Proceedings of the KIEE Conference
• /
• 2001.04a
• /
• pp.75-77
• /
• 2001

전기기기 최적 설계에 있어서 결정론적 최적화 방법은 국부해를 빠른 속도로 찾을 수 있지만 최적값에 대한 보장이 어려우므로 비결정론적 방법인 진화전략 알고리즘을 많이 사용한다. 전기기기 최적화에 쓰이는 많은 확률적 알고리즘 중에서 진화 전략 알고리즘은 시뮬레이티드 어닐링과 유전 알고리즘을 결합한 방법으로, 전체 최적점 탐색이 가능할 뿐만 아니라 알고리즘이 비교적 간단하면서도 빠른 수렴 특성을 갖고 있다. 그리고, 종류 또한 다양하다. 진화 전략 알고리즘 중에서 중요한 것은 수렴속도와 성공률에 기여하는 파라미터들을 잘 선정하는 것이다. 본 논문에서는, 진화 전략 알고리즘의 중요한 인자인 자식 세대의 개수인 ${\lambda}$값과 ${\alpha}$값을 변화시켜 가면서 변수 개수에 따른 최적화된 조합을 제시한다. 본 논문의 결과는 전기기기 최적 설계에 응용하는데 도움이 될 것으로 사료된다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1420-1428
• /
• 2017

It is difficult to guarantee the reliability of the algorithm due to the difference of the sampling frequency among the various ECG databases used for the R wave detection in case of applying to different environments. In this study, we propose an optimal threshold setting method for R wave detection according to the sampling frequency of ECG signals. For this purpose, preprocessing process was performed using moving average and the squaring function based the derivative. The optimal value for the peak threshold was then detected according to the sampling frequency by changing the threshold value according to the variation of the signal and the previously detected peak value. The performance of R wave detection is evaluated by using 48 record of MIT-BIH arrhythmia database. When the optimal values of the differential section, window size, and threshold coefficient for the MIT-BIH sampling frequency of 360 Hz were 7, 8, and 6.6, respectively, the R wave detection rate was 99.758%.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.2
• /
• pp.704-710
• /
• 2017

Our research team is developing a 6-DOF manipulator that is adequate for the narrow workspace of press forming processes. This paper addresses the task sequence optimization methods for the manipulator to minimize the task-finishing time. First, a kinematic model of the manipulator is presented, and the anticipated times for moving among the task locations are computed. Then, a mathematical model of the task sequence optimization problem is presented, followed by a comparison of three meta-heuristic methods to solve the optimization problem: an ant colony system, simulated annealing, and a genetic algorithm. The simulation shows that the genetic algorithm is robust to the parameter settings and has the best performance in both minimizing the task-finishing time and the computing time compared to the other methods. Finally, the algorithms were implemented and validated through a simulation using Mathworks' Matlab and Coppelia Robotics' V-REP (virtual robot experimentation platform).