In this paper an algorithm is presented to store and process fully adaptive computational grids requiring only a minimal amount of memory. The adaptive grid is specified by a recursive bisection of triangular grid cells. The cells are stored and processed in an order specified by the Sierpinski space-filling curve. A sophisticated system of stacks is used to ensure cache-efficient access to the...

Existing map deformation techniques are mainly based on uniform grids and can be insufficient for real-time demands. For higher flexibility of allocating resolutions, we propose to use a content-aware non-uniform grid. Our contentaware non-uniform grid leads to adaptive resolutions on the map deformation. This adaptive approach results in both higher road deformability and performance. We imple...

Medial entorhinal grid cells and hippocampal place cells provide neural correlates of spatial representation in the brain. A place cell typically fires whenever an animal is present in one or more spatial regions, or places, of an environment. A grid cell typically fires in multiple spatial regions that form a regular hexagonal grid structure extending throughout the environment. Different grid...

ÐQuadtree-based adaptive Cartesian/Quad (quadrilateral) grid generator, grid adaptor and ̄ow solver have been developed and fully demonstrated in this study. Given the de®nition of geometries (cubic B-splines and straight line segments), geometrically-adaptive, body-®tted Quad grids are generated automatically. These grids are then overlapped with a large Cartesian cell which is subdivided recur...

Clustering is a key data mining problem. Density and grid based technique is a popular way to mine clusters in a large multi-dimensional space wherein clusters are regarded as dense regions than their surroundings. The attribute values and ranges of these attributes characterize the clusters. Fine grid sizes lead to a huge amount of computation while coarse grid sizes result in loss in quality ...

Dynamic load balancing is considered in the context of adaptive multilevel methods for partial differential equations on distributed memory multiprocessors. An approach that periodically repartitions the grid is taken. The important properties of a partitioning algorithm are presented and discussed in this context. A partitioning algorithm based on the refinement tree of the adaptive grid is pr...

This paper argues that the assumption of end-to-end QoS provision for use in Grid based applications is unsafe. We present an architecture which provides an adaptive QoS service for GRID applications which are prepared to adapt rather than assume the best and then suffer the worst. This is particularly relevant to Internet based GRIDs. An example application from the field of collaborative lear...

In this paper, we discuss the design and implementation of an adaptive visualization platform effectively supporting Grid-enabled visualintensive applications such as mechanical CAD, medical, virtual heritage and etc across heterogeneous network of computing resources. In our preliminary design of the visualization platform, we choose to focus on the study of the adaptive strategies and caching...

This paper illustrates the use of moving mesh methods for solving partial differential equation (PDE) problems in Q-tensor theory of liquid crystals. We present the results of an initial study using a simple one-dimensional test problem which illustrates the feasibility of applying adaptive grid techniques in such situations. We describe how the grids are computed using an equidistribution prin...

Three-phase four-wire grid-forming (GFM) inverters are promising to interface distributed energy resources into low-voltage networks. However, these prone overcurrent under grid faults. Physically increasing the inverter current capacity is not cost-effective cope with complicated fault conditions. In this article, an adaptive ride-through (FRT) scheme based on instantaneous saturators and virt...