• Title/Summary/Keyword: Kernel Approximation

Search Result 57, Processing Time 0.022 seconds

The Design of Polynomial RBF Neural Network by Means of Fuzzy Inference System and Its Optimization (퍼지추론 기반 다항식 RBF 뉴럴 네트워크의 설계 및 최적화)

  • Baek, Jin-Yeol;Park, Byaung-Jun;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.2
    • /
    • pp.399-406
    • /
    • 2009
  • In this study, Polynomial Radial Basis Function Neural Network(pRBFNN) based on Fuzzy Inference System is designed and its parameters such as learning rate, momentum coefficient, and distributed weight (width of RBF) are optimized by means of Particle Swarm Optimization. The proposed model can be expressed as three functional module that consists of condition part, conclusion part, and inference part in the viewpoint of fuzzy rule formed in 'If-then'. In the condition part of pRBFNN as a fuzzy rule, input space is partitioned by defining kernel functions (RBFs). Here, the structure of kernel functions, namely, RBF is generated from HCM clustering algorithm. We use Gaussian type and Inverse multiquadratic type as a RBF. Besides these types of RBF, Conic RBF is also proposed and used as a kernel function. Also, in order to reflect the characteristic of dataset when partitioning input space, we consider the width of RBF defined by standard deviation of dataset. In the conclusion part, the connection weights of pRBFNN are represented as a polynomial which is the extended structure of the general RBF neural network with constant as a connection weights. Finally, the output of model is decided by the fuzzy inference of the inference part of pRBFNN. In order to evaluate the proposed model, nonlinear function with 2 inputs, waster water dataset and gas furnace time series dataset are used and the results of pRBFNN are compared with some previous models. Approximation as well as generalization abilities are discussed with these results.

Novel Peak-to-Average Power Ratio Reduction Methods for OFDM/OQAM Systems

  • Sandeep, Vangala;Anuradha, Sundru
    • ETRI Journal
    • /
    • v.38 no.6
    • /
    • pp.1124-1134
    • /
    • 2016
  • The tone reservation method is one of the most effective pre-distortion methods for peak-to-average power ratio reduction in orthogonal frequency division multiplexing (OFDM) systems. Its direct application to OFDM systems with offset quadrature amplitude modulation (OQAM) is, however, not effective. In this paper, two novel TR-based methods are proposed, specifically designed for OFDM/OQAM systems by taking into consideration the overlapping nature of OQAM signals. These two methods have different approaches to the generation of the peak-cancelling signal. The first one (overlapped scaling tone reservation) generates the peak-cancelling signal using a least squares approximation algorithm with possible adjacent symbol overlap; the second one (multi-kernel tone reservation) generates the peak-cancelling signal by using multiple impulse-like time domain kernels. It is shown by simulation that, when used in OFDM/OQAM systems, the proposed methods can provide better performance than the direct application of the existing controlled clipping tone reservation method, and even outperform the multi-block tone reservation method.

An efficient Galerkin meshfree analysis of shear deformable cylindrical panels

  • Wang, Dongdong;Wu, Youcai
    • Interaction and multiscale mechanics
    • /
    • v.1 no.3
    • /
    • pp.339-355
    • /
    • 2008
  • A Galerkin meshfree method is presented for analyzing shear deformable cylindrical panels. Based upon the analogy between the cylindrical panel and the curved beam a pure bending mode for cylindrical panel is rationally constructed. The meshfree approximation employed herein is characterized by an enhanced moving least square or reproducing kernel basis function that can exactly represent the pure bending mode and thus meets the requirement of Kirchhoff mode reproducing condition. The variational form is discretized using the efficient stabilized conforming nodal integration with a smoothed nodal gradient based curvature. The resulting meshfree formulation satisfies the integration constraint for bending exactness. Moreover, it is shown here that the smoothed gradient preserves several desired properties which are valid for the standard gradient obtained by direct differentiation, such as partition of nullity and reproduction of a constant strain field. The efficacy of the proposed approach is demonstrated by two benchmark cylindrical panel examples.

Numerical Analysis on the Wave Resistance by the Theory of Slender Ships (세장선 이론에 의한 조파저항의 수치 해석)

  • Kim, In Chull
    • Journal of the Korean Society of Fisheries and Ocean Technology
    • /
    • v.23 no.3
    • /
    • pp.1-1
    • /
    • 1987
  • The accurate prediction of the ship wave resistance is very important to design ships which operate satisfactorily in a wave environment. Thus, work should continue on development and validation of methods to compute ship wave patterns and wave resistance. Research efforts to improve the prediction of ship waves and wavemaking resistance are categorized in two major areas. First is the development of higher-order theories to take account of the nonlinear effect of the free surface condition and improved analytical treatment of the body boundary condition. Second is the development of direct numerical methods aimed at solving body and free-surface boundary conditions as accurately as possible. A new formulation of the slender body theory for a ship with constant speed is developed by Maruo. It is quite different from the existing slender ship theory by Vossers, Maruo and Tuck. It may be regarded as a substitute for the Neumann-Kelvin approximation. In present work, the method of asymptotic expansion of the Kelvin source is applied to obtain a new wave resistance formulation in fluid of finite depth. It takes a simple form than existing theory.

A Classification Method of Delirium Patients Using Local Covering-Based Rule Acquisition Approach with Rough Lower Approximation (러프 하한 근사를 갖는 로컬 커버링 기반 규칙 획득 기법을 이용한 섬망 환자의 분류 방법)

  • Son, Chang Sik;Kang, Won Seok;Lee, Jong Ha;Moon, Kyoung Ja
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.9 no.4
    • /
    • pp.137-144
    • /
    • 2020
  • Delirium is among the most common mental disorders encountered in patients with a temporary cognitive impairment such as consciousness disorder, attention disorder, and poor speech, particularly among those who are older. Delirium is distressing for patients and families, can interfere with the management of symptoms such as pain, and is associated with increased elderly mortality. The purpose of this paper is to generate useful clinical knowledge that can be used to distinguish the outcomes of patients with delirium in long-term care facilities. For this purpose, we extracted the clinical classification knowledge associated with delirium using a local covering rule acquisition approach with the rough lower approximation region. The clinical applicability of the proposed method was verified using data collected from a prospective cohort study. From the results of this study, we found six useful clinical pieces of evidence that the duration of delirium could more than 12 days. Also, we confirmed eight factors such as BMI, Charlson Comorbidity Index, hospitalization path, nutrition deficiency, infection, sleep disturbance, bed scores, and diaper use are important in distinguishing the outcomes of delirium patients. The classification performance of the proposed method was verified by comparison with three benchmarking models, ANN, SVM with RBF kernel, and Random Forest, using a statistical five-fold cross-validation method. The proposed method showed an improved average performance of 0.6% and 2.7% in both accuracy and AUC criteria when compared with the SVM model with the highest classification performance of the three models respectively.

Density Estimation Technique for Effective Representation of Light In-scattering (빛의 내부산란의 효과적인 표현을 위한 밀도 추정기법)

  • Min, Seung-Ki;Ihm, In-Sung
    • Journal of the Korea Computer Graphics Society
    • /
    • v.16 no.1
    • /
    • pp.9-20
    • /
    • 2010
  • In order to visualize participating media in 3D space, they usually calculate the incoming radiance by subdividing the ray path into small subintervals, and accumulating their respective light energy due to direct illumination, scattering, absorption, and emission. Among these light phenomena, scattering behaves in very complicated manner in 3D space, often requiring a great deal of simulation efforts. To effectively simulate the light scattering effect, several approximation techniques have been proposed. Volume photon mapping takes a simple approach where the light scattering phenomenon is represented in volume photon map through a stochastic simulation, and the stored information is explored in the rendering stage. While effective, this method has a problem that the number of necessary photons increases very fast when a higher variance reduction is needed. In an attempt to resolve such problem, we propose a different approach for rendering particle-based volume data where kernel smoothing, one of several density estimation methods, is explored to represent and reconstruct the light in-scattering effect. The effectiveness of the presented technique is demonstrated with several examples of volume data.

Optimal Non-Uniform Resampling Algorithm (최적 비정규 리샘플링 알고리즘)

  • Sin, Geon-Sik;Lee, Hak-Mu;Gang, Mun-Gi
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.2
    • /
    • pp.50-55
    • /
    • 2002
  • The standard approach of image resampling is to fit the original image with continuous model and resample the function at a desired rate. We used the B-spline function as the continuous model because it oscillates less than the others. The main purpose of this paper is the derivation of a nonuniform optimal resampling algorithm. To derive it, needing approximation can be computed in three steps: 1) determining the I-spline coefficients by matrix inverse process, 2) obtaining the transformed-spline coefficients by the optimal resampling algorithm derived from the orthogonal projection theorem, 3) converting of the result back into the signal domain by indirect B-spline transformation. With these methods, we can use B-spline in the non-uniform resampling, which is proved to be a good kernel in uniform resampling, and can also verify the applicability from our experiments.