In interactive visualization, selection techniques such as dynamic queries and brushing are used to specify and extract items of interest. In other words, users define areas of interest in data space that often have a clear semantic meaning. We call such areas Semantic Zones, and argue that support for their manipulation and reasoning with them is highly useful during exploratory analysis. An i...

will be uncorrelated, since 〈ĉĉ〉 − 〈ĉ〉〈ĉ〉 = I. 〈ĉ〉 = Mc, so the new window function matrix will be M. However, whereas the window functions of the original power estimates (the rows of F) are always well-behaved (they are always non-negative, and are generally quite narrow, as shown in the top panel of Figure 1), there is no guarantee that the same will hold for the new window functions. As was...

This paper proposes an approach which allows users to edit natural language fragments given by the system and to obtain a pseudonatural language text describing the meaning of the intended query. Algorithms presented here translate manipulations on the pseudonatural language text being edited intro changes on a query hypergraph as its internal representation, calculate possible quantifier scope...

A parallel adder which is optimal in both delay and size under left-to-right input arrival is proposed. The delay is the computation time after the arrival of the nal input bits. The proposed adder is composed of a carry select adder (CSA) and a small adder based on the on-they conversion (OTFA). Parallel computation in the CSA and the OTFA which make full use of the delay of the input arrival ...

SQL standard provides SQL/XML publishing functions to publish the result of an SQL query as XML values but it does not provide any SQL/XML publishing function that can publish the result of a recursive SQL query as recursively structured XML values. Therefore, to publish transitively connected relational tuples as recursively structured XML values with the use of appropriate SQL/XML publishing ...

Assume that we have an SQL query containing joins and a group by The standard way of evaluating this type of query is to rst perform all the joins and then the group by operation However it may be possible to perform the group by early that is to push the group by operation past one or more joins Early grouping may reduce the query processing cost by reducing the amount of data participating in...

We describe a technique and a tool called Qex for generating input tables and parameter values for a given parameterized SQL query. The evaluation semantics of an SQL query is translated into a specific background theory for a satisfiability modulo theories (SMT) solver as a set of equational axioms. Symbolic evaluation of a goal formula together with the background theory yields a model from w...

RÉSUMÉ. En informatique ambiante, les objectifs de l’utilisateur peuvent émerger opportunément. Il devient, dès lors, nécessaire de savoir générer à la volée des systèmes interactifs. Un système interactif est composé d’un noyau fonctionnel et d’une Interface Homme-Machine (IHM). Cet article traite de la composition d’IHM pour un objectif utilisateur et un contexte d’usage (utilisateur, plate-f...

A simple sql statement can be used to search learning or rule in relational database for data mining purposes particularly for classification rule. With just only one simple sql statement, characteristic and classification rule can be created simultaneously. Collaboration sql statement with any other application software will increase the ability for creating t-weight as measurement the typical...

........................................................................................................................7 Table of