• Communications for Statistical Applications and Methods
• /
• v.14 no.2
• /
• pp.401-411
• /
• 2007

In this paper we propose an influence measure for detecting potentially influential observations using the infinitesimal perturbation and the local influence in the log-linear regression model. Also, we propose a goodness-of-fit measure for variable selection. A real data set are used for illustration.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.05a
• /
• pp.587-590
• /
• 2000

By using the information obtained from output of the MR(Magneto Resistive) sensor for an unmanned vehicle system which is used in the Local Position System. We develop an algorithm that decides the distance and directions between the guideline made by magnets and vehicle, and make an unmanned vehicle driving system that is steered by PD controller and MR sensor

• Proceedings of the IEEK Conference
• /
• 2000.06e
• /
• pp.31-34
• /
• 2000

In this paper, we design an optimal path for multiple mobile robots. For this purpose, we propose a new method of path planning for multiple mobile robots in dynamic environment. First, every mobile robot searches a global path using a distance transform algorithm. Then we put subgoals at crooked path points and optimize them. And finally to obtain an optimal on-line local path, ever)r mobile robot searches a new path with static and dynamic obstacle avoidance.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.983-994
• /
• 2000

We consider the problem of determining the circle of best fit to a set of data points in the plane. In [1] and [2] several algorithms already have been given for fitting a circle in least squares sense of minimizing the geometric distances to the given data points. In this paper we present another new descent algorithm which computes a parametric represented circle in order to minimize the sum of the squares of the distances to the given points. For any choice of starting values our algorithm has the advantage of ensuring convergence to a local minimum. Numerical examples are given.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.713-719
• /
• 2011

The problem of approximation from a set of scattered data arises in a wide range of applied mathematics and scientific applications. In this study, we present a quasi-interpolatory approximation scheme for scattered data approximation problem, which reproduces a certain space of polynomials. The proposed scheme is local in the sense that for an evaluation point, the contribution of a data value to the approximating value is decreasing rapidly as the distance between two data points is increasing.

• Proceedings of the KIEE Conference
• /
• 1999.11b
• /
• pp.116-118
• /
• 1999

A fault location algorithm that is suitable for parallel transmission line which contains a teed circuit is presented. The method uses only the local end voltage and current signals. Zero sequence currents of other lines are calculated by distribution factors, and distance equations are solved by recursive calculation.

• Journal of the Korean Data and Information Science Society
• /
• v.11 no.2
• /
• pp.335-345
• /
• 2000

Most context use the classical norms on function spaces as the error criteria. Since these norms are all based on the vertical distances between the curves, these can be quite inappropriate from a visual notion of distance. Visual errors in Marron and Tsybakov(1995) correspond more closely to "what the eye sees". Simulation is performed to compare the performance of the regression smoothers in view of MISE and the visual error. It shows that the visual error can be used as a possible candidate of error criteria in the kernel regression estimation.

• Bulletin of the Society of Naval Architects of Korea
• /
• v.16 no.1
• /
• pp.1-6
• /
• 1979

A method to determine the optimum drafts of waveboards of single and double-flap wavemaker is presented by using a linearized first-order wave theory and a linear regression method. A linear regression is verified to be quite simpler than the local disturbance consideration or regular-wave forming distance. It is pointed out that lower hinge should be deep enough to keep the upper flap vertical for a long wave length.

• East Asian mathematical journal
• /
• v.17 no.2
• /
• pp.303-308
• /
• 2001

Let K($z,\gamma$) denote the euclidean curvature of the curve $\gamma$ at the point z. Flinn and Osgood proved that if f is a univalent mapping of the open unit disk D={z:|z|<1} into itself with f(0)=0 and |f'(0)|<1, then $K(0,\gamma){\leq}K(0,f\;o\;\gamma)$ for any $C^2$ curve $\gamma$ on D through the origin with $K(0,\gamma){\geq}4$. In this paper we establish a generalization of the Flinn-Osgood Monotonicity Theorem.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.265-267
• /
• 2003

이동성을 가진 다수의 노드들로 구성된 Ad­Hoc 무선 네트워크는 유선망이나 기지국이 존재하지 않는 환경에서 통신망을 구성하기 위한 목적으로 연구되어 왔다. Ad­Hoc 무선 네트워크에서 라우팅 프로토콜은 이동 노드들간의 연결을 위한 경로를 제공하며, 본 논문에서는 무선 Ad­Hoc 라우팅 프로토콜 중 AODV(Ad­Hoc On­Demand Distance Vector routing)의 개선된 알고리즘을 제안하고자 한다. AODV는 경로획득, 경로유지. 경로복구의 크게 3단계로 나누어져 있고, AODV에서의 경로복구는 전체 경로를 재설정하는 것으로 많은 오버헤드를 가지고 있다. 제안한 방법에서는 링크손실로 인한 경로복구의 과정을 링크 손실이 발생한 인접 지역내에서 행하게 함으로써 전체적인 성능 향상을 가져왔다.