نتایج جستجو برای: polynomial model
تعداد نتایج: 2184434 فیلتر نتایج به سال:
In this paper a data simulation system, based on the cos(x) and sin(x)/x functions, called CSINC Polynomial Higher Order Neural Network (CSINCPHONN) has been developed. The CSINCPHONN model provides one more opportunity to find the optimal neural network model for simulation and prediction. This paper also proves that CSINCPHONN models can converge when simulating XOR data. This study also test...
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...
this paper was aimed to address the modeling of effective thermal conductivity and viscosity of carbon structured nanofluids. response surface methodology, d_optimal design (dod) was employed to assess the main and interactive effects of temperature (t) and weight percentage (wt %) to model effective thermal conductivity and viscosity of multi wall and single wall carbon nanotube, cvd and rgo g...
we consider the class of polynomial differential equation x&= , 2(,)(,)(,)nnmnmpxypxypxy++++2(,)(,)(,)nnmnmyqxyqxyqxy++&=++. for where and are homogeneous polynomials of degree i. inside this class of polynomial differential equation we consider a subclass of darboux integrable systems. moreover, under additional conditions we proved such darboux integrable systems can have at most 1 limit cycle.
in this paper, we introduce the new notion of strongly j-clean rings associatedwith polynomial identity g(x) = 0, as a generalization of strongly j-clean rings. we denotestrongly j-clean rings associated with polynomial identity g(x) = 0 by strongly g(x)-j-cleanrings. next, we investigate some properties of strongly g(x)-j-clean.
In this paper we will survey some recent results on complexity theoretic model theory and algebra Essentially there are two major themes in this work The rst which we call complexity theoretic model theory deals with model ex istence questions For example given a recursive model A is there there a polynomial time exponential time polynomial space etc model B which is isomorphic to A The second ...
In this paper, a system level behavioural model for RF power amplifier, which exhibits memory effects, and based on multibranch system is proposed. When higher order terms are included, the memory polynomial model (MPM) exhibits numerical instabilities. A set of memory orthogonal polynomial model (OMPM) is introduced to alleviate the numerical instability problem associated to MPM model. A data...
For a polynomial p(z) of degree n, having all zeros in |z|< k, k< 1, Dewan et al [K. K. Dewan, N. Singh and A. Mir, Extension of some polynomial inequalities to the polar derivative, J. Math. Anal. Appl. 352 (2009) 807-815] obtained inequality between the polar derivative of p(z) and maximum modulus of p(z). In this paper we improve and extend the above inequality. Our result generalizes certai...
let g be a simple graph and (g,) denotes the number of proper vertex colourings of gwith at most colours, which is for a fixed graph g , a polynomial in , which is called thechromatic polynomial of g . using the chromatic polynomial of some specific graphs, weobtain the chromatic polynomials of some nanostars.
We prove the Landau–Ginzburg mirror symmetry conjecture between invertible quasihomogeneous polynomial singularities at all genera. That is, we show that FJRW theory (LG A-model) of such a is equivalent to Saito–Givental B-model) polynomial.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید