• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.575-594
• /
• 2010

In this study, we propose a space search algorithm (SSA) and then introduce a hybrid optimization of fuzzy inference systems based on SSA and information granulation (IG). In comparison with "conventional" evolutionary algorithms (such as PSO), SSA leads no.t only to better search performance to find global optimization but is also more computationally effective when dealing with the optimization of the fuzzy models. In the hybrid optimization of fuzzy inference system, SSA is exploited to carry out the parametric optimization of the fuzzy model as well as to realize its structural optimization. IG realized with the aid of C-Means clustering helps determine the initial values of the apex parameters of the membership function of fuzzy model. The overall hybrid identification of fuzzy inference systems comes in the form of two optimization mechanisms: structure identification (such as the number of input variables to be used, a specific subset of input variables, the number of membership functions, and polyno.mial type) and parameter identification (viz. the apexes of membership function). The structure identification is developed by SSA and C-Means while the parameter estimation is realized via SSA and a standard least square method. The evaluation of the performance of the proposed model was carried out by using four representative numerical examples such as No.n-linear function, gas furnace, NO.x emission process data, and Mackey-Glass time series. A comparative study of SSA and PSO demonstrates that SSA leads to improved performance both in terms of the quality of the model and the computing time required. The proposed model is also contrasted with the quality of some "conventional" fuzzy models already encountered in the literature.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.119-131
• /
• 2009

Existing proposals on route optimization for nested Network Mobility(NEMO) have a problem that it is difficult to optimize a route promptly in an environment where a MR moves frequently. Also, they have L3 handoff latency as well as route optimization latency until an optimized route is formed. In this paper, we propose a L3 handoff scheme that supports fast route optimization for nested NEMO without any additional optimization procedure. To achieve this, our proposed scheme is designed to include a procedure that an AR acquires address informations of a MR. After receiving binding update message from the MR, the AR performs the binding update procedure with the MR's HA on behalf of the MR. Packets are delivered to the AR only passing by the MR's HA after a bi-directional tunnel is formed between the AR and the HA. The result of our performance evaluation has shown that the proposed scheme could provide excellent performance compared with the RRH and the ONEMO.

• Proceedings of the KSME Conference
• /
• 2005.11a
• /
• pp.169.2-169.2
• /
• 2005

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.143-146
• /
• 1996

In this paper, we propose a hopfield model for solving the part-matching which is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and net total path of part-connection. Therefore, this kind of problem is referred to as a combinatorial optimization problem. First of all, we review the theoretical basis for hopfield model to optimization and present two method of part-matching; Traveling Salesman Problem (TSP) and Weighted Matching Problem (WMP). Finally, we show demonstration through computer simulation and analyzes the stability and feasibility of the generated solutions for the proposed connection methods.

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.3
• /
• pp.233-236
• /
• 2015

In this paper, a nonlinear optimization problem is proposed to obtain a structured static output feedback controller for discrete time linear systems. The proposed optimization problem has LMI (Linear Matrix Inequality) constraints and a non-convex objective function. Using the conditional gradient method, we can obtain suboptimal solutions of the proposed optimization problem. Numerical examples show the effectives of the proposed approach.

• Proceedings of the IEEK Conference
• /
• 2000.06e
• /
• pp.124-126
• /
• 2000

The Minimum-Norm Least-Square(MNLS) approach based on lead field theory is an useful method to find an unique inverse solution for the measured magnetic field. The lead field depends on head geometry and location of sources and sensors. So, optimization of sensor array location is important issue for MNLS estimation. In this paper, we present an investigation for the optimization of sensor array location in computer simulation.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.690-694
• /
• 2008

In this presentation, we study numerically an optimization problem of a fire fighting robot cooling system. The governing equation for the system is the unsteady heat equation with source term. We use a multigrid method for numerical solutions in three-dimensional space. We investigated the effects of various parameters and the results will be presented.

• Journal of information and communication convergence engineering
• /
• v.8 no.4
• /
• pp.370-376
• /
• 2010

Ensemble learning is a method for improving the performance of classification and prediction algorithms. However, its performance can be degraded due to multicollinearity problem where multiple classifiers of an ensemble are highly correlated with. This paper proposes genetic algorithm-based optimization techniques of SVM ensemble to solve multicollinearity problem. Empirical results with bankruptcy prediction on Korea firms indicate that the proposed optimization techniques can improve the performance of SVM ensemble.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.253-263
• /
• 1998

This study presents a method of realizing the theoretical results of Demyanov in practice on a computer in order to produce a kind of constructive evidence for his theory and a practical method of getting numerical results for quasi-differentiab1e optimization problems which may arise in industry and science. A practical result for a restricted nondifferentiable optimization problem is experimented with a simle example.

• Proceedings of the Korea Society for Energy Engineering kosee Conference
• /
• 1994.11a
• /
• pp.146-149
• /
• 1994

A nonlinear dynamic optimization has been performed for reactor power control system of CANDU 6 nuclear power plant considering xenon, fuel and moderator temperature feedback effects. Integral-of-Time-multiplied Absolute-Error (ITAE) criterion has been used as a performance index of the system behavior. Optimum controller gain are found by searching algorithm of Sequential Quadratic Programming (SQP). System models are referenced from most recent literatures. Signal flow network construction and optimization have been done by using commercial computer software package.