Estimation of tolerance relation on the basis of multiple pairwise comparisons with random errors
Estudio de algunas secuencias pseudoaleatorias de aplicación criptográfica.
Pseudorandom binary sequences are required in stream ciphers and other applications of modern communication systems. In the first case it is essential that the sequences be unpredictable. The linear complexity of a sequence is the amount of it required to define the remainder. This work addresses the problem of the analysis and computation of the linear complexity of certain pseudorandom binary sequences. Finally we conclude some characteristics of the nonlinear function that produces the sequences...
Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées
Étude des spécifications modulaires : constructions de colimites finies, diagrammes, isomorphismes
Étude des spécifications modulaires : constructions de colimites finies, diagrammes, isomorphismes. Partie II
Étude des spécifications modulaires : constructions de colimites finies, diagrammes, isomorphismes. Partie III
Étude et implémentation d'un système de déduction pour logique algorithmique
Étude spectrale de la multiplication -adique
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
EuDML—Towards the European Digital Mathematics Library
The paper describes the background, the expected functionalities, and the architecture design goals of the European Digital Mathematics Library (Eu-DML), an infrastructure system aimed to integrate the mathematical contents available online throughout Europe, allowing for both extensive and specialized mathematics resource discovery. The three years long project to build the EuDML, partially funded by the European Commission, started in February 2010.
Euler's Polyhedron Formula
Euler's polyhedron theorem states for a polyhedron p, thatV - E + F = 2,where V, E, and F are, respectively, the number of vertices, edges, and faces of p. The formula was first stated in print by Euler in 1758 [11]. The proof given here is based on Poincaré's linear algebraic proof, stated in [17] (with a corrected proof in [18]), as adapted by Imre Lakatos in the latter's Proofs and Refutations [15].As is well known, Euler's formula is not true for all polyhedra. The condition on polyhedra considered...
E-unification by means of tree tuple synchronized grammars.
Evaluating a weighted graph polynomial for graphs of bounded tree-width.
Evaluating many valued modus ponens
This paper deals with many valued case of modus ponens. Cases with implicative and with clausal rules are studied. Many valued modus ponens via discrete connectives is studied with implicative rules as well as with clausal rules. Some properties of discrete modus ponens operator are given.
Evaluating scientific products by means of citation-based models: a first analysis and validation.
Evaluating the Kernighan-Lin heuristic for hardware/software partitioning
In recent years, several heuristics have been proposed for the hardware/software partitioning problem. One of the most promising directions is the adaptation of the Kernighan-Lin algorithm. The Kernighan-Lin heuristic was originally developed for circuit partitioning, but it has been adapted to other domains as well. Moreover, numerous improvements have been suggested so that now several variants of the original algorithm exist. The aim of this paper is to systematically evaluate the possibilities...
Evaluation of educational effects of the solid simulator.
Even kernels.
Event-Based Proof of the Mutual Exclusion Property of Peterson’s Algorithm
Proving properties of distributed algorithms is still a highly challenging problem and various approaches that have been proposed to tackle it [1] can be roughly divided into state-based and event-based proofs. Informally speaking, state-based approaches define the behavior of a distributed algorithm as a set of sequences of memory states during its executions, while event-based approaches treat the behaviors by means of events which are produced by the executions of an algorithm. Of course, combined...
Every commutative quasirational language is regular