• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 D
• /
• pp.2732-2734
• /
• 2000

This paper proposes a path planning algorithm for mobile robots. To generate a minimum-distance path for mobile robots, we use the Genetic Algorithm(GA) and Visibility Graph. After finding a minimum-distance path between a start and a goal point, the path is revised to find the smooth subminimum-distance path by a path-smoothing algorithm. Simulation results show that the proposed algorithms are effective.

• Communications for Statistical Applications and Methods
• /
• 제30권4호
• /
• pp.411-421
• /
• 2023

This paper provides a new estimation equation based on the concept of a minimum distance between the empirical and theoretical distribution functions under the most widely used progressive Type-II censoring scheme. For illustrative purposes, simulated and real datasets from a three-parameter Weibull distribution are analyzed. For comparison, the most popular estimation methods, the maximum likelihood and maximum product of spacings estimation methods, are developed together. In the analysis of simulated datasets, the excellence of the provided estimation method is demonstrated through the degree of the estimation failure of the likelihood-based method, and its validity is demonstrated through the mean squared errors and biases of the estimators obtained from the provided estimation equation. In the analysis of the real dataset, two types of goodness-of-fit tests are performed on whether the observed dataset has the three-parameter Weibull distribution under the progressive Type-II censoring scheme, through which the performance of the new estimation equation provided is examined.

• 해양환경안전학회지
• /
• 제23권3호
• /
• pp.250-257
• /
• 2017

This paper investigates minimum safe distances relative to a ship's four cardinal sides, as perceived by Filipino navigators when encountering dangerous elements and in adverse weather conditions when maneuvering in and around harbors. It uses a descriptive research method in the form of a questionnaire survey for experienced Filipino navigators of various ranks. During the course of research, 71 responses were colleted and the resulting data is presented in graphical and tabulated forms. Statistical methods including Pearson-product moment correlations, Cronbach's Alpha and ANOVA were used to identify internal associations, consistencies and significances, respectively. It has been proven that there are no significant differences in minimum safe distances relative to a ship's four cardinal sides, whether maneuvering while approaching a port or within an inner harbor. This study has been deemed significant for training future navigators, managing traffic in fairways, and designing harbors and maneuvering areas in the approaches to ports, among other applications. This work can also be used as a preliminary study for comparison with the well known safe domains presently in use.

• Journal of the Korean Statistical Society
• /
• 제30권1호
• /
• pp.41-61
• /
• 2001

The minimum negative exponential disparity estimator(MNEDE), introduced by Lindsay(1994), is an excellenet competitor to the minimum Hellinger distance estimator(Beran 1977) as a robust and yet efficient alternative to the maximum likelihood estimator in parametric models. In this paper we define the negative exponential deviance test(NEDT) as an analog of the likelihood ratio test(LRT), and show that the NEDT is asymptotically equivalent to he LRT at the model and under a sequence of contiguous alternatives. We establish that the asymptotic strong breakdown point for a class of minimum disparity estimators, containing the MNEDE, is at least 1/2 in continuous models. This result leads us to anticipate robustness of the NEDT under data contamination, and we demonstrate it empirically. In fact, in the simulation settings considered here the empirical level of the NEDT show more stability than the Hellinger deviance test(Simpson 1989). The NEDT is illustrated through an example data set. We also define a goodness-of-fit statistic to assess adequacy of a specified parametric model, and establish its asymptotic normality under the null hypothesis.

• 한국인터넷방송통신학회논문지
• /
• 제10권2호
• /
• pp.69-75
• /
• 2010

본 논문에서는, 802.22 WRAN 시스템과 DTV 사이의 주파수 공존 영향에 대해 분석한다. 먼저 간섭에 대한 정의를 명확히 하기위해, DTV를 간섭원으로, 802.22 WRAN을 피 간섭원으로 설정한다. 두 시스템이 동일한 스펙트럼을 사용했을 때, 두 시스템의 최소 이격 거리를 계산한다. 그리고 잠재적 간섭의 존재 유무를 결정하기위해, 최소 커플링 손실을 전송 손실과 비교하였다. 최소 이격거리는 전송 손실이 최소 커플링 손실보다 큰 값을 가질 경우 결정된다. 이러한 경우, DTV는 802.22 WRAN 시스템에 아무런 영향도 끼치지 않는 것으로 생각할 수 있다.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2009년도 춘계학술대회 논문집
• /
• pp.7-8
• /
• 2009

Non-contact critical current measurement apparatus was developed using hall probe which measures the magnetic field distribution across the width of superconducting tape. The hall probe consists of 7 independent hall sensors which lie in a line 600 ${\mu}m$. The difference between maximum and minimum magnetic field in the magnetic filed distribution is a main parameter to determine the critical current. As preliminary research, we calculated the magnetic field intensity at the middle sensor, which is a minimum magnetic field and generated by the circular shielding current modeled by Bean model. We confirmed that there are some parameters that affect on the minimum magnetic field; the distance between superconducting layer and hall sensor, the width of superconducting tape, and the critical current distribution across the width of superconducting tape. Among these parameters, the distance between superconducting layer and hall sensor highly influences on the minimum magnetic field.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.26-28
• /
• 2007

The motion estimation is the most important technique in the image compression of the video standards. In the case of next generation standards in the video codec as H.264, a high compression-efficiency can be also obtained by using a motion compensation. To obtain the accurate motion search, a motion estimation should be achieved up to 1/2 pixel and 1/4 pixel uiuts. To do this, the computational complexity is increased although the image compression rate is increased. Therefore, in this paper, we propose the advanced sub-pixel block matching algorithm to reduce the computational complexity by using a statistical characteristics of SAD(Sum of Absolute Difference). Generally, the probability of the minimum SAD values is high when searching point is in the distance 1 from the reference point. Thus, we reduced the searching area and then we can overcome the computational complexity problem. The main concept of proposed algorithm, which based on TSS(Three Step Search) method, first we find three minimum SAD points which is in integer distance unit, and then, in second step, the optimal point is in 1/2 pixel unit either between the most minimum SAD value point and the second minimum SAD point or between the most minimum SAD value point and the third minimum SAD point In third step, after finding the smallest SAD value between two SAD values on 1/2 pixel unit, the final optimized point is between the most minimum SAD value and the result value of the third step, in 1/2 pixel unit i.e., 1/4 pixel unit in totally. The conventional TSS method needs an eight.. search points in the sub-pixel steps in 1/2 pixel unit and also an eight search points in 1/4 pixel, to detect the optimal point. However, in proposed algorithm, only total five search points are needed. In the result. 23 % improvement of processing speed is obtained.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.418-418
• /
• 2000

This paper proposes a path planning algorithm for mobile robot. To generate an optimal path and minimum time path for a mobile robot, we use the Genetic Algorithm(GA) and Visibility Graph. After finding a minimum-distance between start and goal point, the path is revised to find the minimum time path by path-smoothing algorithm. Simulation results show that the proposed algorithms are more effective.

• 대한수학회지
• /
• 제46권5호
• /
• pp.967-977
• /
• 2009

There are three standard weight functions on a linear code viz. Hamming weight, Lee weight, and Euclidean weight. Euclidean weight function is useful in connection with the lattice constructions [2] where the minimum norm of vectors in the lattice is related to the minimum Euclidean weight of the code. In this paper, we obtain an upper bound over the number of parity check digits for Euclidean weight codes detecting and correcting burst errors.

• 한국축산시설환경학회지
• /
• 제17권2호
• /
• pp.93-100
• /
• 2011

본 연구는 로봇 착유시스템의 유두인식을 위한 기초연구로 레이저 스캔 센서를 이용하여 모형유두의 위치정보를 획득 및 분석하고 이를 통하여 로봇 착유시스템에 적용가능성을 알아보고자 하였다. 이를 위하여 실제유두와 같은 모양과 크기의 모형유두를 제작하였으며, 각 모형의 재질에 따른 특성을 파악하고 센서의 거리에 따른 오차, 각도에 따른 오차를 분석하였다. 또한 4개 유두모형을 이용하여 각 유두의 2차원 거리정보를 동시에 획득하였으며 결과는 다음과 같다. 1. 모형유두의 재질선택을 위한 실험에서 손가락의 경우 거리오차가 최대 4.3 mm, 최소 1.3 mm, 평균 2.8 mm로 가장 작게 나타났으며, 고무재질의 모형유두가 평균 4.3 mm로 나타나 모형유두로 가장 적합한 것으로 판단되었다. 2. 거리에 따른 오차는 기준거리 100 mm에서 가장 크게 나타났으며, 거리가 증가할수록 감소하다 300 mm를 지나 다시 증가한 후 다시 감소하는 경향을 나타내었다. 3. 각도별 오차는 $170^{\circ}$에서 10.1 mm로 최대오차가 발생하였으며, $70^{\circ}$일 때 0.2 mm로 최소 오차를 나타내었다. 각도에 따른 오차는 특별한 경향을 나타내지 않는 것으로 판단되었다. 4. 4개 모형유두에 대한 2차원 위치오차를 측정한 결과 거리오차의 경우 최소 3.8 mm, 최대 7.2 mm로 나타났으며, 각도 오차는 최대 $1.2^{\circ}$로 오차가 발생한 것으로 나타났다. 모든 오차가 센서 정밀도 내에 포함되며, 센서의 측정 속도와 착유컵의 구멍크기 등을 고려해 볼 때 로봇 착유시스템을 위한 유두의 거리측정에 적용이 가능할 것으로 판단되었다.