• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.1
• /
• pp.87-91
• /
• 2009

In the server disconnection problem, a network with m servers and their users is given and an attacker is to destroy a set of edges to maximize his net gain defined as the total disconnected utilities of the users minus the total edge-destruction cost. The problem is known to be NP-hard. In this paper, we study the server disconnection problem restricted to a ring network. We present an efficient combinatorial algorithm that generates an optimal solution in polynomial time.

• Kyungpook Mathematical Journal
• /
• v.58 no.1
• /
• pp.167-182
• /
• 2018

In this paper, we prove the optimal inequalities for the generalized normalized ${\delta}$-Casorati curvature and the normalized scalar curvature for different submanifolds in generalized (${\kappa},{\mu}$)-space forms. The proof is based on an optimization procedure involving a quadratic polynomial in the components of the second fundamental form. We also characterize the submanifolds on which equalities hold.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.102.1-102
• /
• 2002

In this paper, we propose Self-organizing neurofuzzy networks(SONFN) and discuss their comprehensive design methodology. The proposed SONFN is generated from the mutually combined structure of both neurofuzzy networks (NFN) and polynomial neural networks(PNN) for model identification of complex and nonlinear systems. NFN contributes to the formation of the premise part of the SONFN. The consequence part of the SONFN is designed using PNN. The parameters of the membership functions, learning rates and momentum coefficients are adjusted with the use of genetic optimization. We discuss two kinds of SONFN architectures and propose a comprehensive learning algorithm. It is shown that this network...

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.248-251
• /
• 1991

A robust monitor AGC(Automatic Gauge Control) system for a hot strip mill plant of POSCO Is designed by minimizing the H.inf. norm of a so called mixed sensitivity function. In order to solve the mininizatlon problem, a polynomial approach proposed by Kwakernaak[5] is used. The controller performance is tested by a computer simulation under various circumstances.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.92-97
• /
• 1988

The path planning is done at the joint level. Cubic spline functions are used for constructing joint trajectories for industrial robots. For N-joint robot, Cartesian knots are transformed into N sets of joint displacements, with one set for each joint. For industrial application the speed of operation affects the productivity. An algorithm is developed to schedule the time intervals between each pair of adjacent knots such that the total traveling time is minimized subject to the physical constraints on joint velocties acceleration and jerks.

• Journal of the Korean Statistical Society
• /
• v.8 no.1
• /
• pp.37-64
• /
• 1979

Criteria and designs are developed for estimating derivatives of P-variable second order polynomial response surfaces. The basic criterion used is mean square error of the estimated derivative, averaged over all directions and then averaged over a region of interest. A new design concept called slope-rotatability is introduced. A simplex optimization program is used to find minimum mena square error designs for the two variable case for $6 \leq N \leq 12$.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.471-478
• /
• 2007

In this article we shall introduce several operators on the reproducing kernel spaces and investigate quadratic forms on the $\mathcal{l}^2$ space. Using these operators we shall obtain a particular solution of a system of quadratic equations(1.5). Finally we can find an approximate solution of(1.5) by optimization of a nonnegative biquadratic polynomial.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.188-192
• /
• 2002

The ellipsoid algorithm solves some feasibility(or optimization) problems with LMI(Linear Matrix Inequality) constraint in polynomial time. Recently, it has been replaced by interior point algorithm due to its slow convergence and incapability of verifying feasibility. This paper proposes a method to improve its convergence by using the deep-cut method of linear programming. Simulation results show that the improved algorithm is more effective than the original one.

• Management Science and Financial Engineering
• /
• v.19 no.1
• /
• pp.25-28
• /
• 2013

Consider the inverse bin-packing number problem. Given a set of items and a prescribed number K of bins, the inverse bin-packing number problem, IBPN for short, is concerned with determining the minimum perturbation to the item-size vector so that all the items can be packed into K bins or less. It is known that this problem is NP-hard (Chung, 2012). In this paper, we investigate some special cases of IBPN that can be solved in polynomial time. We propose an optimal algorithm for solving the IBPN instances with two distinct item sizes and the instances with large items.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.6
• /
• pp.1-8
• /
• 2007

In this paper, research on joint optimization of the image spatial registration and the exposure compensation is conducted. The exposure compensation is performed in a frame work of the intensity compensation based on the polynomial approximation of the relationship between images. This compensation is jointly combined with the registration problem employing the Gauss-Newton nonlinear optimization method. In this paper, to perform for a simple and stable optimization, the block-coordinate method is combined with the Gauss-Newton optimization and extensively compared with the traditional approaches. Furthermore, regression analysis is considered in the compensation part for a better stable performance. By combining the block-coordinate method with the Gauss-Newton optimization, we can obtain a compatible performance reducing the computational complexity and stabilizing the performance. In the numerical result for a particular image, we obtain a satisfactory result for 10 repeats of the iteration, which implies a 50% reduction of the computational complexity. The error is also further reduced by 1.5dB compared to the ordinary method.