background: although visual impairment of drivers is a very important risk factor for car accident, a few published papers have explored this issue in iran. this study aims to evaluate the visual fitness of public vehicle drivers in kerman province, southeast of iran. methods: a total of 4,003 public vehicle drivers were examined by one ophthalmologist for visual fitness in kerman province betw...

In this paper, we present a strongly fault-tolerant design for the l-level k-ary tree multiprocessor and examine its reconfigurability. Our design assigns one spare node to the regular nodes of each subtree with lc levels. Moreover, spare nodes are interconnected to form a spare tree. Our approach utilizes the circuit-switched capabilities of the communication modules of the spare nodes to tole...

In this paper, we present a strongly fault-tolerant design for a d-dimensional hypercube multiprocessor and examine its reconfigurability. The augmented hypercube has a spare node connected to each node of an i-cube and the spare nodes are also connected as a (d i)-dimensional hypercube. By utilizing the circuit-switched capabilities of the communication modules of the spare nodes, large number...

in many countries road crashes are the main cause of fatal accidents related to job. the aim of our study was to characterize a population of iranian professional drivers with regard to history of drivers’ road crash incidents and some occupational factors. using swedish version of the nordic questionnaire information about musculoskeletal pain prevalence in last 12 months, demographic features...

The star graph interconnection network has been recognized as an attractive alternative to the hypercube network. Previously, the star graph has been shown to contain a Hamiltonian cycle. In this paper, we consider an injured star graph with some faulty links and nodes. We show that even with fe £ n 3 faulty links, a Hamiltonian cycle still can be found in an n-star, and that with fv £ n 3 faul...

We consider the problem of simulating a PRAM on a faulty distributed memory machine (DMM). We focus on dynamic faults, i.e. each processor or memory module independently fails during the simulation of a PRAM step with fixed probability and remains faulty for the rest of the simulation. We build upon randomized hashing-based simulations on non-faulty DMMs from [14], which achieve delay O(log log...