• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.858-860
• /
• 2005

This paper presents an Optimal Power Flow (OPF) algorithm using Interior Point Method (IPM) to swiftly and precisely perform the five minute dispatch. This newly suggested methodology is based on Affine Scailing Interior Point Method (AS IPM), which is favorable for large-scale problems involving many constraints. It is also eligible for OPF problems in order to improve the calculation speed and the preciseness of its resultant solutions. Lastly, this paper provides a relevant case study to confirm the efficiency of the proposed methodology.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.2
• /
• pp.135-140
• /
• 1999

This paper describes a affine transform coding which is reducing long time to take on image encoding by using scaling method and limited search area technique. For evaluating its performance, the proposed algorithm compare with Jacquin's method using traditional affine transform coding methods. Simulation results, the proposed algorithm considerably reduces encoding time by using scaling method and limited search area method. Also, the proposed algorithm provides much shorter encoding time with a little degradation of the decoded image quality than Jacquin's method.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.06a
• /
• pp.125-130
• /
• 1997

In this paper we present an algorithm to generate new views of a scene, starting with images from weakly calibrated cameras. Errors in 3D scene reconstruction usually gets reflected in the quality of the new scene generated, so we seek a direct method for reprojection. In this paper, we use the knowledge of dense point matches and their affine coordinate values to estimate the corresponding affine coordinate values in the new scene. We borrow ideas from the object recognition literature, and extend them significantly to solve the problem of reprojection. Unlike the epipolar line intersection algorithms for reprojection which requires at least eight matched points across three images, we need only five matched points. The theory of reprojection is used with hardware based rendering to achieve fast rendering. We demonstrate our results of novel view generation from stereopairs for arbitrary locations of the virtual camera.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.2
• /
• pp.476-483
• /
• 2010

If the data are pre-whitened, then gradient adaptive algorithms which are simpler than higher order statistics algorithms can be used in adaptive blind signal estimation. In this paper, we propose a blind subband affine projection algorithm for multiple-input multiple-output adaptive equalization in the blind environments. All of the adaptive filters in subband affine projection equalization are decomposed to polyphase components, and the coefficients of the decomposed adaptive sub-filters are updated by defining the multiple cost functions. An infinite impulse response filter bank is designed for the data pre-whitening. Pre-whitening procedure through subband filtering can speed up the convergence rate of the algorithm without additional computation. Simulation results are presented showing the proposed algorithm's convergence rate, blind equalization and blind signal separation performances.

• Journal of Power Electronics
• /
• v.11 no.3
• /
• pp.327-334
• /
• 2011

Single-phase power factor correction (PFC) converter circuits are non-linear systems due to the contribution of their multiplier. This non-linearity causes difficulties in analysis and design. Models that reduce the system to a linear system involve considerable approximation, and produce results that are susceptible to instability problems. In this paper a piecewise affine (PWA) system is introduced for describing the nonlinear averaged model. Then robust output feedback controllers are established in terms of the linear matrix inequality (LMI). Simulation and experiments results show the effectiveness of the proposed control method.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.169-172
• /
• 2001

In recent years, many studies regarding the modeling of fuzzy system have been conducted. In this paper, a new computational approach to modeling of linguistic fuzzy system is proposed The fuzzy system is modeled as a combination of affine systems, The proposed method can be used in a rigorous stability analysis of fuzzy system including the linguistic fuzzy controller.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.127-143
• /
• 2015

In this paper, we consider a modified inexact Newton method for solving a nonlinear system F(x) = 0 where $F(x):R^n{\rightarrow}R^n$. The basic idea is to accelerate convergence. A semi-local convergence theorem for the modified inexact Newton method is established and an affine invariant version is also given. Moreover, we test three numerical examples which show that the modified inexact scheme is more efficient than the classical inexact Newton strategy.

• Honam Mathematical Journal
• /
• v.33 no.3
• /
• pp.381-391
• /
• 2011

One of the main interesting things of a matroid theory is the representability by a matroid from a matrix over some field F. The representability of uniform matroid $U_{m,n}$ over some field are studied by many authors. In this paper we construct a matrix representing $U_{3,6}$ over the field GF(4). Also we find out matrix of the affine matroid AG(2, 3) over the field GF(4).

• The Pure and Applied Mathematics
• /
• v.12 no.1
• /
• pp.65-73
• /
• 2005

Let g = g(A) = (equation omitted) + be a symmetrizable Kac-Moody Lie algebra of type D/sub l//sup (1) with W as its Weyl group. We construct a sequence of root spaces with certain conditions. We also find the number of terms of this sequence is less then or equal to the hight of θ, the highest root.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.59-65
• /
• 1992

A modified primal-dual affine scaling algorithm for linear programming is presented. This modified algorithm generates an elipsoid containing all optimal dual solutions at each iteration, then checks whether or not a dual hyperplane intersects this ellipsoid. If the dual hyperplane has no intersection with this ellipsoid, its corresponding column must be optimal nonbasic. By condensing these columns, the size of LP problem can be reduced.