A reduced-reference perceptual image and video quality metric based on edge preservation

In image and video compression and transmission, it is important to rely on an objective image/video quality metric which accurately represents the subjective quality of processed images and video sequences. In some scenarios, it is also important to evaluate the quality of the received video sequence with minimal reference to the transmitted one. For instance, for quality improvement of video transmission through closed-loop optimisation, the video quality measure can be evaluated at the receiver and provided as feedback information to the system controller. The original image/video sequence-prior to compression and transmission-is not usually available at the receiver side, and it is important to rely at the receiver side on an objective video quality metric that does not need reference or needs minimal reference to the original video sequence. The observation that the human eye is very sensitive to edge and contour information of an image underpins the proposal of our reduced reference (RR) quality metric, which compares edge information between the distorted and the original image. Results highlight that the metric correlates well with subjective observations, also in comparison with commonly used full-reference metrics and with a state-of-the-art RR metric. © 2012 Martini et al

The All-Data-Based Evolutionary Hypothesis of Ciliated Protists with a Revised Classification of the Phylum Ciliophora (Eukaryota, Alveolata)

This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article's Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/ The file attached is the published version of the article

Optimization of the ScaLAPACK LU Factorization Routine Using Communication/Computation Overlap

This paper presents some works on the ScaLAPACK LU factorization. First, a complexity analysis is given. It allows to compute the optimal block size for the block scattered distribution used in ScaLAPACK LU . It also gives the communication phases that are interesting to overlap. Second, two optimizations based on computations/communications overlap are given with experimental results on Intel Paragon system

Simulation d'écoulement tridimensionnel autour d'une aile de parapente.

This report presents our work for the design, model and implementation of a 3D air flow simulation software using the singularity method. The aim was the computation of the performance parameters of a wing at different speeds (between 10-60 km/h) with perfect uncompressible fluid and permanent flow hypothesis in order to help out with the design of paragliders. Sections 1 and 2 presents the model, design and the implementation and the results we obtained are in section 3.Ce rapport présente le modèle, la conception et l'implémentation d'un code tridimensionnel de simulation d'écoulement de fluide utilisant la méthode des singularités. Notre but était de calculer les paramètres d'une aile à différentes vitesses (comprises entre 10 et 60 km/h) avec des hypothèses de fluide parfait incompressible en écoulement permanent pour pouvoir améliorer la conception de parapentes. Les chapitres 1 et 2 présentent le modèle, la conception et l'implémentation. Le chapitre 3 apporte une validation du code et les résultats obtenus

© World Scientific Publishing Company ON THE CONVERGENCE OF COMPUTATIONAL AND DATA GRIDS

Great advances in high-performance computing have given rise to scientific applications that place large demands on software and hardware infrastructures for both computational and data services. With these trends the necessity has emerged for distributed systems developers that once distinguished between these elements to acknowledge that indeed computational and data services are tightly coupled and need to be addressed simultaneously. In this article, we compile and discuss several strategies and techniques, like co-scheduling and co-allocation of computational and data services, dynamic storage capabilities, and quality-of-service, that can be used to help resolve some of the aforementioned issues. We present our interactions with a distributed computing system, NetSolve, and a Distributed Storage Infrastructure, IBP, as a case study of how some of these techniques can be effectively deployed and offer experimental evidence from early prototypes that validate our motivation and direction

References

[6] S.L. Johnnson. Communication efficient basic linear algebra computations on hypercube architectures. JPDC, 4:133-172, 1987. [7] S.L. Johsson and Ching-Tien Ho. Optimum broadcasting and personalized communi-cation in hypercubes. IEEE Trans. Comput., 38:1249-1268, 1989. [8] Y. Saad and M.H. Schultz. Data communications in hypercubes. JPDC, 6:115-135

Simulation d'ecoulement tridimensionnel autour d'une aile

Theme 1 - Reseaux et systemes. Projet ReMaPAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1997 n.3091 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueSIGLEFRFranc