A composite-metaphor interface is a computer interface consisting of a combination of two or more metaphors. As computer systems have become more sophisticated, researchers have proposed the use of multiple metaphors to design computer systems because they would better match the characteristics of complex target systems; however, due to the difficulty of designing interface metaphors and limited research in this area, there are few guidelines or accepted standards for generating and implementing composite metaphors for interface design. In this paper, the authors propose an approach for designing composite metaphors. We first present the metaphor design strategies as we interviewed eight game designers, then summarise the design considerations from the metaphor literatures. Finally, we propose the design approach for selecting and combining metaphors in designing composite-metaphor interfaces.

Preserving cultural heritage and historic sites is an important problem. These sites are subject to erosion, vandalism, and as long-lived artifacts, they have gone through many phases of construction, damage and repair. It is important to keep an accurate record of these sites using 3-D model building technology as they currently are, so preservationists can track changes, foresee structural problems, and allow a wider audience to "virtually" see and tour these sites. Due to the complexity of these sites, building 3-D models is time consuming and difficult, usually involving much manual effort. This paper discusses new methods that can reduce the time to build a model using automatic methods. Examples of these methods are shown in reconstructing a model of the Cathedral of Ste. Pierre in Beauvais, France.

Scheduling algorithms for control dominated applialgorithm can be restricted to 0(pbn2 ), where p is the number of paths, b is the number of blocks and n is the number of operations.We tested the algorithm on a set of benchmarks and achieved reductions on the number of states as compared with previous algorithms.

In this paper, a new path selection heuristic search algorithm is proposed for connecting two components of vertices. A novel feature of the algorithm is that the active terminals (vertices in the net which are not yet connected) are modeled as magnets during the path searching process. The heuristic search algorithm is applied to two commonly used multi-terminal net tree connection algorithms. Experimental results show that the new path selection heuristic search algorithm is better than the other algorithms which do not consider the active terminals.