In order to reduce the algorithm complexity of the target coverage problem in Wireless Sensor Network, three kinds of approaches are designed to decrease the network scale, that is, one is deleting the redundant sensor nodes, another is removing the redundant targets, and the third is decomposing the target coverage graph into multiple independent sub graphs. This paper proves that the three ap...

PURPOSE To determine the dosimetric effects of rotational errors on target coverage using volumetric modulated arc therapy (VMAT) for multitarget stereotactic radiosurgery (SRS). METHODS AND MATERIALS This retrospective study included 50 SRS cases, each with 2 intracranial planning target volumes (PTVs). Both PTVs were planned for simultaneous treatment to 21 Gy using a single-isocenter, nonc...

Although many smart coverage algorithms for intelligent robots have been proposed, to the best of our knowledge, all of them make the same assumption that they have sufficient time to cover the entire target area. However, the time to completely cover the whole target area may not always be available. Therefore, in this paper, we propose another new coverage scheme, which we call the DmaxCovera...

Maximum target coverage with minimum number of sensor nodes, known as an MCMS problem, is an important problem in directional sensor networks (DSNs). For guaranteed coverage and event reporting, the underlying mechanism must ensure that all targets are covered by the sensors and the resulting network is connected. Existing solutions allow individual sensor nodes to determine the sensing directi...