A guarding problem can naturally be modeled as a set system (U ,S) in which the universe U of elements is the set of points we need to guard and our collection S of sets contains, for each potential guard g, the set of points from U seen by g. We prove bounds on the maximum VC-dimension of set systems associated with guarding both 1.5D terrains (monotone chains) and 2.5D terrains (polygonal ter...

There exist many variants of guarding an orthogonal polygon in an orthogonal fashion: sometimes a guard can see an entire rectangle, or along a staircase, or along a orthogonal path with at most k bends. In this paper, we study all these guarding models in the special case of orthogonal polygons that have bounded treewidth in some sense. Exploiting algorithms for graphs of bounded treewidth, we...

Substrate noise effects caused by the integration of a DC-DC converter into a 0.13 μm CMOS technology integrated circuit are investigated in this paper. Simulations performed using the Substrate Noise Analyst tool show strong impact of switching and power supply noise on a sensitive analog block. The dependence of substrate noise coupling on physical separation distance, floorplanning and intro...

We put forward the notion of self-guarding cryptographic protocols as a countermeasure to algorithm substitution attacks. Such self-guarding protocols can prevent undesirable leakage by subverted algorithms if one has the guarantee that the system has been properly working in an initialization phase. Unlike detection-based solutions they thus proactively thwart attacks, and unlike reverse firew...

We consider variations of the original art gallery problem where the domain is a polyomino, a polycube, or a polyhypercube. Anm-polyomino is the connected union of m unit squares called pixels, an m-polycube is the connected union of m unit cubes called voxels, and an m-polyhypercube is the connected union of m unit hypercubes in a d dimensional Euclidean space. In this paper we generalize and ...