• Title/Summary/Keyword: Dynamic programming method

Search Result 388, Processing Time 0.024 seconds

A Design Scheme for Multimedia Contents Considering Memory Constraints in IoT Devices (IoT 장치에서 메모리 용량 제한을 고려한 멀티미디어 콘텐츠 설계 기법)

  • Son, Kyung A
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.11
    • /
    • pp.1463-1469
    • /
    • 2020
  • Multimedia information, including video and voice, is highly utilized in that it is easily understood by people. For this reason, applications have been studied which store multimedia information in IoT devices and transmit information in conjunction with smartphones. The problem is that the size of information can be larger than the capacity of IoT devices due to video and image. In this paper, the multimedia content design technique, which takes into account the limitations of storage capacity, was studied when there is a limit of storage capacity. Considering that the video has a higher understanding of information than text, while the capacity is larger, the solution between information comprehension and capacity is sought. The size of static and dynamic media is a variable and the harm is solved in accordance with the linear planning method. Case studies have shown that the design techniques of this paper are useful.

A Study on Determining the Optimal Amount of Labor Force for Cargo Handling in the Harbor (항만 하역 노동력의 최적 규모 결정에 관하여)

  • Lee, Cheol-Yeong;Jang, Yeong-Jun
    • Journal of Korean Port Research
    • /
    • v.3 no.1
    • /
    • pp.35-55
    • /
    • 1989
  • Today, about 99% of total import and export cargo in Korea is being transported through the port. The general trends of cargo handling show increases in capacity and speed, In order to cope with these trends, it is not only required to raise the efficiencies of port operation and function but also necessary to decide the optimal amount of the skilled labor force for cargo handling in the port. Cargo handling in the port is basically relied on the cargo handling facilities. Therefore, it is very important to reserve the amount of labor force for cargo handling system has been developed up to a certain level but the personnel management system which is the superior structure has not been followed well. In this study, therefore, we show a method to determine the required amount of labor force for cargo handling considering the amount of cargo and type of cargo handling work per each cargo, and the optimal amount labor force in cope with the fluctuation of the basic cargo handling labor force with respect to the time of in and out cargo flow in the viewpoint of minimizing the expences due to reservation of extra labor force than needed and firing employment of labor force using the Dynamic Programming. The derived algorithm is introduced into the computer simulation for Pusan port with the analyzed real data such as amount of cargo handling in the port with respect to working hour, cargo capacity, working step, the ratio of cargo handling facility and actual number of workers and we estimated the required labor force. As a result of analysis the labor force of Pusan port showed the over-employment such as maximum 21.4%, minimum 8.2% when we assumed that the averages of actual working hours and days were 8 hours in a day and 20 day in a month.

  • PDF

Fast Content-Aware Video Retargeting Algorithm (고속 컨텐츠 인식 동영상 리타겟팅 기법)

  • Park, Dae-Hyun;Kim, Yoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.11
    • /
    • pp.77-86
    • /
    • 2013
  • In this paper, we propose a fast video retargeting method which preserves the contents of a video and converts the image size. Since the conventional Seam Carving which is the well-known content-aware image retargeting technique uses the dynamic programming method, the repetitive update procedure of the accumulation energy is absolutely needed to obtain seam. The energy update procedure cannot avoid the processing time delay because of many operations by the image full-searching. By applying the proposed method, frames which have similar features in video are classified into a scene, and the first frame of a scene is resized by the modified Seam Carving where multiple seams are extracted from candidate seams to reduce the repetitive update procedure. After resizing the first frame of a scene, all continuous frames of the same scene are resized with reference to the seam information stored in the previous frame without the calculation of the accumulation energy. Therefore, although the fast processing is possible with reducing complexity and without analyzing all frames of scene, the quality of an image can be analogously maintained with an existing method. The experimental results show that the proposed method can preserve the contents of an image and can be practically applied to retarget the image on real time.

Development of Robust-SDP for improving dam operation to cope with non-stationarity of climate change (기후변화의 비정상성 대비 댐 운영 개선을 위한 Robust-SDP의 개발)

  • Yoon, Hae Na;Seo, Seung Beom;Kim, Young-Oh
    • Journal of Korea Water Resources Association
    • /
    • v.51 no.spc
    • /
    • pp.1135-1148
    • /
    • 2018
  • Previous studies on reservoir operation have been assumed that the climate in the future would be similar to that in the past. However, in the presence of climate non-stationarity, Robust Optimization (RO) which finds the feasible solutions under broader uncertainty is necessary. RO improves the existing optimization method by adding a robust term to the objective function that controls the uncertainty inherent due to input data instability. This study proposed Robust-SDP that combines Stochastic Dynamic Programming (SDP) and RO to estimate dam operation rules while coping with climate non-stationarity. The future inflow series that reflect climate non-stationarity were synthetically generated. We then evaluated the capacity of the dam operation rules obtained from the past inflow series based on six evaluation indicators and two decision support schemes. Although Robust-SDP was successful in reducing the incidence of extreme water scarcity events under climate non-stationarity, there was a trade-off between the number of extreme water scarcity events and the water scarcity ratio. Thus, it is proposed that decision-makers choose their optimal rules in reference to the evaluation results and decision support illustrations.

Implementation of Parallel Local Alignment Method for DNA Sequence using Apache Spark (Apache Spark을 이용한 병렬 DNA 시퀀스 지역 정렬 기법 구현)

  • Kim, Bosung;Kim, Jinsu;Choi, Dojin;Kim, Sangsoo;Song, Seokil
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.10
    • /
    • pp.608-616
    • /
    • 2016
  • The Smith-Watrman (SW) algorithm is a local alignment algorithm which is one of important operations in DNA sequence analysis. The SW algorithm finds the optimal local alignment with respect to the scoring system being used, but it has a problem to demand long execution time. To solve the problem of SW, some methods to perform SW in distributed and parallel manner have been proposed. The ADAM which is a distributed and parallel processing framework for DNA sequence has parallel SW. However, the parallel SW of the ADAM does not consider that the SW is a dynamic programming method, so the parallel SW of the ADAM has the limit of its performance. In this paper, we propose a method to enhance the parallel SW of ADAM. The proposed parallel SW (PSW) is performed in two phases. In the first phase, the PSW splits a DNA sequence into the number of partitions and assigns them to multiple nodes. Then, the original Smith-Waterman algorithm is performed in parallel at each node. In the second phase, the PSW estimates the portion of data sequence that should be recalculated, and the recalculation is performed on the portions in parallel at each node. In the experiment, we compare the proposed PSW to the parallel SW of the ADAM to show the superiority of the PSW.

In-Plane Extensional Buckling Analysis of Curved Beams under Uniformly Distributed Radial Loads Using DQM (등분포하중 하에서 미분구적법(DQM)을 이용한 곡선 보의 내평면 신장 좌굴해석)

  • Kang, Ki-Jun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.7
    • /
    • pp.265-274
    • /
    • 2018
  • The increasing use of curved beams in buildings, vehicles, ships, and aircraft has prompted studies directed toward the development of an accurate method for analyzing the dynamic behavior of such structures. The stability behavior of elastic curved beams has been the subject of a large number of investigations. Solutions of the relevant differential equations have been obtained traditionally using standard finite difference or finite element methods. These techniques require a great deal of computer time as the number of discrete nodes becomes relatively large under the conditions of complex geometry and loading. One of the efficient procedures for the solution of partial differential equations is the method of differential quadrature. The differential quadrature method (DQM) has been applied to a large number of cases to overcome the difficulties of the complex algorithms of programming for the computer, as well as the excessive use of storage due to the conditions of complex geometry and loading. The in-plane buckling of curved beams considering the extensibility of the arch axis was analyzed under uniformly distributed radial loads using the DQM. The critical loads were calculated for the member with various parameter ratios, boundary conditions, and opening angles. The results were compared with the precise results by other methods for cases, in which they were available. The DQM, using only a limited number of grid points, provided results that agreed very well (less than 0.3%) with the exact ones. New results according to diverse variations were obtained, showing the important roles in the buckling behavior of curved beams, and can be used in comparisons with other numerical solutions or with experimental test data.

Intensity Based Stereo Matching Algorithm Including Boundary Information (경계선 영역 정보를 이용한 밝기값 기반 스테레오 정합)

  • Choi, Dong-Jun;Kim, Do-Hyun;Yang, Yeong-Yil
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.12
    • /
    • pp.84-92
    • /
    • 1998
  • In this paper, we propose the novel cost functions for finding the disparity between the left and the right images in the stereo matching problem. The dynamic programming method is used in solving the stereo matching problem by Cox et al[10]. In the reference[10], only the intensity of the pixels in the epipolar line is used as the cost functions to find the corresponding pixels. We propose the two new cost functions. The information of the slope of the pixel is introduced to the constraints in determining the weights of intensity and direction(the historical information). The pixels with the higher slope are matched mainly by the intensity of pixels. As the slope becomes lower, the matching is performed mainly by the direction. Secondly, the disparity information of the previous epipolar line the pixel is used to find the disparity of the current epipolar line. If the pixel in the left epipolar line, $p-i$ and the pixel in the right epipolar line, $p-j$ satisfy the following conditions, the higher matching probability is given to the pixels, $p-i$ and $p-j$. i) The pixels, $p-i$ and $p-j$ are the pixles on the edges in the left and the right images, respectively. ⅱ) For the pixels $p-k$ and $p-l$ in the previous epipolar line, $p-k$and $p-l$ are matched and are the pixels on the same edge with $p-i$ and $p-j$, respectively. The proposed method compared with the original method[10] finds the better matching results for the test images.

  • PDF

In-Plane Extensional Vibration Analysis of Asymmetric Curved Beams with Linearly Varying Cross-Section Using DQM (미분구적법(DQM)을 이용한 단면적이 선형적으로 변하는 비대칭 곡선보의 내평면 신장 진동해석)

  • Kang, Ki-Jun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.5
    • /
    • pp.612-620
    • /
    • 2019
  • The increasing use of curved beams in buildings, vehicles, ships, and aircraft has results in considerable effort being directed toward developing an accurate method for analyzing the dynamic behavior of such structures. The stability behavior of elastic curved beams has been the subject of a large number of investigations. Solutions of the relevant differential equations have traditionally been obtained by the standard finite difference. These techniques require a great deal of computer time as the number of discrete nodes becomes relatively large under conditions of complex geometry and loading. One of the efficient procedures for the solution of partial differential equations is the method of differential quadrature. The differential quadrature method(DQM) has been applied to a large number of cases to overcome the difficulties of the complex algorithms of programming for the computer, as well as excessive use of storage due to conditions of complex geometry and loading. In this study, the in-plane extensional vibration for asymmetric curved beams with linearly varying cross-section is analyzed using the DQM. Fundamental frequency parameters are calculated for the member with various parameter ratios, boundary conditions, and opening angles. The results are compared with the result by other methods for cases in which they are available. According to the analysis of the solutions, the DQM, used only a limited number of grid points, gives results which agree very well with the exact ones.

Facial Expression Control of 3D Avatar using Motion Data (모션 데이터를 이용한 3차원 아바타 얼굴 표정 제어)

  • Kim Sung-Ho;Jung Moon-Ryul
    • The KIPS Transactions:PartA
    • /
    • v.11A no.5
    • /
    • pp.383-390
    • /
    • 2004
  • This paper propose a method that controls facial expression of 3D avatar by having the user select a sequence of facial expressions in the space of facial expressions. And we setup its system. The space of expression is created from about 2400 frames consist of motion captured data of facial expressions. To represent the state of each expression, we use the distance matrix that represents the distances between pairs of feature points on the face. The set of distance matrices is used as the space of expressions. But this space is not such a space where one state can go to another state via the straight trajectory between them. We derive trajectories between two states from the captured set of expressions in an approximate manner. First, two states are regarded adjacent if the distance between their distance matrices is below a given threshold. Any two states are considered to have a trajectory between them If there is a sequence of adjacent states between them. It is assumed . that one states goes to another state via the shortest trajectory between them. The shortest trajectories are found by dynamic programming. The space of facial expressions, as the set of distance matrices, is multidimensional. Facial expression of 3D avatar Is controled in real time as the user navigates the space. To help this process, we visualized the space of expressions in 2D space by using the multidimensional scaling(MDS). To see how effective this system is, we had users control facial expressions of 3D avatar by using the system. As a result of that, users estimate that system is very useful to control facial expression of 3D avatar in real-time.

Intercomparison of Change Point Analysis Methods for Identification of Inhomogeneity in Rainfall Series and Applications (강우자료의 비동질성 규명을 위한 변동점 분석기법의 상호비교 및 적용)

  • Lee, Sangho;Kim, Sang Ug;Lee, Yeong Seob;Sung, Jang Hyun
    • Journal of Korea Water Resources Association
    • /
    • v.47 no.8
    • /
    • pp.671-684
    • /
    • 2014
  • Change point analysis is a efficient tool to understand the fundamental information in hydro-meteorological data such as rainfall, discharge, temperature etc. Especially, this fundamental information to change points to future rainfall data identified by reasonable detection skills can affect the prediction of flood and drought occurrence because well detected change points provide a key to resolve the non-stationary or inhomogeneous problem by climate change. Therefore, in this study, the comparative study to assess the performance of the 3 change point detection skills, cumulative sum (CUSUM) method, Bayesian change point (BCP) method, and segmentation by dynamic programming (DP) was performed. After assessment of the performance of the proposed detection skills using the 3 types of the synthetic series, the 2 reasonable detection skills were applied to the observed and future rainfall data at the 5 rainfall gauges in South Korea. Finally, it was suggested that BCP (with 0.9 posterior probability) could be best detection skill and DP could be reasonably recommended through the comparative study. Also it was suggested that BCP (with 0.9 posterior probability) and DP detection skills to find some change points could be reasonable at the North-eastern part in South Korea. In future, the results in this study can be efficiently used to resolve the non-stationary problems in hydrological modeling considering inhomogeneity or nonstationarity.