نتایج جستجو برای: group evaluation polynomial

تعداد نتایج: 1815682  

Journal: :تولیدات دامی 0
مهشید محمدپناه کارشناس ارشد، گروه علوم دامی، دانشکدۀ کشاورزی، دانشگاه بیرجند، بیرجند، ایران همایون فرهنگ فر استاد گروه علوم دامی، دانشکدۀ کشاورزی، دانشگاه بیرجند، بیرجند، ایران مسلم باشتنی دانشیار گروه علوم دامی، دانشکدۀ کشاورزی، دانشگاه بیرجند، بیرجند، ایران

correlation between breeding value of crude milk (cm) and energy-corrected milk (ecm) was studied based on a total of 774,013 test day records belongs to 88,456 first-parity holsteins dairy cattle calving during 1997-2009 in 165 herds (from six provinces). genetic analysis of the traits was carried out by a fixed regression test day model. in the model, effects of herd, calving year, production...

Journal: :Journal of applied behavior analysis 2007
Catherine A Cote Rachel H Thompson Gregory P Hanley Paige M McKerchar

Teachers were asked to identify and rank 10 preferred stimuli for 9 toddlers, and a hierarchy of preference for these items was determined via a direct preference assessment. The reinforcing efficacy of the most highly preferred items identified by each method was evaluated concurrently in a reinforcer assessment. The reinforcer assessment showed that all stimuli identified as highly preferred ...

1997
J. V. STOKMAN

We show that limit transitions from Askey-Wilson polynomials to q-Racah, little and big q-Jacobi polynomials can be made rigorous on the level of their orthogonality measures in a suitable weak sense. This allows us to derive the orthogonality relations and norm evaluations for the q-Racah polynomials, little and big q-Jacobi polynomials by taking limits in the orthogonality relations and norm ...

2008
Benny Godlin Tomer Kotek Johann A. Makowsky

A graph polynomial p(G, X̄) can code numeric information about the underlying graph G in various ways: as its degree, as one of its specific coefficients or as evaluations at specific points X̄ = x̄0. In this paper we study the question how to prove that a given graph parameter, say ω(G), the size of the maximal clique of G, cannot be a fixed coefficient or the evaluation at any point of the Tutte...

2001
VICTOR PAN

Stable polynomial evaluation and interpolation at n Chebyshev or adjusted (expanded) Chebyshev points is performed using O(nlog’ n) arithmetic operations, to be compared with customary algorithms either using on the order of n* operations or being unstable. We also evaluate a polynomial of degree d at the sets of n Chebyshev or adjusted (expanded) Chebyshev points using O(dlog d log n) if n 5 d...

Journal: Evidence Based Care 2018

Background: The most important barriers to patient education are nurses’ poor motivation and training, and poor quality of managerial supervision. Clinical supervision could be a powerful tool for overcoming these barriers. However, the associated patient, staff, and organization-related outcomes still require further research. Aim: The present study aimed to evaluate the patient-, staff-, and ...

Journal: :iranian journal of mathematical chemistry 2012
m. ghorbani m. songhori

the omega polynomial(x) was recently proposed by diudea, based on the length of stripsin given graph g. the sadhana polynomial has been defined to evaluate the sadhana index ofa molecular graph. the pi polynomial is another molecular descriptor. in this paper wecompute these three polynomials for some infinite classes of nanostructures.

We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.

2002
MARTIN LOTZ JOHANN A. MAKOWSKY

We investigate the coloured Tutte polynomial in Valiant’s algebraic framework of NP-completeness. Generalising the well known relationship between the Tutte polynomial and the partition function from the Ising model, we establish a reduction from the permanent to the coloured Tutte polynomial, thus showing that its evaluation is a VNP−complete problem.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید