background: long distance truck drivers (ldtds) and their sexual health risk behaviors have been associated with greater prevalence of sexually transmitted infections (stis), hiv and hepatitis virus transmission. however, there is no information about iranian ldtds' high-risk behaviors. the aim of this investigation was to estimate the prevalence of high-risk behaviors in iranian ldtds. methods...

conclusions this study showed that hiv-infected patients with jobs enjoy a great deal of acceptance from the people around them and a higher quality of life in general. it also led to suggestions for further study with the purpose of finding more effective solutions for hiv prevention and better strategies for dealing with psychological disorders. such research could also help in providing an e...

background: considering differences in head size and shape of different equine breeds, biometric parameters can be an attribute to a particular race. objectives: the purpose of the present paper is to give a numerical definition of morphological characteristics of head region of the darehshori horse. methods: twenty mature darehshori horses were studied biometrically. the ear length, ears dista...

Proximity, or spatial closeness, can generate social closeness—the closer people are together, the more they interact, affiliate, and befriend one another. Mediated communication allows people to bridge spatial distance and can increase social closeness between conversational partners, even when they are separated by distance. However, mediated communication may not always make people feel clos...

A set D ⊆ V of vertices is said to be a (connected) distance k-dominating set of G if the distance between each vertex u ∈ V − D and D is at most k (and D induces a connected graph in G). The minimum cardinality of a (connected) distance k-dominating set in G is the (connected) distance k-domination number of G, denoted by γk(G) (γ c k (G), respectively). The set D is defined to be a total k-do...

With a dependency grammar, this study provides a unified method for calculating the syntactic complexity in linear and hierarchical dimensions. Two metrics, mean dependency distance (MDD) and mean hierarchical distance (MHD), one for each dimension, are adopted. Some results from the Czech-English dependency treebank are revealed: (1) Positive asymmetries in the distributions of the two metrics...

Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...

In this paper, the exact formulae for the generalized degree distance, degree distance and reciprocal degree distance of strong product of a connected and the complete multipartite graph with partite sets of sizes m0, m1, . . . , mr&minus1 are obtained. Using the results obtained here, the formulae for the degree distance and reciprocal degree distance of the closed and open fence graphs are co...