Variable Data Printing (VDP) refers to the process of generating and printing dynamic or personalized contents. A core technology required by highly customized VDP applications is the automatic document layout design engine, whose task is to adjust the original design or generate a new layout to present variable contents. This paper presents a novel document layout design engine, called Active ...

This paper describes the development of a process simulation model and integration of the Genetic Algorithms (GA) with the model as optimisation techniques using a case study of stockyard layout planning in precast concrete products industry. Genetic algorithms have been used for two purposes: firstly, to identify clusters of concrete products by analysing sales historical data such that freque...

ing the ADL problem There is a relationship between the problem of chip layout and display layout, since both can be abstracted as a graph-layout problem. It should be noted, however, that this abstraction is simplifying in both cases. A (directed or undirected) graph G = (N,E) consists of a finite set N of nodes and a finite set E of edges (ni,nj). The layout of a graph means the placement of ...

For single-source, single-tree-based peer-to-peer live media streaming, it is generally believed that a short (and wide) tree has a good comprehensive performance in terms of reliability and service delay. While the short tree directly benefits delay optimization, it is unclear whether such a structure maximizes tree reliability, which is sometimes more critical for a streaming Internet service...

We describe new, e cient algorithms for layout modi cation and phase assignment for dark eld alternating-type phase-shifting masks in the single-exposure regime. We make the following contributions. First, we give optimal and fast algorithms to minimize the number of phase con icts that must be removed to ensure 2-colorability of the con ict graph. These methods can potentially reduce runtime a...

Many algorithms for graph layout have been devised over the last 30 years spanning both the graph drawing and information visualisation communities. This article first reviews the advances made in the field of graph drawing that have then often been applied by the information visualisation community. There then follows a discussion of a range of techniques developed specifically for graph visua...

GPUs are able to provide a tremendous computational power, but their optimal usage requires the optimization of memory access. The many threads available can mitigate the long memory access latencies, but this usually demands a reorganization of the data and algorithm to reach the performance peak. The addressed problem is to know which data layout produces a faster evaluation when dealing with...

This research explores the double row layout problem (DRLP) that deals with how to place departments or machines on both sides of a central corridor. This type of layout problem is commonly observed in production and service facilities. Over the last 40 years, researchers have extensively studied a similar problem called the single row layout problem (SRLP) or one dimensional space allocation p...

The facility layout problem is a well researched one. However few effective and user friendly approaches have been proposed. Since it is an NP hard problem, various optimization approaches for small problems and heuristic approaches for the larger problems have been proposed. For the most part the more effective algorithms are not user friendly. On the other hand user friendly methods have not ...

Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such high demand storage servers are used as web servers or multimedia servers, for handling high demand for data. As the system is running, it needs to dynamically respond to changes in demand for different data items. There are known algorithms for mapping demand to a layout. When the demand ch...