• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.1
• /
• pp.31-31
• /
• 1989

The Generalized Assignment Problem(GAP) determines the minimum assignment of n tasks to m workstations such that each task is assigned to exactly one workstation, subject to the capacity of a workstation. In this paper, we presented a new heuristic search algorithm for GAPs. Then we tested it on 4 different benchmark sample sets of random problems generated according to uniform distribution on a microcomputer.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.44 no.2
• /
• pp.112-116
• /
• 1999

Genetic diversity of 31 rice varieties including 25 japonica and 6 indica varieties was evaluated using a combination of 19 microsatellite or simple sequence repeats (SSRs) and 28 random decamer oligonucle-otide primers. All 19 microsatellite primer sets representing 19 loci in the rice genome showed polymorphisms among the 31 varieties and revealed 91 alleles with an average of 4.80 bands per primer. Also all 28 random decamer primers used were informative and generated 114 non-redundant bands with a mean of 4.07 bands. Microsatellite markers detected higher number of alleles than random primers .although the mean difference was not statistically significant. A cluster analysis based on Nei＇s genetic distances calculated from the 205 bands resolved the 31 varieties into two major groups that correspond to indica and japonica subspecies, which is consistent with the genealogical information. As few as six random decamer primers or a combination of one microsatellite and four random decamer primers were sufficient to uniquely differentiate all 31 varieties. These combinations would be potentially useful in rice variety protection and identification considering that 25 out of 31 varieties used in this study are japonica rices with high grain quality and have close make up.

• Journal of the Korean Ceramic Society
• /
• v.56 no.6
• /
• pp.596-600
• /
• 2019

Artificial intelligence with a sufficient amount of realistic big data in certain applications has been demonstrated to play an important role in designing new materials or in manufacturing high-quality products. To reduce cracks in ceramic products using machine learning, it is desirable to utilize big data in recently developed data-driven optimization schemes. However, there is insufficient big data for ceramic processes. Therefore, we developed a numerical algorithm to make "virtual" manufacturing data sets using indirect methods such as computer simulations and image processing. In this study, a numerical algorithm based on the random walk was demonstrated to generate images of cracks by adjusting the conditions of the random walk process such as the number of steps, changes in direction, and the number of cracks.

• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.835-844
• /
• 2002

For the one-way random model when the ratio of the variance components is of interest, Bayesian analysis is often appropriate. In this paper, we develop the noninformative priors for the ratio of the variance components under the balanced one-way random effect model. We reveal that the second order matching prior matches alternative coverage probabilities up to the second order (Mukerjee and Reid, 1999) and is a HPD(Highest Posterior Density) matching prior. It turns out that among all of the reference priors, the only one reference prior (one-at-a-time reference prior) satisfies a second order matching criterion. Finally we show that one-at-a-time reference prior produces confidence sets with expected length shorter than the other reference priors and Cox and Reid (1987) adjustment.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.595-598
• /
• 2003

A new classifier is constructed by using a generalized regression neural network (GRNN) in conjunction with a random generator (RC). The RG played a role of generating a number of sets of random spreads given a range for gaussian functions in the pattern layer, The range experimentally varied from 0.4 to 1.4. The DNA sequences consisted 4 types of promoters. The performance of classifier is examined in terms of total classification sensitivity (TCS), and individual classification sensitivity (ICS). for comparisons, another GRNN classifier was constructed and optimized in conventional way. Compared GRNN, the RG-GRNN demonstrated much improved TCS along with better ICS on average.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.875-883
• /
• 2010

In this paper, we present a secure biometric hashing scheme for face recognition by random fusion of global and local features. The Fourier-Mellin transform and Radon transform are adopted respectively to form specialized representation of global and local features, due to their invariance to geometric operations. The final biometric hash is securely generated by random weighting sum of both feature sets. A fourfold key is involved in our algorithm to ensure the security and privacy of biometric templates. The proposed biometric hash can be revocable and replaced by using a new key. Moreover, the attacker cannot obtain any information about the original biometric template without knowing the secret key. The experimental results confirm that our scheme has a satisfactory accuracy performance in terms of EER.

• Architectural research
• /
• v.8 no.2
• /
• pp.27-36
• /
• 2006

Structural uncertainties are generally modeled using probabilistic approaches in order to quantify uncertainties in behaviors of structures. This uncertainty results from the uncertainties of structural parameters. Monte Carlo methods have been usually carried out for analyses of uncertainty problems where no analytical expression is available for the forward relationship between data and model parameters. In such cases any direct mathematical treatment is impossible, however the forward relation materializes itself as an algorithm allowing data to be calculated for any given model. This study addresses a new method which is utilized as a basis for the uncertainty estimates of structural responses. It applies double uniform random numbers (i.e. DURN technique) to conventional Monte Carlo algorithm. In DURN method, the scenarios of uncertainties are sequentially selected and executed in its simulation. Numerical examples demonstrate the beneficial effect that the technique can increase uncertainty degree of structural properties with maintaining structural stability and safety up to the limit point of a breakdown of structural systems.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.1
• /
• pp.255-264
• /
• 2016

Classification is a predictive modeling for a categorical target variable. Various classification ensemble methods, which predict with better accuracy by combining multiple classifiers, became a powerful machine learning and data mining paradigm. Well-known methodologies of classification ensemble are boosting, bagging and random forest. In this article, we assume that decision trees are used as classifiers in the ensemble. Further, we hypothesized that tree size affects classification accuracy. To study how the tree size in uences accuracy, we performed experiments using twenty-eight data sets. Then we compare the performances of ensemble algorithms; bagging, double-bagging, boosting and random forest, with different tree sizes in the experiment.

• The Korean Journal of Applied Statistics
• /
• v.31 no.2
• /
• pp.241-251
• /
• 2018

The analysis of gene sets in microarray has advantages in interpreting biological functions and increasing statistical powers. Many statistical methods have been proposed for detecting significant gene sets that show relations between genes and phenotypes, but there is no consensus about which is the best to perform gene sets analysis and permutation based tests are considered as standard tools. When many gene sets are tested simultaneously, a large number of random permutations are needed for multiple testing with a high computational cost. In this paper, several parametric approximations are considered as alternatives of the permutation distribution and the moment based gene set test has shown the best performance for providing p-values of the permutation test closely and quickly on a general framework.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.7
• /
• pp.139-148
• /
• 2012

An ensemble of classifiers is to employ a set of individually trained classifiers and combine their predictions. It has been found that in most cases the ensembles produce more accurate predictions than the base classifiers. Combining outputs from multiple classifiers, known as ensemble learning, is one of the standard and most important techniques for improving classification accuracy in machine learning. An ensemble of classifiers is efficient only if the individual classifiers make decisions as diverse as possible. Bagging is the most popular method of ensemble learning to generate a diverse set of classifiers. Diversity in bagging is obtained by using different training sets. The different training data subsets are randomly drawn with replacement from the entire training dataset. The random subspace method is an ensemble construction technique using different attribute subsets. In the random subspace, the training dataset is also modified as in bagging. However, this modification is performed in the feature space. Bagging and random subspace are quite well known and popular ensemble algorithms. However, few studies have dealt with the integration of bagging and random subspace using SVM Classifiers, though there is a great potential for useful applications in this area. The focus of this paper is to propose methods for improving SVM performance using hybrid ensemble strategy for bankruptcy prediction. This paper applies the proposed ensemble model to the bankruptcy prediction problem using a real data set from Korean companies.