in this paper, the concept of canonical representation is proposed to find fuzzy roots of fuzzy polynomial equations. we transform fuzzy polynomial equations to system of crisp polynomial equations, this transformation is perform by using canonical representation based on three parameters value, ambiguity and fuzziness.

This paper presents an approach for developing formally verifiable conflict detection algorithms for aircraft flying arbitrary, nonlinear trajectories. The approach uses a multivariate polynomial global optimization algorithm based on Bernstein polynomials. Since any continuous function on a closed interval, such as an aircraft trajectory within a closed interval of time, can be uniformly appro...

Many problems of systems control theory boil down to solving polynomial equations, polynomial inequalities or polyomial differential equations. Recent advances in convex optimization and real algebraic geometry can be combined to generate approximate solutions in floating point arithmetic. In the first part of the course we describe semidefinite programming (SDP) as an extension of linear progr...

This paper presents the proportional-derivative fuzzy controller for trajectory tracking of gripping mechanism with two degrees freedom. Aiming to achieve movement without sudden starting and stopping, a polynomial velocity profile is utilized. The African vultures optimization, as one latest metaheuristic algorithms, used obtain optimal input/output scaling gains proposed according selected fi...

Excellent physical performance of soccer players is inevitable for the success of a team. Despite of this, a large-scale, quantitative analysis of the maximal speed of the players is missing due to the sensitive nature of trajectory datasets. We propose a novel method to derive the in-game speed profile of soccer players from event-based datasets, which are widely accessible. We show that eight...

let $d$ be a digraph with skew-adjacency matrix $s(d)$. then the skew energyof $d$ is defined to be the sum of the norms of all eigenvalues of $s(d)$. denote by$mathcal{o}_n$ the class of digraphs on order $n$ with no even cycles, and by$mathcal{o}_{n,m}$ the class of digraphs in $mathcal{o}_n$ with $m$ arcs.in this paper, we first give the minimal skew energy digraphs in$mathcal{o}_n$ and $mat...

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 a closing lemma for C1 nonsingular endomorphisms equivariant under free actions of finite-groups is proved. Hence a recurrent trajectory, as well as all of its symmetric conjugates, of a C1 nonsingular endomorphism equivariant under a free action of a finite group can be closed up simultaneously by an arbitrarily small C1 equivariant perturbation.