نتایج جستجو برای: finally in distance 5
تعداد نتایج: 17238377 فیلتر نتایج به سال:
Let G be a connected simple (molecular) graph. The distance d(u, v) between two vertices u and v of G is equal to the length of a shortest path that connects u and v. In this paper we compute some distance based topological indices of H-Phenylenic nanotorus. At first we obtain an exact formula for the Wiener index. As application we calculate the Schultz index and modified Schultz index of this...
â industrial site selection is a complicated decision and is related to various factors, so it is kind of multi-criteria decision analysis which is used for prioritizing different factors and selecting the best alternative among possible alternatives. in fact by scientific site selection, it is possible to minimize negative impacts of industrial construction and going towards sustainable devel...
distinguishing the susceptible areas to landslide using different landslide susceptibility mapping (lsm) models is one of the primitive and basic works to reduce probable damages and reduce risk. the main purpose of this research is the efficiency evaluation of four methods including information value (winf), valuing area accumulation (wa), analytical hierarchy process (ahp), kopta-joshi propos...
the aim of this paper is to propose some diagnostic methods in linear ridge measurement error models with stochastic linear restrictions using the corrected likelihood. based on the bias-corrected estimation of model parameters, diagnostic measures are developed to identify outlying and influential observations. in addition, we derive the corrected score test statistic for outliers detection ba...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید