• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.859-863
• /
• 1987

In this paper, a relationship between difference triangular sets and sum triangular sets is developed to evaluate the weighted number of the third-order intermodulation products. In addition, a lower bound of the intermodulation products falling into the worst signal channel has been derived using the relationship between difference triangular sets and sum triangular sets. The formulas of the lower bound are useful for estimating the intermodulation impairment level in satellite communication systems.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.4
• /
• pp.207-211
• /
• 2004

We consider a class of uncertain nonlinear systems containing the uncertainties without a priori information except that they are bounded. For such systems, we assume that the upper bound of the uncertainties is represented as a Fredholm integral equation of the first kind and we propose an adaptation law that is capable of estimating the upper bound. Using this adaptive upper bound, a continuous robust control which renders uncertain nonlinear systems uniformly ultimately bounded is designed.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.296-298
• /
• 1992

Presented in this paper is a generalized norm bound for the continuous and discrete algebraic Riccati equations. The generalized norm bound provides a lower bound of the Riccati solutions specified by any kind of submultiplicative matrix norms including the spectral, Frobenius and $\ell_1$ norms.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.113.1-113
• /
• 2001

The robust position control with the bound function of neural network structure is proposed for uncertain robot manipulators. The neural network structure presents the bound function and does not need the concave property of the bound function, The robust approach is to solve this problem as uncertainties are included in a model and the controller can achieve the desired properties in spite of the imperfect modeling. Simulation is performed to validate this law for four-axis SCARA type robot manipulators.

• Journal of the Korean Statistical Society
• /
• v.22 no.1
• /
• pp.1-12
• /
• 1993

An approach to make the information bound sharper in median-unbiased estimation, based on an analogue of the Cramer-Rao inequality developed by Sung et al. (1990), is introduced for continuous densities with a nuisance parameter by considering information quantities contained both in the parametric function of interest and in the nuisance parameter in a linear fashion. This approach is comparable to that of improving the information bound in mean-unbiased estimation for the case of two unknown parameters. Computation of an optimal weight corresponding to the nuisance parameter is also considered.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.505-510
• /
• 2011

We give a constructive proof that a (partial) evaluation of a multivariate algebraic function with algebraic numbers is again an algebraic function. Especially, we obtain a bound on the degree of an evaluation with the degrees of the original algebraic function and the algebraic numbers evaluated. Furthermore, we show that our bound is sharp with an example.

• Journal of the Korean Statistical Society
• /
• v.21 no.1
• /
• pp.27-34
• /
• 1992

This paper provides a method of obtaining a lower bound on the probability of correct selection for a two-stage selection procedure. The resulting lower bound sharpens that by Tamhane and Bechhofer (1979) for the normal means problem with a common known variance. The design constants associated with the lower bound are computed and the results of the performance comparisons are given.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.291-299
• /
• 1998

We present a variant for the generalized continuous multiple-choice knapsack problem[1], which additionally has the well-known generalized lower bound constraints. The presented problem is characterized by some variables which only belong to the simple upper bound constraints and the others which are partitioned into both the continuous multiple-choice constraints and the generalized lower bound constraints. By exploiting some extended structural properties, an efficient algorithm of order Ο($n^2$1og n) is developed, where n is the total number of variables. A numerical example is presented.

• Proceedings of the Korea Contents Association Conference
• /
• 2018.05a
• /
• pp.485-486
• /
• 2018

In this paper, we consider a binary recovery framework of the Compressed Sensing (CS) problem. We derive an upper bound for $L_0$ recovery performance of a binary sparse signal in terms of the dimension N and sparsity K of signals, the number of measurements M. We show that the upper bound obtained from this work goes to the limit bound when the sensing matrix sufficiently become dense. In addition, for perfect recovery performance, if the signals are very sparse, the sensing matrices required for $L_0$ recovery are little more dense.

• Communications for Statistical Applications and Methods
• /
• v.3 no.2
• /
• pp.283-290
• /
• 1996

For finite discrete distributions with prescribed moments, there is a well-known upper bound on the index of the support. In this paper, we are interested in the smoothest density with prescribed moments among the class of smooth functions. We define an index of continuous distribution through the support and derive an upper bound on the index of the smoothest density. Some examples are given, some of which achieve the upper bound.