• Journal of Biomedical Engineering Research
• /
• v.42 no.5
• /
• pp.232-240
• /
• 2021

Heterogeneity in cancer is the major obstacle for precision medicine and has become a critical issue in the field of a cancer diagnosis. Many attempts were made to disentangle the complexity by molecular classification. However, multi-dimensional information from dynamic responses of cancer poses fundamental limitations on biomolecular marker-based conventional approaches. Cell morphology, which reflects the physiological state of the cell, can be used to track the temporal behavior of cancer cells conveniently. Here, we first present a hybrid learning-based platform that extracts cell morphology in a time-dependent manner using a deep convolutional neural network to incorporate multivariate data. Feature selection from more than 200 morphological features is conducted, which filters out less significant variables to enhance interpretation. Our platform then performs unsupervised clustering to unveil dynamic behavior patterns hidden from a high-dimensional dataset. As a result, we visualize morphology state-space by two-dimensional embedding as well as representative morphology clusters and trajectories. This cell morphology profiling strategy by hybrid learning enables simplification of the heterogeneous population of cancer.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.4
• /
• pp.211-220
• /
• 2017

The application of the theoretical model to real assembly lines has been one of the biggest challenges for researchers and industrial engineers. There should be some realistic approach to achieve the conflicting objectives on real systems. Therefore, in this paper, a model is developed to synchronize a real system (A discrete event simulation model) with a theoretical model (An optimization model). This synchronization will enable the realistic optimization of systems. A job assignment model of the assembly line is formulated for the evaluation of proposed realistic optimization to achieve multiple conflicting objectives. The objectives, fluctuation in cycle time, throughput, labor cost, energy cost, teamwork and deviation in the skill level of operators have been modeled mathematically. To solve the formulated mathematical model, a multi-objective simulation integrated hybrid genetic algorithm (MO-SHGA) is proposed. In MO-SHGA each individual in each population acts as an input scenario of simulation. Also, it is very difficult to assign weights to the objective function in the traditional multi-objective GA because of pareto fronts. Therefore, we have proposed a probabilistic based linearization and multi-objective to single objective conversion method at population evolution phase. The performance of MO-SHGA is evaluated with the standard multi-objective genetic algorithm (MO-GA) with both deterministic and stochastic data settings. A case study of the goalkeeping gloves assembly line is also presented as a numerical example which is solved using MO-SHGA and MO-GA. The proposed research is useful for the development of synchronized human based assembly lines for real time monitoring, optimization, and control.

• The Korean Journal of Mycology
• /
• v.45 no.4
• /
• pp.328-335
• /
• 2017

In this study, we made a population with high biological efficiency (BE) to investigate the complex genetic architecture of yield-related traits in Agaricus bisporus. MB-013 crossed between bisp 015-p2 and bisp 034-p2, had high BE. Additionally MB-013 was an intervarietal hybrid that intercrosses with A. bisporus var. burnettii, bisp 015, and A. bisporus var. bisporus, bisp 034. One hundred and seventy homokaryons were selected using the cleaved amplified polymorphic sequence (CAPS) markers (PIN primer/HaeIII) from 300 single spore isolates (SSIs). One hundred $BC_1F_1$ hybrids were obtained by crossing the homokaryons of MB-013 with bisp15-p1. The population of 100 BC1F1 hybrids is suitable for analyses of BE.

• Journal of Environmental Impact Assessment
• /
• v.14 no.4
• /
• pp.157-164
• /
• 2005

Existing models that predict of Daily water supply include statistical models and neural network model. The neural network model was more effective than the statistical models. Only neural network model, which predict of Daily water supply, is focused on estimation of the operational control. Neural network model takes long learning time and gets into local minimum. This study proposes Neuro Genetic hybrid model which a combination of genetic algorithm and neural network. Hybrid model makes up for neural network's shortcomings. In this study, the amount of supply, the mean temperature and the population of the area supplied with water are use for neural network's learning patterns for prediction. RMSE(Root Mean Square Error) is used for a MOE(Measure Of Effectiveness). The comparison of the two models showed that the predicting capability of Hybrid model is more effective than that of neural network model. The proposed hybrid model is able to predict of Daily water, thus it can apply real time estimation of operational control of water works and water drain pipes. Proposed models include accidental cases such as a suspension of water supply. The maximum error rate between the estimation of the model and the actual measurement was 11.81% and the average error was lower than 1.76%. The model is expected to be a real-time estimation of the operational control of water works and water/drain pipes.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.52 no.3
• /
• pp.334-340
• /
• 2007

A super sweet corn hybrid, "Cambella 90", was grown at 5 plant populations (35,000, 45,000, 55,000, 65,000, 75,000 plants/ha) on 1 April, 1 May, and 1 June in 2004 under black polyethylene (P. E.) film mulch to find out the optimum plant populations at different planting dates. Emergence rate and percent stand increased as planting dates delayed. Culm length and ear height were highest at the planting on 1 May and increased with increased plant population. Soluble solids content was highest at the planting on 1 May and decreased as plant population increased. Ear length, seed set ear length, ear diameter, and ear weight decreased as plant population increased. Seed set ear length could not substitute for ear weight to evaluate marketable ears. The optimum plant population of "Cambella 90" was $65,000{\sim}75,000$ plants/ha at the planting on 1 April when emergence rate was low due to low temperature, $55,000{\sim}65,000$ plants/ha at the planting on 1 May, and 65,000 plants/ ha after the planting on 1 June.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.6
• /
• pp.2269-2275
• /
• 2010

The performance of Genetic Algorithms (GA) is affected by various factors such as parameters, genetic operators and strategies. The traditional approach with random initial population is efficient however the whole initial population may contain many infeasible solutions. Thus it would take a long time for GA to produce a good solution. The GA have been modified in various ways to achieve faster convergence and it was particularly recognized by researchers that initial population greatly affects the performance of GA. This study proposes modified GA with sorted initial population and applies it to solving Travelling Salesman Problem (TSP). Normally, the bigger the initial the population is the more computationally expensive the calculation becomes with each generation. New approach allows reducing the size of the initial problem and thus achieve faster convergence. The proposed approach is tested on a simulator built using object-oriented approach and the test results prove the validity of the proposed method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.2
• /
• pp.121-134
• /
• 1999

In this paper, I propose a hybrid genetic algorithm(HGAM) incorporating a greedy interchange local optimization procedure for the multiobjective vehicle scheduling problems with service due times where three conflicting objectives of the minimization of total vehicle travel time, total weighted tardiness, and fleet size are explicitly treated. The vehicle is allowed to visit a node exceeding its due time with a penalty, but within the latest allowable time. The HGAM applies a mixed farming and migration strategy in the evolution process. The strategy splits the population into sub-populations, all of them evolving independently, and applys a local optimization procedure periodically to some best entities in sub-populations which are then substituted by the newly improved solutions. A solution of the HCAM is represented by a diploid structure. The HGAM uses a molified PMX operator for crossover and new types of mutation operator. The performance of the HGAM is extensively evaluated using the Solomons test problems. The results show that the HGAM attains better solutions than the BC-saving algorithm, but with a much longer computation time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.2
• /
• pp.59-68
• /
• 2001

The job shop scheduling problem is not only NP-hard, but is one of the well known hardest combinatorial optimization problems. The goal of this research is to develop an efficient scheduling method based on hybrid genetic algorithm to address job shop scheduling problem. In this scheduling method, generating method of initial population, new genetic operator, selection method are developed. The scheduling method based on genetic algorithm are tested on standard benchmark job shop scheduling problem. The results were compared with another genetic algorithm0-based scheduling method. Compared to traditional genetic, algorithm, the proposed approach yields significant improvement at a solution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.10
• /
• pp.3419-3437
• /
• 2022

Anonymization technology is an important technology for privacy protection in the process of data release. Usually, before publishing data, the data publisher needs to use anonymization technology to anonymize the original data, and then publish the anonymized data. However, for data publishers who do not have or have less anonymized technical knowledge background, how to configure appropriate parameters for data with different characteristics has become a more difficult problem. In response to this problem, this paper adds a historical configuration scheme resource pool on the basis of the traditional anonymization process, and configuration parameters can be automatically recommended through the historical configuration scheme resource pool. On this basis, a privacy model hybrid recommendation algorithm for user satisfaction is formed. The algorithm includes a forward recommendation process and a reverse recommendation process, which can respectively perform data anonymization processing for users with different anonymization technical knowledge backgrounds. The privacy model hybrid recommendation algorithm for user satisfaction described in this paper is suitable for a wider population, providing a simpler, more efficient and automated solution for data anonymization, reducing data processing time and improving the quality of anonymized data, which enhances data protection capabilities.

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.193-201
• /
• 2023

In this paper, we consider the maximum scatter traveling salesman problem (MSTSP), a travelling salesman problem (TSP) variant. The problem aims to maximize the minimum length edge in a salesman's tour that travels each city only once in a network. It is a very complicated NP-hard problem, and hence, exact solutions can be found for small sized problems only. For large-sized problems, heuristic algorithms must be applied, and genetic algorithms (GAs) are found to be very successfully to deal with such problems. So, this paper develops a hybrid GA (HGA) for solving the problem. Our proposed HGA uses sequential sampling algorithm along with 2-opt search for initial population generation, sequential constructive crossover, adaptive mutation, randomly selected one of three local search approaches, and the partially mapped crossover along with swap mutation for perturbation procedure to find better quality solution to the MSTSP. Finally, the suggested HGA is compared with a state-of-art algorithm by solving some TSPLIB symmetric instances of many sizes. Our computational experience reveals that the suggested HGA is better. Further, we provide solutions to some asymmetric TSPLIB instances of many sizes.