• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.2
• /
• pp.168-175
• /
• 1999

In this paper, a modified RBF(Radial Basis Function) network structure is suggested for the prediction of a time-series with non-linear, non-stationary characteristics. Coventional RBF network predicting time series by using past outputs sense the trajectory of the time series and react when there exists strong relation between input and hidden activation function's RBF center. But this response is highly sensitive to level and trend of time serieses. In order to overcome such dependencies, hidden activation functions are modified to react to the increments of input variable and multiplied by increment(or dectement) for prediction. When the suggested structure is applied to prediction of Macyey-Glass chaotic time series, Lorenz equation, and Rossler equation, improved performances are obtained.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.6 no.2
• /
• pp.26-35
• /
• 1996

In this paper, some fundamental problems concerning RBF(radial-basis-function) networks and approximation of functions are addressed. First, a comprehensive introduction to RBF networks is given with typical RBF networks classified into three classes. Next, sharp conditions are given under which continuous functions of a finite number of real variables can be approximated arbitrarily well by a certain class of RBF networks. Finally, a related result is given concerning the representation of functions in the form of distributed RBF networks.

• Korean Journal of Computational Design and Engineering
• /
• v.21 no.4
• /
• pp.443-452
• /
• 2016

This paper proposes a method for expensive black box optimization using radial basis functions (RBFs). The proposed algorithm is a computational strategy that uses a RBF model approximating the expensive black box function to predict an optimum. First, a RBF-based approximation technique is introduced and a sampling plan for estimation of the black box function is described. Then the proposed algorithm is explained, which presents the pseudo-codes for implementation and the detailed description of each step performed in the optimization process. In addition, numerical experiments will be given to analyze the performance of the proposed algorithm, by investigating computation accuracy, number of function evaluations, and convergence history. Finally, geometric distance problem as application example will be also presented for showing the algorithm applicability to different engineering problems.

• Structural Engineering and Mechanics
• /
• v.29 no.2
• /
• pp.117-134
• /
• 2008

A new adaptive dual reciprocity boundary element method for dynamic analysis of 3-D structures is presented in this paper. It is based on finding the best approximation function of a radial basis function (RBF) group $f=r^n+c$ which minimize the error of displacement field expansion. Also, the effects of some parameters such as the existence of internal points, number of RBF functions and position of collocation nodes in discontinuous elements are investigated in this adaptive procedure. Three numerical examples show improvement in dynamic response of structures with adaptive RBF in dual reciprocity with respect to ordinary BEM.

• Journal of KIISE:Software and Applications
• /
• v.31 no.5
• /
• pp.555-562
• /
• 2004

Software industry has put more emphasis on maintenance and enhancement work than on the new development. The existing effort estimation models can still be applied to maintenance projects, though modifications are needed. This paper suggests a way to estimate the size of a maintenance project from the regression analysis of ISBSG's benchmarking data. First of all, among the 3 elements(addition, modification and deletion of the program) which influences the software cost, we selected and classified 4 groups from a total of 8 which shows actual maintenance cost from ISBSG's data. Moreover, we developed statistical model and a model which uses RBF(Radial Basis Function) Network and after evaluating each functions we concluded that the RBF Network is superior to the statistical model.

• Steel and Composite Structures
• /
• v.47 no.5
• /
• pp.569-585
• /
• 2023

This paper proposes an efficient approach for the structural topology optimization of bi-directional functionally graded structures by incorporating popular radial basis functions (RBFs) into an implicit level set (ILS) method. Compared to traditional element density-based methods, a level set (LS) description of material boundaries produces a smoother boundary description of the design. The paper develops RBF implicit modeling with multiquadric (MQ) splines, thin-plate spline (TPS), exponential spline (ES), and Gaussians (GS) to define the ILS function with high accuracy and smoothness. The optimization problem is formulated by considering RBF-based nodal densities as design variables and minimizing the compliance objective function. A LS-RBF optimization method is proposed to transform a Hamilton-Jacobi partial differential equation (PDE) into a system of coupled non-linear ordinary differential equations (ODEs) over the entire design domain using a collocation formulation of the method of lines design variables. The paper presents detailed mathematical expressions for BiDFG beams topology optimization with two different material models: continuum functionally graded (CFG) and mechanical functionally graded (MFG). Several numerical examples are presented to verify the method's efficiency, reliability, and success in accuracy, convergence speed, and insensitivity to initial designs in the topology optimization of two-dimensional (2D) structures. Overall, the paper presents a novel and efficient approach to topology optimization that can handle bi-directional functionally graded structures with complex geometries.

• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.1183-1188
• /
• 2004

The inverse heat conduction problem (IHCP) is a problem of estimating boundary condition from temperature measurement at one or more interior points. Neural networks are general information processing systems inspired by the connectionist theory of human brain. By properly training the network by the learning rule, the neural network method can handle many non-linear or other complex problems. In this work, neural network is applied to complicated inverse heat conduction problems. Efficiency of the procedure is enhanced by incorporating the radial basis functions (RBF). The RBF is trained faster than other neural network and can find smooth solution. In order to demonstrate the effectiveness of the current scheme, a typical one-dimensional IHCP is considered. At one surface, the temperature as well as the heat flux is known. The unknown temperature of interest is estimated on the other side of the slab. The results from the proposed method based on RBF neural network are compared with the conventional method.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.30-33
• /
• 2002

To obtain good performance of radial basis function (RBF) neural networks, it needs very careful consideration in design. The selection of several parameters such as the number of centers and widths of the radial basis functions must be considered carefully since they critically affect the network's performance. We propose a learning algorithm for growing of complexity of RBF neural networks which is adapted automatically according to the complexity of tasks. The algorithm generates a new basis function based on the errors of network, the percentage of decreasing rate of errors and the nearest distance from input data to the center of hidden unit. The RBF's center is located at the point where the maximum of absolute interference error occurs in the input space. The width is calculated based on the standard deviation of distance between the center and inputs data. The steepest descent method is also applied for adjusting the weights, centers, and widths. To demonstrate the performance of the proposed algorithm, general problem of function estimation is evaluated. The results obtained from the simulation show that the proposed algorithm for RBF neural networks yields good performance in terms of convergence and accuracy compared with those obtained by conventional multilayer feedforward networks.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.6
• /
• pp.1223-1229
• /
• 2009

The performance of Radial Basis Function Neural Networks depends on setting up the Radial Basis Functions over the input space which are the important design procedure of Radial Basis Function Neural Networks. The existing method to initialize the location of the radial basis functions over the input space is to use the conditional fuzzy C-means clustering. However, the researchers which are interested in the conditional fuzzy C-means clustering cannot get as good modeling performance as they expect because the conditional fuzzy C-means clustering cannot project the information which is extracted over the output space into the input space. To compensate the above mentioned drawback of the conditional fuzzy C-means clustering, we apply a fuzzy K-nearest neighbors approach to project the auxiliary information defined over the output space into the input space without lose of the information.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.200-200
• /
• 2000

Highly nonlinear dynamical systems are easily identified using neural networks. When disturbances are included in the learning data set Int system modeling, modeling process will be poorly performed. Since the radial basis functions in the radial basis function network(RBFN) are centered at the points specified by the weights, RBF networks are robust for approximating the process including the narrow-band disturbances deviating significantly from the regular signals. To exclude(filter) these disturbances, a robust algorithm for system identification, based on the RBFN, is proposed. The performance of system identification excluding disturbances is investigated and compared with the one including disturbances.