The paper presents a system theoretic analysis of network-of-networks which are formed from smaller factor networks via graph Kronecker products. We provide a compositional framework for extending trajectories, stabilizability, controllability and observability of the factor networks to that of the composite network-of-networks. We proceed to delve into the effectiveness of applying these compo...

We present results related to the vertex degree in a uniform s-intersection graph which has received much interest recently. Specifically , we derive the probability distribution for the minimum vertex degree, and show that the number of vertices with an arbitrary degree converges to a Poisson distribution. A uniform s-intersection graph models the topology of a secure wireless sensor network e...

Abstract. We present results related to the vertex degree in a uniform s-intersection graph which has received much interest recently. Specifically, we derive the probability distribution for the minimum vertex degree, and show that the number of vertices with an arbitrary degree converges to a Poisson distribution. A uniform s-intersection graph models the topology of a secure wireless sensor ...

Model-driven development (MDD) has become a promising trend in software engineering for a number of reasons. Models as the key artifacts help the developers to abstract from irrelevant details, focus on important aspects of the underlying domain, and thus master complexity. As software systems grow, models may grow as well and nally become possibly too large to be developed and maintained in a ...

The system presented is part of a general object recognition system. Images of faces are represented as graphs, labeled with topographical information and local features. New graphs of faces are generated by an elastic graph matching procedure comparing the new face with a composition of stored graphs: the face bunch graph. The result of this matching process can be used to generate composite i...

In contrast with knots, whose properties depend only on their extrinsic topology in S3, there is a rich interplay between the intrinsic structure of a graph and the extrinsic topology of all embeddings of the graph in S3. For example, it was shown by Conway and Gordon that every embedding of the complete graph K7 in S3 contains a non-trivial knot. Later it was shown that for every m ∈ N there i...

In contrast with knots, whose properties depend only on their extrinsic topology in S3, there is a rich interplay between the intrinsic structure of a graph and the extrinsic topology of all embeddings of the graph in S3. For example, it was shown by Conway and Gordon that every embedding of the complete graph K7 in S3 contains a non-trivial knot. Later it was shown that for every m ∈ N there i...