In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
Chaotic attractors generated by the iteration of polynomial functions with cyclic symmetry have been the subject of recent study. A new formulation is investigated which generates ...
Trust is an important aspect of decision making for Internet applications and particularly influences the specification of security policy i.e. who is authorised to perform action...
Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. In this paper we present methods that smoothly ...
In this paper, we study the observability properties of nonlinear discrete time systems. Two types of contributions are given. First, we present observability criteria in terms of...