We consider the complexity of determining the winner of a finite, two-level poset game. This is a natural question, as it has been shown recently that determining the winner of a finite, three-level poset game is PSPACE-complete. We give a simple formula allowing one to compute the status of a type of two-level poset game that we call parity-uniform. This class includes significantly more easil...

background: in the past 20 years, a dramatic improvement in the prognosis of patients with hepatoblastoma (hb)has been achieved by combining surgery and chemotherapy in several national and international trials.materials and methods: four children ( 3 girl and 1 boy) aged 34 days, 4 months, 13 months, and 1 year with meanage of 6.53 (±5.15) months were presented to our center from 2002 to 2009 ...

‎‎Let $R$ be a non-commutative ring with unity‎. ‎The commuting graph‎ of $R$ denoted by $Gamma(R)$‎, ‎is a graph with a vertex set‎ ‎$Rsetminus Z(R)$ and two vertices $a$ and $b$ are adjacent if and only if‎ $ab=ba$‎. ‎In this paper‎, ‎we investigate non-commutative rings with unity of order $p^n$ where $p$ is prime and $n in lbrace 4,5 rbrace$‎. It is shown that‎, ‎$Gamma(R)$ is the disjoint ...

in order to study effect of irrigation with wastewater and foliar application of complete fertilizer on forage yield and seed yield and yield components of foxtail millet (setaria italica). a split plot experiment based on randomized complete block design with three replications was conducted at the agriculture institute of zabol university in year 2009. treatments included three levels of irri...

‎Let $R$ be a commutative ring with non-zero identity. ‎We describe all $C_3$‎- ‎and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. ‎Also, ‎we shall describe all complete, ‎regular and $n$-claw-free intersection graphs. ‎Finally, ‎we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...

super eciency data envelopment analysis(dea) model can be used in ranking the performanceof ecient decision making units(dmus). in dea, non-extreme ecient unitshave a super eciency score one and the existing super eciency dea models do notprovide a complete ranking about these units. in this paper, we will propose a methodfor ranking the performance of the extreme and non-extreme ecient u...

‎let $r$ be a commutative ring with non-zero identity. ‎we describe all $c_3$‎- ‎and $c_4$-free intersection graph of non-trivial ideals of $r$ as well as $c_n$-free intersection graph when $r$ is a reduced ring. ‎also, ‎we shall describe all complete, ‎regular and $n$-claw-free intersection graphs. ‎finally, ‎we shall prove that almost all artin rings $r$ have hamiltonian intersection graphs. ...