• Korean Management Science Review
• /
• v.14 no.2
• /
• pp.47-61
• /
• 1997

This paper considers the parallel machines scheduling problem characterized as a multi-objective combinatorial problem. As this problem belongs to the NP-complete problem, genetic algorithms are applied instead of the traditional analytical approach. The purpose of this study is to show how the problem can be effectively solved by using genetic algorithms with a permutation approach. First, a permutation representation which can effectively represent the chromosome is introduced for this problem . Next, a schedule builder which employs the combination of scheduling theories and a simple heuristic approach is suggested. Finally, through the computer experiments of genetic algorithm to test problems, we show that the niche formation method does not contribute to getting better solutions and that the PMX crossover operator is the best among the selected four recombination operators at least for our problem in terms of both the performance of the solution and the operational convenience.

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

This paper considers the parallel machines scheduling problem characterized as a multi-objective combinatorial problem. As this problem belongs to the NP-complete problem, genetic algorithms are applied instead of the traditional analytical approach. The purpose of this study is to show how the problem can be effectively solved by using genetic algorithms with a permutation approach. First, a permutation representation which can effectively represent the chromosome is introduced for this problem . Next, a schedule builder which employs the combination of scheduling theories and a simple heuristic approach is suggested. Finally, through the computer experiments of genetic algorithm to test problems, we show that the niche formation method does not contribute to getting better solutions and that the PMX crossover operator is the best among the selected four recombination operators at least for our problem in terms of both the performance of the solution and the operational convenience.

• Korean Management Science Review
• /
• v.18 no.2
• /
• pp.117-124
• /
• 2001

This paper presents a machining parameter selection approach using an evolutionary computation (EC). In order to perform a successful material cutting process, the engineer is to select suitable machining parameters. Until now, it has been mostly done by the handbook look-up or solving optimization equations which is inconvenient when not in handy. The main thrust of the paper is to provide a handy machining parameter selection approach. The EC is applied to rapidly find optimal machining parameters for the user\\`s specific machining conditions. The EC is basically a combination of genetic a1gorithm and microcanonical stochastic simulated annealing method. The approach is described in detail with an application example. The paper concludes with a discussion on the potential of the proposed approach.

• Communications for Statistical Applications and Methods
• /
• v.14 no.3
• /
• pp.531-540
• /
• 2007

When multiple objectives exist, there are three approaches exist. These are maximin design, compound design, and constrained design. Still, each of three design criteria has its own strength and weakness. In this paper Hybrid approach is suggested when multiple design objectives exist, which is a combination of maximin and constrained design. Sometimes experimenter has several objectives, but he/she has only one or two primary objectives, others less important. A new approach should be useful under this condition. The genetic algorithm is used for few examples. It has been proven to be a very useful technique for this complex situation. Conclusion follows.

• Communications for Statistical Applications and Methods
• /
• v.20 no.6
• /
• pp.455-466
• /
• 2013

In nested case-control studies, the most common way to make inference under a proportional hazards model is the conditional logistic approach of Thomas (1977). Inclusion probability methods are more efficient than the conditional logistic approach of Thomas; however, the epidemiology research community has not accepted the methods as a replacement of the Thomas' method. This paper promotes the inverse probability weighting method originally proposed by Samuelsen (1997) in combination with an approximate jackknife standard error that can be easily computed using existing software. Simulation studies demonstrate that this approach yields valid type 1 errors and greater powers than the conditional logistic approach in nested case-control designs across various sample sizes and magnitudes of the hazard ratios. A generalization of the method is also made to incorporate additional matching and the stratified Cox model. The proposed method is illustrated with data from a cohort of children with Wilm's tumor to study the association between histological signatures and relapses.

• Interdisciplinary Bio Central
• /
• v.5 no.2
• /
• pp.3.1-3.7
• /
• 2013

Recently, the productivity of drug discovery has gradually decreased as the limitations of single-target-based drugs for various and complex diseases become exposed. To overcome these limitations, drug combinations have been proposed, and great efforts have been made to predict efficacious drug combinations by statistical methods using drug databases. However, previous methods which did not take into account biological networks are insufficient for elaborate predictions. Also, increased evidences to support the fact that drug effects are closely related to metabolic enzymes suggested the possibility for a new approach to the study drug combinations. Therefore, in this paper we suggest a novel approach for analyzing drug combinations using a metabolic network in a systematic manner. The influence of a drug on the metabolic network is described using the distance between the drug target and an enzyme. Target-enzyme distances are converted into influence scores, and from these scores we calculated the correlations between drugs. The result shows that the influence score derived from the targetenzyme distance reflects the mechanism of drug action onto the metabolic network properly. In an analysis of the correlation score distribution, efficacious drug combinations tended to have low correlation scores, and this tendency corresponded to the known properties of the drug combinations. These facts suggest that our approach is useful for prediction drug combinations with an advanced understanding of drug mechanisms.

• Journal of Microbiology and Biotechnology
• /
• v.24 no.4
• /
• pp.577-583
• /
• 2014

Three major classes of retroviral restriction factors (APOBEC3G, Tetherin, and TRIM5${\alpha}$) have been identified in mammals. Restriction factors are cellular proteins that are able to limit viral replication by targeting specific steps of the viral life cycle. To evaluate which restriction factor is the most effective to inhibit the replication of porcine endogenous retroviruses (PERVs), the antiviral activity of each restriction factor was compared. In pseudotype assay, the antiviral activity of human tetherin against PERV pseudotype was slightly weaker than that of human APOBEC3G (hA3G). A combination of tetherin and hA3G was more potent than each individual restriction factor. We questioned whether a combination of tetherin and hA3G could also inhibit the spreading replication of PERV. In agreement with the pseudotype assay, two restriction factors inhibit infectious PERV replication in a spreading infection. In this study, hA3G could strongly inhibit the replication of PERV, but tetherin modestly restricted it. Based on these results, we concluded that a combination of tetherin and hA3G is the most effective way to restrict PERV. A combination of different restriction factors will encourage the development of a new approach to treat retroviral disease.

• Proceedings of the KSPS conference
• /
• 1996.10a
• /
• pp.349-354
• /
• 1996

The phonetic mastery of English has been considered next to impossible to many non-native speakers of English, including even some teachers of English. This paper takes issue with this phonetic problem of second language acquisition and proposes that combination of cognitive and physical approaches can help master English faster and more easily.

• Asia pacific journal of information systems
• /
• v.13 no.1
• /
• pp.103-118
• /
• 2003

Software project planning is usually represented by a project activity network that is composed of stages of tasks to be done and precedence restrictions among them. The project network is very complex and its construction requires a vast amount of field knowledge and experience. So this study proposes a case-based reasoning approach that can generate the project network automatically based on the past cases and modification knowledge. For the case indexing, we have adopted 17 factors, each with a few alternative values. A special structure of this problem is that the modification effort can be identified by each factor independently. Thus it is manageable to identify 85 primitive modification actions(add and delete activities) and estimate its modification efforts in advance. A specific case requires a combination of primitive modifications. Based on the modification effort knowledge, we have adopted the Least Modification approach as a metric of similarity between a new project and past cases. Using the Least Modification approach and modification knowledge base, we can automatically generate the project network. To validate the performance of Least Modification approach, we have compared its performance with an ordinary minimal distance approach for 21 test cases. The experiment showed that the Least Modification approach could reduce the modification effort significantly.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1302-1311
• /
• 2003

This paper presents a more stable method of multiresolution editing for a triangular mesh. The basic idea of our paper is to embed an editing area of a mesh onto a 2D region and to produce 3D surfaces which interpolate the editing-information. In this paper, we adopt the extended convex combination approach based on the shape-preserving parameterization for the embedding, which guarantees no self-intersection on the 2D embedded mesh. That is, the result of the embedding is stable. Moreover, we adopt the multi-level B-spline approach to generate the surface containing all of 3D editing-information, which can make us control the editing area in several levels. Hence, this method supports interactive editing and thus can produce intuitive editing results.