The Sphene-Centered Ocellar Texture: An Effect of Grain-Supported Flow and Melt Migration in a Hyperdense Magma Mush

The sphene-centered ocellar texture consists of leucocratic ocelli with sphene (titanite) crystals at the center, enclosed in a biotite-rich matrix. This texture has been recognized worldwide in hybrid intermediate rocks. On the basis of structural, petrological, and geochronological data from selected outcrops of the Variscan Ribadelago pluton (NW Iberian Massif), we propose that the ocelli were formed by migration and accumulation of a residual melt through a plagioclase- and biotite-dominated crystalline framework. At the late stage of crystallization, the magma acted as a hyperdense suspension and reacted to the pressure gradient caused by the regional stress field, entering the domain of grain-supported flow. Microstructures reveal that aligned crystal domains arose in the crystal framework from the shearing and compaction of the crystal mush and behaved as magmatic microshears. Relative displacement of adjacent crystal clusters along these microshears corresponded to the onset of Reynolds dilatancy that generated an expansion of the crystal mush, involving melt migration and pore aperture. The mineralogy of the ocelli, dominated by andesine and sphene, represents the composition of the migrating melt. The chemistry of this late, Ti-rich melt stems from the incongruent melting of biotite. Magmatic sphene from the ocelli yields a U-Pb age of 317 +/- 1 Ma, which represents the final crystallization of the hybridized magmatic system. Moreover, this texture offers an opportunity to better understand the rheological behavior of highly crystallized magmas.

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks` dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model-the evolving graphs-was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience.