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

The robust predictive control law which use the bound estimation is proposed for uncertain robot manipulators. Since the control design of a real manipulator system may often be made on the basis of the imperfect knowledge about model, it´s an important tend to design a robust control law that will guarantee the desired performance of the manipulator under uncertain elements. In the preceeding work, the robust predictive control law was proposed. In this work, we propose a class of robust predictive control of manipulators with the bound estimate technique and fe stability based on Lyapunov function is presented.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.259-262
• /
• 2001

An improved robust hybrid control law is proposed. This law used the separated bounding function and the stiffness bound. It satisfied the performance though we don't know precise information of contact environments. It guarantees the practical stability in sense of Lyapunov. Simulation was performed to validate this law using a four-axis SCARA type robot manipulator.

• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.1
• /
• pp.7-10
• /
• 2009

With the introduction of a new parameter $n{\geq}1$, Kim generalized an upper bound for the exponential function that implies the inequality between the arithmetic and geometric means. By a change of variable, this generalization is equivalent to exp $(\frac{n(x-1)}{n+x-1})\;\leq\;\frac{n-1+x^n}{n}$ for real ${n}\;{\geq}\;1$ and x > 0. In this paper, we show that this inequality is true for real x > 1 - n provided that n is an even integer.

• Journal of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.171-181
• /
• 1995

Nielsen coincidence theory is concerned with the estimation of a lower bound for the number of coincidences of two maps $f,g: X \longrightarrow Y$. For this purpose the so-called Nielsen number N(f,g) is introduced, which is a lower bound for the number of coincidences ([1]). The relative Nielsen number N(f : X,A) in the fixed point theory is introduced in [3], which is a lower bound for the number of fixed points for all maps in the relative homotopy class of f:(X,A) $\longrightarrow$ (X,A), and its estimation is given in [5].

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1996.03b
• /
• pp.40-47
• /
• 1996

An upper bound solution of tube drawing process using a fixed tapered plug has been obtained , which reduces to an solution for tube sinking by setting friction factor between tube and plug at zero. Effects of various process paraments have been discussed based on the solution.

• The Pure and Applied Mathematics
• /
• v.10 no.1
• /
• pp.37-47
• /
• 2003

We will show that any linear perturbation of polynomials that introduces bounded perturbations into the roots of polynomial is some linear combination of the derivatives of a polynomial. And we will derive an absolute root bound functional which is in some sense better than the other known absolute root bound functionals.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.223-233
• /
• 2007

The so-called Korean BNC (bound noun construction) displays complex syntactic, semantic, and constructional properties. This paper, couched upon a constraint-based approach, two different syntactic structures for the construction with articulated lexical properties for the BNs and relevant predicates. The paper reports an implementation of this analysis in the LKB (Linguistic Knowledge Building) system and shows us that this direction is robust enough to pare relevant sentences.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.542-547
• /
• 2007

It is suggested that the difference between co-referential and bound reflexive pronouns found in many languages can be accounted for by using the notion of the case extension of a type <1> quantifier. Given this proposal the co-referential pronouns get their meaning when the corresponding NP takes nominal case extension first. Bound reflexives are reflexivisers in the sense that they are not case extensions of quantifiers although they also transform binary relations into sets. Examples from Japanese and from Polish are discussed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.880-882
• /
• 2008

This paper presents LDPC codes' upper bounds over the waterfall SNR region. The previous researches have focused on the average bound or ensemble bound over the whole SNR region and showed the performance differences for the fixed block size. In this paper, the particular LDPC codes' upper bounds for various block sizes are calculated over the waterfall SNR region and are compared with BP decoding performance. For different block sizes the performance degradation of BP decoding is shown.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.4
• /
• pp.1219-1231
• /
• 2008

The main object of this paper is to develop a leave-one-out(LOO) bound of all pairwise comparison error correcting output codes (APC-ECOC). To avoid using classifiers whose corresponding target values are 0 in APC-ECOC and requiring pilot estimates we developed a bound based on mean misclassification probability(MMP). It can be used to tune kernel hyperparameters. Our empirical experiment using kernel mean squared estimate(KMSE) as the binary classifier indicates that the bound leads to good estimates of kernel hyperparameters.