• Journal of the Korean Data and Information Science Society
• /
• v.25 no.1
• /
• pp.227-235
• /
• 2014

In this paper, we develop the noninformative priors for the scale parameter and the shape parameter in the log-logistic distribution. We developed the first and second order matching priors. It turns out that the second order matching prior matches the alternative coverage probabilities, and is a highest posterior density matching prior. Also we revealed that the derived reference prior is the second order matching prior for both parameters, but Jerffrey's prior is not a second order matching prior. We showed that the proposed reference prior matches the target coverage probabilities in a frequentist sense through simulation study, and an example based on real data is given.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.1
• /
• pp.115-123
• /
• 2011

In this paper, we develop the noninformative priors for stress-strength reliability from the Pareto distributions. We develop the matching priors and the reference priors. It turns out that the second order matching prior does not match the alternative coverage probabilities, and is not a highest posterior density matching or a cumelative distribution function matching priors. Also we reveal that the one-at-a-time reference prior and Jeffreys' prior are the second order matching prior. We show that the proposed reference prior matches the target coverage probabilities in a frequentist sense through simulation study, and an example is given.

• Communications for Statistical Applications and Methods
• /
• v.18 no.4
• /
• pp.467-475
• /
• 2011

This paper develops the noninformative priors for the stress-strength reliability from one parameter generalized exponential distributions. When this reliability is a parameter of interest, we develop the first, second order matching priors, reference priors in its order of importance in parameters and Jeffreys' prior. We reveal that these probability matching priors are not the alternative coverage probability matching prior or a highest posterior density matching prior, a cumulative distribution function matching prior. In addition, we reveal that the one-at-a-time reference prior and Jeffreys' prior are actually a second order matching prior. We show that the proposed reference prior matches the target coverage probabilities in a frequentist sense through a simulation study and a provided example.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.3
• /
• pp.763-772
• /
• 2015

In this paper, we develop the noninformative priors for the product of different powers of k means in the exponential distribution. We developed the first and second order matching priors. It turns out that the second order matching prior matches the alternative coverage probabilities, and is the highest posterior density matching prior. Also we revealed that the derived reference prior is the second order matching prior, and Jeffreys' prior and reference prior are the same. We showed that the proposed reference prior matches very well the target coverage probabilities in a frequentist sense through simulation study, and an example based on real data is given.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.8
• /
• pp.786-793
• /
• 2010

This paper proposes a new method called the path-history coverage to generate a test suite to test the state transition behavior of the robot SW component. The proposed method generate a test suite which includes abnormal state transitions based on FSM of target component. Especially the proposed method covers the disadvantage of the mutation test method that the size of the test suite is explosively increasing. Examples including OPRoS Component[1] show the validity of the proposed method.

• Communications for Statistical Applications and Methods
• /
• v.20 no.5
• /
• pp.387-394
• /
• 2013

In this paper, we develop the noninformative priors for the ratio of the scale parameters in the inverted exponential distributions. The first and second order matching priors, the reference prior and Jeffreys prior are developed. It turns out that the second order matching prior matches the alternative coverage probabilities, is a cumulative distribution function matching prior and is a highest posterior density matching prior. In addition, the reference prior and Jeffreys' prior are the second order matching prior. We show that the proposed reference prior matches the target coverage probabilities in a frequentist sense through a simulation study as well as provide an example based on real data is given.

• ETRI Journal
• /
• v.38 no.5
• /
• pp.799-806
• /
• 2016

In this paper, we propose an emergency wake-up alert system (EWAS) for providing accurate and rapid emergency information. The proposed system can provide an emergency wake-up alert service without an additional frequency allotment by utilizing the guard band of the Advanced Television Systems Committee (ATSC) Terrestrial Digital Television (DTV) system. The design target of the proposed system is to match the indoor reception coverage of EWAS with the outdoor reception coverage of the ATSC DTV system. To achieve this, the proposed system should be about 35.65 dB more robust than the ATSC DTV system. The simulation results show that the proposed system offers an emergency wake-up alert service supporting a data rate of up to 23 bps.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.4
• /
• pp.833-841
• /
• 2012

In this paper, we develop the noninformative priors for the ratio of the scale parameters in the half logistic distributions. We develop the first and second order matching priors. It turns out that the second order matching prior matches the alternative coverage probabilities, and is a highest posterior density matching prior. Also we reveal that the one-at-a-time reference prior and Jeffreys' prior are the second order matching prior. We show that the proposed reference prior matches the target coverage probabilities in a frequentist sense through simulation study, and an example based on real data is given.

• The Journal of Korea Robotics Society
• /
• v.16 no.2
• /
• pp.122-129
• /
• 2021

For the Simultaneous Localization and Mapping (SLAM) problem, a different path results in different SLAM results. Usually, SLAM follows a trail of input data. Active SLAM, which determines where to sense for the next step, can suggest a better path for a better SLAM result during the data acquisition step. In this paper, we will use reinforcement learning to find where to perceive. By assigning entire target area coverage to a goal and uncertainty as a negative reward, the reinforcement learning network finds an optimal path to minimize trajectory uncertainty and maximize map coverage. However, most active SLAM researches are performed in indoor or aerial environments where robots can move in every direction. In the urban environment, vehicles only can move following road structure and traffic rules. Graph structure can efficiently express road environment, considering crossroads and streets as nodes and edges, respectively. In this paper, we propose a novel method to find optimal SLAM path using graph structure and reinforcement learning technique.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.556-559
• /
• 2011

CTC(Connected Target Coverage)문제는 주어진 전체 타겟을 관측하고 관측한 데이터를 싱크노드까지 전송하는데 관여하는 센서집합의 개수를 최대화하여 네트워크 수명을 최대화하는 문제이다. 본 논문은 센서가 타겟을 관측할 확률이 타겟과의 거리에 영향을 받는다고 가정하는 확률 커버리지 모델을 기반으로 CTC문제에 접근한다. CTC문제를 해결하기 위해 휴리스틱 알고리즘인 CWGC-PM 알고리즘을 제안하고 시뮬레이션을 통해 알고리즘이 CTC문제를 해결하기에 적합함을 보인다.