• Bulletin of the Korean Chemical Society
• /
• v.33 no.1
• /
• pp.69-75
• /
• 2012

Five-channel electrochemical chips were fabricated based on the Micro-electromechanical System (MEMS) technology and were used as platforms to develop DNA arrays. Different kinds of thiolated DNA strands, whose sequences were related to white spot syndrome virus (WSSV) gene, were separately immobilized onto different working electrodes to fabricate a combinatorial biosensor system. As a result, different kinds of target DNA could be analyzed on one chip via a simultaneous recognition process using potassium ferricyanide as an indicator. To perform quantitative target DNA detection, a limit of 70 nM (S/N=3) was found in the presence of 600 nM coexisting noncomplementary ssDNA. The real samples of loop-mediated isothermal amplification (LAMP) products were detected by the proposed method with satisfactory result, suggesting that the multichannel chips had the potential for a high effective microdevice to recognize specific gene sequence for pointof-care applications.

• Journal of the Society of Naval Architects of Korea
• /
• v.42 no.6 s.144
• /
• pp.654-665
• /
• 2005

In this paper, we present a non-linear integer programming by genetic algorithm (GA) for available sizes of stiffener or thickness of plate in a job site. GA can rapidly search for the approximate global optimum under complicated design environment such as ship. Meanwhile it can handle the optimization problem involving discrete design variable. However, there are many parameters have to be set for GA, which greatly affect the accuracy and calculation time of optimum solution. The setting process is hard for users, and there are no rules to decide these parameters. In order to overcome these demerits, the optimization for these parameters has been also conducted using GA itself. Also it is proved that the parameters are optimal values by the trial function. Finally, we applied this method to compass deck of ship where the vibration problem is frequently occurred to verify the validity and usefulness of nonlinear integer programming.

• International Journal of Oral Biology
• /
• v.42 no.2
• /
• pp.71-78
• /
• 2017

BMP-2 is a well-known TGF-beta related growth factor, having a significant role in bone and cartilage formation. It has been employed to promote bone formation in some clinical trials, and to differentiate mesenchymal stem cells into osteoblasts. However, it is difficult to obtain this protein in its soluble and active form. hBMP-2 is expressed as an inclusion body in the bacterial system. To continuously supply hBMP-2 for research, we optimized the refolding of recombinant hBMP-2 expressed in E. coli, and established an efficient method by using detergent and alkali. Using a heparin column, the recombinant hBMP-2 was purified with the correct refolding. Although combinatorial refolding remarkably enhanced the solubility of the inclusion body, a higher yield of active dimer form of hBMP-2 was obtained from one-step refolding with detergent. The refolded recombinant hBMP-2 induced alkaline phosphatase activity in mouse myoblasts, at $ED_{50}$ of 300-480ng/ml. Furthermore, the expressions of osteogenic markers were upregulated in hPDLSCs and hDPSCs. Therefore, using the process described in this study, the refolded hBMP-2 might be cost-effectively useful for various differentiation experiments in a laboratory.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.9
• /
• pp.66-75
• /
• 1999

Image segmentation is the process where an image is segmented into regions that are set of homogeneous pixels. The result has a ciritical effect on accuracy of image understanding. In this paper, an Markov random field (MRF) image segmentation is proposed using genetic algorithm(GA). We model an image using MRF which is resistant to noise and blurring. While MRF based methods are robust to degradation, these require accurate parameter estimation. So GA is used as a segmentation algorithm which is effective at dealing with combinatorial problems. The efficiency of the proposed method is shown by experimental results with real images and application to automatic vehicle extraction system.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.1
• /
• pp.15-19
• /
• 2004

Ant Colony System(ACS) is a meta heuristic approach based on biology in order to solve combinatorial optimization problem. It is based on the tracing action of real ants which accumulate pheromone on the passed path and uses as communication medium. In order to search the optimal path, ACS requires to explore various edges. In existing ACS, the local updating rule assigns the same pheromone to visited edge. In this paper, our local updating rule gives the pheromone according to the number of visiting times and the distance between visited cities. Our approach can have less local optima than existing ACS and find better solution by taking advantage of more informations during searching.

• Industrial Engineering and Management Systems
• /
• v.12 no.2
• /
• pp.151-160
• /
• 2013

In the past decades, several algorithms based on evolutionary approaches have been proposed for solving job shop scheduling problems (JSP), which is well-known as one of the most difficult combinatorial optimization problems. Most of them have concentrated on finding optimal solutions of a single objective, i.e., makespan, or total weighted tardiness. However, real-world scheduling problems generally involve multiple objectives which must be considered simultaneously. This paper proposes an efficient particle swarm optimization based approach to find a Pareto front for multi-objective JSP. The objective is to simultaneously minimize makespan and total tardiness of jobs. The proposed algorithm employs an Elite group to store the updated non-dominated solutions found by the whole swarm and utilizes those solutions as the guidance for particle movement. A single swarm with a mixture of four groups of particles with different movement strategies is adopted to search for Pareto solutions. The performance of the proposed method is evaluated on a set of benchmark problems and compared with the results from the existing algorithms. The experimental results demonstrate that the proposed algorithm is capable of providing a set of diverse and high-quality non-dominated solutions.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.175-182
• /
• 2021

Deadlock is a situation in which two or more processes competing for resources are waiting for the others to finish, and neither ever does. There are two different forms of systems, multi-unit and single-unit resource systems. The difference is the number of instances (or units) of each type of resource. Deadlock problem can be modeled as a constrained combinatorial problem that seeks to find a possible scheduling for the processes through which the system can avoid entering a deadlock state. To solve deadlock problem, several algorithms and techniques have been introduced, but the use of metaheuristics is one of the powerful methods to solve it. Genetic algorithms have been effective in solving many optimization issues, including deadlock Problem. In this paper, an improved parallel framework of the genetic algorithm is introduced and adapted effectively and efficiently to deadlock problem. The proposed modified method is implemented in java and tested on a specific dataset. The experiment shows that proposed approach can produce optimal solutions in terms of burst time and the number of feasible solutions in each advanced generation. Further, the proposed approach enables all types of crossovers to work with high performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3619-3637
• /
• 2022

Big data analytics offers endless opportunities for operational enhancement by extracting valuable insights from complex voluminous data. Hadoop is a comprehensive technological suite which offers solutions for the large scale storage and computing needs of Big data. The performance of Hadoop is closely tied with its configuration settings which depends on the cluster capacity and the application profile. Since Hadoop has over 190 configuration parameters, tuning them to gain optimal application performance is a daunting challenge. Our approach is to extract a subset of impactful parameters from which the performance enhancing sub-optimal configuration is then narrowed down. This paper presents a statistical model to analyze the significance of the effect of Hadoop parameters on a variety of performance metrics. Our model decomposes the total observed performance variation and ascribes them to the main parameters, their interaction effects and noise factors. The method clearly segregates impactful parameters from the rest. The configuration setting determined by our methodology has reduced the Job completion time by 22%, resource utilization in terms of memory and CPU by 15% and 12% respectively, the number of killed Maps by 50% and Disk spillage by 23%. The proposed technique can be leveraged to ease the configuration tuning task of any Hadoop cluster despite the differences in the underlying infrastructure and the application running on it.

• Structural Engineering and Mechanics
• /
• v.87 no.3
• /
• pp.231-242
• /
• 2023

A novel combinatorial type-2 adaptive neuro-fuzzy inference system (T2-ANFIS) and robust proportional integral derivative (PID) control framework for intelligent vibration mitigation of uncertain structural system is introduced. The fuzzy logic controllers (FLCs), are designed independently of the mathematical model of the system. The type-1 FLCs, have a limited ability to reduce the effect of uncertainty, due to their fuzzy sets with a crisp degree of membership. In real applications, the consequent part of the fuzzy rules is uncertain. The type-2 FLCs, are robust to the fuzzy rules and the process parameters due to the fuzzy degree of membership functions and footprint of uncertainty (FOU). The adaptivity of the proposed method is provided with the optimum tuning of the parameters using the neural network training algorithms. In our approach, the PID control force is obtained using the generalized type-2 neuro-fuzzy in such a way that the stability and robustness of the controller are guaranteed. The robust performance and stability of the presented framework are demonstrated in a numerical study for an eleven-story seismically-excited building structure combined with an active tuned mass damper (ATMD). The results indicate that the introduced type-2 neuro-fuzzy PID control scheme is effective to attenuate plant states in the presence of the structured and unstructured uncertainties, compared to the conventional, type-1 FLC, type-2 FLC, and type-1 neuro-fuzzy PID controllers.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.6
• /
• pp.87-94
• /
• 2003

One of the important fields for heuristic algorithm is how to balance between Intensification and Diversification. Ant Colony Optimization(ACO) is a new meta heuristic algorithm to solve hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as Breedy search It was first Proposed for tackling the well known Traveling Salesman Problem(TSP). In this paper, we deal with the performance improvement techniques through balance the Intensification and Diversification in Ant Colony System(ACS). First State Transition considering the number of times that agents visit about each edge makes agents search more variously and widen search area. After setting up criteria which divide elite tour that receive Positive Intensification about each tour, we propose a method to do addition Intensification by the criteria. Implemetation of the algorithm to solve TSP and the performance results under various conditions are conducted, and the comparision between the original An and the proposed method is shown. It turns out that our proposed method can compete with the original ACS in terms of solution quality and computation speed to these problem.