ندارد

da is a memory of iraqi war against iran. this narration of war is a representation of young girl life that had a significant role in her own time. this book challenges masculinity of war and passes out gender as a limitation. the important narration of war, mentioned in da, has been associated with 150 republication and these elements confirm research on da. this article tries to attempts to a...

energy consumption is considered as a critical issue in wireless sensor networks (wsns). batteries of sensor nodes have limited power supply which in turn limits services and applications that can be supported by them. an efcient solution to improve energy consumption and even trafc in wsns is data aggregation (da) that can reduce the number of transmissions. two main challenges for da are: (i)...

because of participation in many aspects of human life, and due to oxidation-sensitive characteristics of dopamine (da) and arachidonoyl dopamine (aa-da), the necessity of biocompatible carrier to keep them against oxidation is of importance. in this work, we explored the putative binding sites of da and aa-da to -lactoglobulin (blg) as potent carrier. docking results identified the binding si...

Dopamine  (DA)  and  uric  acid  (UA)  are  two  of  important bimolecular widely  circulated  in  body blood. Therefore, development of simple and rapid methods for simultaneous determination of them in  routine  analysis  has  a  great  significance  for  many  researchers. Therefore,  for  the  first  time, nanocomposite  of  graphene  (Gr)LaMnO3has  been  utilized  to  fabricate  the  new  ...

Derived from the emerging paradigm shift in English language teaching and assessment, there has been a renewal of interest in dynamic assessment (DA) to be used as an alternative to the traditional static testing in language classrooms. However, to date, DA practice has been mostly limited to clinical treatments of children with learning disabilities, and it has not been widely incorporated int...

Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the indu...