• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.28-37
• /
• 2008

In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink channels. We design a scheduler that selects a user for transmission and determines the transmission rate of the selected user based on the channel and backlog information of users. Since it requires prohibitively high computation complexity to determine an optimal scheduler for multi-user systems, we propose a low-complexity scheduling scheme that can achieve near-optimal performance. In this scheme, we reduce the complexity by decomposing the multiuser problem into multiple individual user problems. We arrange the probability of selecting each user such that it can be determined only by the information of the corresponding user and then optimize the transmission rate of each user independently. We solve the user problem by using a dynamic programming approach and analyze the upper and lower bounds of average transmission power and average delay, respectively. In addition, we investigate the effects of the user selection algorithm on the performance for different channel models. We show that a channel-adaptive user selection algorithm can improve the energy efficiency under uncorrelated channels but the gain is obtainable only for loose delay requirements in the case of correlated channels. Based on this, we propose a user selection algorithm that adapts itself to both the channel condition and the backlog level, which turns out to be energy-efficient over wide range of delay requirement regardless of the channel model.

• Journal of KIISE:Information Networking
• /
• v.41 no.4
• /
• pp.186-191
• /
• 2014

Previous work only focuses on a maximization of network coding opportunity since it can reduce the number of packets in network system. However, it can make congestion in a relay node as each source node may transmit each packet with the maximum transmission rate based on the channel qualities. Therefore, in this paper, we propose CmNC (Congestion minimized Network Coding over unreliable wireless links) performing opportunistic network coding to guarantee the network coding gain with the consideration of the congestion and channel qualities. The relay node selects the best network code set based on the objective function for reducing the packet loss and congestion via a dynamic programming. With Qualnet simulations, we show CmNC is better up to 20% than the previous work.

• Environmental and Resource Economics Review
• /
• v.25 no.2
• /
• pp.179-197
• /
• 2016

The development of overseas resource is a driving force to secure the energy security in Korea with low sufficiency rate of energy. This paper analyzes the effect of overseas oil resource development on the economy by presenting a real business cycle model with consolidated energy price index. A linear-quadratic dynamic programming is adopted to raise computational transparency and efficiency. The analysis shows that the overseas oil resource development project during 2010 and 2012 decreases the energy price by 1.2% per annum which effect is equivalent to the positive 0.47% to the GDP. The implication calls for steady and robust support for overseas resource development projects to enhance energy resilience.

• Journal of Korea Water Resources Association
• /
• v.31 no.6
• /
• pp.855-862
• /
• 1998

This paper investigates the impact of the forecast error on performance of a reservoir system for hydropower production. Forecast error is measured as th Root Mean Square Error (RMSE) and parametrically varied within a Generalized Maintenance Of Variance Extension (GMOVE) procedure. A set of transition probabilities are calculated as a function of the RMSE of the GMOVE procedure and then incorporated into a Bayesian Stochastic Dynamic Programming model which derives monthly operating policies and assesses their performance. As a case study, the proposed methodology is applied to the Skagit Hydropower System (SHS) in Washington state. The results show that the system performance is a nonlinear function of RMSE and therefor suggested that continued improvements in the current forecast accuracy correspond to gradually greater increase in performance of the SHS.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.23 no.6
• /
• pp.591-600
• /
• 2015

The efficiency of a powertrain system of hybrid vehicle is highly dependent on the design and control of the hybrid powertrain system. In other words, the optimal design of the powertrain systems is coupled with optimal control of the powertrain system. Therefore, the solution of an optimal design problem for hybrid vehicles is computationally and timely very expensive. For example, dynamic programming, which is a recursive optimization method, is usually used to evaluate the best fuel economy of certain hybrid vehicle design, and, thus, the evaluation takes tens of minutes to several hours. This research aims to accelerate the speed of efficiency evaluation of hybrid vehicles. We suggest a mathematical treat and a methodological treat to reduce the computational load. The mathematical treat is that the dynamics of system is discretized with sparse sampling time without loss of energy balance. The methodological treat is that the efficiency of the hybrid vehicle is inferred by characteristic loss evaluation that is computationally inexpensive. With the suggested methodology, evaluating a design candidate of hybrid powertrain system is taken few minutes, which was taken several hours when dynamic programming is used.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.683-695
• /
• 1996

In this paper, we implemented the content-based image retrieval system that indexes and retrieves the images by acquiring contour information of images and by extracting lines from the object. For this purpose, we proposed the advanced line extraction algorithm called FSLHT(Flexible SLHT) which covers drawback of SLHT(Straight Line Hough Transform)andapplied aDP(Dynamic Programming)algorithm to getadesirable similarity ofimages by lines. We estimated the contour features as a key value of sampled region to compensate for the problem that image contours are heavily depend on the noise. When performing the Hough transform we calculated the directionality based on the perceptual organization and transformed according to this direction to overcome the problem of time consuming and discontinuity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3034-3055
• /
• 2014

Wireless Sensor Networks have extensively been utilized for ambient data collection from simple linear structures to dense tiered deployments. Issues related to optimal resource allocation still persist for simplistic deployments including linear and hierarchical networks. In this work, we investigate the case of dimensioning parameters for linear and tiered wireless sensor network deployments with notion of providing extended lifetime and reliable data delivery over extensive infrastructures. We provide a single consolidated reference for selection of intrinsic sensor network parameters like number of required nodes for deployment over specified area, network operational lifetime, data aggregation requirements, energy dissipation concerns and communication channel related signal reliability. The dimensioning parameters have been analyzed in a pipeline monitoring scenario using ZigBee communication platform and subsequently referred with analytical models to ensure the dimensioning process is reflected in real world deployment with minimum resource consumption and best network connectivity. Concerns over data aggregation and routing delay minimization have been discussed with possible solutions. Finally, we propose a node placement strategy based on a dynamic programming model for achieving reliable received signals and consistent application in structural health monitoring with multi hop and long distance connectivity.

• Journal of Broadcast Engineering
• /
• v.23 no.6
• /
• pp.896-913
• /
• 2018

Seam finding algorithm is one of the most important techniques to construct the high quality 360 VR image. We found that some degradations, such as ghost effect, are generated when the conventional seam finding algorithms (for examples, Voronoi algorithm, Dynamic Programming algorithm, Graph Cut algorithm) are applied, because those make the inefficient masks which cross the body of main objects. In this paper, we proposed an advanced seam finding algorithm providing the efficient masks which go through background region, instead of the body of objects. Simulation results show that the proposed algorithm outperforms the conventional techniques in the viewpoint of the quality of the stitched image.

• Journal of the Korean Solar Energy Society
• /
• v.39 no.5
• /
• pp.53-63
• /
• 2019

This paper in order to efficiently operate zero energy buildings developed a methodology for optimal operation of PV + ESS active systems. This program consists of three steps. First step is PV optimal operation and second step is PV + ESS optimal operation. Third step is the analysis of the results by PV + ESS optimal operation. The optimal operation of PV + ESS was calculated by using Dynamic Programming (DP). Therefore, the optimal capacity and operating plan of PV + ESS in this study are calculated for electric load at building. This paper conducted case study to verify the validity of the developed algorithm. Also, the sensitivity analysis analyzed the effect of each variable on the optimal operation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.6
• /
• pp.2060-2073
• /
• 2022

Cloud Computing permits users to access vast amounts of services of computing power in a virtualized environment. Providing secure services is essential. There are several problems to real-world optimization that are dynamic which means they tend to change over time. For these types of issues, the goal is not always to identify one optimum but to keep continuously adapting to the solution according to the change in the environment. The problem of scheduling in Cloud where new tasks keep coming over time is unique in terms of dynamic optimization problems. Until now, there has been a large majority of research made on the application of various Evolutionary Algorithms (EAs) to address the issues of dynamic optimization, with the focus on the maintenance of population diversity to ensure the flexibility for adapting to the changes in the environment. Generally, trust refers to the confidence or assurance in a set of entities that assure the security of data. In this work, a dynamic optimization technique is proposed to find an optimal trust weights in cloud during scheduling.