Wrappers provide access to heterogeneous information sources by converting application queries into source specific queries or commands. In this paper we present a wrapper implementation toolkit that facilitates rapid development of wrappers. We focus on the query translation component

We present the lifting scheme, a simple construction of second generation wavelets, wavelets that are not necessarily translates and dilates of one fixed function. Such wavelets can be adapted to intervals, domains, surfaces, weights, and irregular samples. We show how the lifting scheme leads

This paper examines the current limitations imposed various page table mechanisms to the virtual address space concept. It also estimates to what extent sparsity, granularity, hierarchy, sharing and scalability of virtual address spaces might be improved. From this point of view, the mechanisms of multi-level, inverted and guarded page tables are analyzed. The results show that the requirements of sparsity, fine granularity, inexpensive sharing and fast operations on large address space regions can all be satisfied by guarded page tables. However, traditional multi-level and inverted page tables each exhibit certain limitations with respect to these requirements. Related problems concerning TLBs, caches and OS book-keeping are pointed out but not discussed.

. We introduce a new point of view into database schemes by applying systematically an old logical technique: translation schemes, and their induced formula and structure transformations. This allows us to re-examine the notion of dependency preserving decomposition and its generalization

for determining just how large is actually possible; this theory rests on Delsarte’s thesis [4], which showed how to use schemes to translate the problem into a question that be solved by linear programming.

This paper introduces stacked generalization, a scheme for minimizing the generalization error rate of one or more generalizers. Stacked generalization works by deducing the biases of the generalizer(s) with respect to a provided learning set. This deduction proceeds by generalizing in a second

heterogeneous XML data sources, there is a high possibility that these documents do not all conform to the same schema assumed by the user, thus causing the query to fail. In this paper, we try to solve this query and data schema mismatching problem by proposing a query translation scheme. Without attempting

Current research in parallel programming is focused on closing the gap between globally indexed algorithms and the separate address spaces of processors on distributed memory multicomputers. A set of index translation schemes have been implemented as a part of CHAOS runtime support library, so

SUMMARY MicroRNAs (miRNAs) are small noncoding regulatory RNAs that reduce stability and/or translation of fully or partially sequencecomplementary target mRNAs. In order to identify miRNAs and to assess their expression patterns, we sequenced over 250 small RNA libraries from 26 different organ

To ensure the re-use of domain ontologies the usual approach relies on a pivot language, e.g., Kif, into and from which the domain ontology is translated. This requires several distinct trans-lators for the different target Knowledge Based System (KBS). We propose a solution which uses a unique