• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.418-420
• /
• 2005

본 연구에서는 각종 전문가 선정의 전문성, 공정성, 투명성 및 신뢰성 제공과 최적으로 전문가 그룹에 적합한 전문가를 구성하기 위한 전문가 선정 방법론을 제안한다. 이를 위해, 전문가를 3차원적으로 탐색 및 정량적인 값으로 평가할 수 있는 전문가 후보군 선정 알고리즘을 제시하였으며, 선정된 전문가 후보군들을 조합 최적화 문제에 많이 응용되고 있는 유전자 알고리즘을 이용하여 전문가 선정 방법을 보였다.

• Journal of the Society of Naval Architects of Korea
• /
• v.30 no.1
• /
• pp.20-29
• /
• 1993

In this paper, a procedure is presented to optimize ship propulsion systems considering the hull- propeller-engine interactions. The propeller diameter and expanded blade ratio are systematically varied to find out the optimum combinations of RPM and BHP at a given design speed by considering cavitation criteria, and then by comparing the fuel oil consumptions of each main engine candidates which can produce each combination of RPM and BHP, appropriate main engine with the lowest fuel oil consumption together with principal characteristics of the optimum propeller are selected.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.118-121
• /
• 2018

끊김 없는 이동성은 멀티미디어가 풍부한 실시간 서비스를 지원하는 미래의 무선 네트워크에서 필수적이다. SDN (Software Defined Networking)은 중앙 집중식 컨트롤러를 통해 무선 네트워크에서 세밀한 플로우 수준의 이동성 관리를 제공할 수 있지만 핸드오버 지연의 새로운 네트워킹 패러다임이다. 스플릿 포인트 방식은 SDN 무선 네트워크에서 핸드오버 및 종단 간 전송 지연을 줄이는 효과적인 방법이다. 스플릿 포인트는 트래픽이 새로운 AP (Access Point)를 향하여 핸드오버 한 후에 기존 플로우 경로상에 존재하는 스위치이다. 본 논문에서는 MN-CN (Corresponding Node) 경로의 각 스위치의 가중치를 스위치와 후보 AP 사이의 평균 고리(홉)로 계산하고 최소 가중치를 갖는 스위치가 스플릿 포인트로 선택된다. 스플릿 포인트 선택 외에도 이 논문은 SDN 에서 제공하는 제어 및 데이터 플레인 분리를 이용하여 핸드오버 후 플로우에 대한 최적의 경로를 복원한다. 제안 아이디어의 수치 해석은 이전 솔루션과 비교하여 총 비용이 9.6 % ~ 13 % 향상되었음을 보여준다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.531-533
• /
• 2010

솔리드 텍스처 합성에서 최종 결과의 품질과 마찬가지로 텍스처 합성에 필요한 계산을 단축하는 것은 중요하다. 최근 연구에서는 데이터 차원 감소나 k-coherence search 같은 매칭 가속화 방법을 사용해서 솔리드 텍스처 합성 시간을 단축하였다. 본 논문에서는 빠르게 2D 이미지로부터 솔리드 텍스처 합성을 할 수 있는 새로운 방법을 제시한다. 제안하는 방법의 기본 아이디어는 주어진 이미지를 다수 영역으로 분할하여 형상 매칭(feature matching) 과정에서 사용되는 후보 수를 줄이는 것으로, 사물을 이루는 복셀과 관련한 픽셀이 포함된 분할 영역내의 후보들과 비교함으로써, 보다 빠르게 최적의 결과값을 제공한다. 실험적으로 본 방법은 k-coherence search 알고리즘에서 k 값을 1 로 사용했을 때보다 빠르거나 비슷한 시간을 갖는다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.9 no.2
• /
• pp.127-138
• /
• 1991

This is a study on the selection of the optimum route using geographic information system. In general, the selection of route was classifed in order of candidate route zone, optimum route zone and optimum route, this study comes under optimum route that is the last part in the route planning. The optimum route is get attined on the weighted matrix table that based on landuse status, land value, slope degree of each grid cell of the test area, and also we suggest application possibility of geographic information system in the route planning with the comparision and analysis of the three selection route in this study.

• Journal of the Korea Convergence Society
• /
• v.7 no.5
• /
• pp.213-219
• /
• 2016

This paper presents a branch-and-bound algorithm for solving the concave minimization problem with upper bounded variables whose single constraint is linear. The algorithm uses simplex as partition element. Because the convex envelope which most tightly underestimates the concave function on the simplex is uniquely determined by solving the related linear equations. Every branching process generates two subsimplices one lower dimensional than the candidate simplex by adding 0 and upper bound constraints. Subsequently the feasible points are partitioned into two sets. During the bounding process, the linear programming problems defined over subsimplices are minimized to calculate the lower bound and to update the incumbent. Consequently the simplices which do certainly not contain the global minimum are excluded from consideration. The major advantage of the algorithm is that the subproblems are defined on the one less dimensinal space. It means that the amount of work required for the subproblem decreases whenever the branching occurs. Our approach can be applied to solving the concave minimization problems under knapsack type constraints.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.12-17
• /
• 2009

We consider an OFDM based multiple AF relaying systems. Since the channel between first hop (source station-relay station) and second hop (relay station -destination station) varies independently, the subcarrier in the first hop can be paired to another subcarrier in the second hop for the increase of the system capacity. The conventional pairing which uses the brute force searching requires large complexity while giving optimal pairing for maximum system capacity. In this paper, we present sub-optimal subcarrier pairing scheme with low complexity. Every RS firstly pairs the subcarrier with the highest channel gain in the first hop to the subcarrier with highest channel gain in the second hop. The pair with the highest SNR among all the pairs is determined as final selected pair and the corresponding subcarriers are not selected at other RSs in the next paring iteration. This process is repeated until all the subcarriers are paired. Simulation results show the proposed pairing scheme achieves near optimal performance with low complexity.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.1
• /
• pp.38-46
• /
• 1999

One of the tasks of maritime navigation is to decide upon the optimal navigation route that minimizes a vessals travel time and fuel consumption. Recently. ECDIS(Electronic Chart Display Information System) is used to decide the optimal navigation route and have expert knowledge of maritime navigation. In this paper, the system use $A^*$algorithm for optimal navigation route on ECDIS. But some problems is discovered in this situation. it requires many memory device and searching time. So this paper has tried to develope a advanced algorithm system that decides the optimal navigation route.

• Journal of the Korean Geosynthetics Society
• /
• v.15 no.1
• /
• pp.59-70
• /
• 2016

The purpose of this study is to review that the VE techniques can be used as a selection tool of borrow pit locations. The analysis of the soil investigation report is performed for the selection of proposed borrow pit site on a large-scale residential development area. Possible earthwork volume of mining is estimated and the weighting matrix evaluation is applied to the VE techniques. After determining the evaluation items for VE assessment, important degree was calculated. The Rating and evaluation of performance is carried out on a proposed borrow pit site. And, development priority has to be decided for a proposed borrow pit sites. As a result, the relative construction cost is closely related to the haulage distance. As the haulage distance increases, the relative construction cost will be increased. Therefore, it was confirmed quantitatively that haulage distance has a significant impact on the select of borrow pits. Also, it was found that the condition of borrow pits itself is important, but it cannot be ignored the impact of the life cycle cost for the selection of optimal borrow pit sites.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.25 no.9
• /
• pp.944-951
• /
• 2014

In this paper, evaluation indices of the location selection of satellite ground station is proposed to maximize satellite applications. The evaluation index has been developed based on radio-wave environmental conditions to avoid the radio interference to perform the missions of ocean observation satellite. The radio interference investigation was generated based on professionals of satellite control/operation, calibration/validation, applications. And evaluation index was applied to a candidate site of ground station. In the future, this result may be able to compare with the results of other candidate sites for the best location selection of 'marine mission-oriented ground stations'. According to recent trends of mission-oriented ground stations, the results can be used for location selection of 'marine mission-oriented ground station' as reference.