6 resultados para Rastreio universal de surdez

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP)


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Let M be a finite-dimensional manifold and Sigma be a driftless control system on M of full rank. We prove that for a given initial state x epsilon M, the covering space Gamma(Sigma, x) for a monotonic homotopy of trajectories of Sigma which is recently constructed in [1] coincides with the simply connected universal covering manifold of M and that the terminal projection epsilon(x) : Gamma(Sigma, x) -> M given by epsilon(x) ([alpha]) = alpha(1) is a covering mapping.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this work we present new coupled channel calculations with the Sao Paulo potential (SPP) as the bare interaction, and an imaginary potential with system and energy independent normalization that has been developed to take into account dissipative processes in heavy-ion reactions. This imaginary potential is based on high-energy nucleon interaction in nuclear medium. Our theoretical predictions for energies up to approximate to 100 MeV/nucleon agree very well with the experimental data for the p, n + nucleus, (16)O + (27)Al, (16)O + (60)Ni, (58)Ni + (124)Sn, and weakly bound projectile (7)Li + (120)Sn systems. (C) 2008 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We discuss the possibility of implementing a universal quantum XOR gate by using two coupled quantum dots subject to external magnetic fields that are parallel and slightly different. We consider this system in two different field configurations. In the first case, parallel external fields with the intensity difference at each spin being proportional to the time-dependent interaction between the spins. A general exact solution describing this system is presented and analyzed to adjust field parameters. Then we consider parallel fields with intensity difference at each spin being constant and the interaction between the spins switching on and off adiabatically. In both cases we adjust characteristics of the external fields (their intensities and duration) in order to have the parallel pulse adequate for constructing the XOR gate. In order to provide a complete theoretical description of all the cases, we derive relations between the spin interaction, the inter-dot distance, and the external field. (C) 2008 WILEYNCH Verlag GmbH & Co. KGaA. Weinheim.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Heavy-ion total reaction cross-section measurements for more than 1100 reaction cases covering 61 target nuclei in the range (6)Li-(238)U and 158 projectile nuclei from (2)H to (84)Kr (mostly exotic ones) have been analyzed in a systematic way by using an empirical, three-parameter formula that is applicable to the cases of projectile kinetic energies above the Coulomb barrier. The analysis has shown that the average total nuclear binding energy per nucleon of the interacting nuclei and their radii are the chief quantities that describe the cross-section patterns. A great amount of cross-section data (87%) has been quite satisfactorily reproduced by the proposed formula; therefore, the total reaction cross-section predictions for new, not yet experimentally investigated reaction cases can be obtained within 25% (or much less) uncertainty.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In 1983, Chvatal, Trotter and the two senior authors proved that for any Delta there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph K(N) with N >= Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Delta. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N(2-1/Delta)log(1/Delta)N) edges, with N = [B`n] for some constant B` that depends only on Delta. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Delta is O(n(2-1/Delta)log(1/Delta)n) Our approach is based on random graphs; in fact, we show that the classical Erdos-Renyi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Delta. The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed. (C) 2011 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The recovery and stability of DNA for the detection and genotyping of HPV in UCM-containing specimens, after exposure to denaturing reagents and stored for up to 2 years were evaluated. Samples were collected from 60 women who had cervical cytology specimens harboring cervical intraepithelial neoplasia (CIN) 2 or 3. All samples were stored in UCM and had been frozen at -20 degrees C following the addition of the denaturing reagent (sodium hydroxide) and the removal of the aliquot required for Hybrid Capture 2 testing for the identification of HPV DNA. The samples had been stored for 6, 12 and 24 months (20 samples for each storage time). HPV DNA extraction was performed according to a protocol designed specifically and the presence and quality of DNA was confirmed by human P-globin detection using the consensus primers G73 and G74. HPV DNA was amplified using the consensus primers PGMY09 and PGMY11, and reverse line-blot hybridization was used to detect type-specific amplicons for 37 HPV types. The DNA extracted from the denatured specimen was recovered in 57/60 (95%) of the samples. HPV DNA was detected in 56/57 (98%) of the recovered samples. Twenty-six of the 56 samples recovered (48%) were genotyped successfully. (c) 2007 Elsevier B.V. All rights reserved.