Springer Your dedication goes here Preface Physical design of integrated circuits is a fascinating and rapidly advancing discipline, situated between the obvious and the impossible. Its roots are in hand-drawn circuit layout, where experienced engineers are capable of performing any operation, but lack the productivity to handle multimillion-gate circuits. Design automation is achieved by devel...

Many developments have recently been made in mining dynamic networks; however, effective visualization of dynamic networks remains a significant challenge. Dynamic networks are typically visualized via a sequence of static graph layouts. In addition to providing a visual representation of the network topology at each time step, the sequence should preserve the “mental map” between layouts of co...

KCSS 2015/2 M ro Sönem nn Automatic layout is an important tool for the efficient use of graphical models in a model-driven engineering (MDE) context. Since the 1980s, research on graph layout methods has led to a multitude of different approaches, and several free software libraries for graph layout are available. However, today’s practically relevant MDE tools hardly reflect this diversity. T...

Dynamic graph layout refers to the layout of graphs that change over time. These changes are due to user interaction, algorithms, or other underlying processes determining the graph. Typically, users spend a noteworthy amount of time to get familiar with a layout, i.e. they build a mental map ELMS91]. To retain this map at least partially, consecutive layouts of similar graphs should not diier ...

In cellular networks, channels must be assigned to call requests so that interference constraints are respected and bandwidth is minimized. The number of call requests per cell is continually changing, making channel assignment naturally an online problem. We describe two new online channel assignment algorithms for networks based on a regular hexagonal layout of cells, where interference level...

Many researchers had worked on three dimensional (3D) optimization which presented results using numbers and graphs. This paper proposes a standard way to represent the solution naturally, in 3D graphical layout display based on OpenGL. Since container loading problem (CLP) is a common reference for 3D space optimization algorithms, we present a method to represent the 3D layout solution for CL...

The paper presents a model of designing of the flexible manufacturing system (FMS) in one or multiple rows with genetic algorithms (GAs). First the reasons for studying the layout of devices in the FMS are discussed. After studying the properties of the FMS and perusing the methods of layout designing the genetic algorithms methods was selected as the most suitable method for designing the FMS....

The need for bridging the ever growing gap between memory and processor performance has motivated research for exploiting the memory hierarchy effectively. An important software solution called code reordering produces a new program layout to better utilize the available memory hierarchy. Many algorithms have been proposed. They differ based on: 1) the code granularity assumed by reordering alg...

Effective layout pattern sampling is a fundamental component for lithography process optimization, hotspot detection, and model calibration. Existing pattern sampling algorithms rely on either vector quantization or heuristic approaches. However, it is difficult to manage these methods due to the heavy demands of prior knowledge, such as high-dimensional layout features and manually tuned hypot...

Abstract. When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightness of lines, graph topology, orthogonalities and proximities. A layout adjustment algorithm which can be used to create sheye views of nested graphs is introduced. The SHriMP (SimpleHierarchicalMulti-Perspective) vis...