Studies on violence in the work of security guards are largely lacking. This study is unique in that it focuses on security guards (n=1,010) in Finland, and assesses the different forms, prevalence, and risk factors of the work-related violence they often face. Information to a survey instrument was obtained by first interviewing 30 volunteers. Then we made a cross-sectional mailed survey that ...

A Herbrand equality between expressions in a program is an equality which holds relative to the Herbrand interpretation of operators. We show that the problem of checking validity of positive Boolean combinations of Herbrand equalities at a given program point is decidable — even in presence of disequality guards. This result vastly extends the reach of classical methods for global value number...

We present eecient polynomial time algorithms that place bn=2c vertex guards which cover the surface of an n-vertex polyhedral terrain, and similarly, bn=3c edge guards which cover the surface of an n-vertex polyhedral terrain. The time complexity of both algorithms, dominated by the cost of nding a maximum matching in a graph, is O(n 3=2).

Entropy guards pore T he rapid fl uctuations of fl exible FG repeat–containing nucleoporins (FG Nups) form an entropic barrier to would-be entrants into the nuclear pore complex (NPC), according to Roderick Lim (University of Basel, Switzerland) and colleagues. FG Nups, which consist of large natively unfolded domains, are the pore’s gatekeepers—they keep out proteins that are not bound to tran...

Alzheimer’s disease is characterized by protein deposits of amyloid-β as plaques in the brain (1). The suite of enzymes that produce amyloid-β by cutting it out of the amyloid-β precursor protein (APP) have long been considered to be prime targets for therapeutic intervention. Converting this promise into reality, however, continues to be stalled by a series of obstacles, including an inaccurat...

We investigate the complexity of the satisfiability problem for the two-variable guarded fragment with transitive guards.We prove that the satisfiability problem for the monadic version of this logic without equality is 2EXPTIME-hard. It is in fact 2EXPTIME-complete, since as shown by Szwast and Tendera, the whole guarded fragment with transitive guards is in 2EXPTIME.We also introduce a new lo...