Introduction Conclusions References

Background and objective: Clear Cell Renal Cell Carcinoma (CCRCC) is the most common adult renal neoplasm. Staging and grading of RCC are important predictors of survival. Fuhrman nuclear grading is widely used for CCRCC, the subjective nature of which has prompted more objective methods to evaluate nuclear features. Furthermore, Ki-67, a reliable marker of cellular pr...

Introduction: Glioma is the most common type of brain malignancy among adults. Treatment for this type of tumor involves surgery, radiotherapy, and in higher grades, including chemotherapy. The precise grading of the tumor is critical for treatment planning and prognosis determining. Considering the possibility of problems such as errors in tissue sampling during surgery, as we...

background: bladder cancer accounts for about 7% of all cancers among adults in iran. we aimed to evaluate epidemiological and clinicopathological features of bladder cancer in kermanshah province, west iran. methods: in a descriptive retrospective study, records of patients with bladder cancer referring to imam reza hospital, kermanshah city, iran during 2011-2013 were analyzed. sex, age, smok...

volume estimation of most agricultural products using mathematical methods is not accurate because of their irregular shape. an alternative method is image processing, which can be used in continuous sorting machines. the objective of this study is to find a practical method for volume estimation of potatoes using image processing. fifty potatoes (marfona variety) were selected as experimental ...

squamous cell carcinoma, a cancer of keratinocytes origin, mostly involves sun-exposed areas of the skin. to study the pathologic and demographic features of this disease, records of 395 patients of squamous cell carcinoma of skin and lip were reviewed. most of the patients (83%) aged 40 years or more at the time of diagnosis. respectively, 74.4% and 75.8% of cases with skin and lower lip carci...

A graph G is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree T and two non-negative real numbers dmin and dmax such that each leaf lu of T corresponds to a vertex u ∈ V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (lu, lv) ≤ dmax where dT (lu, lv) is the sum of the weights of the edges on the unique path from lu to lv in T . In this paper we analyze...