• Journal of the Korean Data and Information Science Society
• /
• v.28 no.6
• /
• pp.1271-1278
• /
• 2017

Although the $L_0$-penalty is the most natural choice to identify the sparsity structure of the model, it has not been widely used due to the computational bottleneck. Recently, the adaptive ridge procedure is developed to efficiently approximate a $L_q$-penalized problem to an iterative $L_2$-penalized one. In this article, we proposed to apply the adaptive ridge procedure to solve the $L_0$-penalized weighted support vector machine (WSVM) to facilitate the corresponding optimization. Our numerical investigation shows the advantageous performance of the $L_0$-penalized WSVM compared to the conventional WSVM with $L_2$ penalty for both simulated and real data sets.

• ETRI Journal
• /
• v.4 no.3
• /
• pp.18-29
• /
• 1982

In a block adaptive filtering procedure, the filter coefficients are adjusted once per each output block while maintaining performance comparable to that of widely used LMS adaptive filtering in which the filter coefficients are adjusted once per each output data sample. An efficient implementation of block adaptive filter is possible by means of discrete transform technique which has cyclic convolution property and fast algorithms. In this paper, the block adaptive filtering using Fermat Number Transform (FNT) is investigated to exploit the computational efficiency and less quantization effect on the performance compared with finite precision FFT realization. And this has been verified by computer simulation for several applications including adaptive channel equalizer and system identification.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.928-938
• /
• 2008

This study presents an approach for approximation an unknown function from a numerical data set based on the synthesis of a neuro-fuzzy model. An adaptive input data space parting method, which is used for building hyperbox-shaped clusters in the input data space, is proposed. Each data cluster is implemented here as a fuzzy set using a membership function MF with a hyperbox core that is constructed from a min vertex and a max vertex. The focus of interest in proposed approach is to increase degree of fit between characteristics of the given numerical data set and the established fuzzy sets used to approximate it. A new cutting procedure, named NCP, is proposed. The NCP is an adaptive cutting procedure using a pure function $\Psi$ and a penalty function $\tau$ for direction the input data space parting process. New algorithms named CSHL, HLM1 and HLM2 are presented. The first new algorithm, CSHL, built based on the cutting procedure NCP, is used to create hyperbox-shaped data clusters. The second and the third algorithm are used to establish adaptive neuro- fuzzy inference systems. A series of numerical experiments are performed to assess the efficiency of the proposed approach.

• Journal of Intelligence and Information Systems
• /
• v.17 no.2
• /
• pp.1-22
• /
• 2011

In this paper, we propose an adaptive genetic algorithm (aGA) approach for effectively solving the sequencing problem with precedence constraints (SPPC). For effective representation of the SPPC in the aGA approach, a new representation procedure, called the topological sort-based representation procedure, is used. The proposed aGA approach has an adaptive scheme using a fuzzy logic controller and adaptively regulates the rate of the crossover operator during the genetic search process. Experimental results using various types of the SPPC show that the proposed aGA approach outperforms conventional competing approaches. Finally the proposed aGA approach can be a good alternative for locating optimal solutions or sequences for various types of the SPPC.

• Earthquakes and Structures
• /
• v.14 no.5
• /
• pp.477-492
• /
• 2018

Recently, the adaptive nonlinear static analysis method has been widely used in the field of performance based earthquake engineering. However, the proposed methods are almost deterministic and cannot directly consider the seismic record uncertainties. In the current study an innovative Stochastic Adaptive Pushover Analysis, called "SAPA", based on equivalent hysteresis system responses is developed to consider the earthquake record to record uncertainties. The methodology offers a direct stochastic analysis which estimates the seismic demands of the structure in a probabilistic manner. In this procedure by using a stochastic linearization technique in each step, the equivalent hysteresis system is analyzed and the probabilistic characteristics of the result are obtained by which the lateral force pattern is extracted and the actual structure is pushed. To compare the results, three different types of analysis have been considered; conventional pushover methods, incremental dynamic analysis, IDA, and the SAPA method. The result shows an admirable accuracy in predicting the structure responses.

• 한국전산유체공학회:학술대회논문집
• /
• 2011.05a
• /
• pp.261-265
• /
• 2011

An adaptive wavelet transformation method with high order accuracy is proposed to allow efficient and accurate flow computations. While maintaining the original numerical accuracy of a conventional solver, the scheme offers efficient numerical procedure by using only adapted dataset. The main algorithm includes 3rd order wavelet decomposition and thresholding procedure. After the wavelet transformation, 3rd order of spatial and temporal accurate high order interpolation schemes are executed only at the points of the adapted dataset. For the other points, high order of interpolation method is utilized for residual evaluation. This high order interpolation scheme with high order adaptive wavelet transformation was applied to unsteady Euler flow computations. Through these processes, both computational efficiency and numerical accuracy are validated even in case of high order accurate unsteady flow computations.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1990.10a
• /
• pp.9-15
• /
• 1990

In this study, an adaptive mesh h-refinement procedure was presented in plate bending problems. By introducing the transition elements for the procedure, same drawbacks due to the irregular nodes are eliminated which are generated in the consequence of local mesh refinement in common adaptive h-version performed by single type of quadrilateral elements. For the above objective, compatible 5-node through 7-node transition plate bending elements are developed by including variable number of midside nodes. Using the Zienkiewicn-Zhu error estimator, some numerical examples are presented to show the effectiveness of the adaptive h-refinement using the transition elements.

• Structural Engineering and Mechanics
• /
• v.10 no.6
• /
• pp.635-650
• /
• 2000

In this paper, the adaptive nodal generation procedure based on the estimated local and global error in the element-free Galerkin (EFG) method is proposed. To investigate the possibility of h-type adaptivity of EFG method, a simple nodal refinement scheme is used. By adding new node along the background cell that is used in numerical integration, both of the local and global errors can be controlled adaptively. These errors are estimated by calculating the difference between the values of the projected stresses and original EFG stresses. The ultimate goal of this study is to develop the reliable nodal generator based on the local and global errors that is estimated posteriori. To evaluate the performance of proposed adaptive procedure, the convergence behavior is investigated for several examples.

• Journal of the Korean Statistical Society
• /
• v.13 no.1
• /
• pp.32-41
• /
• 1984

An adaptive distribution-free test is proposed for testing the equality of k independent distributions against unrestricted alternatives. In this paper, several rank-sum test statistics are considered as teh components of the adaptive one. The emprical powers of the adaptive testing procedure are compared to those of the classical F test and the component tests through a Monte Carlo study. The results show that the adaptive test has good power properties over a wide class of underlying distributions.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2555-2557
• /
• 2001

The adaptive IIR filters is more effective than adaptive FIR filters which have the same order of IIR filters. But the IIR filters may have stability problems especially when the adaptive algorithm is not converged. In this paper, a stabilizing procedure for adaptive IIR filters is proposed, and computer simulation is performed to show the effectiveness of proposed schemes.