Generalized neurofuzzy network modeling algorithms using Bezier-Bernstein polynomial functions and additive decomposition

This paper introduces a new neurofuzzy model construction algorithm for nonlinear dynamic systems based upon basis functions that are Bezier-Bernstein polynomial functions. This paper is generalized in that it copes with n-dimensional inputs by utilising an additive decomposition construction to overcome the curse of dimensionality associated with high n. This new construction algorithm also introduces univariate Bezier-Bernstein polynomial functions for the completeness of the generalized procedure. Like the B-spline expansion based neurofuzzy systems, Bezier-Bernstein polynomial function based neurofuzzy networks hold desirable properties such as nonnegativity of the basis functions, unity of support, and interpretability of basis function as fuzzy membership functions, moreover with the additional advantages of structural parsimony and Delaunay input space partition, essentially overcoming the curse of dimensionality associated with conventional fuzzy and RBF networks. This new modeling network is based on additive decomposition approach together with two separate basis function formation approaches for both univariate and bivariate Bezier-Bernstein polynomial functions used in model construction. The overall network weights are then learnt using conventional least squares methods. Numerical examples are included to demonstrate the effectiveness of this new data based modeling approach.

An introduction to radial basis functions for system identification: a comparison with other neural network methods

A look is taken at the use of radial basis functions (RBFs), for nonlinear system identification. RBFs are firstly considered in detail themselves and are subsequently compared with a multi-layered perceptron (MLP), in terms of performance and usage.

Belowground biomass functions and expansion factors in high elevation Norway spruce

Biomass allocation to above- and belowground compartments in trees is thought to be affected by growth conditions. To assess the strength of such influences, we sampled six Norway spruce forest stands growing at higher altitudes. Within these stands, we randomly selected a total of 77 Norway spruce trees and measured volume and biomass of stem, above- and belowground stump and all roots over 0.5 cm diameter. A comparison of our observations with models parameterised for lower altitudes shows that models developed for specific conditions may be applicable to other locations. Using our observations, we developed biomass functions (BF) and biomass conversion and expansion factors (BCEF) linking belowground biomass to stem parameters. While both BF and BCEF are accurate in belowground biomass predictions, using BCEF appears more promising as such factors can be readily used with existing forest inventory data to obtain estimates of belowground biomass stock. As an example, we show how BF and BCEF developed for individual trees can be used to estimate belowground biomass at the stand level. In combination with existing aboveground models, our observations can be used to quantify total standing biomass of high altitude Norway spruce stands.

Wiener System identification using B-spline functions with De Boor recursion

A simple and effective algorithm is introduced for the system identification of Wiener system based on the observational input/output data. The B-spline neural network is used to approximate the nonlinear static function in the Wiener system. We incorporate the Gauss-Newton algorithm with De Boor algorithm (both curve and the first order derivatives) for the parameter estimation of the Wiener model, together with the use of a parameter initialization scheme. The efficacy of the proposed approach is demonstrated using an illustrative example.

Asymptotic expansions for Taylor coefficients of the composition of two functions

We give an asymptotic expansion for the Taylor coe±cients of L(P(z)) where L(z) is analytic in the open unit disc whose Taylor coe±cients vary `smoothly' and P(z) is a probability generating function. We show how this result applies to a variety of problems, amongst them obtaining the asymptotics of Bernoulli transforms and weighted renewal sequences.