Metamorphic P-T evolution of granulites in the central Ribeira Fold Belt, SE Brazil

Pseudosections, geothermobarometric estimates and careful petrographic observations of gneissic migmatites and granulites from Neoproterozoic central Ribeira Fold Belt (SE Brazil) were performed in order to quantify the metamorphic P-T conditions during prograde and retrograde evolution of the Brasiliano Orogeny. Results establish a prograde metamorphic trajectory from amphibolite facies conditions to metamorphic peak (T = 850 +/- 50 A degrees C; P = 8 +/- 1 kbar) that promoted widespread dehydrationmelting of 30 to 40% of the gneisses and high-grade granitization. After the metamorphic peak, migmatites evolved with cooling and decompression to T a parts per thousand 500 A degrees C and P a parts per thousand 5 kbar coupled with aH2O increase, replacing the high-grade paragenesis plagioclase-quartz-K-feldspar-garnet by quartz-biotite-sillimanite-(muscovite). Cordierite absence, microtextural observations and P-T results constrain the migmatite metamorphic evolution in the pseudosections as a clockwise P-T path with retrograde cooling and decompression. High-temperature conditions further dehydrated the lower crust with biotite and amphibole-dehydration melting and granulite formation coupled with 10% melt generation. Granulites can thus be envisaged as middle to lower crust dehydrated restites. Granulites were slowly (nearly isobarically) cooled, followed by late exhumation/retrograde rapid decompression and cooling, reflecting a two step P-T path. This retrograde evolution, coupled with water influx, chemically reequilibrated the rocks from granulite to amphibolite/greenschist facies, promoting the replacement of the plagioclase-quartz-garnet-hypersthene peak assemblage by quartz-biotite- K-feldspar symplectites.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.

Approximation algorithms and hardness results for the clique packing problem

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.

Packing triangles in low degree graphs and indifference graphs

We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation ratio known so far for these problems has ratio 3/2 + epsilon, a result that follows from a more general algorithm for set packing obtained by Hurkens and Schrijver [On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Math. 2(1) (1989) 68-72]. We present improvements on the approximation ratio for restricted cases of VTP and ETP that are known to be APX-hard: we give an approximation algorithm for VTP on graphs with maximum degree 4 with ratio slightly less than 1.2, and for ETP on graphs with maximum degree 5 with ratio 4/3. We also present an exact linear-time algorithm for VTP on the class of indifference graphs. (C) 2007 Elsevier B.V. All rights reserved.

Approximations of modal logics: K and beyond

Inspired by the recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of the n-degree of introspection that is allowed, thus generating modal n-logics. The semantics for n-logics is presented, in which formulas are evaluated with respect to paths, and not possible worlds. A tableau-based proof system is presented, n-SST, and soundness and completeness is shown for the approximation of modal logics K, T, D, S4 and S5. (c) 2008 Published by Elsevier B.V.

SCALING LIMIT FOR A DRAINAGE NETWORK MODEL

We consider the two-dimensional version of a drainage network model introduced ill Gangopadhyay, Roy and Sarkar (2004), and show that the appropriately rescaled family of its paths converges in distribution to the Brownian web. We do so by verifying the convergence criteria proposed in Fontes, Isopi, Newman and Ravishankar (2002).

ON THE COMPOSITE OF THREE IRREDUCIBLE MORPHISMS IN THE FOURTH POWER OF THE RADICAL

We study here the nonzero composite of three irreducible morphisms between indecomposable modules lying in the fourth power of the radical.

An algebraic theory for generalized Jordan chains and partial signatures in the Lagrangian Grassmannian

We discuss an algebraic theory for generalized Jordan chains and partial signatures, that are invariants associated to sequences of symmetric bilinear forms on a vector space. We introduce an intrinsic notion of partial signatures in the Lagrangian Grassmannian of a symplectic space that does not use local coordinates, and we give a formula for the Maslov index of arbitrary real analytic paths in terms of partial signatures.

Geodesics and Almost Geodesic Cycles in Random Regular Graphs

A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance d(G)(u, v) is at least d(C)(u, v) - e(n). Let omega(n) be any function tending to infinity with n. We consider a random d-regular graph on n vertices. We show that almost all pairs of vertices belong to an almost geodesic cycle C with e(n)= log(d-1)log(d-1) n+omega(n) and vertical bar C vertical bar =2 log(d-1) n+O(omega(n)). Along the way, we obtain results on near-geodesic paths. We also give the limiting distribution of the number of geodesics between two random vertices in this random graph. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 66: 115-136, 2011

Photophysics and photostability of adenine in aqueous solution: A theoretical study

The sequential Monte Carlo/CASPT2 approach was employed to investigate deactivation and emission processes from the lowest-lying pi pi * and n pi * excited states of 9H-adenine in aqueous solution. It is found that conical intersections connecting the pi pi* and n pi* states with the ground state are also present in solution, whereas the barriers for the deactivation paths are significantly smaller on solvated conditions. The large destabilization of the n pi* state found in solution possibly prevents its involvement in the deactivation photophysics and explains the change from a bi- to a mono-exponential decay for the molecule in the gas phase and solution, respectively. (C) 2010 Elsevier B.V. All rights reserved.

On the Relaxation Mechanisms of 6-Azauracil

The nonadiabatic photochemistry of 6-azauracil has been studied by means of the CASPT2//CASSCF protocol and double-zeta plus polarization ANO basis sets. Minimum energy states, transition states, minimum energy paths, and surface intersections have been computed in order to obtain an accurate description of several potential energy hypersurfaces. It is concluded that, after absorption of ultraviolet radiation (248 nm), two main relaxation mechanisms may occur, via which the lowest (3)(pi pi*) state can be populated. The first one takes place via a conical intersection involving the bright (1)(pi pi*) and the lowest (1)(n pi*) states, ((1)pi pi*/(1)n pi*)(CI), from which a low energy singlet-triplet crossing, ((1)n pi*/(3)pi pi*)(STC), connecting the (1)(n pi*) state to the lowest (3)(pi pi*) triplet state is accessible. The second mechanism arises via a singlet-triplet crossing, ((1)pi pi*/(3)n pi*)(STC), leading to a conical intersection in the triplet manifold, ((3)n pi*/(3)pi pi*)(CI), evolving to the lowest (3)(pi pi*) state. Further radiationless decay to the ground state is possible through a (gs/(3)pi pi*)(STC).

A three-state model for the photophysics of guanine

The nonadiabatic photochemistry of the guanine molecule (2-amino-6-oxopurine) and some of its tautomers has been studied by means of the high-level theoretical ab initio quantum chemistry methods CASSCF and CASPT2. Accurate computations, based by the first time on minimum energy reaction paths, states minima, transition states, reaction barriers, and conical intersections on the potential energy hypersurfaces of the molecules lead to interpret the photochemistry of guanine and derivatives within a three-state model. As in the other purine DNA nucleobase, adenine, the ultrafast subpicosecond fluorescence decay measured in guanine is attributed to the barrierless character of the path leading from the initially populated (1)(pi pi* L-a) spectroscopic state of the molecule toward the low-lying methanamine-like conical intersection (gs/pi pi* L-a)(CI). On the contrary, other tautomers are shown to have a reaction energy barrier along the main relaxation profile. A second, slower decay is attributed to a path involving switches toward two other states, (1)(pi pi* L-b) and, in particular, (1)(n(o)pi*), ultimately leading to conical intersections with the ground state. A common framework for the ultrafast relaxation of the natural nucleobases is obtained in which the predominant role of a pi pi*-type state is confirmed.

Sequential IRMPD of XGe(OEt)(4)(-) ions: Gas-phase synthesis of novel oxy-germanium anions

The gas-phase ion/molecule reactions of F(-) and EtO(-) with Ge(OEt)(4) yield readily and exclusively pentacoordinated complexes XGe(OEt)(4)(-) (X = F, EtO) at pressures in the 10(-8) T range as observed by FT-ICR techniques. These hypervalent species are prone to undergo sequential fragmentations induced by infrared multiphoton excitation that lead to a variety of germyl and germanate anions. In the case of FGe(OEt)(4)(-), three primary competitive channels are observed in the IRMPD process that can be identified as (EtO)(3)GeO(-), F(EtO)(2)GeO(-) and (EtO)(3)Ge(-). Ab initio calculations have been carried out to characterize the primary fragmentation paths induced by IRMPD and the most favorable structure of the resulting anions. The gas-phase acidity of a number of these germanium-containing ions have been estimated by bracketing experiments and by theoretical calculations. Germanate anions such as (EtO)(3)GeO(-) undergo some interesting reactions with H(2)S to give rise to anions such as (EtO)(3)GeS(-) and (EtO)(2)Ge(OH)S(-). (C) 2010 Elsevier B.V. All rights reserved.

A quantum chemical study on the formation of phosphorus mononitride

The chemical mechanism of the (1)PN formation was successfully studied by using the CCSD(T)/6-311++G(3df,3pd) level of theory. The (1)NH(3) + (3)PH and (4)P + NH(3) reaction paths are not energetically favorable to form the (1)PN molecule. However, the (3)NH + (3)PH, (4)N + (3)PH(3), (4)N + (3)PH, (4)P + (3)NH, and (4)P + (2)NH(2) reaction paths to form the (1)PN molecule are only energetically favorable by taking place through specific transition states to form the (1)PN molecule. The NH(3) + (3)PH, (4)N + (1)PH(3), NH(3) + (4)P, and (4)N + (2)PH(2) reactions are spin-forbidden and the probability of hopping for these reactions was estimated to be 0 by the Landau-Zener theory. This is the first detailed study on the chemical mechanism for the (1)PN formation. (C) 2009 Elsevier B.V. All rights reserved.

Production and Delivery (Optimization of production system and reliability)

This thesis is done to solve two issues for Sayid Paper Mill Ltd Pakistan. Section one deals with a practical problem arise in SPM that is cutting a given set of raw paper rolls of known length and width, and a set of product paper rolls of known length (equal to the length of raw paper rolls) and width, practical cutting constraints on a single cutting machine, according to demand orders for all customers. To solve this problem requires to determine an optimal cutting schedule to maximize the overall cutting process profitability while satisfying all demands and cutting constraints. The aim of this part of thesis is to develop a mathematical model which solves this problem.Second section deals with a problem of delivering final product from warehouse to different destinations by finding shortest paths. It is an operational routing problem to decide the daily routes for sending trucks to different destination to deliver their final product. This industrial problem is difficult and includes aspect such as delivery to a single destination and multiple destinations with limited resources. The aim of this part of thesis is to develop a process which helps finding shortest path.