نتایج جستجو برای: dependence polynomial
تعداد نتایج: 253488 فیلتر نتایج به سال:
conclusions metacognitive regulation strategies are more considerable prediction than emotional regulation strategies in sd group than in ad group. individuals with ad use alcohol as a means of both cognitive and emotional regulation strategy. patients and methods according to dsm-iv tr criteria, 45 patients with alcohol dependence (ad), 44 patients with substance dependence (sd), and 43 volunt...
conclusions opium was not identified as a risk factor of ischemic stroke. a more extended survey considering further confounding factors is recommended. background one of the supposed risk factors of ischemic stroke is opium addiction, while the researches about its prevalence among patients with stroke are limited. objectives the aim of this study was comparing the prevalence of opium addictio...
The Narumi-Katayama index is the first topological index defined by the product of some graph theoretical quantities. Let G be a simple graph. Narumi-Katayama index of G is defined as the product of the degrees of the vertices of G. In this paper, we define the Narumi-Katayama polynomial of G. Next, we investigate some properties of this polynomial for graphs and then, we obtain ...
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute atomically. We show that these problems become decidable, if this assumption is abandoned. So, the (unrealistic) idealization from program verification “atomic execution of base statements” introduced in order to simp...
Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific g...
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...
In [kal89], Kaltofen proved the remarkable fact that multivariate polynomial factorization can be done efficiently, in randomized polynomial time. Still, more than twenty years after Kaltofen’s work, many questions remain unanswered regarding the complexity aspects of polynomial factorization, such as the question of whether factors of polynomials efficiently computed by arithmetic formulas als...
objectivethis study was initiated to investigate the effect of portulaca oleraceae on morphine dependence in mice.materials and methodsdependence was induced using the subcutaneous injections of morphine for 3 days. on the day 4, morphineinjected 2 h prior to intraperitoneal injection of naloxone. the plant extracts ethanolic or aqueousadministered 0.5 h before the final dose of morphine. the n...
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.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید