introduction: the field of stem cell biology and regenerative medicine is rapidly moving toward translation to clinical practice. stem cell therapy seems to be a new treatment option for some diseases. so, tracking the distribution of stem cells is crucial to their therapeutic use. based on this fact we labeled human mesenchymal stem cells (mscs) with 111in- oxine for the first time in our coun...

we consider biobjective shortest path problems in networks with fuzzy arc lengths. considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. the rst and second approaches are extensions of the labeling method to solve the sing...

For any h in N , a graph G = (V, E) is said to be h-magic if there exists a labeling l: E(G) to Z_{h}-{0} such that the induced vertex set labeling l^{+: V(G) to Z_{h}} defined by l^{+}(v)= Summation of l(uv)such that e=uvin in E(G) is a constant map. For a given graph G, the set of all for which G is h-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper, the ...

  Introduction: The field of stem cell biology and regenerative medicine is rapidly moving toward translation to clinical practice. Stem cell therapy seems to be a new treatment option for some diseases. So, tracking the distribution of stem cells is crucial to their therapeutic use. Based on this fact we labeled human mesenchymal stem cells (MSCs) with 111...

We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...

A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...

In this paper, a modified segmentation algorithm for printed Farsi words is presented. This algorithm is based on a previous work by Azmi that uses the conditional labeling of the upper contour to find the segmentation points. The main objective is to improve the segmentation results for low quality prints. To achieve this, various modifications on local baseline detection, contour labeling an...

let $a$ be a non-trivial abelian group and $a^{*}=asetminus {0}$. a graph $g$ is said to be $a$-magic graph if there exists a labeling$l:e(g)rightarrow a^{*}$ such that the induced vertex labeling$l^{+}:v(g)rightarrow a$, define by $$l^+(v)=sum_{uvin e(g)} l(uv)$$ is a constant map.the set of all constant integerssuch that $sum_{uin n(v)} l(uv)=c$, for each $vin n(v)$,where $n(v)$ denotes the s...

background and purpose : there has been no report in which preoperative evaluation of adc for prediction of post therapeutic outcome was presented. the aim of our study was to retrospectively evaluation the use of the apparent diffusion coefficient (adc) for the prediction of malignancy and the outcome of malignant astrocytic tumors. methods: we reviewed mri of 26 male and 14 female patients wi...