نتایج جستجو برای: neighbourhood polynomial
تعداد نتایج: 108026 فیلتر نتایج به سال:
In this paper we introduce the graph layout parameter neighbourhood-width as a variation of the well-known cut-width. The cut-width of a graph G = (V ,E) is the smallest integer k, such that there is a linear layout : V → {1, . . . , |V |}, such that for every 1 i < |V | there are at most k edges {u, v} with (u) i and (v)> i. The neighbourhood-width of a graph is the smallest integer k, such th...
BACKGROUND Neighbourhood characteristics may influence physical activity (PA), which has positive effects on the health of older adults. Older adults with chronic conditions are less active and possibly more affected by environmental factors than their peers. Understanding neighbourhood characteristics associated with PA specific to older adults with chronic conditions is currently lacking. Thi...
STUDY OBJECTIVE This study investigates whether neighbourhood socioeconomic disadvantage may contribute to child behavioural and emotional problems, beyond the effects of parental socioeconomic status. It also examines the influence of neighbourhood disadvantage on changes in the frequency of behavioural problems from late childhood into early adolescence. DESIGN AND SETTING The study was con...
BACKGROUND This study investigates the effects of neighbourhood income on children's Body Mass Index (BMI) from childhood (ages 2-3) to early adolescence (ages 10-11) using longitudinal data. METHODS Five cycles of data from the Canadian National Longitudinal Survey of Children and Youth are analyzed for a sub-sample of children (n = 2152) aged 2-3 at baseline (1994) and assessed at two year ...
Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. A variable elimination rule (value elimination rule) allows the polynomial-time identification of certain variables (domain elements) whose elimination, without the introduction of extra compensatory constraints, does not affect the satisfiability o...
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.
BACKGROUND It is widely believed that the social environment has an important influence on health, but there is less certainty about how to measure specific factors within the social environment that could link the neighbourhood of residence to a health outcome. The objectives of the study were to examine the underlying constructs captured by an adapted version of Buckner's neighbourhood cohesi...
Second order properties of nearly nonstationary ARMA processes are investigated in the cases when the autoregressive polynomial equation has (i) a real root close to 1; (ii) a real root close to -1; (iii) a pair of complex roots close to the unit circle. The effect of the closeness to the unit circle of the ARMA poles on its covariance and spectral density functions is considered. The obtained ...
For many problems in Scheduling and Timetabling the choice of a mathematical programming formulation is determined by the formulation of the graph colouring component. This paper briefly surveys seven known integer programming formulations of vertex colouring and introduces a new formulation using “supernodes”. In the definition of George and McIntyre [SIAM J. Numer. Anal. 15 (1978), no. 1, 90–...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید