Let l = [l0, l1] be the directed line segment from l0 ∈ IR to l1 ∈ IR. Suppose l̄ = [l̄0, l̄1] is a second segment of equal length such that l, l̄ satisfy the “two sticks condition”: ∥∥l1 − l̄0∥∥ ≥ ‖l1 − l0‖ ,∥∥l̄1 − l0∥∥ ≥ ∥∥l̄1 − l̄0∥∥ . Here ‖·‖ is a norm on IR. We explore the manner in which l1− l̄1 is then constrained when assumptions are made about “intermediate points” l∗ ∈ l, l̄∗ ∈ l̄. Roughly spe...

We introduce a sequential model for the deposition and aggregation of particles in the submonolayer regime. Once a particle has been randomly deposited on the substrate, it sticks to the closest atom or island within a distance l, otherwise it sticks to the deposition site. We study this model both numerically and analytically in one dimension. A clear comprehension of its statistical propertie...

objectives: clinical laboratory health care workers can become infected through their occupation with blood-borne pathogens by percutanous injuries and mucocutaneous blood contacts such as cuts, needle sticks, splashes to mucous membranes or other body injuries. the purpose of this study was to determine the seroprevalence of, hepatitis c virus (hcv), and some of the risk factors in medical lab...

We investigate the computational complexity of some maze problems, namely the reachability problem for (undirected) grid graphs with diagonal edges, and the solvability of Xmas tree mazes. Simply speaking, in the latter game one has to move sticks of a certain length through a maze, ending in a particular game situation. It turns out that when the number of sticks is bounded by some constant, t...