A new method for increasing LDR in deep drawing is application of anti-lock braking system (ABS) on blank holder. In this method, instead of applying a constant force on blank and control the metal flow, the ABS system holds and releases the blank several times (20 to 50 times) which results increasing LDR. This study investigates the effect of different parameters of ABS on improving the condi...

A new method for increasing LDR in deep drawing is application of anti-lock braking system (ABS) on blank holder. In this method, instead of applying a constant force on blank and control the metal flow, the ABS system holds and releases the blank several times (20 to 50 times) which results increasing LDR. This study investigates the effect of different parameters of ABS on improving the condi...

Deep drawing of two-layer sheet is a suitable way to achieve product with a desired shape and desired properties in sheet metal forming technology. Control of deep drawing parameter such as thinning is the most important challenge in this process. The most difficult part of this challenge is differences in material properties and geometry of each layer. In this paper, numerical approach has bee...

Spring algorithms are regarded as eeective tools for visualizing undirected graphs. One major feature of applying spring algorithms is to display symmetric properties of graphs. This feature has been connrmed by numerous experiments. In this paper, rstly we formalize the concepts of graph symmetries in terms of \reeectional" and \rotational" automorphisms; and characterize the types of symmetri...

In medicine, genetics, criminology and various other areas, Venn and Euler diagrams are used to visualize data set relations and their cardinalities. The data sets are represented by closed curves and the data set relationships are depicted by the overlaps between these curves. Both the sets and their intersections are easily visible as the closed curves are preattentively processed and form co...

Abstract. We explore various techniques to incorporate grid-like layout conventions into a force-directed, constraint-based graph layout framework. In doing so we are able to provide high-quality layout—with predominantly axis-aligned edges—that is more flexible than previous gridlike layout methods and which can capture layout conventions in notations such as SBGN (Systems Biology Graphical No...

A Lombardi drawing of a graph is defined as one in which vertices are represented as points, edges are represented as circular arcs between their endpoints, and every vertex has perfect angular resolution (angles between consecutive edges, as measured by the tangents to the circular arcs at the vertex, all have the same degree). We describe two algorithms that create “Lombardi-style” drawings (...

Understanding the structure, dynamics, and evolution of large graphs is becoming increasingly important in a variety of fields. The demand for visual tools to aid in this process is rising accordingly. Yet, many algorithms that create good representations of small and medium-sized graphs do not scale to larger graph sizes. The exploitation of the massive computational power provided by parallel...

We adapt multilevel, force-directed graph layout techniques to visualizing dynamic graphs in which vertices and edges are added and removed in an online fashion (i.e., unpredictably). We maintain multiple levels of coarseness using a dynamic, randomized coarsening algorithm. To ensure the vertices follow smooth trajectories, we employ dynamics simulation techniques, treating the vertices as poi...

PrEd [Ber00] is a force-directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties. The algorithm has a number of applications including: improving the layouts of planar graph drawing algorithms, interacting with a graph layout, and drawing Euler-like diagrams. The algorithm ensures that nodes do not cross edges during its execution. However, P...