• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.283-290
• /
• 2003

Andras Bezdek proved that if a convex n-gon and n points are given, then the points and the sides of the polygon can be renumbered so that at least[${\frac{n}{3}}$] triangles spanned by the ith point and the ith side (i = 1,2,...n) are mutually non-overlapping. In this paper, we show that at least [${\frac{n}{2}}$] mutually non-overlapping triangles can be constructed. This lower bound is best possible.

• Journal of the Chungcheong Mathematical Society
• /
• v.32 no.4
• /
• pp.393-400
• /
• 2019

Pajoohesh introduced the concept of k-metric spaces and Hiltzler and Seda defined the concept of metric-like spaces. Recently, Kopperman and Pajoohesh proved a fixed point theorem in complete k-metric spaces for a Lipschitz map with bound. In this paper, we prove a fixed point theorem in complete metric-like spaces for a Lipschitz map with bound.

• Bulletin of the Korean Chemical Society
• /
• v.27 no.11
• /
• pp.1903-1906
• /
• 2006

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.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
• /
• v.46 no.2
• /
• pp.185-188
• /
• 2006

In the present paper, we give the applications of the optimum bound for Bernstein basis functions. It is noted that using the optimum bound the main results of Aniol and Taberska [Ann. Soc. Math. Pol. Seri, Commentat. Math., 30(1990), 9-17], [Approx. Theory and its Appl. 11:2(1995), 94-105] and V. Gupta [Soochow J. Math., 23(1)(1997) 115-118] can be improved which were not pointed out earlier.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1097-1102
• /
• 2008

An effective method for calculating delay bounds of flows through flow aggregations and deaggregations is given. Based on this calculation, it is suggested a simple criteria for flow aggregation whether the aggregation will induce an increased delay bound. The criteria is evaluated in a few realistic scenarios.

• Journal of Korean Institute of Industrial Engineers
• /
• v.14 no.2
• /
• pp.41-51
• /
• 1988

In this paper an efficient heuristic for the generalized assignment problem(GAP) is presented. A new lower bound that is slightly improved by adding the feasibility constraint is used to measure the quality of solutions obtained by the heuristic. The heuristic was tested on a number of large-scale random problems and a large sample of small problems. The heuristic appears to be better than the best previously existing heuristic for GAP. Its effectiveness in comparison of running times and closenesses to lower bound is discussed.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.5
• /
• pp.827-837
• /
• 1994

This paper presents robustness propertis of the Kalman Fiter and the associated LQG/LTR method for linear time-invariant output-delayed systems. It is shown that, even for minimum phase plants, the LQG/LTR method can not recover the target loop transfer function. Instead, an upper bound on the recovery error is obtained using an upper bound of the solution of the Kalman filter Riccati equations. Finally, some dual properties between output-delayed systems and input-delayed systems are exploited.

• Journal of the Korean Statistical Society
• /
• v.34 no.4
• /
• pp.281-295
• /
• 2005

We investigate the rate of convergence of the distribution of the maximum likelihood estimator (MLE) of an unknown parameter in the drift coefficient of a stochastic process described by a linear stochastic differential equation driven by a fractional Brownian motion (fBm). As a special case, we obtain the rate of convergence for the case of the fractional Ornstein- Uhlenbeck type process studied recently by Kleptsyna and Le Breton (2002).

• Journal of the Optical Society of Korea
• /
• v.9 no.4
• /
• pp.131-134
• /
• 2005

We have proposed a method to calculate the absorption coefficients for the bound-to-continuum transitions in a strong biased quantum-well infrared photodetector. We have applied this method to a manufactured sample of typical device parameters, and obtained good agreements with experiments. The absorption coefficients evaluated are up to 5,700/cm at some particular operating conditions. We have also been able to make a qualitative explanation for the bias dependence of response.