• Journal of the Korean Statistical Society
• /
• 제22권1호
• /
• pp.1-12
• /
• 1993

An approach to make the information bound sharper in median-unbiased estimation, based on an analogue of the Cramer-Rao inequality developed by Sung et al. (1990), is introduced for continuous densities with a nuisance parameter by considering information quantities contained both in the parametric function of interest and in the nuisance parameter in a linear fashion. This approach is comparable to that of improving the information bound in mean-unbiased estimation for the case of two unknown parameters. Computation of an optimal weight corresponding to the nuisance parameter is also considered.

• 한국멀티미디어학회논문지
• /
• 제13권12호
• /
• pp.1798-1804
• /
• 2010

TCP with AIMD mechanism, one of the most popular protocols in internet, can solve congestion control in wired networks. This protocol, however, is not efficient in wireless networks. This paper proposes a new mechanism namely General AIMD with Congestion Window Upper Bound in which congestion window is limited by an upper bound. By applying optimization theory, we find an optimal policy for congestion window upper bound to maximize network throughput.

• 대한수학회논문집
• /
• 제18권4호
• /
• pp.745-754
• /
• 2003

Maximum clique problem is to find a maximum clique(largest in size) in an undirected graph G. We present a method that computes either a maximum clique or an upper bound for the size of a maximum clique in G. We show that this method performs well on certain class of graphs and discuss the application of this method in a branch and bound algorithm for solving maximum clique problem, whose efficiency is depended on the computation of good upper bounds.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.859-863
• /
• 1987

In this paper, a relationship between difference triangular sets and sum triangular sets is developed to evaluate the weighted number of the third-order intermodulation products. In addition, a lower bound of the intermodulation products falling into the worst signal channel has been derived using the relationship between difference triangular sets and sum triangular sets. The formulas of the lower bound are useful for estimating the intermodulation impairment level in satellite communication systems.

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

The robust position control with the bound function of neural network structure is proposed for uncertain robot manipulators. The neural network structure presents the bound function and does not need the concave property of the bound function, The robust approach is to solve this problem as uncertainties are included in a model and the controller can achieve the desired properties in spite of the imperfect modeling. Simulation is performed to validate this law for four-axis SCARA type robot manipulators.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2018년도 춘계 종합학술대회 논문집
• /
• pp.485-486
• /
• 2018

In this paper, we consider a binary recovery framework of the Compressed Sensing (CS) problem. We derive an upper bound for $L_0$ recovery performance of a binary sparse signal in terms of the dimension N and sparsity K of signals, the number of measurements M. We show that the upper bound obtained from this work goes to the limit bound when the sensing matrix sufficiently become dense. In addition, for perfect recovery performance, if the signals are very sparse, the sensing matrices required for $L_0$ recovery are little more dense.

• 한국지하수토양환경학회지:지하수토양환경
• /
• 제20권6호
• /
• pp.111-116
• /
• 2015

The soil sample obtained from shooting area contaminated with Pb, Cu, and Zn was investigated to determine the chemical forms of heavy metals with Tessier’s sequential extraction method, which is constituted of five fractions such as ‘exchangeable’, ‘bound to carbonate’, ‘bound to oxide’, ‘bound to organic matter’, and residual fractions. The amount of organic matter was measured by loss on ignition (LOI) and then the results of ‘bound to organic matter’ and LOI were compared. The sequential extraction results show that 4.7%-45% of Pb, 6.2%-25.9% of Cu and 3.9%-15.3% of Zn belong to the ‘bound to organic matter’ fraction, but LOI result shows that only 1.0%-2.8% of organic matter exists in the soil sample. In heavy medium separation tests, because Pb and Cu extracted in ‘bound to organic matter’ and residual fractions were removed, the heavy metals in the fractions would exist as heavier forms. These results suggest that the part of heavy metal extracted in ‘bound to organic matter’ fraction would result from the oxidation of metallic forms by hydrogen peroxide and nitric acid used in the fraction, and, consequently, that the ‘bound to organic matter’ fraction should be investigated in detail to determine the removal method and treatment capacity when the Tessier’s sequential extraction method is used to examine heavy metal contaminants resulted from elemental metal like bullets.

• 산업경영시스템학회지
• /
• 제38권4호
• /
• pp.132-141
• /
• 2015

We focus on the fire scheduling problem (FSP), the problem of determining the sequence of targets to be fired at, for the objective of minimizing makespan to achieve tactical goals. In this paper, we assume that there are m available weapons to fire at n targets (> m) and the weapons are already allocated to targets. One weapon or multiple weapons can fire at one target and these fire operations should start simultaneously while the finish time of them may be different. We develop several dominance properties and a lower bound for the problem, and suggest a branch and bound algorithm implementing them. Also, In addition, heuristic algorithms that can be used for obtaining an initial upper bound in the B&B algorithm and for obtaining good solutions in a short time were developed. Computational experiments are performed on randomly generated test problems and results show that the suggested algorithm solves problems of a medium size in a reasonable amount of computation time. The proposed lower bound, the dominance properties, and the heuristics for upper bound are tested in B&B respectively, and the result showed that lower bound is effective to fathoming nodes and the dominance properties and heuristics also worked well. Also, it is showed that the CPU time required by this algorithm increases rapidly as the problem size increases. Therefore, the suggested B&B algorithm would be limited to solve large size problems. However, the employed heuristic algorithms can be effectively used in the B&B algorithm and can give good solutions for large problems within a few seconds.

• 대한수학회논문집
• /
• 제17권4호
• /
• pp.741-754
• /
• 2002

In this paper we present an error bound for cubic spline approximation of conic section curve. We compare it to the error bound proposed by Floater [1]. The error estimating function proposed in this paper is sharper than Floater's at the mid-point of parameter, which means the overall error bound is sharper than Floater's if the estimating function has the maximum at the midpoint.

• Communications for Statistical Applications and Methods
• /
• 제3권2호
• /
• pp.283-290
• /
• 1996

For finite discrete distributions with prescribed moments, there is a well-known upper bound on the index of the support. In this paper, we are interested in the smoothest density with prescribed moments among the class of smooth functions. We define an index of continuous distribution through the support and derive an upper bound on the index of the smoothest density. Some examples are given, some of which achieve the upper bound.