• Journal of the military operations research society of Korea
• /
• v.26 no.2
• /
• pp.143-158
• /
• 2000

This paper deals with the problem of redundancy allocation for the mixed reliability system in an optimal way. Two kinds of the reliability system are considered for optimal allocation of parallel redundancy. The problem is approached as the optimization problems using th standard method of dynamic programming(DP). The algorithm for solving the optimal redundancy allocation is proposed and then the DP algorithm is applied to two numerical examples such as maximization of reliability subject to an allowable cost-constraint and minimization of the total cost subject to the specified minimum reliability-constraint. A consequence of this study is that the developed computer program package can be applied to the optimal redundancy allocation for the mixed reliability system.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.2
• /
• pp.278-281
• /
• 2008

Linear motor (LM) based shuttle cars will play an important role in the future transportation systems of marine terminals to cope with increasing container flows. These systems are known as agile port terminals because of their significant advantages. However, routing for multiple shuttle cars is still an open issue. We present a network model of a container yard and propose constrained dynamic programming (DP) for its routing strategy with collision avoidance. The algorithm is a modified version of typical DP which is used to find an optimal path for a single traveler. We evaluate the new algorithm through simulation results for three shuttle cars in a mesh-type container yard.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.4
• /
• pp.304-311
• /
• 2003

This paper considers a new variation of scheduling problems where jobs are dispatched in batches. The variation is the case where the batch sequence is fixed. The objective is to minimize the sum of the completion times of the batches. This simple environment has a variety of real world applications such as part kitting and customer order scheduling. We show that this problem is binary NP-complete when there exist two machines. For the same problem, we develop an optimal dynamic programming (DP) algorithm which runs in pseudo-polynomial time. We finally prove the optimality of the DP algorithm.

• Journal of Korea Water Resources Association
• /
• v.48 no.1
• /
• pp.57-67
• /
• 2015

One of main benefits of a dual polarization radar is improvement of quantitative rainfall estimation. In this paper, performance of two representative rainfall estimation methods for a dual polarization radar, JPOLE and CSU algorithms, have been compared by using data from a MOLIT S-band dual polarization radar. In addition, this paper presents evaluation of specific differential phase ($K_{dp}$) retrieval algorithm proposed by Lim et al. (2013). Current $K_{dp}$ retrieval methods are based on range filtering technique or regression analysis. However, these methods can result in underestimating peak $K_{dp}$ or negative values in convective regions, and fluctuated $K_{dp}$ in low rain rate regions. To resolve these problems, this study applied the $K_{dp}$ distribution method suggested by Lim et al. (2013) and evaluated by adopting new $K_{dp}$ to JPOLE and CSU algorithms. Data were obtained from the Mt. Biseul radar of MOLIT for two rainfall events in 2012. Results of evaluation showed improvement of the peak $K_{dp}$ and did not show fluctuation and negative $K_{dp}$ values. Also, in heavy rain (daily rainfall > 80 mm), accumulated daily rainfall using new $K_{dp}$ was closer to AWS observation data than that using legacy $K_{dp}$, but in light rain(daily rainfall < 80mm), improvement was insignificant, because $K_{dp}$ is used mostly in case of heavy rain rate of quantitative rainfall estimation algorithm.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.13 no.1
• /
• pp.208-222
• /
• 2021

Managing with the presence of sea ice is the primary challenge in the operation of floating platforms in the Arctic region. It is widely accepted that offshore structures operating in Arctic conditions need station-keeping methods as well as ice management by icebreakers. Dynamic Positioning (DP) is one of the station-keeping methods that can provide mobility and flexibility in marine operations. The presence of sea ice generates complex external forces and moments acting on the vessel, which need to be counteracted by the DP system. In this paper, an icevaning control algorithm is proposed that enables Arctic offshore vessels to perform DP operations. The proposed icevaning control enables each vessel to be oriented toward the direction of the mean environmental force induced by ice drifting so as to improve the operational safety and reduce the overall thruster power consumption by having minimum external disturbances naturally. A mathematical model of an Arctic offshore vessel is summarized for the development of the new icevaning control algorithm. To determine the icevaning action of the Arctic offshore vessel without any measurements and estimation of ice conditions including ice drift, task and null space are defined in the vessel model, and the control law is formulated in the task space. A backstepping technique is utilized to handle the nonlinearity of the Arctic offshore vessel's dynamic model, and the Lyapunov stability theory is applied to guarantee the stability of the proposed icevaning control algorithm. Experiments are conducted in the ice tank of the Korea Research Institute of Ships and Ocean Engineering to demonstrate the feasibility of the proposed approach.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.620-626
• /
• 2004

For general nonlinear processes, it is difficult to control with a linear model-based control method and nonlinear controls are considered. Among the numerous approaches suggested, the most rigorous approach is to use dynamic optimization. Many general engineering problems like control, scheduling, planning etc. are expressed by functional optimization problem and most of them can be changed into dynamic programming (DP) problems. However the DP problems are used in just few cases because as the size of the problem grows, the dynamic programming approach is suffered from the burden of calculation which is called as 'curse of dimensionality'. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach is proposed by Bertsekas and Tsitsiklis (1996). To get the solution of seriously nonlinear process control, the interest in NDP approach is enlarged and NDP algorithm is applied to diverse areas such as retailing, finance, inventory management, communication networks, etc. and it has been extended to chemical engineering parts. In the NDP approach, we select the optimal control input policy to minimize the value of cost which is calculated by the sum of current stage cost and future stages cost starting from the next state. The cost value is related with a weight square sum of error and input movement. During the calculation of optimal input policy, if the approximate cost function by using simulation data is utilized with Bellman iteration, the burden of calculation can be relieved and the curse of dimensionality problem of DP can be overcome. It is very important issue how to construct the cost-to-go function which has a good approximate performance. The neural network is one of the eager learning methods and it works as a global approximator to cost-to-go function. In this algorithm, the training of neural network is important and difficult part, and it gives significant effect on the performance of control. To avoid the difficulty in neural network training, the lazy learning method like k-nearest neighbor method can be exploited. The training is unnecessary for this method but requires more computation time and greater data storage. The pH neutralization process has long been taken as a representative benchmark problem of nonlin ar chemical process control due to its nonlinearity and time-varying nature. In this study, the NDP algorithm was applied to pH neutralization process. At first, the pH neutralization process control to use NDP algorithm was performed through simulations with various approximators. The global and local approximators are used for NDP calculation. After that, the verification of NDP in real system was made by pH neutralization experiment. The control results by NDP algorithm was compared with those by the PI controller which is traditionally used, in both simulations and experiments. From the comparison of results, the control by NDP algorithm showed faster and better control performance than PI controller. In addition to that, the control by NDP algorithm showed the good results when it applied to the cases with disturbances and multiple set point changes.

• ETRI Journal
• /
• v.42 no.4
• /
• pp.619-632
• /
• 2020

Highly dispersive S-boxes are desirable in cryptosystems as nonlinear confusion sublayers for resisting modern attacks. For a near optimal cryptosystem resistant to modern cryptanalysis, a highly nonlinear and low differential probability (DP) value is required. We propose a method based on a piecewise linear chaotic map (PWLCM) with optimization conditions. Thus, the linear propagation of information in a cryptosystem appearing as a high DP during differential cryptanalysis of an S-box is minimized. While mapping from the chaotic trajectory to integer domain, a randomness test is performed that justifies the nonlinear behavior of the highly dispersive and nonlinear chaotic S-box. The proposed scheme is vetted using well-established cryptographic performance criteria. The proposed S-box meets the cryptographic performance criteria and further minimizes the differential propagation justified by the low DP value. The suitability of the proposed S-box is also tested using an image encryption algorithm. Results show that the proposed S-box as a confusion component entails a high level of security and improves resistance against all known attacks.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.1
• /
• pp.73-80
• /
• 2016

This study focuses on the formation of input release lots in a semiconductor wafer fabrication facility. After the order-lot pegging process assigns lots in the fab to orders and calculates the required quantity of wafers for each product type to meet customers' orders, the decisions on the formation of input release lots should be made to minimize the production costs of the release lots. Since the number of lots being processed in the wafer fab directly is related to the productivity of the wafer fab, the input lot formation is crucial process to reduce the production costs as well as to improve the efficiency of the wafer fab. Here, the input lot formation occurs before every shift begins in the semiconductor wafer fab. When input quantities (of wafers) for product types are given from results of the order-lot pegging process, lots to be released into the wafer fab should be formed satisfying the lot size requirements. Here, the production cost of a homogeneous lot of the same type of product is less than that of a heterogeneous lot that will be split into the number of lots according to their product types after passing the branch point during the wafer fabrication process. Also, more production cost occurs if a lot becomes more heterogeneous. We developed a multi-dimensional dynamic programming algorithm for the input lot formation problem and showed how to apply the algorithm to solve the problem optimally with an example problem instance. It is necessary to reduce the number of states at each stage in the DP algorithm for practical use. Also, we can apply the proposed DP algorithm together with lot release rules such as CONWIP and UNIFORM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1126-1139
• /
• 1994

This paper proposes an effective recognition system which recognizes the mixed document consisting of handwritten korean/alphanumeric texts and graphic images. In the preprocessing step, an input image is binarized by the proposed thresholding scheme, then graphic and character regions are separated by using connected components and chain codes. Separated Korean characters are merged based on partial recognition and their character types and sized. In the character recognition step, we use the branch and bound algorithm based on DP matching costs to recognize Korean characters. Also we recognize alphanumeric characters using several robust features. Finally we use a dictionary and information of a recognition step to correct wrong recognition results. Computer simulation with several test documents shows what the proposed algorithm recognized effectively handwritten mixed texts.

• 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.