945 resultados para SOD MIMICS
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Objective: The present study aimed at evaluating the PROP1 and HESX1 genes in a group of patients with septo-optic dysplasia (SOD) and pituitary hormone deficiency (combined – CPHD; isolated GH deficiency – GHD). Eleven patients with a clinical and biochemical presentation consistent with CPHD, GHD or SOD were evaluated. Subjects and methods: In all patients, the HESX1 gene was analyzed by direct sequence analysis and in cases of CPHD the PROP1 gene was also sequenced. Results: A polymorphism (1772 A > G; N125S) was identified in a patient with SOD. We found three patients carrying the allelic variants 27 T > C; A9A and 59 A > G; N20S in exon 1 of the PROP1 gene. Mutations in the PROP1 and HESX1 genes were not identified in these patients with sporadic GHD, CPHD and SOD. Conclusion: Genetic alterations in one or several other genes, or non-genetic mechanisms, must be implicated in the pathogenic process.
Resumo:
The greenhouse production associated with the fertigation management, have established in Brazil as economical alternative for several horticultural species. With this strategy this study had as aim to evaluate possible impacts in the metabolism of plants of bell pepper (Capsicum annuum L.; cv Elisa) in response to the increase of mineral concentration in the soil. During the experiments, the some nutrient concentrations were altered, to obtain high values of electric conductivity (EC) in the soil solution. The EC values commonly observed in the traditional fertigation system were adopted, as control. It was also verified the possibility of reduction of the mineral stress impact by the application of organic matter in the soil. Parameters of the antioxidative response system, as the superoxide dismutase (SOD) and catalase enzyme activities besides the proline content were evaluated to measure the extension of the saline stress and their effects on the plants. The increase of EC of the soil induced to the increase of the proline concentration and the SOD activity. Unexpectedly, it was verified that the saline stress inhibited the activity of the enzyme catalase. It was also concluded that the monitoring of EC of the soil is an indispensable tool to reach success in the fertigation system and that the study of the activity of the enzymes of the antioxidative response system, and the proline contents can be assumed as indicators in of the levels of stress in bell pepper plants (Capsicum annuum L.; cv Elisa).
Resumo:
The excessive compaction of the soil observed in sod production systems, affects the physical attributes of the soil, which can influence the water infiltration into the soil and hence the rate of soil cover by turfgrasses and time of the sod production. To minimize the effects of soil compacting, some producers use soil preparation equipment that raises the soil on the surface but does not cause excessive roughness which may harm the quality of the sod. Thus, the aim of the present study was to evaluate the infiltration rate and soil cover rate due to different management mechanized in the zoysiagrass sod production. The experimental design had random plots and four replications. The treatments consisted of five mechanized managements of soil: witness (without the use of equipment); coulter blade disc harrow used once (1CB), coulter blade disc harrow used twice (2CB), surface chisel used once (1C), surface chisel and coulter blade disc harrow used once (1C + 1CB). The treatments with 2CB and 1C + 1CB provided greater basic water infiltration speed in the soil and higher rate of soil cover by the turfgrass. The rate of soil cover by turfgrass is positively correlated with water infiltration rate at 133 and 226 DAP, demonstrating the influence of managements used in zoysiagrass sod production and the increment in the infiltration rate of water. Soil preparation utilizing coulter blade disc harrow used twice or surface chisel and coulter blade disc harrow used once is recommended under the conditions this study was done.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Efeito do treinamento físico aeróbio na reatividade vascular da artéria ilíaca em camundongos LDL-/-
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Pós-graduação em Alimentos e Nutrição - FCFAR
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Pós-graduação em Odontologia - FOAR
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
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.