矩形无效块模型可以用来解决网格下的容错路由问题，最小连接块（MCC）模型是它的一个改良模型。本文在MCC基础上，建立MCC 重叠图，当发现不存在曼哈顿路径的时候，给出一套算法，来计算出一条避免无效块的尽可能短的路径。模拟试验表明，通过这种算法找到的路径，与最短路径相差很小。相比起花费更多的时间去找寻最短路径，这种启发式容错算法无疑是更好的选择。

Midimew networks[4] are mesh-connected networks derived from a subset of degree-4 circulant graphs. They have minimum diameter and average distance among all degree-4 circulant graphs, and are better than some of the most common topologies for parallel corr puters in terms of various cost measures. Among the many midimew networks, the rectangular ones appear to be most suitable for practical implementation. Unfortunately, with the normal way of laying out these networks on a 2D plane, long cross wires that grow with the size of the network exist. In this paper, we propose ways to lay out rectangular midimew networks in a 2D grid so that the length of the longest wire is at most a small constant. We prove that these constants are optimal under the assumption that rows and columns are moved as a whole during the layout process.

Most Internet search engines are keyword-based. They are not efficient for the queries where geographical location is important, such as finding hotels within an area or close to a place of interest. A natural interface for spatial searching is a map, which can be used not only to display locations of search results but also to assist forming search conditions. A map-based search engine requires a well-designed visual interface that is intuitive to use yet flexible and expressive enough to support various types of spatial queries as well as aspatial queries. Similar to hyperlinks for text and images in an HTML page, spatial objects in a map should support hyperlinks. Such an interface needs to be scalable with the size of the geographical regions and the number of websites it covers. In spite of handling typically a very large amount of spatial data, a map-based search interface should meet the expectation of fast response time for interactive applications. In this paper we discuss general requirements and the design for a new map-based web search interface, focusing on integration with the WWW and visual spatial query interface. A number of current and fuhrre research issues are discussed, and a prototype for the University of Queensland is presented.

There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(log n) hops per lookup request with O(log n) neighbors per node, where n is the network size. In this paper, we present a constant-degree P2P architecture, namely Cycloid, which emulates a cube-connected cycles (CCC) graph in the routing of lookup requests. It achieves a time complexity of O(d) per lookup request by using O(1) neighbors per node, where n=d

Preparata and Vuillemin proposed the cube-connected cycles (CCC) and its compact layout in 1981[17]. We give a new layout of the CCC which uses less than half the area of the Preparata-Vuillemin layout. We also give a lower bound on the layout area of the CCC. The area of the new layout deviates from this bound by a small constant factor. If we "unfold" the cycles in the CCC, the resulting structure can be laid out in optimal area.