In practice, there are many dynamic covering decision information systems, and knowledge reduction of dynamic covering decision information systems is a significant challenge of covering-based rough sets. In this paper, we first study mechanisms of constructing attribute reducts for consistent covering decision information systems when adding objects using related families. We also employ examp...

The construction of optimal template banks for matched-filtering searches is an example of the sphere covering problem. For parameter spaces with constant-coefficient metrics a (near-) optimal template bank is achieved by the A∗n lattice, which is the best lattice-covering in dimensions n ≤ 5, and is close to the best covering known for dimensions n ≤ 16. Generally this provides a substantially...