This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...

mobile robot navigation is one of the basic problems in robotics. in this paper, a new approachis proposed for autonomous mobile robot navigation in an unknown environment. the proposedapproach is based on learning virtual parallel paths that propel the mobile robot toward the trackusing a multi-layer, feed-forward neural network. for training, a human operator navigates themobile robot in some...

  We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...

OBJECTIVE To evaluate the relative power of social relations and social conditions in predicting depression using (CES-D scale) among rural pregnant women belonging to Sind, Pakistan. METHODS The study was conducted from January 2004 tp December 2004. Both qualitative and quantitative methods were employed. During quantitative phase a total of 375 rural pregnant women were inquired about soci...

Can one make a Majorana field theory for fermions starting from the zero mass Weyl theory, then adding a mass term as an interaction? The answer to this question is: yes we can. We can proceed similarly to the case of the Dirac massive field theory[1]. In both cases one can start from the zero mass Weyl theory and then add a mass term as an interacting term of massless particles with a constant...