A locating-dominating set D of a graph G is dominating where each vertex not in has unique neighborhood D, and the Locating-Dominating Set problem asks if contains such bounded size. This known to be NP-hard even on restricted classes, as interval graphs, split planar bipartite subcubic graphs. On other hand, it solvable polynomial time for some trees and, more generally, graphs cliquewidth. Wh...

The development of commercial real-time location system (RTLS) enables new ICT solutions. This paper presents an intelligent surveillance system for indoor high-security environments based on RTLS and artificial intelligence methods. The system consists of several software modules each specialized for detection of specific security risks. The validation shows that the system is capable of detec...

Problem 1. this needs to be fleshed out We will use 3 arrays A, B, and C. A will represent that actual array and hold the stored items in their stored positions. Arrays B and C will act as “checks” for which entries of A are truly initialized. B will contain a list, built up sequentially from position 0, of all entries of A that have been filled. We use a “length” variable i to keep track of th...

Active Appearance Models (AAMs) provide a method of modelling the appearance of objects in images and locating them automatically. Although the AAM approach is computationally eÆcient, the models used to search unseen images for the structures of interest are large typically the size of 100 images. This is perfectly practical for most 2-D images, but is currently impractical for 3-D images. We ...