نتایج جستجو برای: dependence polynomial
تعداد نتایج: 253488 فیلتر نتایج به سال:
aim: the purpose of this study was to compare the attention bias about tempting incentives related to opium materials in treated, addicted and normal people. duration of consumption and treating were also considered. method: in this causal-comparative study population was all addicted people who were referred to the rehabilitation offices, addiction treatment clinic, rebirthing centers and narc...
background: the effects of opium dependence on prognosis and short term outcome of patients with acute myocardial infarction (ami) are not clear yet. methods: from march 2004 to august 2004 all male patients admitted with diagnosis of ami were enrolled. patients who fulfilled dsm- iv-tr criteria were chosen as opium dependent patients (odp). demographic data, risk factors, peak enzyme levels, l...
the neighbourhood polynomial g , is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph. in other word $n(g,x)=sum_{uin n(g)} x^{|u|}$, where n(g) is neighbourhood complex of a graph, whose vertices are the vertices of the graph and faces are subsets of vertices that have a common neighbour. in this paper we compute this polynomial for some na...
let $g$ be a simple graph of order $n$. the domination polynomial of $g$ is the polynomial $d(g, x)=sum_{i=gamma(g)}^{n} d(g,i) x^{i}$, where $d(g,i)$ is the number of dominating sets of $g$ of size $i$ and $gamma(g)$ is the domination number of $g$. in this paper we present some families of graphs whose domination polynomials are unimodal.
An attractive and challenging problem in computational number theory is to count in an e*cient manner the number of solutions to a multivariate polynomial equation over a -nite -eld. One desires an algorithm whose time complexity is a small polynomial function of some appropriate measure of the size of the polynomial. A natural measure of size is d logðqÞ for a polynomial of total degree d in n...
In the context of Universal Composability, we introduce the concept of universal environments and simulators. Then, Universal Composability is equivalent to Universal Composability wrt. universal environments and simulators. We prove the existence of universal environments and simulators and investigate their computational complexity. From this, we get a number of consequences: First, we see th...
The Painlevé and weak Painlevé conjectures have been used widely to identify new integrable nonlinear dynamical systems. For a system which passes the Painlevé test, the calculation of the integrals relies on a variety of methods which are independent from Painlevé analysis. The present paper proposes an explicit algorithm to build first integrals of a dynamical system, expressed as ‘quasi-poly...
conclusions low onset age of smoking cigarettes, high novelty seeking and low cooperativeness in opiate dependents are among the important personality traits in future use of drugs that can predict the subsequent onset of using opiate drugs. results opiate addicts had higher scores in novelty seeking dimension and lower scores in cooperativeness compared to nicotine addicts. the onset age of sm...
sexual dysfunction among males with opiate dependence undergoing methadone maintenance therapy (mmt)
conclusions results showed that sexual dysfunction is a prevalent disorder in opioid-dependent males. addiction withdrawal centers should be warned about the dysfunction caused by opioids and, from a clinical perspective, it is imperative that patients misusing opiates and those treated with methadone are routinely asked about their sexual functioning so that, if indicated, appropriate investig...
In this paper, we show how certain metabelian groups can be found within polynomial evaluation groupoids. We show that every finite abelian group can beobtained as a polynomial evaluation groupoid.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید