• The Korean Journal of Applied Statistics
• /
• v.13 no.2
• /
• pp.563-573
• /
• 2000

In this paper, we propose three estimators of Kullback-Leibler Information functions using the data from accelerated life tesb. This acceleration model is assumed to be a tampered random variable model. Some asymptotic properties of proposed estimators are proved. Simulations are performed for comparing the small sample properties of the proposed estimators under use condition of accelerated life test.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.2
• /
• pp.1-8
• /
• 2004

In this paper, we propose three estimators of Kullback-Leibler Information functions using the data from accelerated life tests. This acceleration model is assumed to be a cumulative exposure model. Some asymptotic properties of proposed estimators are proved. Simulations are performed for comparing the small sample properties of the proposed estimators under use condition of accelerated life test.

• Journal of Korean Society for Quality Management
• /
• v.31 no.4
• /
• pp.194-202
• /
• 2003

In this paper, we propose goodness of fit test statistics for exponentiality in accelerated life tests data based on Kullback­Leibler information functions. This acceleration model is assumed to be a tampered random variable model. The procedure is applicable when the exponential parameter using the data from accelerated life tests is or is not specified under null hypothesis. And we compare the power of the proposed test statistics with Kolmogorov­Smirnov, Cramer von Mises and Anderson­Darling statistics in the small sample.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.4
• /
• pp.37-45
• /
• 2022

In this paper, a multi agent-multi task assignment problem, which is a representative problem of combinatorial optimization, is presented. The objective of the problem is to determine the coordinated agent-task assignment that maximizes the sum of the achievement rates of each task. The achievement rate is represented as a concave down increasing function according to the number of agents assigned to the task. The problem is expressed as an NP-hard problem with a non-linear objective function. In this paper, to solve the assignment problem, we propose a hybrid cross-entropy algorithm as an effective and efficient solution methodology. In fact, the general cross-entropy algorithm might have drawbacks (e.g., slow update of parameters and premature convergence) according to problem situations. Compared to the general cross-entropy algorithm, the proposed method is designed to be less likely to have the two drawbacks. We show that the performances of the proposed methods are better than those of the general cross-entropy algorithm through numerical experiments.