Investigating ontogenetic space with developmental cell lineages

Development plays a significant role in biological evolution, and is likely to prove an effective route to overcoming the limitations of direct genotype-phenotype mappings in artificial evolution. Nonetheless, the relationship between development and evolution is complex and still poorly understood. One question of current interest concerns the possible role that developmental processes may play in orienting evolution. A first step towards exploring this issue from a theoretical perspective is understanding the structure of ontogenetic space: the space of possible genotype-phenotype mappings. Using a quantitative model of development that enables ontogenetic space to be characterised in terms of complexity, we show that ontogenetic landscapes have a characteristic structure that varies with genotypic properties.

Assessing Union Strategies in Indonesian Telecommunications Industry

This article explores the implementation of a comprehensive model of union strategy,consisting of union aims, union methods, union tactics, and level of decision-making (Gahan 1998). The analysis further employs the framework of Boxall and Haynes (1997) to assess the dominant strategy pattern of the unions. Empirical data are provided from a survey of seven national enterprise unions in the telecommunications industry in Indonesia. Research findings reveal that consultancy unionism is playing important roles in explaining the relationships among unions, workers, and employers. This pattern of strategy places more emphasis on servicing and limited partnership with employers. The stronger organising solidarity from their members may improve their partnership in the interest of union survival facing tough competition in the telecommunications business.

An efficient algorithm for partitioning parameterized polygons into rectangles

In this paper, we propose an algorithm for partitioning parameterized orthogonal polygons into rectangles. The algorithm is based on the plane-sweep technique and can be used for partitioning polygons which contain holes. The input to the algorithm consists of the contour of a parameterized polygon to be partitioned and the constraints for those parameters which reside in the contour. The algorithm uses horizontal cuts only and generates a minimum number of rectangles whose union is the original orthogonal polygon. The proposed algorithm can be used as the basis to build corner stitching data structure for parameterized VLSI layouts and has been implemented in Java programming language. Copyright © 2010 ACM, Inc.