Each regular code is included in a maximal regular code
EasyMSG : tools and techniques for an adaptive overlapping in SPMD programming
During the development of a parallel solver for Maxwell equations by integral formulations and Fast Multipole Method (FMM), we needed to optimize a critical part including a lot of communications and computations. Generally, many parallel programs need to communicate, but choosing explicitly the way and the instant may decrease the efficiency of the overall program. So, the overlapping of computations and communications may be a way to reduce this drawback. We will see a implementation of this techniques...
EasyMSG: Tools and techniques for an adaptive overlapping in SPMD programming
During the development of a parallel solver for Maxwell equations by integral formulations and Fast Multipole Method (FMM), we needed to optimize a critical part including a lot of communications and computations. Generally, many parallel programs need to communicate, but choosing explicitly the way and the instant may decrease the efficiency of the overall program. So, the overlapping of computations and communications may be a way to reduce this drawback. We will see a implementation of this...
Échanges de trois d'intervalles et suites sturmiennes
On appelle échange d’intervalles l’application qui consiste à réordonner les intervalles d’une partition de suivant une permutation donnée. Dans le cas des partitions en trois intervalles, nous donnons une caractérisation combinatoire des suites codant, d’après la partition définissant l’échange, l’orbite d’un point de sous l’action de cette transformation.
ECO species.
Edge Insertion for Optimal Triangulations.
Edge-disjoint Hamiltonian cycles in two-dimensional torus.
Edge-orthogonal patches through a given rational Bézier curve.
Edon- – an efficient implementation of Edon- family of cryptographic hash functions
We have designed three fast implementations of a recently proposed family of hash functions Edon–. They produce message digests of length bits and project security of hash computations for finding collisions and hash computations for finding preimages and second preimages. The design is not the classical Merkle-Damgård but can be seen as wide-pipe iterated compression function. Moreover the design is based on using huge quasigroups of orders , and that are constructed by using only bitwise...
Effective constructions of grammars
Effective reduction of Goresky-Kottwitz-MacPherson graphs.
Efficiency of automata in semi-commutation verification techniques
Computing the image of a regular language by the transitive closure of a relation is a central question in regular model checking. In a recent paper Bouajjani et al. [IEEE Comput. Soc. (2001) 399–408] proved that the class of regular languages – called APC – of the form
Efficiency of automata in semi-commutation verification techniques
Computing the image of a regular language by the transitive closure of a relation is a central question in regular model checking. In a recent paper Bouajjani et al. [IEEE Comput. Soc. (2001) 399–408] proved that the class of regular languages L – called APC – of the form UjL0,jL1,jL2,j...Lkj,j, where the union is finite and each Li,j is either a single symbol or a language of the form B* with B a subset of the alphabet, is closed under all semi-commutation relations R. Moreover a recursive...
Efficiency-conscious propositionalization for relational learning
Systems aiming at discovering interesting knowledge in data, now commonly called data mining systems, are typically employed in finding patterns in a single relational table. Most of mainstream data mining tools are not applicable in the more challenging task of finding knowledge in structured data represented by a multi-relational database. Although a family of methods known as inductive logic programming have been developed to tackle that challenge by immediate means, the idea of adapting structured...
Efficient algorithms on the Moore family associated to an implicational system.
Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling.
Efficient calculation of sensitivities for optimization problems
Sensitivity information is required by numerous applications such as, for example, optimization algorithms, parameter estimations or real time control. Sensitivities can be computed with working accuracy using the forward mode of automatic differentiation (AD). ADOL-C is an AD-tool for programs written in C or C++. Originally, when applying ADOL-C, tapes for values, operations and locations are written during the function evaluation to generate an internal function representation....
Efficient calculation of the Reed-Muller form by means of the Walsh transform
The paper describes a spectral method for combinational logic synthesis using the Walsh transform and the Reed-Muller form. A new algorithm is presented that allows us to obtain the mixed polarity Reed-Muller expansion of Boolean functions. The most popular minimisation (sub-minimisation) criterion of the Reed-Muller form is obtained by the exhaustive search of all the polarity vectors. This paper presents a non-exhaustive method for Reed-Muller expansions. The new method allows us to build the...
Efficient computation of addition chains
The aim of this paper is to present a unifying approach to the computation of short addition chains. Our method is based upon continued fraction expansions. Most of the popular methods for the generation of addition chains, such as the binary method, the factor method, etc..., fit in our framework. However, we present new and better algorithms. We give a general upper bound for the complexity of continued fraction methods, as a function of a chosen strategy, thus the total number of operations required...
Efficient distributed algorithms by using the archimedean time assumption