A soja no Brasil: história e estatística.

Origem e distribuicao no mundo; Introducao e primeiras experiencias no Brasil; Evolucao da producao; Destino da producao; Capacidade de processamento; Portos de embarque; Meios de transporte; Precos recebidos pelos produtores; Custos de producao.bitstream/item/23236/1/Doc21.pd

Searches for exotic physics at CMS

A review of the searches for new physics at the CMS experiment is presented. The latest results exploiting all the data collected in 2012, corresponding to 19.6 fb−1 of luminosity, are summarized. A broad range of final states and models of new physics is investigated. No statistically significant evidence of new physics has been found

Extração de DNA genômico de cereais de inverno na Embrapa Trigo.

bitstream/CNPT-2010/40600/1/p-co235.pd

Aberration cancellation in quantum interferometry

We report the first experimental demonstration of even-order aberration cancellation in quantum interferometry. The effect is a spatial counterpart of the spectral group velocity dispersion cancellation, which is associated with spectral entanglement. It is manifested in temporal interferometry by virtue of the multi-parameter spatial-spectral entanglement. Spatially-entangled photons, generated by spontaneous parametric down conversion, were subjected to spatial aberrations introduced by a deformable mirror that modulates the wavefront. We show that only odd-order spatial aberrations affect the quality of quantum interference

Hyperopic Cops and Robbers

We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the corresponding analogue of the cop number, and we investigate bounds and other properties of this parameter. We characterize the cop-win graphs for this variant, along with graphs with the largest possible hyperopic cop number. We analyze the cases of graphs with diameter 2 or at least 3, focusing on when the hyperopic cop number is at most one greater than the cop number. We show that for planar graphs, as with the usual cop number, the hyperopic cop number is at most 3. The hyperopic cop number is considered for countable graphs, and it is shown that for connected chains of graphs, the hyperopic cop density can be any real number in $[0,1/2].