This paper presents a novel approach for theoretical estimation of power consumption in digital binary adders. Closed-form expressions for power consumption of four different types of binary adders – the ripple-carry adder, the Manchester adder, a multiplexor-based carry-select adder and an efficient tree-based look-ahead adder – are derived in terms of word-length and pre-computed technologysp...

We show how to translate expressions in a higher-order programming language into SQL queries. Somewhat surprisingly, we show that any suitable expression translates to a single SQL query, where the suitability is determined by a type-and-e ect check. Thus, unlike in Hollywood where a script-writer can never be sure a movie sequel will be popular, we show how to be sure that your SQL|written in ...

A type of bell-shaped compact high order window function ψ(x, y) is studied, and closed analytic and approximation formulas are derived for its Hankel transforms. Applications of these results are presented as fast algorithms for calculating dyadic Green’s functions for electromagnetic scattering in multilayered media. Numerical results in electromagnetics are provided to demonstrate the accura...

RÉSUMÉ. Un objectif du projet de recherches IsyCri (ANR-CSOSG) est de définir une architecture de système d’information collaboratif afin d’aider à la résolution d’une crise dans laquelle plusieurs partenaires sont impliqués. L’ambition est de faciliter la coordination des activités entre les partenaires dans un souci d’efficacité. La structure architecturale de la solution repose sur deux conc...

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...