Learn More
In this paper, an effective probability-based tile pre-fetching algorithm and a collaborative cache replacement algorithm for Web geographical information systems(Web GISs) are proposed. The proposed tile pre-fetching algorithm can approximate which tiles will be used in advance based on the global tile access pattern of all users and the semantics of query(More)
BACKGROUND Recent technical developments with high-resolution real-time 3 dimensional echocardiography (RT3DE) facilitate the acquisition of high quality images and the analysis of segmental volume-time curves (VTCs). AIMS To assess left ventricular (LV) asynchrony using the VTCs of 16 segments by RT3DE, and to evaluate accuracy compared to tissue Doppler(More)
We describe techniques for converting the intermediate code representation of a given program, as generated by a modern compiler, to another representation which produces the same run-time results, but can run faster on a superscalar machine. The algorithms, based on novel parallelization techniques for <italic>Very Long Instruction Word (VLIW)</italic>(More)
With the growth of internet usage, many kinds of useful data are served in the internet. Geographic data such as a map is one of them. However since geographic data is usually very huge, it needs special treatment in serving. One useful technique is tiling. For example, a map is divided into smaller pieces called a tile, and served tile by tile. Since the(More)
Setting up an IDS architecture on ad-hoc network is hard because it is not easy to find suitable locations to setup IDS's. One way is to divide the network into a set of clusters and put IDS on each cluster head. However traditional clustering techniques for ad-hoc network have been developed for routing purpose, and they tend to produce duplicate nodes or(More)
Even though the ideal split policy for M-tree should determine which two routing objects are promoted so that the two partitioned regions would have minimum volume and minimum overlapped space, the previously proposed split algorithms must fail to achieve the goal since they select the actual entries from overflow entries as the routing objects to be(More)