• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.5-9
• /
• 1995

In many cases of robust stability problems, the characteristic polynomial has real coefficients which or nonlinear functions of uncertain parameters. For this set of polynomials, a new stability easily checking algorithm for reducing the conservatism of the stability bound are given. It is the new stability theorem to determine the stability region just in parameter space. Illustrative example show that the presented method has larger stability bound in uncertain parameter space than others.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.367-369
• /
• 1986

Guaranteed cost control is a method applicable to a class of systems with uncertain parameters that guarantees an upper bound of the cost functional. This paper is concerned with a matrix decomposition technique used to yield a reasonable upper bound of the cost functional for a finite-time LQ regulator problem. The uncertain linear systems dealt with in this paper are described by a set of state equations of single-input phase-variable canonical form which contain unknown but bounded uncertain parameters.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2003.05a
• /
• pp.908-911
• /
• 2003

This study was performed to verify the effect of reinforcement of RC Beams strengthened($90^{\circ}$ strip type) by FRP(CFRP) and Predited the shear strength of them using the upper bound theorem. The prediction model was confirmed with the result of the FEM analysis. The analyzed result showed thar shear-damaged RC beams by strengthened by FRP was improved their shear capacity.

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

This paper proposes a solution approach to linear problems with many constraints of variable upper bound (VUB) type. This type of constraints are commonly found in various scheduling type problems for which tighter bounds are essential to achieve an efficiency in enumeration. An analytical framework based on factorization is adopted to devise a solution approach to the problem and extend it for more generalized VUB problem (GVUB). This research shows why the VUB type constraints are amenable to the factorization and gives a unified approach to generalized upper bound(GUB) problems, VUB problems and GVUB problems. Implementation issues are also included.

• Communications of the Korean Mathematical Society
• /
• v.22 no.2
• /
• pp.235-240
• /
• 2007

In this paper the authors study the properties of the so-called exponent-quasiadditive functions and an application to the generalized $Gr\ddot{o}tzsch$ ring function of quasiconformal theory is specified.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.1
• /
• pp.67-77
• /
• 2011

Let M be a compact orientable closed 3-manifold, and F a non-separating incompressible closed surface in M. Let M' = M - ${\eta}(F)$, where ${\eta}(F)$ is an open regular neighborhood of F in M. In the paper, we give a lower bound of genus of self-amalgamation of minimal Heegaard splitting $V'\;{\cup}_{S'}\;W'$ of M' under some conditions on the distance of the Heegaard splitting.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.143-150
• /
• 2004

In this paper we study the estimation problem of individual weights of objects using an A-optimal chemical balance weighing design. We assume that in this model errors are correlated and they have the same variances. The lower bound of tr$(X'G^{-1}X)^{-1}$ is obtained and a necessary and sufficient condition for this lower bound to be attained is given. There is given new construction method of A-optimal chemical balance weighing design.

• Proceedings of the KSME Conference
• /
• 2001.06a
• /
• pp.734-739
• /
• 2001

In this paper, an algorithm for stacking sequence optimization which deals with discrete ply angles is used for optimization of composite laminated plates. To handle discrete ply angles, the branch and bound method is modified. Numerical results show that the optimal stacking sequence is found with fewer evaluations of objective function than expected with the size of feasible region, which shows the algorithm can be effectively used for layup optimization of composite laminates..

• Kyungpook Mathematical Journal
• /
• v.54 no.3
• /
• pp.443-452
• /
• 2014

In the present investigation we consider Fekete-Szeg$\ddot{o}$ problem with complex parameter ${\mu}$ and also find upper bound of the second Hankel determinant ${\mid}a_2a_4-a^2_3{\mid}$ for functions belonging to a new class $S^{\tau}_{\gamma}(A,B)$ using Toeplitz determinants.

• Kyungpook Mathematical Journal
• /
• v.58 no.2
• /
• pp.231-242
• /
• 2018

We derive sharp upper bound on the initial coefficients and Hankel determinants for normalized analytic functions belonging to a class, introduced by Silverman, defined in terms of ratio of analytic representations of convex and starlike functions. A conjecture related to the coefficients for functions in this class is posed and verified for the first five coefficients.