• Journal of the Society of Naval Architects of Korea
• /
• v.56 no.6
• /
• pp.480-487
• /
• 2019

Ship route planning is to find a route to minimize voyage time and/or fuel consumption in a given sea state. Unlike previous studies, this study proposes an optimization method for the route planning to avoid the grounding risk near the coast. The route waypoints were searched using A^* algorithm, and the route simplification was performed to remove redundant waypoints using Douglas-Peucker algorithm. The optimization was performed to minimize fuel consumption by setting the optimization design parameters to the engine rpm. The sea state factors such as wind, wave, and current are also considered for route planning. We propose the constraint to avoid ground risk by using under keel clearance obtained from electoronic navigational chart. The proposed method was applied to find the optimal route between Mokpo and Jeju. The result showed that the proposed method suggests the optimal route that minimizes fuel consumption.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.1
• /
• pp.47-53
• /
• 2007

Satellite image mosaicking is essential for image interpretation and analysis especially for a large area such as the Korean Peninsula. This paper proposed the technique of automatic seam-line extraction and the method of creating image mosaic in automated fashion. The seam-line to minimize artificial discontinuity was extracted using Minimum Absolute Gray Difference Sum algorithm with constraint condition on search-area width and Canny Edge Detection algorithm. To maintain the radiometric balance among images acquired at different time epochs, we utilized Match Cumulative Frequency method. Experimental results showed that edge detection algorithm extracted the seam-lines significantly well along linear features such as roads and rivers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1113-1119
• /
• 2006

For a multi-user OFDM system in mobile channels which requires low-complexity in adaptive resource allocations, resource allocation algorithm using multi-threshold is proposed. The allocation scheme, which is performed by the multi-threshold values in descending order, considers only subcarriers over each threshold level. Moreover, some subcarriers with the lowest channel gain can be· removed in the present threshold level within the constraint of satisfaction of the required data rate, in order to allocate them to the other users when the allocation process of next threshold is executed. As a result, the proposed bandwidth and subcarrier algorithm has better system performances than the conventional allocation schemes in terms of required power and processing time, which is expected as a technique that improves the spectral efficiency of OFDM systems in a mobile environment.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.375-386
• /
• 2016

Most existing studies on broadcast services in orthogonal frequency division multiplexing (OFDM) systems have focused on how to allocate the transmission power to the subcarriers. However, because a broadcasting system must guarantee quality of service to all users, the performance of the broadcast service dominantly depends on the channel state of the user who has the lowest received signal-to-noise ratio among users. To reduce the effect of the worst user on the system performance, we propose a joint delivery scheme of unicast and broadcast transmissions in OFDM systems with broadcast and unicast best-effort users. In the proposed joint delivery scheme, the BS delivers the broadcast information using both the broadcast and unicast subcarriers at the same time in order to improve the performance of the broadcast service. The object of the proposed scheme is to minimize the outage probability of the broadcast service while maximizing the sum-rate of best-effort users. For the proposed joint delivery scheme, we develop an adaptive power and subcarrier allocation algorithm under the constraint of total transmission power. This paper shows that the optimal power allocation over each subcarrier in the proposed scheme has a multi-level water filling form. Because the power allocation and the subcarrier assignment problems should be jointly solved, we develop an iterative algorithm to find the optimal solution. Numerical results show that the proposed joint delivery scheme with adaptive power and subcarrier allocation outperforms the conventional scheme in terms of the outage probability of the broadcast service and the sum-rate of best-effort users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4B
• /
• pp.412-421
• /
• 2011

An economic ship routing means to sail a ship with a goal of minimizing the fuel consumption by utilizing weather forecast information, and many such systems have been recently developed. Most of them assume that sailing is carried out with a constraint like a fixed output of engine-power or a fixed sailing speed. However, if the output of engine-power is controlled, it is possible to reduce the fuel consumption by sailing a ship under a relatively good weather condition. In this paper, we propose a novel economic ship routing system which can search optimal outputs of the engine-power for each part of a path by employing an evolutionary strategy. In addition, we develope an $A^*$ algorithm to find the shortest path and a method to enhance the degree of curve representation. These make the proposed system applicable to an arbitrary pair of departure and destination points. We compared our proposed system with another existing system not controlling output of the engine-power over 36 scenarios in total, and observed that the former reduced the estimated fuel consumption than the latter by 1.3% on average and the maximum 5.6% with little difference of estimated time of arrival.

• Journal of Korea Game Society
• /
• v.18 no.5
• /
• pp.123-132
• /
• 2018

Various methods have been proposed to efficiently animate the motion of soft objects in realtime. In order to maintain the topology between the elements of the objects, it is required to employ constraint forces, which limit the size of the time steps for the numerical integration and reduce the efficiency. To tackle this, an implicit method with larger steps was proposed. However, the method is, in essence, a linear system with a large matrix, of which solution requires heavy computations. Several approximate methods have been proposed, but the approximation is obtained with an increased damping and the loss of accuracy. In this paper, new integration method based on harmonic oscillation with better stability was proposed, and it was further stabilized with the hybridization with approximate implicit method. GPU parallelism can be easily implemented for the method, and large-scale soft objects can be simulated in realtime.

• Proceedings of the Korean Institute of Interior Design Conference
• /
• 2008.05a
• /
• pp.214-219
• /
• 2008

The aging of the population has been in process all over the world including most of advanced countries. With the improvement of living standards and medical technology due to the growth and development of the modern industrial society, the continuous Increase of the average lifespan has led to an abrupt growth in the population ratio of the aged. The senescence is the period where both physical and mental functions get dwindled, and due to a loss of roles in a society and a weakened social bond, the elderly people feel often neglected and isolated. Consequently, the elderly people spend a lot of time in their houses. As this means that the elderly gets higher possibility to stay within housing units and housing complex environment, residents' public space needs to be developed within the housing complex for them. Therefore, constructive programs and plans are required for the elderly who experience distance constraint because of corporal aging, for them to sustain community activities within their housing environment. Contrary to them in the 20th century, the elderly living in the nowadays informational society tend to enjoy their leisure times with arts and cultures and underscore the significance of social exchange under diverse possibility and sustainableness. Thus, it is important to preserve those circumstances to provide continuously them. Thus, the purpose of this paper is to grope a growth direction of residents' public space for the elderly to include them to their community through a socially integrated way by grasping present condition of apartment residents' public space's facilities and to be used practically as a basic housing environment data to raise quality of community life.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.321-328
• /
• 2003

This Paper Proposes a size-variable block matching algorithm for motion vector extraction. The Proposed algorithm dynamically determines the search area and the size of a block. We exploit the constraint of small velocity changes of a block along the time to determine the origin of the search area. The range of the search area is adjusted according to the motion coherency of spatially neighboring blocks. The process of determining the sire of a block begins matching with a small block. If the matching degree is not good enough, we expand the size of a block a little bit and then repeat the matching process until our matching criterion Is satisfied. The experimental results show that the proposed algorithm can yield very accurate block motion vectors. Our algorithm outperforms other algorithms in terms of the estimated motion vectors, though our algorithm requires some computational overhead.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.426-436
• /
• 2000

Given a linear arrangement of n base stations which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n base statons so that a cluster is assigned a location server. Our goal is to minimize the total communication cost for the entire network where the cost of intra-cluster communication is usually lower than that of intercluster communication for each type of traffic. The optimization problem is transformed into an equivavalent problem using the concept of relative cost, which generates the difference of communication costs between intracluster and intercluster communications. Using the relative cost matrix, an efficient algorithm of O($mm^2$), where m is the number of clusters in a partition, is designed by dynamic programming. The algorithm also finds all thevalid partitions in the same polynomial time, given the size constraint on a cluster, and the total allowable communication cost for the entire network.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.18 no.6
• /
• pp.78-83
• /
• 2004

Currently used DLC(Direct Load Control) algorithm is only focused on ON/OFF load control not concerning about reliving participated customer's inconvenience and load priority. Therefore, that is a major obstacle to attract customer participating in demand response program. To overcome the above defects, the authors represent direct load control algorithm using priority based dynamic programming. the proposed algorithm is that participant customer send E-mail to DLC center about priority of load before executing DLC, then DLC algorithm decide which load to be OFF by using priority and off time constraint of the load. By using dynamic programming based on the order of priority for DLC algorithm it is possible to maximize participating customer's satisfaction and it will help to attract more customer's participating in demand response program.