• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.2
• /
• pp.21-31
• /
• 1999

This paper presents a new possibility of calculating optimal control for large scale which consist of non-linear dynamic sub-systems using two level hierarchical structures method. And the proposed method is based on the idea of block pulse transformation to simplify the algorithm and its calculation. This algorithm used an expansion around the equilibrium point of the system to fix the second and higher order terms. These terms are compensated for iteratively at the second level by providing a prediction for the states and controls which form of a part of the higher order terms. In this new approach the quadratic penalty terms are not used in the cost function. This allows convergence over a longer time horizon and also provides faster convergence. And the method is applied to the problem of optimization of the synchronous machine. Results show that the new approach is superior to conventional numerical method or other previous algorithm.

• Interaction and multiscale mechanics
• /
• v.1 no.2
• /
• pp.191-209
• /
• 2008

In this paper, we model grain boundary evolution based on a multiple level set method. Grain boundary migration under a curvature-induced driving force is considered and the level set method is employed to deal with the resulting topological changes of grain structures. The complexity of using a level set method for modeling grain structure evolution is due to its N-phase nature and the associated geometry compatibility constraint. We employ a multiple level set method with a predictor-multicorrectors approach to reduce the gaps in the triple junctions down to the grid resolution level. A ghost cell approach for imposing periodic boundary conditions is introduced without solving a constrained problem with a Lagrange multiplier method or a penalty method. Numerical results for both uniform and random grain structures evolution are presented and the results are compared with the solutions based on a front tracking approach (Chen and Kotta et al. 2004b).

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.357-360
• /
• 2005

In this paper we consider the well-known semiparametric proportional hazards (PH) models for survival analysis. These models are usually used with few covariates and many observations (subjects). But, for a typical setting of gene expression data from DNA microarray, we need to consider the case where the number of covariates p exceeds the number of samples n. For a given vector of response values which are times to event (death or censored times) and p gene expressions (covariates), we address the issue of how to reduce the dimension by selecting the significant genes. This approach enable us to estimate the survival curve when n < < p. In our approach, rather than fixing the number of selected genes, we will assign a prior distribution to this number. The approach creates additional flexibility by allowing the imposition of constraints, such as bounding the dimension via a prior, which in effect works as a penalty. To implement our methodology, we use a Markov Chain Monte Carlo (MCMC) method. We demonstrate the use of the methodology to diffuse large B-cell lymphoma (DLBCL) complementary DNA(cDNA) data.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.3
• /
• pp.183-191
• /
• 2004

This paper deals with smooth curve fitting of data corrupt by noise. Most research efforts have been concentrated on employing the smoothness penalty function with the estimation of its optimal parameter in order to avoid the 'overfilling and underfitting' dilemma in noisy data fitting problems. Our approach, called DBSF(Differentiation-Based Smooth Fitting), is different from the above-mentioned method. The main idea is that optimal functions approximately estimating the derivative of noisy curve data are generated first using genetic programming, and then their integral values are evaluated and used to recover the original curve form. To show the effectiveness of this approach, DBSP is demonstrated by presenting two illustrative examples and the application of estimating the principal dimensions of bulk cargo ships in the conceptual design stage.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2002.05b
• /
• pp.829-836
• /
• 2002

The paper presents a multi-objective genetic algorithm approach to the design of a water distribution network. The objectives considered are minimization of network cost and maximization of a reliability measure. In this study, a new reliability measure, called network resilience, is introduced. This measure mimics a designer's desire of providing excess power at nodes and designing reliable loops with practicable pipe diameters. The proposed method produces a set of Pareto-optimal solutions in the search space of cost and network resilience. Genetic algorithms are observed to be poor in handling constraints. To handle constraints in a better way, a constraint handling technique that does not require a penalty coefficient and applicable to water distribution systems is presented. The present model is applied to two example problems, which were widely reported. Pipe failure analysis carried out on some of the solutions obtained revealed that the network resilience based approach gave better results in terms of network reliability.

• Asian-Australasian Journal of Animal Sciences
• /
• v.32 no.9
• /
• pp.1349-1354
• /
• 2019

Objective: The objective of this study was to determine the best approach for handling missing records of first to successful insemination (FS) in Japanese Black heifers. Methods: Of a total of 2,367 records of heifers born between 2003 and 2015 used, 206 (8.7%) of open heifers were missing. Four penalty methods based on the number of inseminations were set as follows: C1, FS average according to the number of inseminations; C2, constant number of days, 359; C3, maximum number of FS days to each insemination; and C4, average of FS at the last insemination and FS of C2. C5 was generated by adding a constant number (21 d) to the highest number of FS days in each contemporary group. The bootstrap method was used to compare among the 5 methods in terms of bias, mean squared error (MSE) and coefficient of correlation between estimated breeding value (EBV) of non-censored data and censored data. Three percentages (5%, 10%, and 15%) were investigated using the random censoring scheme. The univariate animal model was used to conduct genetic analysis. Results: Heritability of FS in non-censored data was $0.012{\pm}0.016$, slightly lower than the average estimate from the five penalty methods. C1, C2, and C3 showed lower standard errors of estimated heritability but demonstrated inconsistent results for different percentages of missing records. C4 showed moderate standard errors but more stable ones for all percentages of the missing records, whereas C5 showed the highest standard errors compared with noncensored data. The MSE in C4 heritability was $0.633{\times}10^{-4}$, $0.879{\times}10^{-4}$, $0.876{\times}10^{-4}$ and $0.866{\times}10^{-4}$ for 5%, 8.7%, 10%, and 15%, respectively, of the missing records. Thus, C4 showed the lowest and the most stable MSE of heritability; the coefficient of correlation for EBV was 0.88; 0.93 and 0.90 for heifer, sire and dam, respectively. Conclusion: C4 demonstrated the highest positive correlation with the non-censored data set and was consistent within different percentages of the missing records. We concluded that C4 was the best penalty method for missing records due to the stable value of estimated parameters and the highest coefficient of correlation.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.523-525
• /
• 2005

This paper deals with a linear matrix inequality (LMI) approach to the design of a static output feedback controller that simultaneously stabilizes a finite collection of linear time-invariant plants. Simultaneous stabilization by static ouput feedback is represented in terms of LMIs with a rank condition. An iterative penalty method is proposed to solve the rank-constrained LMI problem. Numerical experiments show the effectiveness of the proposed algorithm.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.9
• /
• pp.1624-1627
• /
• 2008

This paper deals with a linear matrix inequality (LMI) approach to the design of a PID controller for an attraction type magnetic levitation system. First, we convert the $H_ {\infty}$ PID controller problem into a static output feedback problem. We then solve the static output problem by using the recently developed penalty function method. Numerical experiments show the effectiveness of the proposed algorithm.

• Journal of applied mathematics & informatics
• /
• v.41 no.2
• /
• pp.311-320
• /
• 2023

In this article, a new penalty and different ranking algorithms are used to find the lowest transportation costs for the fuzzy transportation problem. This approach utilises different ranking techniques when dealing with triangular fuzzy numbers. Also, we find that the fuzzy transportation solution of the proposed method is the same as the Fuzzy Modified Distribution Method (FMODI) solution. Finally, examples are used to show how a problem is solved.

• The Korean Journal of Applied Statistics
• /
• v.35 no.2
• /
• pp.265-283
• /
• 2022

MovieLens data consists of recorded movie evaluations that was often used to measure the evaluation score in the recommendation system research field. In this paper, we provide additional information obtained by clustering user-specific genre preference information through movie evaluation data and movie genre data. Because the number of movie ratings per user is very low compared to the total number of movies, the missing rate in this data is very high. For this reason, there are limitations in applying the existing clustering methods. In this paper, we propose a convex clustering-based method using the pairwise fused penalty motivated by the analysis of MovieLens data. In particular, the proposed clustering method execute missing imputation, and at the same time uses movie evaluation and genre weights for each movie to cluster genre preference information possessed by each individual. We compute the proposed optimization using alternating direction method of multipliers algorithm. It is shown that the proposed clustering method is less sensitive to noise and outliers than the existing method through simulation and MovieLens data application.