Search results for "layout"
showing 10 items of 48 documents
Optimal positioning of irregular shapes in stamping die strip
2010
The nesting of two-dimensional shapes is a common problem, where raw material has to be economically cut. As for the single-pass single-row strip layout, several algorithms, based on established methods, have been proposed. Moreover, it should be noticed that the optimum layout should also consider a few constraints, like grain orientation for subsequent forming operation, correct bridge width, and the commercial roll of metal width in order to make solutions applicable in real industrial environments. Most of the procedures until now shown in literature are quite complex and often ignore these real constraints. They usually make use of sliding techniques and are not able to effectively wor…
A multi objective genetic algorithm for the facility layout problem based upon slicing structure encoding
2012
This paper proposes a new multi objective genetic algorithm (MOGA) for solving unequal area facility layout problems (UA-FLPs). The genetic algorithm suggested is based upon the slicing structure where the relative locations of the facilities on the floor are represented by a location matrix encoded in two chromosomes. A block layout is constructed by partitioning the floor into a set of rectangular blocks using guillotine cuts satisfying the areas requirements of the departments. The procedure takes into account four objective functions (material handling costs, aspect ratio, closeness and distance requests) by means of a Pareto based evolutionary approach. The main advantage of the propos…
Fillets:Cues for connections in Focus+Context views of graph-like diagrams
2003
We apply fillets-smoothing of sharp angles at the joints-between the connections and nodes of graph-like diagrams. In situations where the graph layout is constrained, e.g. Focus+Context views or views where the coordinates of the nodes are informative, fillets can clarify the relationships considerably without altering the layout. A visual search experiment supports our hypothesis that with fillets it is considerably easier to perceive node-connection structures. We discuss algorithms with different tradeoffs for flexibility and performance for rendering these connections in a single pass using OpenGL.
Variable Neighborhood Search for the Vertex Separation Problem
2012
The vertex separation problem belongs to a family of optimization problems in which the objective is to nd the best separator of vertices or edges in a generic graph. This optimization problem is strongly related to other well-known graph problems; such as the Path-Width, the Node Search Number or the Interval Thickness, among others. All of these optimization problems are NP-hard and have practical applications in VLSI, computer language compiler design or graph drawing. Up to know, they have been generally tackled with exact approaches, presenting polynomial-time algorithms to obtain the optimal solution for speci c types of graphs. However, in spite of their practical applications, these…
Reducing the Human Effort in Text Line Segmentation for Historical Documents
2021
Labeling the layout in historical documents for preparing training data for machine learning techniques is an arduous task that requires great human effort. A draft of the layout can be obtained by using a document layout analysis (DLA) system that later can be corrected by the user with less effort than doing it from scratch. We research in this paper an iterative process in which the user only supervises and corrects the given draft for the pages automatically selected by the DLA system with the aim of reducing the required human effort. The results obtained show that similar DLA quality can be achieved by reducing the number of pages that the user has to annote and that the accumulated h…
Lietotāju telpu zonas iekārtojums publiskā bibliotēkā
2018
Bakalaura darba “Lietotāju telpu zonas iekārtojums publiskā bibliotēkā” mērķis ir izpētīt, vai lietotāju telpu zonas iekārtojums publiskā bibliotēkā atbilst Latvijā noteiktajiem normatīvajiem aktiem un lietotāju interesēm un vajadzībām. Pētījuma teorētisko bāzi veido pragmatisma teorija, kurā galvenais uzsvars ir prakses un teorijas apvienojums. Pragmatismā tiek uzskatīts, ka teorijas lietderīgums ir balstīts tajā, kāds ir tās praktiskais pielietojums. Izvirzītā mērķa sasniegšanai veikts pētījums, kurā kā datu vākšanas metodes izmantota dokumentu analīze, novērošana un daļēji strukturēta intervija. Pētījumā tika analizēta normatīvo aktu ievērošana publisko bibliotēku lietotāju telpu zonas i…
Thermal optimization of the Helium-Cooled Lithium Lead breeding zone layout design regarding TBR enhancement
2017
Abstract Within the framework of EUROfusion R&D activities, CEA-Saclay has carried out an investigation of the thermal and mechanical performances of alternative designs intended to enhance the Tritium Breeding Ratio (TBR) of the Helium-Cooled Lithium Lead (HCLL) Breeding Blanket (BB) for DEMO. Neutronic calculations performed on the 2014 DEMO HCLL baseline predicted a value of TBR equal to 1.07, lower than the required value of 1.1, necessary to ensure the tritium self-sufficiency of the breeding blanket taking into account uncertainties. In order to reach the TBR target, the strategy of the steel amount reduction inside the HCLL module breeding zone (BZ) has been followed by suppressing s…
A simple algorithm for drawing large graphs on small screens
1995
Viewing a large graph in limited display space has traditionally been accomplished using either reduced scale rendering of the graph or by attaching scrollbars to a view window which shows only a small portion of the entire graph. Recent work, however, has concentrated on integrating a locally detailed view with a globally scaled view. We present an algorithm for constructing a view which smoothly integrates local detail and global context in a single view window and describe user interaction with such a display.
Characterization of the consistent completion of analytic hierarchy process comparison matrices using graph theory
2019
Decision-making is frequently affected by uncertainty and/or incomplete information, which turn decision-making into a complex task. It is often the case that some of the actors involved in decision-making are not sufficiently familiar with all of the issues to make the appropriate decisions. In this paper, we are concerned about missing information. Specifically, we deal with the problem of consistently completing an analytic hierarchy process comparison matrix and make use of graph theory to characterize such a completion. The characterization includes the degree of freedom of the set of solutions and a linear manifold and, in particular, characterizes the uniqueness of the solution, a re…
Disconnected Graph Layout and the Polyomino Packing Approach
2002
Conference name: GD: International Symposium on Graph Drawing 9th International Symposium Date of Conference: 23–26 September 2001 We review existing algorithms and present a new approach for layout of disconnected graphs. The new approach is based on polyomino representation of components as opposed to rectangles. The parameters of our algorithm and their influence on the drawings produced as well as a variation of the algorithm for multiple pages are discussed. We also analyze our algorithm both theoretically and experimentally and compare it with the existing ones. The new approach produces much more compact and uniform drawings than previous methods. © Springer-Verlag Berlin Heidelberg …