Page layout

About: Page layout is a research topic. Over the lifetime, 2266 publications have been published within this topic receiving 23261 citations.

Automatic creation of alternative layouts using the same selected photos by applying special filters and/or changing photo locations in relation to creating the photobook

Abstract: A system and a method are disclosed for generating photo books using digital images by using pre-assigned templates and pre-assigned filters designed for a particular type of an event, such as weddings and portraits. The placement of the photos and subsequent processing of the photos using pre-defined templates and filters wherein by intelligently selecting and creating page spreads based on limited user information of a number of photos in a single page layout. Based on an original layout, present system and method provides alternate layouts wherein the same images are filtered and/or locations of the images are changed.

Method for automating top-down design processing for the design of LSI functions and LSI mask layouts

Abstract: A netlist between functional macros is entered. Based on the netlist, an outline layout process for a functional macro is performed and physical specifications for the functional macro are determined from an outline layout produced by the outline layout process. Thereafter, a logic synthesis process is performed on the basis of the physical specifications determined. Based on the outline layout, a logic, obtained by the logic synthesis, is laid out. This makes it possible to reduce the number of times a circuit synthesis process is redone, taking into account a laying-out at an upper-stage functional design process in which no gate level is specified. For this reason, an improved LSI automatic design method is provided which is able to complete an LSI layout design, in which the LSI area and the LSI delay value are optimized, in a short period of time.

The reconfiguration issue of stochastic facility layout design in cellular manufacturing systems

Abstract: Facility layout is one of the important stages in the design of cellular manufacturing systems. It concerns with the arrangement of facilities within the machine cells and the machine cells in the shop floor in such a way that provides an efficient layout. Globalisation and consequences of its high competition which have challenged the manufacturers by providing uncertain situations in the manufacturing environments, degrades the performance of the manufacturing systems. In this study, the effects of uncertainty in demand of products on the layout of facilities in a cellular manufacturing system have been investigated. For this purpose, a stochastic facility layout model has been proposed that minimises the total material handling cost (both inter-cell and intra-cell), and considers that demand has a normal distribution function. The model has been made more practical by considering the transfer batch size of products and operation sequence of parts. To validate the model, several cases have been demonstr...

Monarch Butterfly Optimization for Facility Layout Design Based on a Single Loop Material Handling Path

Abstract: Facility layout problems (FLPs) are concerned with the non-overlapping arrangement of facilities. The objective of many FLP-based studies is to minimize the total material handling cost between facilities, which are considered as rectangular blocks of given space. However, it is important to integrate a layout design associated with continual material flow when the system uses circulating material handling equipment. The present study proposes approaches to solve the layout design and shortest single loop material handling path. Monarch butterfly optimization (MBO), a recently-announced meta-heuristic algorithm, is applied to determine the layout configuration. A loop construction method is proposed to construct a single loop material handling path for the given layout in every MBO iteration. A slicing tree structure (STS) is used to represent the layout configuration in solution form. A total of 11 instances are tested to evaluate the algorithm’s performance. The proposed approach generates solutions as intended within a reasonable amount of time.