Grid computing focuses on large-scale resource sharing. Using a general reliability model for grid computing to relax some impractical assumptions, a heuristic algorithm is presented to evaluate grid program/service reliability. The heuristic algorithm is based on two heuristic criteria that determine the significance of an entity and prune those insignificant ones. Through algorithm analysis, the heuristic algorithm is shown to have a linear complexity. This is much better than the previous algorithms, which are of exponential complexity. Another advantage of the heuristic algorithm is that the running time is controllable by adjusting the parameter of significant level (SL) and significant rate. A regression method is proposed to adjust the SL and predict the running time. Two examples are given

This work achieves full registration of scenes in a large area and creates visual indexes for visualization in a digital city. We explore effective mapping, indexing, and display of scenes so that an area becomes visible. Users can virtual navigate city on the Internet and achieve real guidance with a PDA. Extended images such as route panoramas, scene tunnels, panoramic views and spherical views are acquired in an urban area and associated with geospatial locations. A 3D LIDAR elevation map is used to generate a scanning plan based on visibility, image properties, and importance of scenes. Scanning scenes along streets and at spots of interest allows for compact and complete visual data collection. To access city information, visual indexes from scenes to spaces are created pervasively for flexible space exploration and transition. To visualize a space seamlessly in a large view frame and synchronize scenes with the virtual movement in the map, we stream image data on the Internet. An engine is developed for continuous space traversing, accessing spatial information, and transiting between spaces through visual links. A real urban area has been modeled to verify the effectiveness of such a system.

Grid is a type of large-scale distributed system. This paper develops a fast algorithm to efficiently evaluate the grid program/service reliability. It is shown to have a linearly increasing complexity. Compared to the previous exponential algorithms, it broadens the applicability of the generic model into large/complex grid service problems. Moreover, the running time of the fast algorithm is controllable. A regression method is proposed to predict and manage running time.

This work creates a complete view index of an area for seamless visual guidance in the cyber world. The goal is to generate continuous route views that direct people to their destination. In addition to a route map, continuous scenes will be displayed to effectively guide virtual and real trips. We employ compact and seamless image media such as route panoramas and panoramic views in the scene registration. A uniformed framework of space indexing is developed to visualize information in various spaces. View-to-space indexes allow in-depth transitions from a global space to local spaces, and transitions between adjacent spaces. The information of the same format can be displayed on different platforms such as WWW and wireless PDA. An urban area has been modeled to implement the proposed scheme of view indexing.

This paper introduces an effort to build a cyber town from geographically separated routes. It brings streets distributed in different cities and countries together for people to traverse the space, learn history, understand living style, etc. The town is constructed by using our developed technology - route panorama and data acquired at several places. We design a flexible and comprehensive indexing scheme for connecting routes at crossings, and linking Web contents from routes. User can wander around from one route to another, and enter buildings to visit museums and sites with specific topics. This design gives a unique style for virtual exhibition of real scenes and provides cross-culture environment for visit on the Internet.