• Korean Journal of Mathematics
• /
• 제7권2호
• /
• pp.207-213
• /
• 1999

In this paper we estimate a lower bound of the Banach-Mazur distance between a finite dimensional nonlocally convex space and its Banach envelope space by investigating the properties of the nonlocally convex space and the projection constant which are obtained by factoring the identity operator through $l^k_{\infty}$ on the quasi-normed spaces.

• 호남수학학술지
• /
• 제45권1호
• /
• pp.82-91
• /
• 2023

In this paper, we study the nonlinear eigenvalue problem for some of the (p, q)-Laplacian on compact Finsler manifolds with zero boundary condition, and estimate the lower bound of the first eigenvalues for (p, q)-Laplace operators on Finsler manifolds.

• The Journal of the Acoustical Society of Korea
• /
• 제17권3E호
• /
• pp.22-26
• /
• 1998

This paper proposes a simple method to measure system's performance in target tracking problems. Essentially employing the Cramer-Rao Lower Bound (CRLB) on tracking accuracy, an algorithm of predicting system's performance under various scenarios is developed. The input data is a collection of measurements over tim from sensors embedded in Gaussian noise. The target of interest may not maneuver over the processing time interval while the own ship observing platform may maneuver in an arbitrary fashion. The proposed approach is demonstrated and discussed through simulation results.

• Communications for Statistical Applications and Methods
• /
• 제12권3호
• /
• pp.653-657
• /
• 2005

Eigenstructure of a spatial design matrix of Matheron's variogram estimator in $R^1$ is derived. It is shown that the spatial design matrix in $R^1$ with n/2$\le$h < n has a nice spectral decomposition. The mean, variance, and covariance of this estimator are obtained using the eigenvalues of a spatial design matrix. We also found that the lower bound and the upper bound of the normalized Matheron's variogram estimator.

• 대한수학회논문집
• /
• 제17권1호
• /
• pp.81-93
• /
• 2002

We consider the Hausdorff measure for Brownian motion(BM) in ι$_2$. Several path properties of BM in ι$_2$ are used to show the upper bound of Hausdorff measure. We also show the lower bound of it applying a law of iterated logarithm for the occupation time of BM in ι$_2$.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.129-136
• /
• 2003

설비입지문제는 고객에게 좋은 서비스를 제공하면서 전체 비용을 최소화하는 의사결정을 요구한다. 본 논문은 제한된 총 투자 비용 하에서 최대의 서비스 수준을 달성하기 위하여 고정비를 가지는 설비의 입지를 결정하는 문제에 관한 것이다. 이 문제에 대해 수리 모형을 제시하고, 라그랑지안 기법을 이용한 발견적 기법을 통하여 해를 구하였다. 문제의 상한(Upper Bound)은 서브그래디언트(Subgradient) 최적화 기법을 사용하여 구하였고, 하한(Lower Bound)을 구하기 위하여 커팅(Cutting) 알고리즘이라는 새로운 기법을 개발하여 적용하였다. 임의로 생성된 데이터를 이용하여 비용과 커버 가능거리라는 두 가지 관점에서 실험을 하고 제안된 알고리즘의 성능을 비교 분석하였다.

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

In this paper the authors study the properties of the so-called exponent-quasiadditive functions and an application to the generalized $Gr\ddot{o}tzsch$ ring function of quasiconformal theory is specified.

• Journal of Communications and Networks
• /
• 제6권3호
• /
• pp.226-234
• /
• 2004

This work presents a deterministic channel that rules according to inverse a power propagation law. The proposed channel model allows us to derive the lower bound and upper bound of packet's capture probability in Rayleigh fading and shadowing cellular mobile system. According to these capture probabilities, we analyze the system performance in the case of finite stations and finite communicated coverage of a base station. We also adopted a dynamic backoff window size to discuss the robustness of IEEE 802.11 draft standard. Some suggestions and conclusions from numerical results are given to establish the more strong CSMA/CA protocol.

• 산업경영시스템학회지
• /
• 제20권43호
• /
• pp.145-152
• /
• 1997

We present a continuous resource allocation problem with maximin objective functions under the generalized lower bound(GLB) and generalized upper bound(GUB) constraints. This problem is an extension for the problems of previous studies. An efficient algorithm is developed by exploiting extended structural properties, where n is the total number of variables. The worst computational complexity of the proposed algorithm is O(nlogn).

• Kyungpook Mathematical Journal
• /
• 제59권1호
• /
• pp.175-190
• /
• 2019

In this paper, we provide results for the search number of the Cartesian product of graphs. We consider graphs on opposing ends of the spectrum: paths and cliques. Our main result determines the pathwidth of the product of cliques and provides a lower bound for the search number of the product of cliques. A consequence of this result is a bound for the search number of the product of arbitrary graphs G and H based on their respective clique numbers.