Sharif Digital Repository

The use of cell phone is a significant source of driver distraction. Phone use while driving can impair a number of factors critical for safe driving which can cause serious traffic safety problems. The objective of this paper was to investigate the frequency of using cell phones while driving in Iran's roads through an observational survey with a random sample of drivers, to recognize contributing factors to cell phone usage and to understand the magnitude of the problem. A total of 1794 observations were collected from 12 sites at controlled intersections, entrance and exit points of highways. The cell phone use rate among drivers (talking or texting) was estimated at 10% which is... 

The use of cell phone is a significant source of driver distraction. Phone use while driving can impair a number of factors critical for safe driving which can cause serious traffic safety problems. The objective of this paper was to investigate the frequency of using cell phones while driving in Iran's roads through an observational survey with a random sample of drivers, to recognize contributing factors to cell phone usage and to understand the magnitude of the problem. A total of 1794 observations were collected from 12 sites at controlled intersections, entrance and exit points of highways. The cell phone use rate among drivers (talking or texting) was estimated at 10% which is... 

This paper is aimed at investigating some computational aspects of different isoperimetric problems on weighted trees. In this regard, we consider different connectivity parameters called minimum normalized cuts/isoperimetric numbers defined through taking the minimum of the maximum or the mean of the normalized outgoing flows from a set of subdomains of vertices, where these subdomains constitute a partition/subpartition. We show that the decision problem for the case of taking k-partitions and the maximum (called the max normalized cut problem NCP^M), and the other two decision problems for the mean version (referred to as IPP^m and NCP^m) are NP-complete problems for weighted trees. On... 

This paper proposes an artificial pheromone communication system inspired by social insects. The proposed model is an extension of the previously developed pheromone communication system, COS-Φ. The new model increases COS-Φ flexibility by adding two new features, namely, diffusion and advection. The proposed system consists of an LCD flat screen that is placed horizontally, overhead digital camera to track mobile robots, which move on the screen, and a computer, which simulates the pheromone behaviour and visualises its spatial distribution on the LCD. To investigate the feasibility of the proposed pheromone system, real micro-robots, Colias, were deployed which mimicked insects' role in... 

Let LL be a reversible Markovian generator on a finite set View the MathML sourceV. Relations between the spectral decomposition of LL and subpartitions of the state space View the MathML sourceV into a given number of components which are optimal with respect to min–max or max–min Dirichlet connectivity criteria are investigated. Links are made with higher-order Cheeger inequalities and with a generic characterization of subpartitions given by the nodal domains of an eigenfunction. These considerations are applied to generators whose positive rates are supported by the edges of a discrete cycle ZNZN, to obtain a full description of their spectra and of the shapes of their eigenfunctions, as... 

In this paper1 we consider higher isoperimetric numbers of a (finite directed) graph. In this regard we focus on the nth mean isoperimetric constant of a directed graph as the minimum of the mean outgoing normalized flows from a given set of n disjoint subsets of the vertex set of the graph. We show that the second mean isoperimetric constant in this general setting, coincides with (the mean version of) the classical Cheeger constant of the graph, while for the rest of the spectrum we show that there is a fundamental difference between the nth isoperimetric constant and the number obtained by taking the minimum over all n-partitions. In this direction, we show that our definition is the...