The need to monitor today’s networked computer systems for security purposes is a major concern. Our monitoring environment aids system administrators in keeping track of the activities on such systems with much lower time requirements than that of perusing typical log files. With many systems connected to the network the task becomes significantly more difficult. If an attack is identified on ...

Linear layout of graphs/digraphs is one of the classical and important optimization problems that have many practical applications. Recently Tamaki proposed an O(mn)-time and O(n)space algorithm for testing whether the pathwidth (or vertex separation) of a given digraph with n vertices and m edges is at most k. In this paper, we show that linear layout of digraphs with an objective function suc...

Despite advances in CAD tools, layout errors resulting in electrical shorts between complex nets continue to cause trouble in many VLSI design projects. Locating the geometrical features causing shorts is often the most vexing problem faced during the layout verification process. Although this problem is common and important, there seems to be no published literature dealing with short location...

The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when drawn on a piece of paper, appeals to human understanding. The tree-layout problem, which seems inherently sequential at the first glance, can be solved by a data-parallel algorithm. It takes O (height * log width ) time on width pro33333333333333333333333333333 This work was supported in part by Nat...

As networks and their structure have become a major field of research, a strong demand to visualize these networks has emerged. We address this challenge by formalizing the well established spring layout in terms of dynamic equations. We thus opening up the design space for new algorithms. Drawing from the knowledge of systems design, we derive a layout algorithm that remedies several drawbacks...

This paper introduces a novel approach to the drawing of threedimensional graphs: the geometric approach. Graphs are decomposed into building elements that can easily be drawn as a geometric shape. Those elements are linked together in order to form the final layout. The proposed algorithm, Geo3D, has been implemented in the Java language and has been used to produce VRML models of the input gr...

We present and contrast several efficient two-dimensional packing algorithms for specified aspect ratio. These near-linear algorithms are based on strip packing, tiling, and alternate-bisection methodologies and can be used in the layout of disconnected objects in graph visualization. The parameters that affect the performance of these algorithms as well as the circumstances under which they pe...

Certain manufacturing steps in very deep submicron VLSI involve chemical-mechanical polishing (CMP) which has varying e ects on device and interconnect features, depending on local layout characteristics. To reduce manufacturing variation due to CMP and to improve yield and performance predictability, the layout needs to be made uniform with respect to certain density criteria, by inserting \ l...

In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same vertex set. We designed and implemented three different algorithms for simultaneous graphs drawing and three different visualization schemes. The algorithms are based on a modification of the force-directed algorithm that allows us to take into account ve...

To reduce manufacturing variation due to chemicalmechanical polishing and to improve yield, layout must be made uniform with respect to density criteria. This is achieved by layout postprocessing to add ll geometries, either at the foundry or, for better convergence of performance veri cation ows, during layout synthesis [10]. This paper proposes a new min-variation objective for the synthesis ...