• Communications of the Korean Mathematical Society
• /
• v.13 no.1
• /
• pp.151-158
• /
• 1998

In this note we derive inequalities of linearly positive quadrant dependent random variables and obtain a strong law of large numbers for linealy positive quardant dependent random variables. Our results imply an extension of Birkel's strong law of large numbers for associated random variables to the linear positive quadrant dependence case.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.2
• /
• pp.237-260
• /
• 2001

The approximation properties for $L^2$-projection, Raviart-Thomas projection, and inverse inequality have been derived in 3 dimensional space. h-p-mixed finite element methods for strongly nonlinear second order elliptic problems are proposed and analyzed in 3D. Solvability and convergence of the linearized problem have been shown through duality argument and fixed point argument. The analysis is carried out in detail using Raviart-Thomas-Nedelec spaces as an example.

• Communications of the Korean Mathematical Society
• /
• v.28 no.1
• /
• pp.1-9
• /
• 2013

We consider the sets of matrix ordered pairs which satisfy extremal properties with respect to Boolean rank inequalities of matrices over nonbinary Boolean algebra. We characterize linear operators that preserve these sets of matrix ordered pairs as the form of $T(X)=PXP^T$ with some permutation matrix P.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.409-412
• /
• 1997

In this paper, we propose a novel synthesis method of GBSB(Generalized BSB)-based neural autoassociative memories in which we analyze qualitative properties of GBSB model, recast a design problem of an associative memory to LMIP(Linear Matrix Inequality Problem), and optimize the LMIP using LMI techniques. The obtained memory satisfies many of the required properties of associative memories and has some peculiar properties. Comparing experimental results with those of others, we show its correctness and effectiveness.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.04a
• /
• pp.133-136
• /
• 2004

This paper proposes a stability condition in affine Takagi-Sugeno (T-S) fuzzy systems with parametric uncertainties and then, introduces the design method of a fuzzy-model-based controller which guarantees the stability. The analysis is based on Lyapunov functions that are continuous and piecewise quadratic. The search for a piecewise quadratic Lyapunov function can be represented in terms of linear matrix inequalities (LMIs).

• Communications for Statistical Applications and Methods
• /
• v.1 no.1
• /
• pp.149-156
• /
• 1994

For an r > 2 and a finite B, $E\mid max \;1\leq k\leq n \;\sum\limits_{j=m+1}^{m+k}X_j\mid^r\leq Bn^ {\frac{r}{2}}$ (all $n\geq 1$) is obtained for a negatively associated sequence $\{X_j \;:\; j\in N\}$. We also derive the maximal inequelity for a negatively associated sequence. Stationarity is not required.

• 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.

• Speech Sciences
• /
• v.11 no.2
• /
• pp.211-216
• /
• 2004

In this paper, we present a fast encoding algorithm for vector quantization with an approximate Euclidean distance calculation. An approximation is performed by converting floating point to the near integer. An inequality between the approximate Euclidean distance and the nearest distance is developed to avoid unnecessary distance calculations. Since the proposed algorithm rejects those codewords that are impossible to be the nearest codeword, it produces the same output as conventional full search algorithm.

• Communications for Statistical Applications and Methods
• /
• v.8 no.1
• /
• pp.185-192
• /
• 2001

Using the Lorenz curve that is proved to be a powerful tool to measure the income inequality within a population of income receivers, we propose the normalized sample Lorenz curve for the goodness-of-fit test that is very important test in statistical analysis. For two hodgkin's disease data sets, we compare the Q-Q plot and the proposed normalized sample Lorenz curve.

• Journal of the Chungcheong Mathematical Society
• /
• v.31 no.1
• /
• pp.43-46
• /
• 2018

It is concerned with the continuity of the Hardy-Little wood maximal function between the classical Lebesgue spaces or the Orlicz spaces. A new approach to the continuity of the Hardy-Littlewood maximal function is presented through the observation that the continuity is closely related to the existence of solutions for a certain type of first order ordinary differential equations. It is applied to verify the continuity of the Hardy-Littlewood maximal function from $L^p({\mathbb{R}}^n)$ to $L^q({\mathbb{R}}^n)$ for 1 ${\leq}$ q < p < ${\infty}$.