Kharazmi University

About: Kharazmi University is a education organization based out in Tehran, Iran. It is known for research contribution in the topics: Membrane & Supply chain. The organization has 3395 authors who have published 5321 publications receiving 45645 citations. The organization is also known as: Tarbiat Moallem University of Tehran & Teacher Training University.

Landslide susceptibility mapping by binary logistic regression, analytical hierarchy process, and statistical index models and assessment of their performances

Abstract: The current research presents a detailed landslide susceptibility mapping study by binary logistic regression, analytical hierarchy process, and statistical index models and an assessment of their performances. The study area covers the north of Tehran metropolitan, Iran. When conducting the study, in the first stage, a landslide inventory map with a total of 528 landslide locations was compiled from various sources such as aerial photographs, satellite images, and field surveys. Then, the landslide inventory was randomly split into a testing dataset 70 % (370 landslide locations) for training the models, and the remaining 30 % (158 landslides locations) was used for validation purpose. Twelve landslide conditioning factors such as slope degree, slope aspect, altitude, plan curvature, normalized difference vegetation index, land use, lithology, distance from rivers, distance from roads, distance from faults, stream power index, and slope-length were considered during the present study. Subsequently, landslide susceptibility maps were produced using binary logistic regression (BLR), analytical hierarchy process (AHP), and statistical index (SI) models in ArcGIS. The validation dataset, which was not used in the modeling process, was considered to validate the landslide susceptibility maps using the receiver operating characteristic curves and frequency ratio plot. The validation results showed that the area under the curve (AUC) for three mentioned models vary from 0.7570 to 0.8520 $$ ({\text{AUC}}_{\text{AHP}} = 75.70\;\% ,\;{\text{AUC}}_{\text{SI}} = 80.37\;\% ,\;{\text{and}}\;{\text{AUC}}_{\text{BLR}} = 85.20\;\% ) $$ . Also, plot of the frequency ratio for the four landslide susceptibility classes of the three landslide susceptibility models was validated our results. Hence, it is concluded that the binary logistic regression model employed in this study showed reasonably good accuracy in predicting the landslide susceptibility of study area. Meanwhile, the results obtained in this study also showed that the statistical index model can be used as a simple tool in the assessment of landslide susceptibility when a sufficient number of data are obtained.

Teacher Self-Efficacy and Teacher Burnout: A Study of Relations

Abstract: In any teaching and learning setting, there are some variables that play a highly significant role in both teachers' and learners' performance. Two of these influential psychological domains in educational context include self-efficacy and burnout. This study is conducted to investigate the relationship between the self-efficacy of Iranian teachers of English and their reports of burnout. The data was collected through application of two questionnaires. The Maslach Burnout Inventory (MBI; Maslach& Jackson 1981, 1986) and Teacher Efficacy Scales (Woolfolk& Hoy, 1990) were administered to ten university teachers. After obtaining the raw data, the SPSS software (version 16) was used to change the data into numerical interpretable forms. In order to determine the relationship between self-efficacy and teachers' burnout, correlational analysis was employed. The results showed that participants' self-efficacy has a reverse relationship with their burnout.

Iterated Greedy methods for the distributed permutation flowshop scheduling problem

Abstract: Large manufacturing firms operate more than one production center. As a result, in relation to scheduling problems, which factory manufactures which product is an important consideration. In this paper we study an extension of the well known permutation flowshop scheduling problem in which there is a set of identical factories, each one with a flowshop structure. The objective is to minimize the maximum completion time or makespan among all factories. The resulting problem is known as the distributed permutation flowshop and has attracted considerable interest over the last few years. Contrary to the recent trend in the scheduling literature, where complex nature-inspired or metaphor-based methods are often proposed, we present simple Iterated Greedy algorithms that have performed well in related problems. Improved initialization, construction and destruction procedures, along with a local search with a strong intensification are proposed. The result is a very effective algorithm with little problem-specific knowledge that is shown to provide demonstrably better solutions in a comprehensive and thorough computational and statistical campaign.