• Journal of the Korean Statistical Society
• /
• 제32권2호
• /
• pp.203-211
• /
• 2003

A new result of weak convergence of the empirical process is established for a stationary ${\phi}-mixing$ sequence of random variables, which relaxes the existing conditions on mixing coefficients. The result is basically obtained from bounds for even moments of sums of ${\phi}-mixing$ r.v.'s useful for handling triangular arrays with entries decreasing in size.

• Kyungpook Mathematical Journal
• /
• 제50권4호
• /
• pp.499-507
• /
• 2010

A new class of univalent holomorphic functions with fixed finitely many coefficients based on Generalized fractional derivative are introduced. Also some important properties of this class such as coefficient bounds, convex combination, extreme points, Radii of starlikeness and convexity are investigated.

• Kyungpook Mathematical Journal
• /
• 제49권3호
• /
• pp.545-555
• /
• 2009

In this paper, we investigate a generalized family of complex-valued harmonic functions that are multivalent, sense-preserving, and are associated with k-uniformly harmonic functions in the unit disk. The results obtained here include a number of known and new results as their special cases.

• Journal of the Korean Statistical Society
• /
• 제31권2호
• /
• pp.153-161
• /
• 2002

A new method of construction of second order slope rotatable designs (SOSRD) using symmetrical unequal block arrangements (SUBA) with two unequal block sizes is suggested. The proposed method may sometimes lead to designs with less number of design points than those available in the literature. Further, bounds for the parameters of SOSRD are also obtained.

• 대한수학회지
• /
• 제54권2호
• /
• pp.545-561
• /
• 2017

The signature of a surface bundle over a surface is known to be divisible by 4. It is also known that the signature vanishes if the fiber genus ${\leq}2$ or the base genus ${\leq}1$. In this article, we construct new smooth 4-manifolds with signature 4 which are surface bundles over surfaces with small fiber and base genera. From these we derive improved upper bounds for the minimal genus of surfaces representing the second homology classes of a mapping class group.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.107.6-107
• /
• 2001

Genetic alogorithm(GA) is a well-known global optimization algorithm. However, as the searching bounds grow wider., performance of local optimization deteriorates. In this paper, we propose a hybrid algorithm which integrates the gradient algorithm and GA so as to reinforce the performance of local optimization. We apply this algorithm to the system identification of second order RLC circuit. Identification results show that the proposed algorithm gets the better and robust performance to find the exact values of RLC elements.

• Journal of applied mathematics & informatics
• /
• 제30권1_2호
• /
• pp.127-133
• /
• 2012

We establish the polynomial convergence of a new class of path-following methods for SDLCP whose search directions belong to the class of directions introduced by Monteiro [3]. We show that the polynomial iteration-complexity bounds of the well known algorithms for linear programming, namely the short-step path-following algorithm of Kojima et al. and Monteiro and Alder, carry over to the context of SDLCP.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.742-746
• /
• 1992

This paper proposes a new linear robust state feedback controller for the linear discrete time systems which have uncertainties in the state and input matrices. The uncertainties need not satisfy the matching conditions, but only their bounds are needed to be known. The proposed controller is derived from the linear quadratic game problem, which solution is obtained via the modified algebraic Riccati equation. The controller guarantees the robust performance bound. The bound of the solution and the condition of the uncertainties, which can stabilize the uncertain system are explored.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
• /
• pp.105-108
• /
• 2001

In this paper, we suggest more precise performance analysis method of turbo interleavers based on two criteria; performance bounds like Union Bound and weight frequency of codewords. In order to present our new method, we employ block, pseudo random, and so-called prime interleavers in compliance of 3GPP standard, respectively. 3GPP complied turbo encoder, decoder, and AWGN channel are implemented by using MATLAB for our performance analysis. According to our analysis, both criteria should be taken into account coincidently to predict the performance of newly designed interleavers.

• 대한수학회논문집
• /
• 제22권2호
• /
• pp.305-313
• /
• 2007

Let $A_1,\;A_2,\;\ldots,\;A_m$ and $B_1,\;B_2,\;\ldots,\;B_n$ be two sequences of events on the same probability space. Let $X=X_m(A)\;and\;Y=Y_n(B)$, respectively, denote the numbers of those $A_i's\;and\;B_j's$ which occur. We establish new bivariate Bonferroni-type inequalities using consecutive events and deduce a known result.