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.

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.

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.

A family of Schroeder-Bernstein type theorems for Banach spaces

Motivated by a characterization of the complemented subspaces in Banach spaces X isomorphic to their squares X-2, we introduce the concept of P-complemented subspaces in Banach spaces. In this way, the well-known Pelczynski`s decomposition method can be seen as a Schroeder-Bernstein type theorem. Then, we give a complete description of the Schroeder-Bernstein type theorems for this new notion of complementability. By contrast, some very elementary questions on P-complementability are refinements of the Square-Cube Problem closely connected with some Banach spaces introduced by W.T. Gowers and B. Maurey in 1997. (C) 2007 Elsevier Inc. All rights reserved.

Some Schroeder-Bernstein type theorems for Banach spaces

We first introduce the notion of (p, q, r)-complemented subspaces in Banach spaces, where p, q, r is an element of N. Then, given a couple of triples {(p, q, r), (s, t, u)} in N and putting Lambda = (q + r - p)(t + u - s) - ru, we prove partially the following conjecture: For every pair of Banach spaces X and Y such that X is (p, q, r)-complemented in Y and Y is (s, t, u)-complemented in X, we have that X is isomorphic Y if and only if one of the following conditions holds: (a) Lambda not equal 0, Lambda divides p - q and s - t, p = 1 or q = 1 or s = 1 or t = 1. (b) p = q = s = t = 1 and gcd(r, u) = 1. The case {(2, 1, 1), (2, 1,1)} is the well-known Pelczynski`s decomposition method. Our result leads naturally to some generalizations of the Schroeder-B em stein problem for Banach spaces solved by W.T. Gowers in 1996. (C) 2007 Elsevier Inc. All rights reserved.

Cantor-Bernstein Sextuples for Banach Spaces

Let X and Y be Banach spaces isomorphic to complemented subspaces of each other with supplements A and B. In 1996, W. T. Gowers solved the Schroeder-Bernstein (or Cantor-Bernstein) problem for Banach spaces by showing that X is not necessarily isomorphic to Y. In this paper, we obtain a necessary and sufficient condition on the sextuples (p, q, r, s, u, v) in N with p + q >= 1, r + s >= 1 and u, v is an element of N*, to provide that X is isomorphic to Y, whenever these spaces satisfy the following decomposition scheme A(u) similar to X(P) circle plus Y(q) B(v) similar to X(r) circle plus Y(s). Namely, Phi = (p - u)(s - v) - (q + u)(r + v) is different from zero and Phi divides p + q and r + s. These sextuples are called Cantor-Bernstein sextuples for Banach spaces. The simplest case (1, 0, 0, 1, 1, 1) indicates the well-known Pelczynski`s decomposition method in Banach space. On the other hand, by interchanging some Banach spaces in the above decomposition scheme, refinements of the Schroeder-Bernstein problem become evident.

Validation of the 2000 Bernstein-Parsonnet and EuroSCORE at the Heart Institute - USP

Objective: To validate the 2000 Bernstein Parsonnet (2000BP) and additive EuroSCORE (ES) to predict mortality in patients who underwent coronary bypass surgery and/or heart valve surgery at the Heart Institute, University of Sao Paulo (InCor/HC-FMUSP). Methods:A prospective observational design. We analyzed 3000 consecutive patients who underwent coronary bypass surgery and/or heart valve surgery, between May 2007 and July 2009 at the InCor/HC-FMUSP. Mortality was calculated with the 2000BP and ES models. The correlation between estimated mortality and observed mortality was validated by calibration and discrimination tests. Results: There were significant differences in the prevalence of risk factors between the study population, 2000BP and ES. Patients were stratified into five groups for 2000BP and three for the ES. In the validation of models, the ES showed good calibration (P = 0396), however, the 2000BP (P = 0.047) proved inadequate. In discrimination, the area under the ROC curve proved to be good for models, ES (0.79) and 2000BP (0.80). Conclusion: In the validation, 2000BP proved questionable and ES appropriate to predict mortality in patients who underwent coronary bypass surgery and/or heart valve surgery at the InCor/HC-FMUSP.

Polinomi di Bernstein e curve di Bezier

Questo lavoro si pone come obiettivo l'approfondimento della natura e delle proprietà dei polinomi espressi mediante la base di Bernstein. Introdotti originariamente all'inizio del '900 per risolvere il problema di approssimare una funzione continua su un intervallo chiuso e limitato della retta reale (Teorema di Stone-Weierstrass), essi hanno riscosso grande successo solo a partire dagli anni '60 quando furono applicati alla computer-grafica per costruire le cosiddette curve di Bezier. Queste, ereditando le loro proprietà geometriche da quelle analitiche dei polinomi di Bernstein, risultano intuitive e facilmente modellabili da un software interattivo e sono alla base di tutti i più moderni disegni curvilinei: dal design industriale, ai sistemi CAD, dallo standard SVG alla rappresentazione di font di caratteri.

La base di Bernstein in spazi polinomiali generalizzati

Nella tesi si illustra il passaggio dagli spazi polinomiali agli spazi polinomiali generalizzati, gli spazi di Chebyshev estesi (spazi EC), e viene dato un metodo per costruirli a partire da opportuni sistemi di funzioni dette funzioni peso. Successivamente si tratta il problema dell'esistenza di un analogo della base di Bernstein negli spazi EC: si presenta, in analogia ad una particolare costruzione nel caso polinomiale, una dimostrazione costruttiva dell'esistenza di tale base. Infine viene studiato il problema delle lunghezze critiche di uno spazio EC: si tratta di determinare l'ampiezza dell'intervallo oltre la quale lo spazio considerato perde le proprietà di uno spazio EC, o non possiede più una base di Bernstein generalizzata; l'approccio adottato è di tipo sperimentale: nella tesi sono presentati i risultati ottenuti attraverso algoritmi di ricerca che analizzano le proprietà delle funzioni di transizione e ne traggono informazioni sullo spazio di studio.

La base di Bernstein in spazi polinomiali generalizzati a tratti

Le funzioni polinomiali possono essere utilizzate per approssimare le funzioni continue. Il vantaggio è che i polinomi, le loro derivate e primitive, possono essere rappresentati in maniera semplice attraverso i loro coefficienti ed esistono algoritmi stabili e veloci per valutarli. Inoltre gli spazi polinomiali godono di numerose proprietà importanti. In questo lavoro ci occuperemo di altri spazi funzionali, noti in letteratura come spazi di Chebyshev o polinomi generalizzati, per ragioni di riproducibilità. Infatti ciò che si ottiene attraverso i polinomi è soltanto una approssimazione che spesso risulta essere insufficiente. E' importante, quindi, considerare degli spazi in cui sia possibile avere una rappresentazione esatta di curve. Lo studio di questi spazi è possibile grazie alla potenza di elaborazione degli attuali calcolatori e al buon condizionamento di opportune basi di rappresentazione di questi spazi. Negli spazi polinomiali è la base di Bernstein a garantire quanto detto. Negli spazi di Chebyshev si definisce una nuova base equivalente. In questo lavoro andremo oltre gli spazi di Chebyshev ed approfondiremo gli spazi di Chebyshev a tratti, ovvero gli spazi formati dall'unione di più spazi del tipo precedente. Si dimostrerà inoltre l'esistenza di una base a tratti con le stesse proprietà della base di Bernstein per gli spazi polinomiali.

The Jewish Bogey by Lucien Wolf, London - The History of a Lie, study by Herman Bernstein, New York [Rezension]

Paul Nathan

Podkamin: Replik des Vorsteher gegen I. Bernstein

Ch. L. Apfelbaum

Titelblatt einer französischen Übersetzung der Sprüche Salomonis aus der Mitte des 17. Jahrhunderts [Illustration] : aus der Bibliothek des Herrn Ignaz Bernstein in Warschau

Scan von Monochrom-Mikroform