Matizes do pensamento político norte-americano na virada conservadora de 1970

This paper examines how the reinvigoration of the exceptional American historical experience appears as a solution to some of the leading neoconservatives, considering Nathan Glazer and Irving Kristol as emblematic, regarding the fall of the American empire, beginning in the 1960s and 1970s, after its rise during the Cold War, the so-called 25 glorious years. We note that the arguments of these authors is rooted in the revival of reactionary rhetoric as an antidote to the decadence of American virtue supposedly caused by Communism, by the counterculture movement and the alleged perverse effect of the welfare state.

Twistor origin of the superstring

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Open-closed superstring amplitudes using vertex operators in AdS(5) x S-5

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Infinite tension limit of the pure spinor superstring

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Type IIB R4H4g-4 conjectures

We propose SL(2, ℤ) (and SL(3, ℤ))-invariant conjectures for all R4H4g-4 couplings of Type IIB strings on ℝ10 (and ℝ8×T2), generalizing conjectures of Green and Gutperle (and Kiritsis and Pioline) for the R4 coupling. A strong check for our conjectures is that on T2 at weak coupling, they reproduce the multiloop scattering amplitudes which had been previously computed using N = 2 strings in the N = 4 topological formalism. Applications to (p, q) string production in a background H field, generalizing Schwinger's computation for pair production in a constant F field, are suggested. © 1998 Elsevier Science B.V.

A new limit of the AdS(5) x S-5 sigma model

Using the pure spinor formalism, a quantizable sigma model has been constructed for the superstring in an AdS(5) X S-5 background with manifest PSU(2,2 vertical bar 4) invariance. The PSU(2,2 vertical bar 4) metric g(AB) has both vector components gab and spinor components g, 3, and in the limit where the spinor components g, 3 are taken to infinity, the AdS5 X S5 sigma model reduces to the worldsheet action in a flat background. In this paper, we instead consider the limit where the vector components g(ab) are taken to infinity. In this limit, the AdS5 X S5 sigma model simplifies to a topological A-model constructed from fermionic N=2 superfields whose bosonic components transform like twistor variables. Just as d=3 Chern-Simons theory can be described by the open string sector of a topological A-model, the open string sector of this topological A-model describes d=4 N=4 super-Yang-Mills. These results might be useful for constructing a worldsheet proof of the Maldacena conjecture analogous to the Gopakumar-Vafa-Ooguri worldsheet proof of Chern-Simons/conifold duality.

Problem with the superstring action of Deriglazov and Galajinsky

Deriglazov and Galajinsky have recently proposed a new covariant action for the Green-Schwarz superstring which can be constructed in any spacetime dimension. In this Comment, I show that their action contains extra on-shell degrees of freedom as compared with the standard action and is therefore inequivalent. ©1999 The American Physical Society.

Construction of R4 terms in N = 2 D = 8 superspace

Using linearized superfields, R4 terms in the Type II superstring effective action compactified on T2 are constructed as integrals in N = 2 D = 8 superspace. The structure of these superspace integrals allows a simple proof of the R4 non-renormalization theorems which were first conjectured by Green and Gutperle. © 1998 Elsevier Science B.V.

Venomics of the Australian eastern brown snake (Pseudonaja textilis): detection of new venom proteins and splicing variants

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Neuroglia and their roles in central respiratory control; an overview

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Distribuição espaço-temporal e dinâmica populacional do Siri Callinectes Danae Smith, 1869 (Decapoda: Portunidae) na região adjacente à Baía de Babitonga, Santa Catarina

Pós-graduação em Biociências - FCLAS

Perturbative super-Yang-Mills from the topological AdS 5 × S 5 sigma model

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Influência da anemia ferropriva no eletroforetrograma de hemoglobina de leitões

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Selective Foraging For Anthropogenic Resources By Black Bears: Minivans In Yosemite National Park

Black bears (Ursus americanus) forage selectively in natural environments. To determine if bears also forage selectively for anthropogenic resources we analyzed data on vehicles broken into by bears from Yosemite National Park, California. We classified vehicles into 9 categories based on their make and model and collected data on use (2001–2007) and availability (2004–2005). From 2001 to 2007 bears broke into 908 vehicles at the following rates: minivan (26.0%), sport–utility vehicle (22.5%), small car (17.1%), sedan (13.7%), truck (11.9%), van (4.2%), sports car (1.7%), coupe (1.7%), and station wagon (1.4%). Only use of minivans (29%) during 2004–2005 was significantly higher than expected (7%). We discuss several competing hypotheses about why bears selected minivans.

Applications of Linear Programming to Coding Theory

Maximum-likelihood decoding is often the optimal decoding rule one can use, but it is very costly to implement in a general setting. Much effort has therefore been dedicated to find efficient decoding algorithms that either achieve or approximate the error-correcting performance of the maximum-likelihood decoder. This dissertation examines two approaches to this problem. In 2003 Feldman and his collaborators defined the linear programming decoder, which operates by solving a linear programming relaxation of the maximum-likelihood decoding problem. As with many modern decoding algorithms, is possible for the linear programming decoder to output vectors that do not correspond to codewords; such vectors are known as pseudocodewords. In this work, we completely classify the set of linear programming pseudocodewords for the family of cycle codes. For the case of the binary symmetric channel, another approximation of maximum-likelihood decoding was introduced by Omura in 1972. This decoder employs an iterative algorithm whose behavior closely mimics that of the simplex algorithm. We generalize Omura's decoder to operate on any binary-input memoryless channel, thus obtaining a soft-decision decoding algorithm. Further, we prove that the probability of the generalized algorithm returning the maximum-likelihood codeword approaches 1 as the number of iterations goes to infinity.