8720 articles  [english version]

Vous pouvez consulter et rechercher ici l'ensemble des rapports de recherche et rapports techniques de l'Inria déposées sur HAL ou sur HAL-Inria.
Pour déposer sur Hal-Inria: http://hal.inria.fr


Contact : archive-ouverte@inria.fr


Derniers rapports des équipes Inria




Publications HAL de la collection INRIA-RRRT

2014

Titre
Construction et validation des éléments Serendip associés á un carreau de degré arbitraire
Auteurs
Paul-Louis George; Houman Borouchaki; Nicolas Barral
Détail
[Research Report], 2014, pp. 107. RR-8572
Début du résumé
We give a method to constructing Serendipity elements for quads and hexes with full symmetry properties and indicate the reading of their shape functions. We show that, since the degree~5, the Serendipity elements are no longer symmetric but we propose a method resulting in a Lagrange element of degree 5 with full symmetry properties after adding an adequate number of additional nodes. On the other hand, we show how to guarantee the geometric validity of a given curved element (seen as a patch) of a mesh. This is achieved after writing the patch in a Bézier setting (Bernstein polynomials and .....
Accès au texte intégral et bibtex
RR-8572.pdf BibTex
Titre
Construction et validation des éléments réduits associés á un carreau simplicial de degré arbitraire
Auteurs
Paul-Louis George; Houman Borouchaki; Nicolas Barral
Détail
[Research Report], 2014, pp. 55. RR-8571
Début du résumé
We give a method to constructing Lagrange Serendipity (or reduced) simplices with a detailed description of the triangles of degree 3 and 4. We indicate that higher order triangles are not candidate apart if we impose a restricted polynomial space. We show that a tetrahedron of degree 3 is a candidate while high order elements are not candidate even if a restriction in the polynomial space is considered. In addition, we propose a method for the validation of such elements, in a given mesh, where the validation means the positiveness of the jacobian .....
Accès au texte intégral et bibtex
RR-8571.pdf BibTex
Titre
Can Homomorphic Cryptography ensure Privacy?
Auteurs
Antoine Guellier
Détail
[Research Report], 2014, pp. 111. RR-8568
Début du résumé
The advent of information technology, the dramatic increase of computational and storage capacities along with the development of worldwide communications promise very personalized, well designed and convenient services. However, although privacy is an important right in our societies, these services often neglect and abuse their consumers' privacy, by collecting sensible data notably. This work focuses on the protection of privacy in information systems. For this, it is known that traditional cryptography (e.g. encryption or signature schemes) is necessary, for instance to ensure confidentiality, but it is not sufficient. To enable usability and privacy at the same time, stronger tools are .....
Accès au texte intégral et bibtex
RR-8568.pdf BibTex
Titre
Personalized PageRank with Node-dependent Restart
Auteurs
Konstantin Avrachenkov url; Remco Van Der Hofstad url; Marina Sokol
Détail
[Research Report], 2014. RR-8570
Début du résumé
Personalized PageRank is an algorithm to classify the improtance of web pages on a user-dependent basis. We introduce two generalizations of Personalized PageRank with node-dependent restart. The first generalization is based on the proportion of visits to nodes before the restart, whereas the second generalization is based on the probability of visited node just before the restart. In the original case of constant restart probability, the two measures coincide. We discuss interesting particular cases of restart probabilities and restart distributions. We show that the both generalizations of Personalized PageRank have an elegant expression connecting the so-called direct and reverse Personalized .....
Accès au texte intégral et bibtex
RR-8570.pdf RR-8570.ps BibTex
Titre
Loop-based Modeling of Parallel Communication Traces
Auteurs
Alain Ketterlin; Matthieu Kuhn; Stéphane Genaud; Philippe Clauss
Détail
[Research Report], 2014, pp. 10. RR-8562
Début du résumé
This paper describes an algorithm that takes a trace of a distributed program and builds a model of all communications of the program. The model is a set of nested loops representing repeated patterns. Loop bodies collect events representing communication actions performed by the various processes, like sending or receiving messages, and participating in collective operations. The model can be used for compact visualization of full executions, for program understanding and debugging, and also for building statistical analyzes of various quantitative aspects of the program's behavior. The construction of the communication model is performed in two phases. First, a local .....
Accès au texte intégral et bibtex
RR-8562.pdf BibTex