• Journal of KIISE:Software and Applications
• /
• v.36 no.12
• /
• pp.1009-1015
• /
• 2009

Handwriting verification is a technique of distinguishing the same person's handwriting specimen from imitations with any two or more texts using one's handwriting individuality. This paper suggests an effective verification method for the handwritten signature or text on the off-line environment using pattern recognition technology. The core processes of the method which has been researched in this paper are extraction of letter area, extraction of features employing structural characteristics of handwritten text, feature analysis employing DTW(Dynamic Time Warping) algorithm and PCA(Principal Component Analysis). The experimental results show a superior performance of the suggested method.

• Journal of Digital Convergence
• /
• v.13 no.12
• /
• pp.209-215
• /
• 2015

In the past, there have been many theory and algorithms for vehicle tracking. But the time complexity of many feature point matching methods for vehicle tracking are exponential. Also, object segmentation and detection algorithms presented for vehicle tracking are exhaustive and time consuming. Therefore, we present the fast and efficient two stages method that can efficiently track the many moving vehicles on the road. The first detects the vehicle plate regions and extracts the feature points of vehicle plates. The second associates the feature points between frames using dynamic programming.

• Korean Journal of Microbiology
• /
• v.35 no.2
• /
• pp.115-120
• /
• 1999

Multiple Sequence Alignment of DNA and protem sequences is a imnport'mt tool in the study of molecular evolution, gene regulation. and prolein suucture-function relationships. Progressive pairwise alignment method generates multiple sequence alignment fast but not necessarily with optimal costs. Dynamic programming generates multiple sequence alig~~menl with optimal costs in most cases but long execution time. In this paper. we suggest genetlc algorithm lo improve the multiple sequence alignment generated from the cnlent methods, describe the design of the genetic algorithm, and compare the multiple sequence alignments from 0111 method and current methods.

• Industrial Engineering and Management Systems
• /
• v.16 no.1
• /
• pp.118-128
• /
• 2017

Uncertain factors in finical markets make the prediction of future returns and risk of asset much difficult. In this paper, a model,assuming the admissible errors on expected returns and risks of assets, assisted in the multiperiod mean variance portfolio selection problem is built. The model considers transaction costs, upper bound on borrowing risk-free asset constraints, cardinality constraints and threshold constraints. Cardinality constraints limit the number of assets to be held in an efficient portfolio. At the same time, threshold constraints limit the amount of capital to be invested in each stock and prevent very small investments in any stock. Because of these limitations, the proposed model is a mix integer dynamic optimization problem with path dependence. The forward dynamic programming method is designed to obtain the optimal portfolio strategy. Finally, to evaluate the model, our result of a meaning example is compared to the terminal wealth under different constraints.

• Journal of Advanced Marine Engineering and Technology
• /
• v.11 no.1
• /
• pp.39-52
• /
• 1987

Recently, the design problem of heat insulation have been reappraised in the aspect of energy saving due to the rising trend of energy cost. For example, that design problem is increasingly requsted in the fields of accommodation air conditioning systems, hot water supply systems, cargo handling systems, district heating or cooling systems. The rational design of heat insulation of piping systems can not only improve the overall efficiency of energy transfer but also give energy saving. In this paper, the heat insulation problem of district heating systems is therefore modeled as the multi-stage decision processes, suitable for dynamic programming technique. And take the object function as the sum of heat insulation material cost involved construction cost and heat loss cost, and propose the design method to minimize the object function for overall piping systems by dynamic programing. Effectiveness of design method presented here is proved by a computer simulation.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.1
• /
• pp.8-14
• /
• 2007

This paper addresses the allocation planning of the storage location in a warehouse system that the dedicated storage method is used. In the discrete finite time period model, the demands for storage location of products are dynamic for time periods. The planning is to determine the reallocation time period and the storage location of the products in reallocation time period, which minimizes costs. The cost factors are the reallocation cost, the travel cost within warehouse and the surplus storage location cost. A model is formulated, and the property of optimal solution is characterized. The dynamic programming algorithm is developed, and a numerical example is shown.

• Proceedings of the KIEE Conference
• /
• 2001.05a
• /
• pp.220-222
• /
• 2001

This paper describes the optimizing method of direct load control (DLC) considering unit commitment which is based on dynamic programming. To consider the unit commitment on DLC, 3-Dimensional dynamic programming as a new unit commitment method is developed. And, this method is applied to DLC. As a result, optimization of operating schedule with DLC is possible. This method is applied to the test system, and usefulness of the method is verified.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.2
• /
• pp.57-63
• /
• 2012

Software release planning model of software product lines was formulated as a precedence-constrained multiple 0-1 knapsack problem. The purpose of the model was to maximize the total profit of an entire set of selected features in a software product line over a multi-release planning horizon. The solution approach is a dynamic programming procedure. Feasible solutions at each stage in dynamic programming are determined by using backward dynamic programming approach while dynamic programming for multi-release planning is forward approach. The pre-processing procedure with a heuristic and reduction algorithm was applied to the single-release problems corresponding to each stage in multi-release dynamic programming in order to reduce the problem size. The heuristic algorithm is used to find a lower bound to the problem. The reduction method makes use of the lower bound to fix a number of variables at either 0 or 1. Then the reduced problem can be solved easily by the dynamic programming approaches. These procedures keep on going until release t = T. A numerical example was developed to show how well the solution procedures in this research works on it. Future work in this area could include the development of a heuristic to obtain lower bounds closer to the optimal solution to the model in this article, as well as computational test of the heuristic algorithm and the exact solution approach developed in this paper. Also, more constraints reflecting the characteristics of software product lines may be added to the model. For instance, other resources such as multiple teams, each developing one product or a platform in a software product line could be added to the model.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1137-1140
• /
• 1998

In this paper, we propose the new hardware architecture which implements the stereo matching algorithm using the dynamic programming method. The dynamic programming method is used in finding the corresponding pixels between the left image and the right image. The proposed MOEPE(Merged Odd-Even PE) architecture operates in the systolic manner and finds the disparities from the intensities of the pixels on the epipolar line. The number of PEs used in the MOEPE architecture is the number of the range constraint, which reduced the number of the necessary PEs dramatically compared to the traditional method which uses the PEs with the number of pixels on the epipolar line. For the normal method by 25 times. The proposed architecture is modeled with the VHDL code and simulated by the SYNOPSYS tool.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.2
• /
• pp.511-517
• /
• 2015

Determination of the required reserve capacity has an important function in operation of power system and it is calculated based on the largest loss of supply. However, conventional method cannot be applied in future power system, because potential grid-connected distributed generator and abnormal temperature cause the large load imbalance. Therefore this paper address new framework for determining the optimal required reserve capacity taking into account the real time load imbalance. At first, we introduce the way of operating reserve resources which are the secondary, tertiary, Direct Load Control (DLC) and Load shedding reserves to make up the load imbalance. Then, the formulated problem can be solved by the Probabilistic Dynamic Programming (PDP) method. In case study, we divide two cases for comparing the cost function between the conventional method and the proposed method.