• Communications for Statistical Applications and Methods
• /
• 제21권3호
• /
• pp.201-212
• /
• 2014

We provide a simple basic method to find bounds for higher order moments of unimodal distributions in terms of lower order moments when the random variable takes value in a given finite real interval. The bounds for moments in terms of the geometric mean of the distribution are also derived. Both continuous and discrete cases are considered. The bounds for the ratio and difference of moments are obtained. The special cases provide refinements of several well-known inequalities, such as Kantorovich inequality and Krasnosel'skii and Krein inequality.

• 한국경영과학회지
• /
• 제17권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.

• 한국통신학회논문지
• /
• 제35권11C호
• /
• pp.907-910
• /
• 2010

This paper presents the design of block lengths for irregular low-density parity-check (LDPC) codes based on the maximum variable degree $d_{{\upsilon},max}$. To design a block length, the performance degradation of belief-propagation (BP) decoding performance from upper bounds on the maximum likelihood (ML) decoding performance is used as an important factor. Since for large block lengths, the performance of irregular LDPC codes is very close to the Shannon limit, we focus on moderate block lengths ($5{\times}10^2\;{\leq}\;N\;{\leq}\;4{\times}10^3$). Given degree distributions, the purpose of our paper is to find proper block lengths based on the maximum variable degree $d_{{\upsilon},max}$. We also present some simulation results which show how a block length can be optimized.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 추계학술대회 논문집 학회본부
• /
• pp.52-54
• /
• 1996

A number of algorithm using the VSS(Variable Structure System) for uncertain dynamic system are developed. But, in these algorithms, the assumption that the uncertainties are bounded and their bounds are available to the designer is involved. And bounds on the uncertainties are an important clue to guarantee the stability of the closed loop system. However, sometimes bounds on the uncertainties may not be easily obtained because of the complexity of the structure of the uncertainties. Therefore, a methodology by which the boundary values on the uncertainties can be easily obtained is required. The VSS proposed in this proposal employ the new adaptive VSS scheme for uncertain dynamic system being estimated on line. The resulting control law is simple and easy to apply to on line computer control. It can also suppress chattering and maintain good tracking precision even if unmodeled dynamics are considered. And, a new method using nonlinear switching surface is introduced so that the speed response is improved and the good transient response can be obtained. Simulation results are presented and show the advantage of the proposed adaptive VSS with nonlinear switching surfaces.

• 한국지능시스템학회논문지
• /
• 제11권9호
• /
• pp.788-792
• /
• 2001

일반적으로 슬라이딩모드 제어는 외란이나 시스템의 변수변환에 강인한 특성을 가지나, 그 변화의 최대 경계 값을 알아야한다. 그러나, 이 값은 쉽게 얻어질 수가 없다. 퍼지 논리는 잘 정의되어 있지 않거나 복잡한 시스템의 제어기 설계에 효과적인 방법을 제시하나, 과도응답을 미리 결정할 수가 없다. 본 논문에서는 두 이론의 장점을 결합하여 새로운 제어 알고리듬을 제시한다. 최적의 퍼지변수 값을 결정하기 위하여 적응이론을 도입한다. 마지막으로 제안한 제어 알고리듬의 타당성을 살펴보기 위하여 수치적인 예를 가변길이진자시스템에 적용한다.

• 한국통신학회논문지
• /
• 제25권5B호
• /
• pp.797-808
• /
• 2000

이 논문에서는 강우 페이딩 환경하에서 Ka 밴드 위성을 사용하는 비대칭 8PSK 트랠리스 부호(Trellis-Coded Asymmetric 8PSK : TC-A8PSK)의 BER 상한을 제시한다. 대수정규분포 강우감쇠 모델을 이용하여 강우 페이딩 PDF를 새롭게 유도하고 Crane 모델의 강우강도 데이터에 근거하여 강우 페이딩 파라미터를 계산한다. 나아가 TCM 상태수와 CSI 유무에 따른 TC-A8PSK 시스템의 BER 상한을 각각 분석하고 그 성능을 비교한다. 과거 Divsalar와 Simon[9]에 의해 라이시안 페이딩 채널에서 2 상태 TCM 시스템의 BER 상한이 분석된 바 있으나 강우 페이딩 채널에서 TCM 시스템의 BER 상한을 분석한 것은 이 논문이 처음이다. 최종적으로 강우 페이딩 채널에서 TC-A8PSK 위성시스템의 BER 상한에 지배적인 영향을 미치는 요소는 사용주파수, 강우강도, 앙각, 신호전력대 잡음전력비, 비대칭 성좌각, 그리고 CSI 6가지로 요약 할 수 있다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1133-1138
• /
• 1991

A control of nonlinear system is motivated by the fact that all real plants are nonlinear systems and model identification introduces parameter errors. The purpose of this study is to design a Discrete Variable Structure Controller(DVSC) for single-rod hydraulic cylinder system. The model contains uncertain parameters which we known to lie upper and lower bounds. In the design of DVSC, the boundary layer concept was adopted to reduce cattering. The DVSC was evaluated through digital computer simulation and compared with a VSC (analog controller).

• Korean Journal of Mathematics
• /
• 제30권3호
• /
• pp.503-512
• /
• 2022

In this paper, we are concerned with the problem of locating the zeros of regular polynomials of a quaternionic variable with quaternionic coefficients. We derive new bounds of Eneström-Kakeya type for the zeros of these polynomials by virtue of a maximum modulus theorem and the structure of the zero sets in the newly developed theory of regular functions and polynomials of a quaternionic variable. Our results generalize some recently proved results about the distribution of zeros of a quaternionic polynomial.

• Journal of applied mathematics & informatics
• /
• 제8권2호
• /
• pp.449-472
• /
• 2001

A variety bounds are obtained for the variance and expectation of a continuous random variable whose p.d.f. is defined over a finite interval. Previous results are shown to be particular cases of the current more general development.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1992년도 춘계공동학술대회 발표논문 및 초록집; 울산대학교, 울산; 01월 02일 May 1992
• /
• pp.14-23
• /
• 1992

본 논문은 스케줄링 문제등 정수계획문제에서 흔히 찾아볼 수 있는 변수상한 제약을 갖는 문제의 효율적인 해법을 위한 분석적인 틀을 마련하기 위한 연구이다. 본 연구에서는 이 문제에 관한 기존의 알고리즘적 해법과 달리 분해기법을 이용하여 일반변수상한 문제에 까지 확장 적용될 수 있음을 분석적으로 보였다.