• Journal of the Korean Statistical Society
• /
• v.30 no.1
• /
• pp.99-113
• /
• 2001

This paper deals with the problem of estimating the means in two inverse Gaussian populations with equal but unknown coefficient of variation. The maximum likelihood estimators are derived by solving a cubic equation and their asymptotic variances are presented for comparative purpose. Monte-Carlo simulation is conducted to investigate the efficiency of the estimators relative to the sample means over a wide range of values for the sample size and the coefficient of variation. The effect on this efficiency under the departure from the assumption of common coefficient of variation is also studied.

• Journal of the Korean Statistical Society
• /
• v.31 no.1
• /
• pp.109-120
• /
• 2002

In this paper, we show the weak convergence of U-empirical processes for two sample problem. We use the result to show the asymptotic normality for the generalized dodges-Lehmann estimates with the Bahadur representation for quantifies of U-empirical distributions. Also we consider the asymptotic normality for the test statistics in a simple way.

• Journal of the Korean Statistical Society
• /
• v.26 no.2
• /
• pp.223-229
• /
• 1997

It is demonstrated that many standard nonparametric test such as the Mann-Whitney-Wilcoxon test, the Fisher-Yates test, the Savage test and the median test are admissible for a two-sample nonparametric testing problem. The admissibility of the Kruskal-Wallis test is demonstrated for a nonparametric one-way layout testing problem.

• Journal of the Korean Statistical Society
• /
• v.17 no.2
• /
• pp.61-80
• /
• 1988

For testing homogeneity of scale parameters aginst ordered alternatives, some nonparametric test statistics based on pairwise ranking method are proposed. The proposed tests are distribution-free. The asymptotic distributions of the proposed statistcs are also investigated. It is shown that the Pitman efficiencies of the proposed rank tests are the same as those of the corresponding two-sample rank tests in the scale problem. A small-sample Monte Carlo study is also performed. The results show that the proposed tests are robust and efficient.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.6
• /
• pp.1343-1351
• /
• 2010

Sample size determination is very important part in clinical trials because it influences the time and the cost of the experimental studies. In this article, we consider the Bayesian methods for sample size determination based on hypothesis testing. Specifically we compare the usual Bayesian method using Bayes factor with the decision theoretic method using Bayesian reference criterion in mean difference problem for the normal case with known variances. We illustrate two procedures numerically as well as graphically.

• Research in Mathematical Education
• /
• v.10 no.1 s.25
• /
• pp.13-31
• /
• 2006

This paper uses a composite difficulties model developed by the author (Bao 2002a, 2002b) to compare the characteristics of two sample mathematics tests in China and UK. The initial findings were described through five difficulty factors on several difficulty levels. According the initial findings, the author then tries to analyze the styles of mathematics problem-solving and the curriculum backgrounds in these two countries.

• Journal of Veterinary Clinics
• /
• v.28 no.4
• /
• pp.422-426
• /
• 2011

For a national survey in which wide geographic region or an entire country is targeted, multi-stage sampling approach is widely used to overcome the problem of simple random sampling, to consider both herd- and animallevel factors associated with disease occurrence, and to adjust clustering effect of disease in the population in the calculation of sample size. The aim of this study was to establish sample size for estimating bovine tuberculosis (TB) in Korea using stratified two-stage sampling design. The sample size was determined by taking into account the possible clustering of TB-infected animals on individual herds to increase the reliability of survey results. In this study, the country was stratified into nine provinces (administrative unit) and herd, the primary sampling unit, was considered as a cluster. For all analyses, design effect of 2, between-cluster prevalence of 50% to yield maximum sample size, and mean herd size of 65 were assumed due to lack of information available. Using a two-stage sampling scheme, the number of cattle sampled per herd was 65 cattle, regardless of confidence level, prevalence, and mean herd size examined. Number of clusters to be sampled at a 95% level of confidence was estimated to be 296, 74, 33, 19, 12, and 9 for desired precision of 0.01, 0.02, 0.03, 0.04, 0.05, and 0.06, respectively. Therefore, the total sample size with a 95% confidence level was 172,872, 43,218, 19,224, 10,818, 6,930, and 4,806 for desired precision ranging from 0.01 to 0.06. The sample size was increased with desired precision and design effect. In a situation where the number of cattle sampled per herd is fixed ranging from 5 to 40 with a 5-head interval, total sample size with a 95% confidence level was estimated to be 6,480, 10,080, 13,770, 17,280, 20.925, 24,570, 28,350, and 31,680, respectively. The percent increase in total sample size resulting from the use of intra-cluster correlation coefficient of 0.3 was 22.2, 32.1, 36.3, 39.6, 41.9, 42.9, 42,2, and 44.3%, respectively in comparison to the use of coefficient of 0.2.

• Structural Engineering and Mechanics
• /
• v.63 no.6
• /
• pp.825-835
• /
• 2017

Significant improvements to methodologies on structural damage detection (SDD) have emerged in recent years. However, many methods are related to inversion computation which is prone to be ill-posed or ill-conditioning, leading to low-computing efficiency or inaccurate results. To explore a more accurate solution with satisfactory efficiency, a PSO-INM algorithm, combining particle swarm optimization (PSO) algorithm and an improved Nelder-Mead method (INM), is proposed to solve multi-sample objective function defined based on Bayesian inference in this study. The PSO-based algorithm, as a heuristic algorithm, is reliable to explore solution to SDD problem converted into a constrained optimization problem in mathematics. And the multi-sample objective function provides a stable pattern under different level of noise. Advantages of multi-sample objective function and its superior over traditional objective function are studied. Numerical simulation results of a two-storey frame structure show that the proposed method is sensitive to multi-damage cases. For further confirming accuracy of the proposed method, the ASCE 4-storey benchmark frame structure subjected to single and multiple damage cases is employed. Different kinds of modal identification methods are utilized to extract structural modal data from noise-contaminating acceleration responses. The illustrated results show that the proposed method is efficient to exact locations and extents of induced damages in structures.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3172-3193
• /
• 2018

Recently, several studies have shown that linear representation based approaches are very effective and efficient for image classification. One of these linear-representation-based approaches is the Collaborative representation (CR) method. The existing algorithms based on CR have two major problems that degrade their classification performance. First problem arises due to the limited number of available training samples. The large variations, caused by illumintion and expression changes, among query and training samples leads to poor classification performance. Second problem occurs when an image is partially noised (contiguous occlusion), as some part of the given image become corrupt the classification performance also degrades. We aim to extend the collaborative representation framework under limited training samples face recognition problem. Our proposed solution will generate virtual samples and intra-class variations from training data to model the variations effectively between query and training samples. For robust classification, the image patches have been utilized to compute representation to address partial occlusion as it leads to more accurate classification results. The proposed method computes representation based on local regions in the images as opposed to CR, which computes representation based on global solution involving entire images. Furthermore, the proposed solution also integrates the locality structure into CR, using Euclidian distance between the query and training samples. Intuitively, if the query sample can be represented by selecting its nearest neighbours, lie on a same linear subspace then the resulting representation will be more discriminate and accurately classify the query sample. Hence our proposed framework model the limited sample face recognition problem into sufficient training samples problem using virtual samples and intra-class variations, generated from training samples that will result in improved classification accuracy as evident from experimental results. Moreover, it compute representation based on local image patches for robust classification and is expected to greatly increase the classification performance for face recognition task.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.11 no.1
• /
• pp.24-35
• /
• 1986

We investigate various methods of the Benders decoposition algorithm in its application to the simple plant location problem. We developed six variants. The master problem may be relaxed as an LP problem up to an appropriate point in time, or need not be solved to the optimality before a cut is added. Furthermore, since the subproblem is highly degenerated, we can generate more than one cuts at a time. The efficiency of the methods are examined using a sample problem. The result showed that the adding two-cut method was superior to the standard method. The LP relaxation and the non-optimization of the master program greatly improved the efficiency. Applying the LP relaxation method, we were able to reduce the computing time by two thirds of the time required by the standard method.