• 물과 미래
• /
• 제14권2호
• /
• pp.63-69
• /
• 1981

본 연구는 용수 공급시설의 최적건설순서 및 최적건설년을 시간-용수수요의 관계로부터 결정함에 있어서 동적 계획법에 의한 해석으로부터 동적 계획법의 수질원분야에 대한 응용가능성을 살펴보며 그 적용을 보이고자 하였다. 분석에 있어서 대구시의 상수도확충계획 자료 중 건설가능 Projects를 채택하였으며 용수추정방법을 지수함수식, 대구시추정치 및 두 방법의 평균치의 3가지 방법으로 하여 동적 계획모델에 적용시켰으며 그 결과 수요곡선의 변화가 optimal sequence에 변화를 가져왔고 대체적으로 D-E-G-F-C-B-A의 순으로 향후 33-38년 기간 내에 건설되어야 함을 발견하였다. 그리고 이자율의 변동은 present value cost에만 영향이 있었으며 동적 계획모델에 의한 용수공급시설의 최적화가 타당함을 보여주었다.

• 한국산학기술학회논문지
• /
• 제4권2호
• /
• pp.87-95
• /
• 2003

Dynamic Programming Matching (DPM)은 순차적으로 구성된 문제를 수학적으로 최적화 시키는 기술로서 패턴인시 분야에서 다년간 중요한 역할을 해왔다. 서명인식을 위한 대부분의 실제적 적용에서는 Sakoe and Chiba [9]의 실제구현 버전이 기반이 되어 왔는데, 일반적으로 slope constraint p = 0의 방법이 적용되어 왔다. 이 논문에서는 이 경우에는 전진탐색에 의한 휴리스틱한 방법을 적용한 MDPM이 상당한 처리시간의 단축 뿐만 아니라 약간의 인식능력 향상을 가질 수 있음을 보여준다.

• 대한설비공학회:학술대회논문집
• /
• 대한설비공학회 2009년도 하계학술발표대회 논문집
• /
• pp.1061-1064
• /
• 2009

The objective of this study is to find the optimal operational planning of the hybrid cooling system, which is combined by ice storage system and the absorption chiller. The optimization technique used in this study is dynamic programming. The objective function is summed cost during a day including charge and discharge periods of ice storage system and operation time of absorption chiller. Assuming that initially ice storage tank is stored fully and the cooling load is perfectly predicted for the operational planning. This method provides the most efficient and economic combination of equipment operational planning for cooling with respect to energy consumption cost.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2001년도 기술교육위원회 창립총회 및 학술대회 의료기기전시회
• /
• pp.23-27
• /
• 2001

Making the safety situation from the various work system is very important in the industrial fields. The proposed neural network technique is the real titre computation method based theory of inter-node diffusion for searching the safety distances from the sudden appearance-objests during the work driving. The main steps of the distance computation using the theory of stereo vision like the eyes of man is following steps. One is the processing for finding the corresponding points of stereo images and the other is the interpolation processing of full image data from nonlinear image data of obejects. All of them request much memory space and titre. Therefore the most reliable neural-network algorithm is drived for real time recognition of obejects, which is composed of a dynamic programming algorithm based on sequence matching techniques. And the real time reconstruction of nonlinear image information is processed through several simulations. I-D LIPN hardware has been composed, and the real time reconstruction is verified through the various experiments.

• 산업경영시스템학회지
• /
• 제38권2호
• /
• pp.120-128
• /
• 2015

Quality function deployment (QFD) is a useful method in product design and development to maximize customer satisfaction. In the QFD, the technical attributes (TAs) affecting the product performance are identified, and product performance is improved to optimize customer requirements (CRs). For product development, determining the optimal levels of TAs is crucial during QFD optimization. Many optimization methods have been proposed to obtain the optimal levels of TAs in QFD. In these studies, the levels of TAs are assumed to be continuous while they are often taken as discrete in real world application. Another assumption in QFD optimization is that the requirements of the heterogeneous customers can be generalized and hence only one house of quality (HoQ) is used to connect with CRs. However, customers often have various requirements and preferences on a product. Therefore, a product market can be partitioned into several market segments, each of which contains a number of customers with homogeneous preferences. To overcome these problems, this paper proposes an optimization approach to find the optimal set of TAs under multi-segment market. Dynamic Programming (DP) methodology is developed to maximize the overall customer satisfaction for the market considering the weights of importance of different segments. Finally, a case study is provided for illustrating the proposed optimization approach.

• Journal of Electrical Engineering and Technology
• /
• 제13권5호
• /
• pp.2074-2079
• /
• 2018

Global state space's optimal policy is used for offline controller in the form of table by using Dynamic Programming. If an optimal policy table has a large amount of control data, it is difficult to use the system in a low capacity system. To resolve these problem, controller using the compressed optimal policy table is proposed in this paper. A DCT is used for compression method and the cosine function is used as a basis. The size of cosine function decreased as the frequency increased. In other words, an essential information which is used for restoration is concentrated in the low frequency band and a value of small size that belong to a high frequency band could be discarded by quantization because high frequency's information doesn't have a big effect on restoration. Therefore, memory could be largely reduced by removing the information. The compressed output is stored in memory of embedded system in offline and optimal control input which correspond to state of plant is computed by interpolation with Inverse DCT in online. To verify the performance of the proposed controller, computer simulation was accomplished with a one link inverted pendulum.

• Journal of Information Processing Systems
• /
• 제18권1호
• /
• pp.97-114
• /
• 2022

Interest is increasing in electrocardiogram (ECG) signal analysis for embedded devices, creating the need to develop an algorithm suitable for a low-power, low-memory embedded device. Linear approximation of the ECG signal facilitates the detection of fiducial points by expressing the signal as a small number of vertices. However, dynamic programming, a global optimization method used for linear approximation, has the disadvantage of high complexity using memoization. In this paper, the calculation area and memory usage are improved using a linear approximated template. The proposed algorithm reduces the calculation area required for dynamic programming through local optimization around the vertices of the template. In addition, it minimizes the storage space required by expressing the time information using the error from the vertices of the template, which is more compact than the time difference between vertices. When the length of the signal is L, the number of vertices is N, and the margin tolerance is M, the spatial complexity improves from O(NL) to O(NM). In our experiment, the linear approximation processing time was 12.45 times faster, from 18.18 ms to 1.46 ms on average, for each beat. The quality distribution of the percentage root mean square difference confirms that the proposed algorithm is a stable approximation.

• 한국정보컨버전스학회:학술대회논문집
• /
• 한국정보컨버전스학회 2008년도 International conference on information convergence
• /
• pp.145-150
• /
• 2008

This thesis explores the problem of reconstructing a three-dimensional(3D) scene given a set of images or image sequences of the scene. It describes efficient methods for the 3D reconstruction of static and dynamic scenes from stereo images, stereo image sequences, and images captured from multiple viewpoints. Novel methods for image-based and volumetric modelling approaches to 3D reconstruction are presented, with an emphasis on the development of efficient algorithm which produce high quality and accurate reconstructions. For image-based 3D reconstruction a novel energy minimisation scheme, Iterated Dynamic Programming, is presented for the efficient computation of strong local minima of discontinuity preserving energyy functions. Coupled with a novel morphological decomposition method and subregioning schemes for the efficient computation of a narrowband matching cost volume. the minimisation framework is applied to solve problems in stereo matching, stereo-temporal reconstruction, motion estimation, 2D image registration and 3D image registration. This thesis establishes Iterated Dynamic Programming as an efficient and effective energy minimisation scheme suitable for computer vision problems which involve finding correspondences across images. For 3D reconstruction from multiple view images with arbitrary camera placement, a novel volumetric modelling technique, Embedded Voxel Colouring, is presented that efficiently embeds all reconstructions of a 3D scene into a single output in a single scan of the volumetric space under exact visibility. An adaptive thresholding framework is also introduced for the computation of the optimal set of thresholds to obtain high quality 3D reconstructions. This thesis establishes the Embedded Voxel Colouring framework as a fast, efficient and effective method for 3D reconstruction from multiple view images.

• 한국정보통신학회논문지
• /
• 제7권4호
• /
• pp.826-832
• /
• 2003

본 연구에서는 계통운전예비력특성을 감안하여 DLC와 기동정지계획을 연계시킬 수 있는 방법을 제시하였다. 계통운전예비력을 고려하기 위하여 새로운 제약조건을 정식화하였으며, 또한 DLC와 UC를 연계하기 위하여 3차원 동적계획법을 적용하였다. 이 결과, 경제적인 DLC와 기동정지계획을 동시에 구할 수 있게 되었으며, 이를 시험계통에 적용하여 그 효용성을 입증하였다.

• 정보처리학회논문지B
• /
• 제10B권4호
• /
• pp.451-458
• /
• 2003

Dynamic Programming Matching(DPM)은 순차적으로 구성된 문제를 수학적으로 최적화 시키는 기술로서 패턴인식 분야에서 다년간 중요한 역할을 해왔다. 서명인식을 위한 대부분의 실제적 적용에서는 Sakoe and Chiba [9]의 실제구현 버전이 기반이 되어 왔는데, 일반적으로 slope constraint p = 0의 방법이 적용되어 왔다. 이 논문에서는 이 경우에는 전진탐색에 의한 휴리스틱한 방법을 적용한 MDPM이 상당한 처리 시간의 단축 뿐만 아니라 약간의 인식능력 향상을 가질 수 있음을 보여준다.