In this paper, a novel topological index, named M-index, is introduced based on expanded form of the Wiener matrix. For constructing this index the atomic characteristics and the interaction of the vertices in a molecule are taken into account. The usefulness of the M-index is demonstrated by several QSPR/QSAR models for different physico-chemical properties and biological activities of a large...

Due to existence of uncertainties in input geometrical properties of fractures, there is not any unique solution for assessing the stability of slopes in jointed rock masses. Therefore, the necessity of applying probabilistic analysis in these cases is inevitable. In this study a probabilistic analysis procedure together with relevant algorithms are developed using Discrete Fracture Network-Dis...

the quantitative structure-retention relationship (qsrr) of nanoparticles in roadside atmosphere against the comprehensive two-dimensional gas chromatography which was coupled to high-resolution time-of-flight mass spectrometry was studied. the genetic algorithm (ga) was employed to select the variables that resulted in the best-fitted models. after the variables were selected, the linear multi...

one of the difficulties in using absolute altitudes is the separation between the mean open sealevel and geoid. theoretically, geoid is the base level in absolute altitudes, but practically, the mean open sealevel is used as a base level for absolute altitudes. the difference between these two levels is called as the seasurface topography. in this research, it is dealt the mean sea level modeli...

in this paper, analysis and simulation of media gateway controller (megaco) based cops (common open policy server) which is a protocol defined in ietf (internet engineering task force) to transport configuration requests and deliver the policies is presented. for this scenario, three queuing models include m/m/1, m/m/c and m/d/c were applied . then, some of the key performance benchmarks look l...

The paper focuses on finding the m best solutions to combinatorial optimization problems using best-first or depth-first branch and bound search. Specifically, we present a new algorithm m-A*, extending the well-known A* to the m-best task, and for the first time prove that all its desirable properties, including soundness, completeness and optimal efficiency, are maintained. Since bestfirst al...