• International Journal of Control, Automation, and Systems
• /
• v.4 no.1
• /
• pp.96-104
• /
• 2006

We propose a path planning method to improve the productivity of AOI (automated optical inspection) machines in PCB (printed circuit board) assembly lines. The path-planning problem is the optimization problem of finding inspection clusters and the visiting sequence of cameras to minimize the overall working time. A unified method is newly proposed to determine the inspection clusters and visiting sequence simultaneously. We apply a hybrid genetic algorithm to solve the highly complicated optimization problem. Comparative simulation results are presented to verify the usefulness of the proposed method.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.1 no.1
• /
• pp.113-118
• /
• 2001

In this paper, we develop an optimal intelligent digital redesign method for a class of fuzzy-model-based controllers, effective for stabilization of continuous-time complex nonlinear systems. Takagi-Sugeno (TS) fuzzy model is used to extend the results of the classical digital redesign technique to complex nonlinear systems. Unlike the conventional intelligent digital redesign technique reported in the literature, the proposed method utilized the recently developed LMI optimization technique to obtain a digitally redesigned fuzzy-model-based controller. Precisely speaking, the intelligent digital redesign problem is converted to an equivalent optimization problem, and the LMI optimization method is used to find the digitally redesigned fuzzy-model-based controller. A numerical example is provided to evaluate the feasibility of the proposed approach.

• International Journal of Internet, Broadcasting and Communication
• /
• v.8 no.1
• /
• pp.42-52
• /
• 2016

In this paper, we propose the 16-bits optimization design of the ARIA block-cipher algorithm for embedded systems with 16-bits processors. The proposed design adopts 16-bits XOR operations and rotated shift operations as many as possible. Also, the proposed design extends 8-bits array variables into 16-bits array variables for faster chained matrix multiplication. In evaluation experiments, our design is compared to the previous 32-bits optimized design and 8-bits optimized design. Our 16-bits optimized design yields about 20% faster execution speed and about 28% smaller footprint than 32-bits optimized code. Also, our design yields about 91% faster execution speed with larger footprint than 8-bits optimized code.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.3
• /
• pp.25-31
• /
• 2018

In this paper, we consider the game theoretic approach to investigate the transmit power optimization problem where D2D users share the uplink of the cellular system. Especially, we formulate the transmit power optimization problem as a non cooperative power control game. In the user wide sense, each user may try to select its transmit power level so as to maximize its utility in a selfish way. In the system wide, the transmit power levels of all users eventually converge to the unique point, called Nash Equilibrium. We first formulate the transmit power optimization problem as a non cooperative power control game. Next, we examine the existence of Nash Equilibrium. Finally, we present the numerical example that shows the convergence to the unique transmit power level.

• Journal of Magnetics
• /
• v.19 no.3
• /
• pp.266-272
• /
• 2014

In this paper, we suggest reliability as a metric to evaluate the robustness of a design for the optimal design of electromagnetic devices, with respect to constraints under the uncertainties in design variables. For fast numerical efficiency, we applied the sensitivity-assisted Monte Carlo simulation (S-MCS) method to perform reliability calculation. Furthermore, we incorporated the S-MCS with single-objective and multi-objective particle swarm optimization algorithms to achieve reliability-based optimal designs, undertaking probabilistic constraint and multi-objective optimization approaches, respectively. We validated the performance of the developed optimization algorithms through application to the optimal design of a superconducting magnetic energy storage system.

• Journal of Korean Society for Quality Management
• /
• v.25 no.1
• /
• pp.56-68
• /
• 1997

The object of multiresponse optimization is to determine conditions on hte independent variables that lead to optimal or nearly optimal values of the response variables. Derringer and Suich (1980) extended Harrington's (1965) procedure by introducing more general transformations of the response into desirability functions. The core of the desirability a, pp.oach condenses a multivariate optimization into a univariate one. But because of the subjective nature of this a, pp.oach, inexperience on the part of the user in assessing a product's desirability value may lead to inaccurate results. To compensate for this defect, a weighted desirability function is introduced which takes into consideration the vriances of the responses.

• Water for future
• /
• v.12 no.2
• /
• pp.70-76
• /
• 1979

This study aims at rationalization of assessment method of the output such as power generation and water supply avaiable from a multipurpose dam project in its optimization study. The computer program proposed in this stuidy has much contributed toward rationalization of the optimization study of Chungju Multipurpose Dam Project saving much labor as well as time. This computer program which has been developed in this study may be also applicable to other porject similar to Chungju Project.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.2
• /
• pp.97-103
• /
• 2016

This paper deals with the cycle time minimization problem that determines the productivity in printed circuit board (PCB) with n components using the m placement machines. This is known as production cycle time determination problem (PCTDP). The polynomial time algorithm to be obtain the optimal solution has been unknown yet, therefore this hard problem classified by NP-complete. This paper gets the initial assignment result with the machine has minimum unit placement time per each component firstly. Then, the balancing process with reallocation from overhead machine to underhead machine. Finally, we perform the swap optimization and get the optimal solution of cycle time $T^*$ within O(mn) computational complexity. For experimental data, the proposed algorithm can be obtain the same result as integer programming+branch-and-bound (IP+B&B) and B&B.

• Genomics & Informatics
• /
• v.9 no.2
• /
• pp.89-91
• /
• 2011

DNA chips are becoming increasingly popular as a convenient way to perform vast amounts of experiments related to genes on a single chip. And the importance of analyzing the data that is provided by such DNA chips is becoming significant. A very important analysis on DNA chip data would be clustering genes to identify gene groups which have similar properties such as cancer. Clustering data for DNA chips usually deal with a large search space and has a very fuzzy characteristic. The Particle Swarm Optimization algorithm which was recently proposed is a very good candidate to solve such problems. In this paper, we propose a clustering mechanism that is based on the Particle Swarm Optimization algorithm. Our experiments show that the PSO-based clustering algorithm developed is efficient in terms of execution time for clustering DNA chip data, and thus be used to extract valuable information such as cancer related genes from DNA chip data with high cluster accuracy and in a timely manner.

• ETRI Journal
• /
• v.37 no.3
• /
• pp.502-511
• /
• 2015

Intrusion detection plays a key role in detecting attacks over networks, and due to the increasing usage of Internet services, several security threats arise. Though an intrusion detection system (IDS) detects attacks efficiently, it also generates a large number of false alerts, which makes it difficult for a system administrator to identify attacks. This paper proposes automatic fuzzy rule generation combined with a Wiener filter to identify attacks. Further, to optimize the results, simplified swarm optimization is used. After training a large dataset, various fuzzy rules are generated automatically for testing, and a Wiener filter is used to filter out attacks that act as noisy data, which improves the accuracy of the detection. By combining automatic fuzzy rule generation with a Wiener filter, an IDS can handle intrusion detection more efficiently. Experimental results, which are based on collected live network data, are discussed and show that the proposed method provides a competitively high detection rate and a reduced false alarm rate in comparison with other existing machine learning techniques.