• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.4
• /
• pp.354-359
• /
• 2013

In this paper, we suggested the method for implementation of unsupervised nonlinear classification using Binary Harmony Search (BHS) algorithm, which is known as a optimization algorithm. Various algorithms have been suggested for classification of feature vectors from the process of machine learning for pattern recognition or EEG signal analysis processing. Supervised learning based support vector machine or fuzzy c-mean (FCM) based on unsupervised learning have been used for classification in the field. However, conventional methods were hard to apply nonlinear dataset classification or required prior information for supervised learning. We solved this problems with proposed classification method using heuristic approach which took the minimal Euclidean distance between vectors, then we assumed them as same class and the others were another class. For the comparison, we used FCM, self-organizing map (SOM) based on artificial neural network (ANN). KEEL machine learning datset was used for simulation. We concluded that proposed method was superior than other algorithms.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.11 no.6
• /
• pp.1-14
• /
• 2007

Optimal design method of nonlinear damping system for seismic response control of adjacent structures is studied in this paper. The objective functions of the optimal design are defined by structural response and total amount of the dampers. In order to obtain a solution minimizing two mutually conflicting objective functions simultaneously, multi-objective optimization technique based on genetic algorithm is adopted. In addition, stochastic linearization method is embedded into the multi-objective framework to efficiently estimate the seismic responses of the adjacent structures interconnected by nonlinear hysteretic dampers without performing nonlinear time-history analyses. As a numerical example to demonstrate the effectiveness of the proposed technique, 20-story and 10-story buildings are considered and MR dampers of which hysteretic behaviors vary with the magnitude of the input voltage are considered as nonlinear hysteretic damper interconnecting two adjacent buildings. The proposed approach can provide the optimal number and capacities of the MR dampers, which turned out to be more economical than the uniform distribution system while maintaining similar control performance. The proposed damper system is verified to show more stable performance in terms of the pounding probability between two adjacent buildings. The applicability of the proposed method to the design problem for optimally placing semi-active control system is examined as well.

• Geotechnical Engineering
• /
• v.12 no.6
• /
• pp.87-100
• /
• 1996

This paper verifies the accuracy and efficiency of the implicit stress integration algorithm for an anisotropic hardening constitutive model developed in a companion paper[Oh & Lee (1996)3. Simulation of undrained triaxial test results shows the accuracy of the method through an error estimation, and analyses of accuracy and convergence were performed for a numerical excavation problem. As a result, the stress was accurately integrated by the algorithm and the nonlinear solution was converged to be asymptotically quadratic. Furthermore nonlinear FE analysis of a real excavation problem was by performed considering the initial soil conditions and the in-situ construction sequences. The displacements of wall induced by excavation were more accurately estimated by the anisotropic hardening model than by the Cam-clay model.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.12
• /
• pp.2346-2351
• /
• 2011

This paper presents the intelligent external noise analysis method for nonlinear maneuvering target. After recognizing maneuvering pattern of the target by the proposed method, we track the state of the target. The external noise can be divided into mere noise and acceleration using only the measurement. divided noise passes through the filtering step and acceleration is punched into dynamic model to compensate expected states. The acceleration is the most deterministic factor to the maneuvering. By dividing, approximating, and compensating the acceleration, we can reduce the tracking error effectively. We use the fuzzy c-means (FCM) clustering as the method to divide external noise. FCM can separate the acceleration from the noise without criteria. It makes the criteria with the data made by measurement at every sampling time. So it can show the adaptive tracking result. The proposed method proceeds the tracking target simultaneously with the learning process. Thus it can apply to the online system. The proposed method shows the remarkable tracking result on the linear and nonlinear maneuvering. Finally, some examples are provided to show the feasibility of the proposed algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.8
• /
• pp.682-687
• /
• 2013

Navigation is a crucial capability for all types of manned or unmanned vehicles. However, vehicle navigation in underwater environments still remains a challenging problem since GPS signals for position fixes are not available in the water. Terrain-referenced underwater navigation is an alternative navigation technique that utilizes geometric information of the subsea terrain to correct drift errors due to dead-reckoning or inertial navigation. Terrain-referenced navigation requires the description of an undulating terrain surface as a mathematical function or table, which often leads to a highly nonlinear estimation problem. Recently, PFs (Particle Filters), which do not require any restrictive assumptions about the system dynamics and uncertainty distributions, have been widely used for nonlinear filtering applications. However, PF has considerable computational requirements which used to limit its applicability to problems of relatively low state dimensions. This study proposes the use of a Rao-Blackwellized particle filter that is computationally more efficient than the standard PF for terrain-referenced underwater navigation involving a moderate number of states, and its performance is compared with that of the extended Kalman filter algorithm. The validity and feasibility of the proposed algorithm is demonstrated through numerical simulations.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.20 no.3
• /
• pp.243-259
• /
• 2016

The Richards equation for water movement in unsaturated soil is highly nonlinear partial differential equations which are not solvable analytically unless unrealistic and oversimplifying assumptions are made regarding the attributes, dynamics, and properties of the physical systems. Therefore, conventionally, numerical solutions are the only feasible procedures to model flow in partially saturated porous media. The standard Finite element numerical technique is usually coupled with an Euler time discretizations scheme. Except for the fully explicit forward method, any other Euler time-marching algorithm generates nonlinear algebraic equations which should be solved using iterative procedures such as Newton and Picard iterations. In this study, lumped mass and distributed mass in the frame of Picard and Newton iterative techniques were evaluated to determine the most efficient method to solve the Richards equation with finite element model. The accuracy and computational efficiency of the scheme and of the Picard and Newton models are assessed for three test problems simulating one-dimensional flow processes in unsaturated porous media. Results demonstrated that, the conventional mass distributed finite element method suffers from numerical oscillations at the wetting front, especially for very dry initial conditions. Even though small mesh sizes are applied for all the test problems, it is shown that the traditional mass-distributed scheme can still generate an incorrect response due to the highly nonlinear properties of water flow in unsaturated soil and cause numerical oscillation. On the other hand, non oscillatory solutions are obtained and non-physics solutions for these problems are evaded by using the mass-lumped finite element method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7C
• /
• pp.640-648
• /
• 2009

Summation generator with high period and high linear complexity can be easily implemented by a simple hardware or software and it is proper to apply in mobile security system for ubiquitous environments. However the generator has been some weaknesses from Dawson's divided-and-conquer attack, Golic's correlation attack and Meier's fast correlation attack. In this paper, we propose an improved version($2^{128}$security level) of $E_0$algorithm, CVC-NSG(Circular-Clock-Controlled - Nonlinear Summation Generator), which partially replaces LFSRs with nonlinear FSRs and controls the irregular clock to reinforce it's own weaknesses. Finally, we analyze our proposed design in terms of security and performance.

• Journal of Astronomy and Space Sciences
• /
• v.27 no.3
• /
• pp.221-230
• /
• 2010

A 4+12+16 amplitude phase shift keying (APSK) modulation outperforms other 32-APSK modulations in a nonlinear additive white Gaussian noise (AWGN) channel because of its intrinsic robustness against AM/AM and AM/PM distortions caused by the nonlinear characteristics of a high-power amplifier. Thus, this modulation scheme has been adopted in the digital video broadcasting-satellite2 European standard. And it has been considered for high rate transmission of telemetry data on deep space communications in consultative committee for space data systems which provides a forum for discussion of common problems in the development and operation of space data systems. In this paper, we present an improved bits-to-symbol mapping scheme with a better bit error rate for a 4+12+16 APSK signal in a nonlinear AWGN channel and propose a simple signal detection algorithm for the 4+12+16 APSK from the presented bit mapping.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.3
• /
• pp.315-327
• /
• 2001

This paper considers the problem of operation sequencing in nonlinear process planning, which is the problem of selecting and sequencing operations required to produce a part with the objective of minimizing the sum of operation processing costs and machine, setup and tool change costs. Main constraints are the precedence relations among operations. The problem can be decomposed into two subproblems: operation selection and operation sequencing. We suggest four simulated annealing algorithms, which solve the two subproblems iteratively until a good solution is obtained. Here, the operation selection problem can be solved using a shortest path algorithm. Application of the algorithms is illustrated using an example. Also, to show the performances of the suggested algorithms, computational experiments were done on randomly generated test problems and the results are reported. In particular, one of the suggested algorithms outperforms an existing simulated annealing algorithm.

• Honam Mathematical Journal
• /
• v.36 no.4
• /
• pp.831-852
• /
• 2014

The obstacle shape reconstruction problem has been known to be difficult to solve since it is highly nonlinear and severely ill-posed. The use of local or locally supported basis functions for the problem has been addressed for many years. However, to the authors' knowledge, any research report on the proper usage of local or locally supported basis functions for the shape reconstruction has not been appeared in the literature due to many difficulties. The aim of this paper is to introduce the general concepts and methodologies for the proper choice and their implementation of locally supported basis functions through the two-dimensional Helmholtz equation. The implementations are based on the complex nonlinear parameter estimation (CNPE) formula and its robust algorithm developed recently by the authors. The basic concepts and ideas are simple. The derivation of the necessary properties needed for the shape reconstructions are elementary. However, the capturing abilities for the local geometry of the obstacle are superior to those by conventional methods, the trial and errors, due to the proper implementation and the CNPE algorithm. Several numerical experiments are performed to show the power of the proposed method. The fundamental ideas and methodologies described in this paper can be applied to many other shape reconstruction problems.