It is often computationally advantageous to model space as a discrete set of points forming lattice grid. This technique particularly useful for difficult problems such quantum many-body systems. For reasons simplicity and familiarity, nearly all calculations have been performed on simple cubic lattices. Since the removal artifacts an important concern, it would be perform using more than one g...

Although researchers have devoted considerable attention to helping database users formulate queries, many users still find it challenging to specify queries that involve joining tables. To help users construct join queries for exploring relational databases, we propose ETable, a novel presentation data model that provides users with a presentation-level interactive view. This view compactly pr...

Because of the wealth of new phenomena which the condensates display, and the precision and flexibility with which they can be manipulated, interest in them has grown explosively in communities of atomic physics, quantum optics, and many-body physics. At least twenty groups have created condensates, and the publication rate on BoseEinstein condensation has soared following the discovery of the ...

Different auction-based approaches have been used to allocate resources in Grids, but none of them provide the design choice for a specific economic model while considering the interest of all participants in the market. In this paper, we implement an auction-based framework for producer and consumer matchmaking in an ad-hoc Grid. In ad-hoc Grids, where the availability of resources and tasks i...

The ambiguity of natural language can be an important source of creative concepts. In compositional languages, a many-to-many network of associations exists linking concepts by the polysemy and synonymy of utterances. This network allows utterances to represent the combination of concepts, forming new and potentially interesting compound meanings. At the same time, new experiences of external a...

One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the generic object recognition task where, for example, a collection of features at one scale (in one image) may correspond to a single feature at a coarser scale (in the second image). Generic object recognition therefore req...

Semantic matching is a fundamental step in implementing data sharing applications. Most systems automating this task however limit themselves to finding simple (one-to-one) matching. In fact, complex (many-to-many) matching raises a far more difficult problem as the search space of concept combinations is often very large. This article presents Indigo, a system discovering complex matching in t...

In this paper, we address the problem of planning the textual organization of instructions. We take the view that natural language generation (NLG) is a mapping process of diierent levels of conceptual and textual representations. Within this framework , we consider the mapping between the text's semantic representation and its rhetorical structure. We argue that such a mapping is not direct, b...