The degree of locality of a program reeects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs by reducing the communication costs. A possible human approach to locality optimization is to consider several small program instances of a given program, nd optimal or close to optimal mappings of data and computations for the...

Thanks to the increasing popularity of location-based social networks, a large amount of user-generated geo-referenced check-in data is now available, and such check-in data is becoming a new data source in the study of mobility and travel. Conventionally, spatial interactions between places were measured based on the trips made between them. This paper empirically investigates the use of socia...

There has been considerable work done in the study of Web reference streams: sequences of requests for Web objects. In particular, many studies have looked at the locality properties of such streams, because of the impact of locality on the design and performance of caching and prefetching systems. However, a general framework for understanding why reference streams exhibit given locality prope...

For ontology reuse and integration, a number of approaches have been devised that aim at identifying modules, i.e., suitably small sets of “relevant” axioms from ontologies. Here we consider three logically sound notions of modules: MEX modules, only applicable to inexpressive ontologies; modules based on semantic locality, a sound approximation of the first; and modules based on syntactic loca...

We study Gaifman locality and Hanf locality of an extension of first-order logic with modulo p counting quantifiers (FO+MODp, for short) with arbitrary numerical predicates. We require that the validity of formulas is independent of the particular interpretation of the numerical predicates and refer to such formulas as arb-invariant formulas. This paper gives a detailed picture of locality and ...

Locality-Constrained Discriminative Learning and Coding Report Title This paper explores the enhancement by locality constraint to both learning and coding schemes, more specifically, discriminative low-rank dictionary learning and auto-encoder. Previous Fisher discriminative based dictionary learning has led to interesting results by learning more discerning sub-dictionaries. Also, the low-ran...

Locality notions in logic say that the truth value of a formula can be determined locally, by looking at the isomorphism type of a small neighborhood of its free variables. Such notions have proved to be useful in many applications. They all, however, refer to isomorphism of neighborhoods, which most local logics cannot test. A stronger notion of locality says that the truth value of a formula ...

This paper evaluates the Triplet Based Architecture, TriBA – a new idea in chip multiprocessor architectures and a class of Direct Interconnection Network (DIN). TriBA consists of a 2D grid of small, programmable processing units, each physically connected to its three neighbors so that advantageous features of group locality can be fully and efficiently utilized. Any communication model can be...

The degree of locality of a program re ects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs by reducing the communication costs. A possible human approach to locality optimization is to consider several small program instances of a given program, nd optimal or close to optimal mappings of data and computations for the...

Choosing representations and operators that preserve locality between genotype and phenotype space is an important goal in EA design. In the GA literature there has been considerable discussion of this issue with respect to the choice between standard binary encoding and Gray codes. In this paper we argue that an important and unappreciated aspect of such discussions is the degree to which loca...