42 resultados para Lower Neoproterozoic
Resumo:
Madurai Block, the largest crustal block in the Southern Granulite Terrane (SGT) of Peninsular India, preserves the imprints of multistage tectonic evolution. Here, we present U-Pb and Hf isotope data on zircons from a charnockite-granite suite in the north-western part of this block. The oscillatory zoning, and the LREE to HREE enriched patterns of the zircons with positive Ce and negative Eu anomalies suggest that the zircon cores are of magmatic origin, with ages in the range of 2634-2435 Ma implying Neoarchean-Paleoproterozoic magmatism followed by subsequent metamorphism and protocontinent formation in the north-western part of the Madurai Block. A regional 550-500 Ma metamorphic overprint is also preserved in the zircons coinciding with the final amalgamation of the Gondwana supercontinent. The Hf isotopic data suggest that the granite and charnockite were derived from isotopically heterogeneous juvenile crustal domains and the charnockites show a significant contribution of mantle-derived components. Therefore, the Hf isotopic data reflect mixing of crustal and mantle-derived sources for the generation of Neoarchean crust in the north-western Madurai Block, possibly in a suprasubduction zone setting during continent building processes. (c) 2014 Elsevier Ltd. All rights reserved.
Resumo:
An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where R-i is a closed interval of the form a(i),b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension b, such that G is representable as the intersection graph of boxes in b-dimensional space. Although boxicity was introduced in 1969 and studied extensively, there are no significant results on lower bounds for boxicity. In this paper, we develop two general methods for deriving lower bounds. Applying these methods we give several results, some of which are listed below: 1. The boxicity of a graph on n vertices with no universal vertices and minimum degree delta is at least n/2(n-delta-1). 2. Consider the g(n,p) model of random graphs. Let p <= 1 - 40logn/n(2.) Then with high `` probability, box(G) = Omega(np(1 - p)). On setting p = 1/2 we immediately infer that almost all graphs have boxicity Omega(n). Another consequence of this result is as follows: For any positive constant c < 1, almost all graphs on n vertices and m <= c((n)(2)) edges have boxicity Omega(m/n). 3. Let G be a connected k-regular graph on n vertices. Let lambda be the second largest eigenvalue in absolute value of the adjacency matrix of G. Then, the boxicity of G is a least (kappa(2)/lambda(2)/log(1+kappa(2)/lambda(2))) (n-kappa-1/2n). 4. For any positive constant c 1, almost all balanced bipartite graphs on 2n vertices and m <= cn(2) edges have boxicity Omega(m/n).
Resumo:
In a nursery pollination mutualism, we asked whether environmental factors affected reproduction of mutualistic pollinators, non-mutualistic parasites and seed production via seasonal changes in plant traits such as inflorescence size and within-tree reproductive phenology. We examined seasonal variation in reproduction in Ficus racemosa community members that utilise enclosed inflorescences called syconia as nurseries. Temperature, relative humidity and rainfall defined four seasons: winter; hot days, cold nights; summer and wet seasons. Syconium volumes were highest in winter and lowest in summer, and affected syconium contents positively across all seasons. Greater transpiration from the nurseries was possibly responsible for smaller syconia in summer. The 3-5 degrees C increase in mean temperatures between the cooler seasons and summer reduced fig wasp reproduction and increased seed production nearly two-fold. Yet, seed and pollinator progeny production were never negatively related in any season confirming the mutualistic fig-pollinator association across seasons. Non-pollinator parasites affected seed production negatively in some seasons, but had a surprisingly positive relationship with pollinators in most seasons. While within-tree reproductive phenology did not vary across seasons, its effect on syconium inhabitants varied with season. In all seasons, within-tree reproductive asynchrony affected parasite reproduction negatively, whereas it had a positive effect on pollinator reproduction in winter and a negative effect in summer. Seasonally variable syconium volumes probably caused the differential effect of within-tree reproductive phenology on pollinator reproduction. Within-tree reproductive asynchrony itself was positively affected by intra-tree variation in syconium contents and volume, creating a unique feedback loop which varied across seasons. Therefore, nursery size affected fig wasp reproduction, seed production and within-tree reproductive phenology via the feedback cycle in this system. Climatic factors affecting plant reproductive traits cause biotic relationships between plants, mutualists and parasites to vary seasonally and must be accorded greater attention, especially in the context of climate change.
Resumo:
Given a Boolean function , we say a triple (x, y, x + y) is a triangle in f if . A triangle-free function contains no triangle. If f differs from every triangle-free function on at least points, then f is said to be -far from triangle-free. In this work, we analyze the query complexity of testers that, with constant probability, distinguish triangle-free functions from those -far from triangle-free. Let the canonical tester for triangle-freeness denotes the algorithm that repeatedly picks x and y uniformly and independently at random from , queries f(x), f(y) and f(x + y), and checks whether f(x) = f(y) = f(x + y) = 1. Green showed that the canonical tester rejects functions -far from triangle-free with constant probability if its query complexity is a tower of 2's whose height is polynomial in . Fox later improved the height of the tower in Green's upper bound to . A trivial lower bound of on the query complexity is immediate. In this paper, we give the first non-trivial lower bound for the number of queries needed. We show that, for every small enough , there exists an integer such that for all there exists a function depending on all n variables which is -far from being triangle-free and requires queries for the canonical tester. We also show that the query complexity of any general (possibly adaptive) one-sided tester for triangle-freeness is at least square root of the query complexity of the corresponding canonical tester. Consequently, this means that any one-sided tester for triangle-freeness must make at least queries.
Resumo:
We consider Ricci flow invariant cones C in the space of curvature operators lying between the cones ``nonnegative Ricci curvature'' and ``nonnegative curvature operator''. Assuming some mild control on the scalar curvature of the Ricci flow, we show that if a solution to the Ricci flow has its curvature operator which satisfies R + epsilon I is an element of C at the initial time, then it satisfies R + epsilon I is an element of C on some time interval depending only on the scalar curvature control. This allows us to link Gromov-Hausdorff convergence and Ricci flow convergence when the limit is smooth and R + I is an element of C along the sequence of initial conditions. Another application is a stability result for manifolds whose curvature operator is almost in C. Finally, we study the case where C is contained in the cone of operators whose sectional curvature is nonnegative. This allows us to weaken the assumptions of the previously mentioned applications. In particular, we construct a Ricci flow for a class of (not too) singular Alexandrov spaces.
Resumo:
A lower-bound limit analysis formulation, by using two-dimensional finite elements, the three-dimensional Mohr-Coulomb yield criterion, and nonlinear optimization, has been given to deal with an axisymmetric geomechanics stability problem. The optimization was performed using an interior point method based on the logarithmic barrier function. The yield surface was smoothened (1) by removing the tip singularity at the apex of the pyramid in the meridian plane and (2) by eliminating the stress discontinuities at the corners of the yield hexagon in the pi-plane. The circumferential stress (sigma(theta)) need not be assumed. With the proposed methodology, for a circular footing, the bearing-capacity factors N-c, N-q, and N-gamma for different values of phi have been computed. For phi = 0, the variation of N-c with changes in the factor m, which accounts for a linear increase of cohesion with depth, has been evaluated. Failure patterns for a few cases have also been drawn. The results from the formulation provide a good match with the solutions available from the literature. (C) 2014 American Society of Civil Engineers.
Resumo:
The ultimate bearing capacity of a circular footing, placed over rock mass, is evaluated by using the lower bound theorem of the limit analysis in conjunction with finite elements and nonlinear optimization. The generalized Hoek-Brown (HB) failure criterion, but by keeping a constant value of the exponent, alpha = 0.5, was used. The failure criterion was smoothened both in the meridian and pi planes. The nonlinear optimization was carried out by employing an interior point method based on the logarithmic barrier function. The results for the obtained bearing capacity were presented in a non-dimensional form for different values of GSI, m(i), sigma(ci)/(gamma b) and q/sigma(ci). Failure patterns were also examined for a few cases. For validating the results, computations were also performed for a strip footing as well. The results obtained from the analysis compare well with the data reported in literature. Since the equilibrium conditions are precisely satisfied only at the centroids of the elements, not everywhere in the domain, the obtained lower bound solution will be approximate not true. (C) 2015 Elsevier Ltd. All rights reserved.
Resumo:
This paper presents a lower bound limit analysis approach for solving an axisymmetric stability problem by using the Drucker-Prager (D-P) yield cone in conjunction with finite elements and nonlinear optimization. In principal stress space, the tip of the yield cone has been smoothened by applying the hyperbolic approximation. The nonlinear optimization has been performed by employing an interior point method based on the logarithmic barrier function. A new proposal has also been given to simulate the D-P yield cone with the Mohr-Coulomb hexagonal yield pyramid. For the sake of illustration, bearing capacity factors N-c, N-q and N-gamma have been computed, as a function of phi, both for smooth and rough circular foundations. The results obtained from the analysis compare quite well with the solutions reported from literature.
Resumo:
We consider the problem of representing a univariate polynomial f(x) as a sum of powers of low degree polynomials. We prove a lower bound of Omega(root d/t) for writing an explicit univariate degree-d polynomial f(x) as a sum of powers of degree-t polynomials.
Resumo:
Bearing capacity factors, N-c, N-q, and N-gamma, for a conical footing are determined by using the lower and upper bound axisymmetric formulation of the limit analysis in combination with finite elements and optimization. These factors are obtained in a bound form for a wide range of the values of cone apex angle (beta) and phi with delta = 0, 0.5 phi, and phi. The bearing capacity factors for a perfectly rough (delta = phi) conical footing generally increase with a decrease in beta. On the contrary, for delta = 0 degrees, the factors N-c and N-q reduce gradually with a decrease in beta. For delta = 0 degrees, the factor N-gamma for phi >= 35 degrees becomes a minimum for beta approximate to 90 degrees. For delta = 0 degrees, N-gamma for phi <= 30 degrees, as in the case of delta = phi, generally reduces with an increase in beta. The failure and nodal velocity patterns are also examined. The results compare well with different numerical solutions and centrifuge tests' data available from the literature.
Resumo:
We show here a 2(Omega(root d.log N)) size lower bound for homogeneous depth four arithmetic formulas. That is, we give an explicit family of polynomials of degree d on N variables (with N = d(3) in our case) with 0, 1-coefficients such that for any representation of a polynomial f in this family of the form f = Sigma(i) Pi(j) Q(ij), where the Q(ij)'s are homogeneous polynomials (recall that a polynomial is said to be homogeneous if all its monomials have the same degree), it must hold that Sigma(i,j) (Number of monomials of Q(ij)) >= 2(Omega(root d.log N)). The above mentioned family, which we refer to as the Nisan-Wigderson design-based family of polynomials, is in the complexity class VNP. Our work builds on the recent lower bound results 1], 2], 3], 4], 5] and yields an improved quantitative bound as compared to the quasi-polynomial lower bound of 6] and the N-Omega(log log (N)) lower bound in the independent work of 7].
Resumo:
A discussion has been provided for the comments raised by the discusser (Clausen, 2015)1] on the article recently published by the authors (Chakraborty and Kumar, 2015). The effect of exponent alpha for values of GSI approximately smaller than 30 becomes more critical. On the other hand, for greater values of GSI, the results obtained by the authors earlier remain primarily independent of alpha and can be easily used. (C) 2015 Elsevier Ltd. All rights reserved.