Aplicação da teoria da confiabilidade em estacas escavadas de grande diâmetro para obtenção das superfícies resistentes de projeto

In this work, the author looks forward to develop a new method capable of incorporate the concepts of the Reliability Theory and Ruin Probability in Deep Foundations, in order to do a better quantification of the uncertainties, which is intrinsic in all geotechnical projects, meanly because we don't know all the properties of the materials that we work with. Using the methodologies of Decourt Quaresma and David Cabral, resistance surfaces have been developed utilizing the data achieved from the Standard Penetration Tests performed in the field of study, in conjecture with the loads defined in the executive project of the piles. The construction of resistance surfaces shows to be a very useful tool for decision making, no matter in which phase it is current on, projecting or execution. The surfaces were developed by Kriging (using the software Surfer® 12), making it easier to visualize the geotechnical profile of the field of study. Comparing the results, the conclusion was that a high safety factor doesn't mean higher security. It is fundamental to consider the loads and resistance of the piles in the whole field, carefully choosing the project methodology responsible to define the diameter and length of the piles

Gramsci, o capital supranacional e o novo teorema da política

Gramsci é um autor da atualidade, teórico da mundialização do capitalismo, mas ainda desconhecido, mesmo no campo do marxismo, entre as suas tendências dominantes. Pensar a globalização, o século XXI, a nova conjuntura política nos quadros da contemporaneidade é um desafio intelectual da maior relevância que tem, em Gramsci – certamente para surpresa de uns e negação de outros –, uma de suas fontes mais estimulantes e reveladoras. É fascinante desvendar em seus escritos teses indispensáveis para refletirmos alguns dos principais temas do momento em horizontes mundiais.

Class Notes for Math 918: Homological Conjectures, Instructor Tom Marley

This course was an overview of what are known as the “Homological Conjectures,” in particular, the Zero Divisor Conjecture, the Rigidity Conjecture, the Intersection Conjectures, Bass’ Conjecture, the Superheight Conjecture, the Direct Summand Conjecture, the Monomial Conjecture, the Syzygy Conjecture, and the big and small Cohen Macaulay Conjectures. Many of these are shown to imply others. This document contains notes for a course taught by Tom Marley during the 2009 spring semester at the University of Nebraska-Lincoln. The notes loosely follow the treatment given in Chapters 8 and 9 of Cohen-Macaulay Rings, by W. Bruns and J. Herzog, although many other sources, including articles and monographs by Peskine, Szpiro, Hochster, Huneke, Grith, Evans, Lyubeznik, and Roberts (to name a few), were used. Special thanks to Laura Lynch for putting these notes into LaTeX.

Aplicação da teoria da confiabilidade em estacas escavadas de grande diâmetro para obtenção das superfícies resistentes de projeto

In this work, the author looks forward to develop a new method capable of incorporate the concepts of the Reliability Theory and Ruin Probability in Deep Foundations, in order to do a better quantification of the uncertainties, which is intrinsic in all geotechnical projects, meanly because we don't know all the properties of the materials that we work with. Using the methodologies of Decourt Quaresma and David Cabral, resistance surfaces have been developed utilizing the data achieved from the Standard Penetration Tests performed in the field of study, in conjecture with the loads defined in the executive project of the piles. The construction of resistance surfaces shows to be a very useful tool for decision making, no matter in which phase it is current on, projecting or execution. The surfaces were developed by Kriging (using the software Surfer® 12), making it easier to visualize the geotechnical profile of the field of study. Comparing the results, the conclusion was that a high safety factor doesn't mean higher security. It is fundamental to consider the loads and resistance of the piles in the whole field, carefully choosing the project methodology responsible to define the diameter and length of the piles

Properly coloured copies and rainbow copies of large graphs with small maximum degree

Let G be a graph on n vertices with maximum degree ?. We use the Lovasz local lemma to show the following two results about colourings ? of the edges of the complete graph Kn. If for each vertex v of Kn the colouring ? assigns each colour to at most (n - 2)/(22.4?2) edges emanating from v, then there is a copy of G in Kn which is properly edge-coloured by ?. This improves on a result of Alon, Jiang, Miller, and Pritikin [Random Struct. Algorithms 23(4), 409433, 2003]. On the other hand, if ? assigns each colour to at most n/(51?2) edges of Kn, then there is a copy of G in Kn such that each edge of G receives a different colour from ?. This proves a conjecture of Frieze and Krivelevich [Electron. J. Comb. 15(1), R59, 2008]. Our proofs rely on a framework developed by Lu and Szekely [Electron. J. Comb. 14(1), R63, 2007] for applying the local lemma to random injections. In order to improve the constants in our results we use a version of the local lemma due to Bissacot, Fernandez, Procacci, and Scoppola [preprint, arXiv:0910.1824]. (c) 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 425436, 2012

On global linearization of planar involutions

Let phi: a"e(2) -> a"e(2) be an orientation-preserving C (1) involution such that phi(0) = 0. Let Spc(phi) = {Eigenvalues of D phi(p) | p a a"e(2)}. We prove that if Spc(phi) aS, a"e or Spc(phi) a (c) [1, 1 + epsilon) = a... for some epsilon > 0, then phi is globally C (1) conjugate to the linear involution D phi(0) via the conjugacy h = (I + D phi(0)phi)/2,where I: a"e(2) -> a"e(2) is the identity map. Similarly, we prove that if phi is an orientation-reversing C (1) involution such that phi(0) = 0 and Trace (D phi(0)D phi(p) > - 1 for all p a a"e(2), then phi is globally C (1) conjugate to the linear involution D phi(0) via the conjugacy h. Finally, we show that h may fail to be a global linearization of phi if the above conditions are not fulfilled.

TRANSITIVITY AND ROTATION SETS WITH NONEMPTY INTERIOR FOR HOMEOMORPHISMS OF THE 2-TORUS

We show that if f is a homeomorphism of the 2-torus isotopic to the identity and its lift (f) over tilde is transitive, or even if it is transitive outside the lift of the elliptic islands, then (0,0) is in the interior of the rotation set of (f) over tilde. This proves a particular case of Boyland's conjecture.

Leishmania amazonensis Arginase Compartmentalization in the Glycosome Is Important for Parasite Infectivity

In Leishmania, de novo polyamine synthesis is initiated by the cleavage of L-arginine to urea and L-ornithine by the action of arginase (ARG, E.C. 3.5.3.1). Previous studies in L. major and L. mexicana showed that ARG is essential for in vitro growth in the absence of polyamines and needed for full infectivity in animal infections. The ARG protein is normally found within the parasite glycosome, and here we examined whether this localization is required for survival and infectivity. First, the localization of L. amazonensis ARG in the glycosome was confirmed in both the promastigote and amastigote stages. As in other species, arg(-) L. amazonensis required putrescine for growth and presented an attenuated infectivity. Restoration of a wild type ARG to the arg(-) mutant restored ARG expression, growth and infectivity. In contrast, restoration of a cytosol-targeted ARG lacking the glycosomal SKL targeting sequence (arg Delta SKL) restored growth but failed to restore infectivity. Further study showed that the ARG Delta SKL protein was found in the cytosol as expected, but at very low levels. Our results indicate that the proper compartmentalization of L. amazonensis arginase in the glycosome is important for enzyme activity and optimal infectivity. Our conjecture is that parasite arginase participates in a complex equilibrium that defines the fate of L-arginine and that its proper subcellular location may be essential for this physiological orchestration.

On the zeros of polynomials: an extension of the Enestrom-Kakeya theorem

This paper presents an extension of the Enestrom-Kakeya theorem concerning the roots of a polynomial that arises from the analysis of the stability of Brown (K, L) methods. The generalization relates to relaxing one of the inequalities on the coefficients of the polynomial. Two results concerning the zeros of polynomials will be proved, one of them providing a partial answer to a conjecture by Meneguette (1994)[6]. (C) 2011 Elsevier Inc. All rights reserved.

Finite-size corrections of the entanglement entropy of critical quantum chains

Using the density matrix renormalization group, we calculated the finite-size corrections of the entanglement alpha-Renyi entropy of a single interval for several critical quantum chains. We considered models with U(1) symmetry such as the spin-1/2 XXZ and spin-1 Fateev-Zamolodchikov models, as well as models with discrete symmetries such as the Ising, the Blume-Capel, and the three-state Potts models. These corrections contain physically relevant information. Their amplitudes, which depend on the value of a, are related to the dimensions of operators in the conformal field theory governing the long-distance correlations of the critical quantum chains. The obtained results together with earlier exact and numerical ones allow us to formulate some general conjectures about the operator responsible for the leading finite-size correction of the alpha-Renyi entropies. We conjecture that the exponent of the leading finite-size correction of the alpha-Renyi entropies is p(alpha) = 2X(epsilon)/alpha for alpha > 1 and p(1) = nu, where X-epsilon denotes the dimensions of the energy operator of the model and nu = 2 for all the models.

MODULARITY, NOISE, AND NATURAL SELECTION

Most biological systems are formed by component parts that are to some degree interrelated. Groups of parts that are more associated among themselves and are relatively autonomous from others are called modules. One of the consequences of modularity is that biological systems usually present an unequal distribution of the genetic variation among traits. Estimating the covariance matrix that describes these systems is a difficult problem due to a number of factors such as poor sample sizes and measurement errors. We show that this problem will be exacerbated whenever matrix inversion is required, as in directional selection reconstruction analysis. We explore the consequences of varying degrees of modularity and signal-to-noise ratio on selection reconstruction. We then present and test the efficiency of available methods for controlling noise in matrix estimates. In our simulations, controlling matrices for noise vastly improves the reconstruction of selection gradients. We also perform an analysis of selection gradients reconstruction over a New World Monkeys skull database to illustrate the impact of noise on such analyses. Noise-controlled estimates render far more plausible interpretations that are in full agreement with previous results.

Effective number of accessed nodes in complex networks

The measurement called accessibility has been proposed as a means to quantify the efficiency of the communication between nodes in complex networks. This article reports results regarding the properties of accessibility, including its relationship with the average minimal time to visit all nodes reachable after h steps along a random walk starting from a source, as well as the number of nodes that are visited after a finite period of time. We characterize the relationship between accessibility and the average number of walks required in order to visit all reachable nodes (the exploration time), conjecture that the maximum accessibility implies the minimal exploration time, and confirm the relationship between the accessibility values and the number of nodes visited after a basic time unit. The latter relationship is investigated with respect to three types of dynamics: traditional random walks, self-avoiding random walks, and preferential random walks.

Helical buckling of Skyrme-Faddeev solitons

Solitons in the Skyrme-Faddeev model on R-2 x S-1 are shown to undergo buckling transitions as the circumference of the S-1 is varied. These results support a recent conjecture that solitons in this field theory are well-described by a much simpler model of elastic rods.

Weak quasi-randomness for uniform hypergraphs

We study quasi-random properties of k-uniform hypergraphs. Our central notion is uniform edge distribution with respect to large vertex sets. We will find several equivalent characterisations of this property and our work can be viewed as an extension of the well known Chung-Graham-Wilson theorem for quasi-random graphs. Moreover, let K(k) be the complete graph on k vertices and M(k) the line graph of the graph of the k-dimensional hypercube. We will show that the pair of graphs (K(k),M(k)) has the property that if the number of copies of both K(k) and M(k) in another graph G are as expected in the random graph of density d, then G is quasi-random (in the sense of the Chung-Graham-Wilson theorem) with density close to d. (C) 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 1-38, 2012

The Tripartite Ramsey Number for Trees

We prove that for all epsilon>0 there are alpha>0 and n(0)is an element of N such that for all n >= n(0) the following holds. For any two-coloring of the edges of Kn, n, n one color contains copies of all trees T of order t <=(3 - epsilon)n/2 and with maximum degree Delta(T)<= n(alpha). This confirms a conjecture of Schelp. (c) 2011 Wiley Periodicals, Inc. J Graph Theory 69: 264300, 2012