Hammerstein model identification algorithm using Bezier-Bernstein approximation

A new identification algorithm is introduced for the Hammerstein model consisting of a nonlinear static function followed by a linear dynamical model. The nonlinear static function is characterised by using the Bezier-Bernstein approximation. The identification method is based on a hybrid scheme including the applications of the inverse of de Casteljau's algorithm, the least squares algorithm and the Gauss-Newton algorithm subject to constraints. The related work and the extension of the proposed algorithm to multi-input multi-output systems are discussed. Numerical examples including systems with some hard nonlinearities are used to illustrate the efficacy of the proposed approach through comparisons with other approaches.

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.

Finding the point on Bezier Curves with the normal vector passing an external point

Two algorithms for finding the point on non-rational/rational Bezier curves of which the normal vector passes through a given external point are presented. The algorithms are based on Bezier curves generation algorithms of de Casteljau's algorithm for non-rational Bezier curve or Farin's recursion for rational Bezier curve, respectively. Orthogonal projections from the external point are used to guide the directional search used in the proposed iterative algorithms. Using Lyapunov's method, it is shown that each algorithm is able to converge to a local minimum for each case of non-rational/rational Bezier curves. It is also shown that on convergence the distance between the point on curves to the external point reaches a local minimum for both approaches. Illustrative examples are included to demonstrate the effectiveness of the proposed approaches.

Neurofuzzy network model construction using Bézier-Bernstein polynomial functions

Neurofuzzy modelling systems combine fuzzy logic with quantitative artificial neural networks via a concept of fuzzification by using a fuzzy membership function usually based on B-splines and algebraic operators for inference, etc. The paper introduces a neurofuzzy model construction algorithm using Bezier-Bernstein polynomial functions as basis functions. The new network maintains most of the properties of the B-spline expansion based neurofuzzy system, such as the non-negativity of the basis functions, and unity of support but with the additional advantages of structural parsimony and Delaunay input space partitioning, avoiding the inherent computational problems of lattice networks. This new modelling network is based on the idea that an input vector can be mapped into barycentric co-ordinates with respect to a set of predetermined knots as vertices of a polygon (a set of tiled Delaunay triangles) over the input space. The network is expressed as the Bezier-Bernstein polynomial function of barycentric co-ordinates of the input vector. An inverse de Casteljau procedure using backpropagation is developed to obtain the input vector's barycentric co-ordinates that form the basis functions. Extension of the Bezier-Bernstein neurofuzzy algorithm to n-dimensional inputs is discussed followed by numerical examples to demonstrate the effectiveness of this new data based modelling approach.

Study of the lactation curve in dairy cattle on farms in Central Mexico

Accurate knowledge of lactation curves has an important relevance to management and research of dairy production systems. A number of equations have been proposed to describe the lactation curve, the most widely applied being the gamma equation. The objective of this work was to compare and evaluate candidate functions for their predictive ability in describing lactation curves from central Mexican dairy cows reared under 2 contrasting management systems. Five equations were considered: Gaines ( exponential decay), Wood ( gamma equation), Rook ( Michaelis-Menten x exponential), and 2 more mechanistic ones (Dijkstra and Pollott). A database consisting of 701 and 1283 records of cows in small-scale and intensive systems, respectively, was used in the analysis. Before analysis, the database was divided into 6 groups representing first, second, and third and higher parity cows in both systems. In all cases except second and above parity cows in small-scale systems, all models improved on the Gaines equation. The Wood equation explained much of the variation, but its parameters do not have direct biological interpretation. Although the Rook equation fitted the data well, some of the parameter estimates were not significant. The Dijkstra equation consistently gave better predictions, and its parameters were usually statistically significant and lend themselves to physiological interpretation. As such, the differences between systems and parity could be explained due to variations in theoretical initial milk production at parturition, specific rates of secretory cell proliferation and death, and rate of decay, all of which are parameters in the model. The Pollott equation, although containing the most biology, was found to be over-parameterized and resulted in nonsignificant parameter estimates. For central Mexican dairy cows, the Dijkstra equation was the best option to use in describing the lactation curve.

Switching curve control of functional electrical stimulation assisted rowing exercise in paraplegia

An indoor rowing machine has been modified for functional electrical stimulation (FES) assisted rowing exercise in paraplegia. To perform the rowing manoeuvre successfully, however, the voluntarily controlled upper body movements must be co-ordinated with the movements of the electrically stimulated paralysed legs. To achieve such co-ordination, an automatic FES controller was developed that employs two levels of hierarchy. At the upper level, a finite state controller identifies the state or phase of the rowing cycle and activates the appropriate lower-level controller, in which electrical stimulation to the paralysed leg muscles is applied with reference to switching curves representing the desired seat velocity as a function of the seat position. In a pilot study, the hierarchical control of FES rowing was shown to be intuitive, reliable and easy to use. Compared with open-loop control of stimulation, all three variants of the closed-loop switching curve controllers used less muscle stimulation per rowing cycle (73% of the open-loop control on average). Further, the closed-loop controller that used switching curves derived from normal rowing kinematics used the lowest muscle stimulation (65% of the open-loop control) and was the most convenient to use for the client.

The small open-economy New Keynesian Phillips Curve: empirical evidence and implied inflation dynamics

In this paper we apply GMM estimation to assess the relevance of domestic versus external determinants of CPI inflation dynamics in a sample of OECD countries typically classified as open economies. The analysis is based on a variant of the small open-economy New Keynesian Phillips Curve derived in Galí and Monacelli (Rev Econ Stud 72:707–734, 2005), where the novel feature is that expectations about fluctuations in the terms of trade enter explicitly. For most countries in our sample the expected relative change in the terms of trade emerges as the more relevant inflation driver than the contemporaneous domestic output gap.

Can carbon surface oxidation shift the pore size distribution curve calculated from Ar, N(2) and CO(2) adsorption isotherms? Simulation results for a realistic carbon model

Using the virtual porous carbon model proposed by Harris et al, we study the effect of carbon surface oxidation on the pore size distribution (PSD) curve determined from simulated Ar, N(2) and CO(2) isotherms. It is assumed that surface oxidation is not destructive for the carbon skeleton, and that all pores are accessible for studied molecules (i.e., only the effect of the change of surface chemical composition is studied). The results obtained show two important things, i.e., oxidation of the carbon surface very slightly changes the absolute porosity (calculated from the geometric method of Bhattacharya and Gubbins (BG)); however, PSD curves calculated from simulated isotherms are to a greater or lesser extent affected by the presence of surface oxides. The most reliable results are obtained from Ar adsorption data. Not only is adsorption of this adsorbate practically independent from the presence of surface oxides, but, more importantly, for this molecule one can apply the slit-like model of pores as the first approach to recover the average pore diameter of a real carbon structure. For nitrogen, the effect of carbon surface chemical composition is observed due to the quadrupole moment of this molecule, and this effect shifts the PSD curves compared to Ar. The largest differences are seen for CO2, and it is clearly demonstrated that the PSD curves obtained from adsorption isotherms of this molecule contain artificial peaks and the average pore diameter is strongly influenced by the presence of electrostatic adsorbate-adsorbate as well as adsorbate-adsorbent interactions.

Simple solution for a complex problem: Proanthocyanidins, galloyl glucoses and ellagitannins fit on a single calibration curve in high performance-gel permeation chromatography

This study was undertaken to explore gel permeation chromatography (GPC) for estimating molecular weights of proanthocyanidin fractions isolated from sainfoin (Onobrychis viciifolia). The results were compared with data obtained by thiolytic degradation of the same fractions. Polystyrene, polyethylene glycol and polymethyl methacrylate standards were not suitable for estimating the molecular weights of underivatized proanthocyanidins. Therefore, a novel HPLC-GPC method was developed based on two serially connected PolarGel-L columns using DMF that contained 5% water, 1% acetic acid and 0.15 M LiBr at 0.7 ml/min and 50 degrees C. This yielded a single calibration curve for galloyl glucoses (trigalloyl glucose, pentagalloyl glucose), ellagitannins (pedunculagin, vescalagin, punicalagin, oenothein B, gemin A), proanthocyanidins (procyanidin B2, cinnamtannin B1), and several other polyphenols (catechin, epicatechin gallate, epicallocatechin gallate, amentoflavone). These GPC predicted molecular weights represented a considerable advance over previously reported HPLC-GPC methods for underivatized proanthocyanidins. (C) 2011 Elsevier B.V. All rights reserved.

Curve crossing for the reflected Levy process at zero and infinity

Let $R_{t}=\sup_{0\leq s\leq t}X_{s}-X_{t}$ be a Levy process reflected in its maximum. We give necessary and sufficient conditions for finiteness of passage times above power law boundaries at infinity. Information as to when the expected passage time for $R_{t}$ is finite, is given. We also discuss the almost sure finiteness of $\limsup_{t\to 0}R_{t}/t^{\kappa}$, for each $\kappa\geq 0$.