| |
|
|
|
Registro Completo |
|
Biblioteca(s): |
Embrapa Amazônia Oriental. |
|
Data corrente: |
22/06/1999 |
|
Data da última atualização: |
22/11/2019 |
|
Tipo da produção científica: |
Resumo em Anais de Congresso |
|
Autoria: |
MAUÉS, M. M.; OLIVEIRA, F. C. de. |
|
Afiliação: |
MARCIA MOTTA MAUES, CPATU; MESTRANDA INPA. |
|
Título: |
Fenologia reprodutiva e entomofauna polinizadora da castanheira-do-brasil (Bertholletia excelsa Humb & Bonpl., Lecythidaceae) na Amazônia Oriental. |
|
Ano de publicação: |
1998 |
|
Fonte/Imprenta: |
In: CONGRESSO DE ECOLOGIA DO BRASIL, 4., 1998, Belém, PA. Ecossistemas: com enfoque em seus componentes básicos: resumos. Belém, PA: FCAP: Sociedade de Ecologia do Brasil, 1998. |
|
Páginas: |
p. 121. |
|
Idioma: |
Português |
|
Palavras-Chave: |
Brasil; Castanha do brasil. |
|
Thesagro: |
Bertholletia Excelsa; Fenologia; Fruta; Inseto Polinizador. |
|
Thesaurus Nal: |
Amazonia; Brazil nuts; fruits; phenology; pollinators. |
|
Categoria do assunto: |
-- |
|
URL: |
https://ainfo.cnptia.embrapa.br/digital/bitstream/item/205250/1/Fenologia-reprodutiva-e-entomofauna.pdf
|
|
Marc: |
LEADER 00880nam a2200253 a 4500
001 1398981
005 2019-11-22
008 1998 bl uuuu u00u1 u #d
100 1 $aMAUÉS, M. M.
245 $aFenologia reprodutiva e entomofauna polinizadora da castanheira-do-brasil (Bertholletia excelsa Humb & Bonpl., Lecythidaceae) na Amazônia Oriental.
260 $aIn: CONGRESSO DE ECOLOGIA DO BRASIL, 4., 1998, Belém, PA. Ecossistemas: com enfoque em seus componentes básicos: resumos. Belém, PA: FCAP: Sociedade de Ecologia do Brasil$c1998
300 $ap. 121.
650 $aAmazonia
650 $aBrazil nuts
650 $afruits
650 $aphenology
650 $apollinators
650 $aBertholletia Excelsa
650 $aFenologia
650 $aFruta
650 $aInseto Polinizador
653 $aBrasil
653 $aCastanha do brasil
700 1 $aOLIVEIRA, F. C. de
Download
Esconder MarcMostrar Marc Completo |
|
Registro original: |
Embrapa Amazônia Oriental (CPATU) |
|
|
Biblioteca |
ID |
Origem |
Tipo/Formato |
Classificação |
Cutter |
Registro |
Volume |
Status |
URL |
Voltar
|
|
|
Registro Completo
|
Biblioteca(s): |
Embrapa Agricultura Digital. |
|
Data corrente: |
09/09/2014 |
|
Data da última atualização: |
17/09/2014 |
|
Tipo da produção científica: |
Artigo em Periódico Indexado |
|
Circulação/Nível: |
A - 1 |
|
Autoria: |
CASTRO, A. de. |
|
Afiliação: |
ALEXANDRE DE CASTRO, CNPTIA. |
|
Título: |
One-way-ness in the input-saving (Turing) machine. |
|
Ano de publicação: |
2014 |
|
Fonte/Imprenta: |
Physica A: statistical mechanics and its applications, Amsterdam, v. 415, p. 473-478, 2014. |
|
DOI: |
10.1016/j.physa.2014.08.021 |
|
Idioma: |
Inglês |
|
Conteúdo: |
Currently, a complexity-class problem is proving the existence of one-way permutations: one-to-one and onto maps that are computationally ?easy?, while their inverses are computationally ?hard?. In what follows, we make use of Bennett?s algorithm of the reversible Turing machine (quantum information heat engine) to perform a cascade of two controlled-NOT gates to physically create a permutation operation. We show that by running this input-saving (Turing) machine backwards the critical inequality of Landauer?s thermodynamic limit is reversed, which provokes the symmetry-breaking of the quantum circuit based on two successive controlled-NOT quantum gates. This finding reveals that a permutation of controlled-NOT gates becomes one-way, provided that adiabatically immersed in a heat bath, which determines the condition of existence of a thermodynamically non-invertible bijection in polynomial-time, that would otherwise be mathematically invertible. This one-way bijection can also be particularly important because it shows nonlinearities in quantum mechanics, which are detectable by watching that the mathematical reversibility of controlled-NOT gates does not work physically. |
|
Palavras-Chave: |
Complexidade computacional; Computational complexity; Landauer's principle; Máquina de Turing; One-way permutation; Permutação one way; Princípio de Landauer; Turing machine. |
|
Categoria do assunto: |
X Pesquisa, Tecnologia e Engenharia |
|
URL: |
https://ainfo.cnptia.embrapa.br/digital/bitstream/item/107991/1/one-wa-ness.pdf
|
|
Marc: |
LEADER 01926naa a2200229 a 4500
001 1994523
005 2014-09-17
008 2014 bl uuuu u00u1 u #d
024 7 $a10.1016/j.physa.2014.08.021$2DOI
100 1 $aCASTRO, A. de
245 $aOne-way-ness in the input-saving (Turing) machine.$h[electronic resource]
260 $c2014
520 $aCurrently, a complexity-class problem is proving the existence of one-way permutations: one-to-one and onto maps that are computationally ?easy?, while their inverses are computationally ?hard?. In what follows, we make use of Bennett?s algorithm of the reversible Turing machine (quantum information heat engine) to perform a cascade of two controlled-NOT gates to physically create a permutation operation. We show that by running this input-saving (Turing) machine backwards the critical inequality of Landauer?s thermodynamic limit is reversed, which provokes the symmetry-breaking of the quantum circuit based on two successive controlled-NOT quantum gates. This finding reveals that a permutation of controlled-NOT gates becomes one-way, provided that adiabatically immersed in a heat bath, which determines the condition of existence of a thermodynamically non-invertible bijection in polynomial-time, that would otherwise be mathematically invertible. This one-way bijection can also be particularly important because it shows nonlinearities in quantum mechanics, which are detectable by watching that the mathematical reversibility of controlled-NOT gates does not work physically.
653 $aComplexidade computacional
653 $aComputational complexity
653 $aLandauer's principle
653 $aMáquina de Turing
653 $aOne-way permutation
653 $aPermutação one way
653 $aPrincípio de Landauer
653 $aTuring machine
773 $tPhysica A: statistical mechanics and its applications, Amsterdam$gv. 415, p. 473-478, 2014.
Download
Esconder MarcMostrar Marc Completo |
|
Registro original: |
Embrapa Agricultura Digital (CNPTIA) |
|
|
Biblioteca |
ID |
Origem |
Tipo/Formato |
Classificação |
Cutter |
Registro |
Volume |
Status |
Fechar
|
| Expressão de busca inválida. Verifique!!! |
|
|
