Search results for "layout"
showing 10 items of 48 documents
Reverse electrodialysis: Applications
2016
Reverse electrodialysis (RED) technology has grown significantly in the last decade, gaining a fast increase in its technology readiness level and presenting some interesting examples of RED pilot systems operating under very different real environments. In this chapter, an overview of technological developments and piloting examples are reported. In particular, a short introduction is given on the historical trend of RED technology growth, followed by a careful analysis of which feed solutions can be adopted and how these can affect the process performance, potentials, and applications. Most prominent fluid dynamics aspects for the RED process are presented, highlighting how these can infl…
Browser independent content based image resizing for liquid web layouts
2010
A typical problem for webdesigners is to realize pages that can be potentially accessed from a number of display devices with different screen sizes and resolutions. Liquid layouts can help for this purpose. However, they can not typically be applied to images, which need to be rescaled or deformed. In both cases usability could be deteriorated. Content-aware image resizing techniques can help for this goal by rescaling the images to the desired width while preserving important image structures. This paper presents a content-aware resizing technique which can be seamlessly integrated into web pages without any effort from the user. The results from the system application prove its effective…
Data for: Decorous Combinatorial Lower Bounds for Row Layout Problems
2021
Files of the new randomly generated instancesnlengths of the departmentsmatrix with the transport weights THIS DATASET IS ARCHIVED AT DANS/EASY, BUT NOT ACCESSIBLE HERE. TO VIEW A LIST OF FILES AND ACCESS THE FILES IN THIS DATASET CLICK ON THE DOI-LINK ABOVE
Firefly algorithm based upon slicing structure encoding for unequal facility layout problem
2019
Finding the locations of departments or machines in a workspace is classified as a Facility Layout Problem. Good placement of departments has a relevant influence on manufacturing costs, work in process, lead times and production efficiency. This paper analyses the problem of allocating departments with restrictions in terms of unequal area and rectangular shape within a facility, in order to minimize the sum of material handling costs taking into account the satisfaction of the aspect ratio requested. In particular, we propose for the first time a Firefly Algorithm based on the slicing structure encoding. The proposed method was tested comparing the results obtained from other authors on t…
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…
A multi-objective approach to facility layout problem by genetic search algorithm and Electre method
2006
Abstract Classical approaches to layout design problem tend to maximise the efficiency of layout, measured by the handling cost related to the interdepartmental flow and to the distance among the departments. However, the actual problem involves several conflicting objectives hence requiring a multi-objective formulation. Multi-objective approaches, recently proposed, in most cases lead to the maximisation of a weighted sum of score functions. The poor practicability of such an approach is due to the difficulty of normalising these functions and of quantifying the weights. In this paper, this difficulty is overcome by approaching the problem in two subsequent steps: in the first step, the P…
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.
Design follows politics? The visualization of political orientation in newspaper page layout
2017
This article explores how the political orientation of newspapers is reflected in their page layout. The authors compare the layouts of five German national quality newspapers exemplarily and exploratively in a combination of quantitative and qualitative analyses. Dimensions of comparison are typography, size, colouration, quantity and arrangement of elements. Results show systematic differences between the page layouts of left-wing and right-wing newspapers. These differences are reflected in the contrast of traditional and contemporary styles and also in the use of ideologically charged typography and colours. In addition, the size of headlines seems to be dependent on political extremity…
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.
Bibliotēku iekārtojuma atbilstība Bibliotēku likumā noteiktajām prasībām
2016
Bakalaura darba „Bibliotēku iekārtojuma atbilstība Bibliotēku likumā noteiktajām prasībām” mērķis ir noskaidrot, vai publisko bibliotēku iekārtojums atbilst Latvijā noteiktiem normatīviem un Bibliotēku likumam. Lai realizētu bakalaura darbā izvirzīto mērķi, tika veikts jaukta tipa pētījums, kurā ir izmantotas kvalitatīvās un kvantitatīvās datu vākšanas metodes - dokumentu analīze, novērošana un daļēji strukturētā intervija. Iegūtie dati tiek analizēti no pragmatisma teorijas viedokļa. Pētījumā iegūtie rezultāti noved pie secinājumiem, ka bibliotēku iekārtojumā ir daļēji ievērotas normatīvajos dokumentos noteiktās prasības.