A large class of nonlinear systems can be well approximated by Takagi-Sugeno (TS) fuzzy models, with linear or affine consequents. However, in practical applications, the process under consideration may be affected by unknown inputs, such as disturbances, faults or unmodeled dynamics. In this paper, we consider the problem of simultaneously estimating the state and unknown inputs in TS systems....

In this paper we present Minimal Polynomial Logic (MPL), a generalisation of classical propositional logic which allows truth values in the continuous interval 0; 1] and in which propositions are represented by multi-variate polynomials with integer coeecients. The truth values in MPL are suited to represent the probability of an assertion being true, as in Nilsson's Probabilistic Logic, but ca...

In this paper we establish several polynomials similar to Bernstein's polynomials and several refinements of  Hermite-Hadamard inequality for convex functions.

let g = (v, e) be a simple graph. hosoya polynomial of g isd(u,v)h(g, x) = {u,v}v(g)x , where, d(u ,v) denotes the distance between vertices uand v. as is the case with other graph polynomials, such as chromatic, independence anddomination polynomial, it is natural to study the roots of hosoya polynomial of a graph. inthis paper we study the roots of hosoya polynomials of some specific graphs.

in this paper, we give some determinantal and permanental representations of generalized lucas polynomials, which are a general form of generalized bivariate lucas p-polynomials, ordinary lucas and perrin sequences etc., by using various hessenberg matrices. in addition, we show that determinant and permanent of these hessenberg matrices can be obtained by using combinations. then we show, the ...

The edge detour index polynomials were recently introduced for computing the edge detour indices. In this paper we find relations among edge detour polynomials for the 2-dimensional graph of $TUC_4C_8(S)$ in a Euclidean plane and $TUC4C8(S)$ nanotorus.

In this work we study numbers and polynomials generated by two type of composition of generating functions and get their explicit formulae. Furthermore we state an improvementof the composita formulae's given in [6] and [3], using the new composita formula's we construct a variety of combinatorics identities. This study go alone to dene new family of generalized Bernoulli polynomials which incl...

The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...