نتایج جستجو برای: polynomial profiles
تعداد نتایج: 250106 فیلتر نتایج به سال:
A Simple Algorithm for Large-Scale Mapping of Evergreen Forests in Tropical America, Africa and Asia
The areal extent and spatial distribution of evergreen forests in the tropical zones are important for the study of climate, carbon cycle and biodiversity. However, frequent cloud cover in the tropical regions makes mapping evergreen forests a challenging task. In this study we developed a simple and novel mapping algorithm that is based on the temporal profile analysis of Land Surface Water In...
design of crystal-like lattices can be achieved by using some net operations. hypothetical networks, thus obtained, can be characterized in their topology by various counting polynomials and topological indices derived from them. the networks herein presented are related to the dyck graph and described in terms of omega polynomial and piv polynomials.
for every $1leq s< n$, the $s^{th}$ derivative of a polynomial $p(z)$ of degree $n$ is a polynomial $p^{(s)}(z)$ whose degree is $(n-s)$. this paper presents a result which gives generalizations of some inequalities regarding the $s^{th}$ derivative of a polynomial having zeros outside a circle. besides, our result gives interesting refinements of some well-known results.
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.
Acceleration profile generation for jerk limitation is a major issue in automated industrial applications like computer numerical control (CNC) machinery and robotics. The automation machinery dynamics should be kept as smooth as possible with suitable controllers where trajectory precision ensures quality while smoothness decreases machinery stress. During the operation of commercially availab...
Action-Graph Games (AGGs) are a fully expressive game representation which can compactly express strict and context-specific independence and anonymity structure in players’ utility functions. We present an efficient algorithm for computing expected payoffs under mixed strategy profiles. This algorithm runs in time polynomial in the size of the AGG representation (which is itself polynomial in ...
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...
Action-Graph Games (AGGs) (Bhat & Leyton-Brown 2004) are a fully expressive game representation which can compactly express strict and context-specific independence and anonymity structure in players’ utility functions. We present an efficient algorithm for computing expected payoffs under mixed strategy profiles. This algorithm runs in time polynomial in the size of the AGG representation (whi...
Implementations of the heat balance integral method are discussed in which exponential functions are used in place of the familiar polynomial approximants. The rationale is based upon that of least-squares in that the use of ‘appropriate’ basis functions can enhance solution accuracy. Whilst this is true in principle it is shown that considerable skill must be exercised when deviating from poly...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید