POSTMODERNO RECIKLIRANJE FANTAZAMA U ROMANU DUBRAVKE UGREŠIĆ BABA JAGA JE SNIJELA JAJE (2008)

The paper focusses on three fantastic figures of the last book of Croatian author Dubravka Ugrešić Baba Jaga je snijela jaje 2008. (English translation: Baba Yaga Laid An Egg, Edinburgh: Canongate, 2009.), that is, the fantasies of birds, Baba Yaga and the egg. Thus, this work investigates how traditional imaginary figures have been recycled in the postmodern women writing. Interpretation is ran in the perspective of psychoanalytical theory, using single concepts of S. Freud, M. Klein, J. Lacan, J. Kristeva, Sl. Žižek, J. Buthler. Ugrešić’s fantastic images have been also compared with similar fantastic representations in film –. Hitchcock’s Birds, or in painting – F. Kahlo’s self-portrait. Research shows that, in comparison with their folklore archetypes, the recycled literary fantasies of Ugrešić have been basically inverted: they imply subversion and irony that are directed not only against the dominant models of public taste and the forms of contemporary “soft” ideologies but also against the traditional roles of reader, writer, critic and text as places where a narrative happens and a coherent meaning has to be produced

On the morphology of the electron-positron annihilation emission as seen by SPI/INTEGRAL

The 511 keV positron annihilation emission remains a mysterious component of the high energy emission of our Galaxy. Its study was one of the key scientific objective of the SPI spectrometer on-board the INTEGRAL satellite. In fact, a lot of observing time has been dedicated to the Galactic disk with a particular emphasis on the central region. A crucial issue in such an analysis concerns the reduction technique used to treat this huge quantity of data, and more particularly the background modeling. Our method, after validation through a variety of tests, is based on detector pattern determination per ~6 month periods, together with a normalisation variable on a few hour timescale. The Galactic bulge is detected at a level of ~70 sigma allowing more detailed investigations. The main result is that the bulge morphology can be modelled with two axisymmetric Gaussians of 3.2 deg. and 11.8 deg. FWHM and respective fluxes of 2.5 and 5.4 x 10^-4 photons/(cm^2.s^1). We found a possible shift of the bulge centre towards negative longitude at l=-0.6 +/- 0.2 degrees. In addition to the bulge, a more extended structure is detected significantly with flux ranging from 1.7 to 2.9 x10^-3 photons/(cm^2.s^1) depending on its assumed geometry (pure disk or disk plus halo). The disk emission is also found to be symmetric within the limits of the statistical errors.Comment: This paper has 12 pages and 14 figures. Accepted for publication by the Astrophysical Journa

Parallel triangular solution in the out-of-core multifrontal approach for solving large sparse linear systems

We consider the solution of very large systems of linear equations with direct multifrontal methods. In this context the size of the factors is an important limitation for the use of sparse direct solvers. We will thus assume that the factors have been written on the local disks of our target multiprocessor machine during parallel factorization. Our main focus is the study and the design of efficient approaches for the forward and backward substitution phases after a sparse multifrontal factorization. These phases involve sparse triangular solution and have often been neglected in previous works on sparse direct factorization. In many applications, however, the time for the solution can be the main bottleneck for the performance. This thesis consists of two parts. The focus of the first part is on optimizing the out-of-core performance of the solution phase. The focus of the second part is to further improve the performance by exploiting the sparsity of the right-hand side vectors. In the first part, we describe and compare two approaches to access data from the hard disk. We then show that in a parallel environment the task scheduling can strongly influence the performance. We prove that a constraint ordering of the tasks is possible; it does not introduce any deadlock and it improves the performance. Experiments on large real test problems (more than 8 million unknowns) using an out-of-core version of a sparse multifrontal code called MUMPS (MUltifrontal Massively Parallel Solver) are used to analyse the behaviour of our algorithms. In the second part, we are interested in applications with sparse multiple right-hand sides, particularly those with single nonzero entries. The motivating applications arise in electromagnetism and data assimilation. In such applications, we need either to compute the null space of a highly rank deficient matrix or to compute entries in the inverse of a matrix associated with the normal equations of linear least-squares problems. We cast both of these problems as linear systems with multiple right-hand side vectors, each containing a single nonzero entry. We describe, implement and comment on efficient algorithms to reduce the input-output cost during an outof- core execution. We show how the sparsity of the right-hand side can be exploited to limit both the number of operations and the amount of data accessed. The work presented in this thesis has been partially supported by SOLSTICE ANR project (ANR-06-CIS6-010)

Résolution triangulaire de systèmes linéaires creux de grande taille dans un contexte parallèle multifrontal et hors-mémoire

Nous nous intéressons à la résolution de systèmes linéaires creux de très grande taille par des méthodes directes de factorisation. Dans ce contexte, la taille de la matrice des facteurs constitue un des facteurs limitants principaux pour l'utilisation de méthodes directes de résolution. Nous supposons donc que la matrice des facteurs est de trop grande taille pour être rangée dans la mémoire principale du multiprocesseur et qu'elle a donc été écrite sur les disques locaux (hors-mémoire : OOC) d'une machine multiprocesseurs durant l'étape de factorisation. Nous nous intéressons à l'étude et au développement de techniques efficaces pour la phase de résolution après une factorization multifrontale creuse. La phase de résolution, souvent négligée dans les travaux sur les méthodes directes de résolution directe creuse, constitue alors un point critique de la performance de nombreuses applications scientifiques, souvent même plus critique que l'étape de factorisation. Cette thèse se compose de deux parties. Dans la première partie nous nous proposons des algorithmes pour améliorer la performance de la résolution hors-mémoire. Dans la deuxième partie nous pousuivons ce travail en montrant comment exploiter la nature creuse des seconds membres pour réduire le volume de données accédées en mémoire. Dans la première partie de cette thèse nous introduisons deux approches de lecture des données sur le disque dur. Nous montrons ensuite que dans un environnement parallèle le séquencement des tâches peut fortement influencer la performance. Nous prouvons qu'un ordonnancement contraint des tâches peut être introduit; qu'il n'introduit pas d'interblocage entre processus et qu'il permet d'améliorer les performances. Nous conduisons nos expériences sur des problèmes industriels de grande taille (plus de 8 Millions d'inconnues) et utilisons une version hors-mémoire d'un code multifrontal creux appelé MUMPS (solveur multifrontal parallèle). Dans la deuxième partie de ce travail nous nous intéressons au cas de seconds membres creux multiples. Ce problème apparaît dans des applications en electromagnétisme et en assimilation de données et résulte du besoin de calculer l'espace propre d'une matrice fortement déficiente, du calcul d'éléments de l'inverse de la matrice associée aux équations normales pour les moindres carrés linéaires ou encore du traitement de matrices fortement réductibles en programmation linéaire. Nous décrivons un algorithme efficace de réduction du volume d'Entrées/Sorties sur le disque lors d'une résolution hors-mémoire. Plus généralement nous montrons comment le caractère creux des seconds -membres peut être exploité pour réduire le nombre d'opérations et le nombre d'accès à la mémoire lors de l'étape de résolution. Le travail présenté dans cette thèse a été partiellement financé par le projet SOLSTICE de l'ANR (ANR-06-CIS6-010). ABSTRACT : We consider the solution of very large systems of linear equations with direct multifrontal methods. In this context the size of the factors is an important limitation for the use of sparse direct solvers. We will thus assume that the factors have been written on the local disks of our target multiprocessor machine during parallel factorization. Our main focus is the study and the design of efficient approaches for the forward and backward substitution phases after a sparse multifrontal factorization. These phases involve sparse triangular solution and have often been neglected in previous works on sparse direct factorization. In many applications, however, the time for the solution can be the main bottleneck for the performance. This thesis consists of two parts. The focus of the first part is on optimizing the out-of-core performance of the solution phase. The focus of the second part is to further improve the performance by exploiting the sparsity of the right-hand side vectors. In the first part, we describe and compare two approaches to access data from the hard disk. We then show that in a parallel environment the task scheduling can strongly influence the performance. We prove that a constraint ordering of the tasks is possible; it does not introduce any deadlock and it improves the performance. Experiments on large real test problems (more than 8 million unknowns) using an out-of-core version of a sparse multifrontal code called MUMPS (MUltifrontal Massively Parallel Solver) are used to analyse the behaviour of our algorithms. In the second part, we are interested in applications with sparse multiple right-hand sides, particularly those with single nonzero entries. The motivating applications arise in electromagnetism and data assimilation. In such applications, we need either to compute the null space of a highly rank deficient matrix or to compute entries in the inverse of a matrix associated with the normal equations of linear least-squares problems. We cast both of these problems as linear systems with multiple right-hand side vectors, each containing a single nonzero entry. We describe, implement and comment on efficient algorithms to reduce the input-output cost during an outof- core execution. We show how the sparsity of the right-hand side can be exploited to limit both the number of operations and the amount of data accessed. The work presented in this thesis has been partially supported by SOLSTICE ANR project (ANR-06-CIS6-010)

Diffuse emission measurement with INTEGRAL/SPI as indirect probe of cosmic-ray electrons and positrons

Significant advances have been made in the understanding of the diffuse Galactic hard X-ray continuum emission using data from the INTEGRAL observatory. The diffuse hard power-law component seen with the INTEGRAL/SPI spectrometer has been identified with inverse-Compton emission from relativistic (GeV) electrons on the cosmic microwave background and Galactic interstellar radiation field. In the present analysis, SPI data from 2003 to 2009, with a total exposure time of ~ 10^8 s, are used to derive the Galactic ridge hard X-ray spatial distribution and spectrum between 20 keV and 2.4 MeV. Both are consistent with predictions from the GALPROP code. The good agreement between measured and predicted emission from keV to GeV energies suggests that the correct production mechanisms have been identified. We discuss the potential of the SPI data to provide an indirect probe of the interstellar cosmic-ray electron distribution, in particular for energies below a few GeV.Comment: 39 pages, 11 figures. Accepted for publication in The Astrophysical Journa

Exotic garnet–clinopyroxene–K-feldspar granulites from the Chepelare shear zone, Central Rhodope massif, Bulgaria: implications for high-pressure granulite facies metamorphism

Garnet–clinopyroxene–K-feldspar granulite occurs as a thick layer or boudin within the variegated rocks of the Chepelare shear zone in the Central Rhodope massif, Bulgaria. It consists of several domains: mesocratic homogeneous matrix (clinopyroxene–plagioclase–K-feldspar–quartz ± amphibole), porphyroblastic garnet, K-feldspar and clinopyroxene, and strongly foliated fine-grain bands (chloritized biotite–chlorite–prehnite–albite ± epidote). The origin and nature of the matrix mineral association is still unclear. The peak porphyroblast association forms at the expense of plagioclase from the matrix at higher pressure. The fine-grain deformation zones channel the lattermost fluid infiltration. The clinopyroxene-garnet and Zr-in-titanite thermometry give temperatures higher than 790–860 ºC at 2 GPa and, with thermodynamic modeling, suggests crystallization at ~1.8–2.1 GPa and temperature of ~850 ºC in HP granulite field for the porphyroblast granulite association

Out-of-core solution for singleton right hand-side vectors

International audienc

Out-of-core solution for singleton rhs vectors

International audienc

Overview of MUMPS (A multifrontal Massively Parallel Solver)

Presentation at the 2nd French-Japanese workshop on Petascale Applications, Algorithms and Programming (PAAP'08)no abstrac