Assessment of cadmium and lead in the water and trout fish (Salmo trutta) of Zayandehroud River, a case study of Zarinshahr rice farms, Isfahan

This study aimed to investigate the concentrations of two heavy metals, lead and cadmium, in the water of Zayandehroud River which is surrounded by Zarinshahr rice farms. Water was sampled from a depth of 30 cm during June, July and August 2015, i.e. during the process of planting, growing and after harvesting, in three stations. Water was collected from three points; 20m before the farms, beside the farms and 100m after the farms. Three water samples and one trout fish (Salmo trutta) sample were collected each month and the concentrations of lead and cadmium were measured in the kidney, liver and gills of trout fish. The results showed that the amounts of lead and cadmium in the water were less and more than standard levels for these metals, respectively. The average concentrations of cadmium in the water were 15.81, 11.25, 8.92 μg/L during June, July and August, respectively. It is evident that the amount of cadmium in water was significantly higher in June during the planting phase and use of fertilizers and pesticides was more than the other months (p≤0.01). There was a correlation in cadmium and lead concentrations between water and fish organs (kidney, liver and gill)

Cigarette smoking and its relationship with perceived familial support and religiosity of university students in Tabriz

Objective: The goal of the present study was to assess the prevalence of cigarette smoking and its relationship to other risk taking behaviors, perceived familial support and religiosity among college students in Tabriz, Iran . Method: In this study, 1837 randomly selected students participated and completed a self-administered questionnaire inquiring demographic characteristics, risk taking behaviors, Aneshensel and Sucoff's 13-items one-dimensional perceived Parental support scale and 28 - items Kendler's general religiosity scale. Results: In general, 15.8 of the students were cigarette smokers. The results indicated that being male (OR = 3.21), living alone or with friends (OR = 2.00), having a part-time job (OR = 1.98), alcohol consumption during the past 30 days (OR = 3.67), hookah use (OR = 5.23), substance abuse (OR = 1.69), familial support (OR = 0.97) and religiosity (OR = 0.98) have statistically significant relationships with cigarette smoking . Conclusion: Our study represents the co-occurrence of risky behaviors. Cultural context in the traditional communities seems to show the crucial role of familial support and religiosity traits with the female gender as predictive factors to not smoke cigarette and perform other risky behaviors

Genetic algorithm solution for double digest problem

The strongly NP-Hard Double Digest Problem, for reconstructing the physical map of DNA sequence, in now using for efficient genotyping. Most of the existing methods are inefficient in tackling large instances due to the large search space for the problem which grows as a factorial function (a!)(b!) of the numbers a and b of the DNA fragments generated by the two restriction enzymes. Also, none of the existing methods are able to handle the erroneous data. In this paper, we develop a novel method based on genetic algorithm for solving this problem and it is adapted to handle the erroneous data. Our genetic algorithm is implemented and compared with the other well-known existing algorithms. The obtained results show the efficiency (speedup) of our algorithm with respect to the other methods, specially for erroneous data

University of Tehran, ISSN 1016-1104 Parallel Generation of t-ary Trees

A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time complexity, and ranking and unranking algorithms with O(t n) time complexity is also given