9 resultados para Weingarten-type linear map
em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo
Resumo:
A fast method was optimized and validated in order to quantify amphetamine-type stimulants (amphetamine, AMP; methamphetamine, MAMP; fenproporex, FPX; 3,4-methylenedioxymethamphetamine, MDMA; and 3,4-methylenedioxyamphetamine, MDA) in human hair samples. The method was based in an initial procedure of decontamination of hair samples (50 mg) with dichloromethane, followed by alkaline hydrolysis and extraction of the amphetamines using hollow-fiber liquid-phase micro extraction (HF-LPME) in the three-phase mode. Gas chromatography-mass spectrometry (GC-MS) was used for identification and quantification of the analytes. The LoQs obtained for all amphetamines (around 0.05 ng/mg) were below the cut-off value (0.2 ng/mg) established by the Society of Hair Testing (SoHT). The method showed to be simple and precise. The intra-day and inter-day precisions were within 10.6% and 11.4%, respectively, with the use of only two deuteratecl internal standards (AMP-d5 and MDMA-d5). By using the weighted least squares linear regression (1/x(2)), the accuracy of the method was satisfied in the lower concentration levels (accuracy values better than 87%). Hair samples collected from six volunteers who reported regular use of amphetamines were submitted to the developed method. Drug detection was observed in all samples of the volunteers. (c) 2012 Elsevier B.V. All rights reserved.
Resumo:
Background: The development of sugarcane as a sustainable crop has unlimited applications. The crop is one of the most economically viable for renewable energy production, and CO2 balance. Linkage maps are valuable tools for understanding genetic and genomic organization, particularly in sugarcane due to its complex polyploid genome of multispecific origins. The overall objective of our study was to construct a novel sugarcane linkage map, compiling AFLP and EST-SSR markers, and to generate data on the distribution of markers anchored to sequences of scIvana_1, a complete sugarcane transposable element, and member of the Copia superfamily. Results: The mapping population parents ('IAC66-6' and 'TUC71-7') contributed equally to polymorphisms, independent of marker type, and generated markers that were distributed into nearly the same number of co-segregation groups (or CGs). Bi-parentally inherited alleles provided the integration of 19 CGs. The marker number per CG ranged from two to 39. The total map length was 4,843.19 cM, with a marker density of 8.87 cM. Markers were assembled into 92 CGs that ranged in length from 1.14 to 404.72 cM, with an estimated average length of 52.64 cM. The greatest distance between two adjacent markers was 48.25 cM. The scIvana_1-based markers (56) were positioned on 21 CGs, but were not regularly distributed. Interestingly, the distance between adjacent scIvana_1-based markers was less than 5 cM, and was observed on five CGs, suggesting a clustered organization. Conclusions: Results indicated the use of a NBS-profiling technique was efficient to develop retrotransposon-based markers in sugarcane. The simultaneous maximum-likelihood estimates of linkage and linkage phase based strategies confirmed the suitability of its approach to estimate linkage, and construct the linkage map. Interestingly, using our genetic data it was possible to calculate the number of retrotransposonscIvana_1 (similar to 60) copies in the sugarcane genome, confirming previously reported molecular results. In addition, this research possibly will have indirect implications in crop economics e. g., productivity enhancement via QTL studies, as the mapping population parents differ in response to an important fungal disease.
Resumo:
The success of magnetic hyperthermia cancer treatments rely strongly on the magnetic properties of the nanoparticles and their intricate dependence on the externally applied field. This is particularly more so as the response departs from the low field linear regime. In this paper we introduce a new parameter, referred to as the efficiency in converting electromagnetic energy into thermal energy, which is shown to be remarkably useful in the analysis of the system response, especially when the power loss is investigated as a function of the applied field amplitude. Using numerical simulations of dynamic hysteresis, through the stochastic Landau-Lifshitz model, we map in detail the efficiency as a function of all relevant parameters of the system and compare the results with simple-yet powerful-predictions based on heuristic arguments about the relaxation time. (C) 2012 American Institute of Physics. [http://dx.doi.org/10.1063/1.4705392]
Resumo:
Background: We aimed to investigate the performance of five different trend analysis criteria for the detection of glaucomatous progression and to determine the most frequently and rapidly progressing locations of the visual field. Design: Retrospective cohort. Participants or Samples: Treated glaucoma patients with =8 Swedish Interactive Thresholding Algorithm (SITA)-standard 24-2 visual field tests. Methods: Progression was determined using trend analysis. Five different criteria were used: (A) =1 significantly progressing point; (B) =2 significantly progressing points; (C) =2 progressing points located in the same hemifield; (D) at least two adjacent progressing points located in the same hemifield; (E) =2 progressing points in the same Garway-Heath map sector. Main Outcome Measures: Number of progressing eyes and false-positive results. Results: We included 587 patients. The number of eyes reaching a progression endpoint using each criterion was: A = 300 (51%); B = 212 (36%); C = 194 (33%); D = 170 (29%); and E = 186 (31%) (P = 0.03). The numbers of eyes with positive slopes were: A = 13 (4.3%); B = 3 (1.4%); C = 3 (1.5%); D = 2 (1.1%); and E = 3 (1.6%) (P = 0.06). The global slopes for progressing eyes were more negative in Groups B, C and D than in Group A (P = 0.004). The visual field locations that progressed more often were those in the nasal field adjacent to the horizontal midline. Conclusions: Pointwise linear regression criteria that take into account the retinal nerve fibre layer anatomy enhances the specificity of trend analysis for the detection glaucomatous visual field progression.
Resumo:
A deep theoretical analysis of the graph cut image segmentation framework presented in this paper simultaneously translates into important contributions in several directions. The most important practical contribution of this work is a full theoretical description, and implementation, of a novel powerful segmentation algorithm, GC(max). The output of GC(max) coincides with a version of a segmentation algorithm known as Iterative Relative Fuzzy Connectedness, IRFC. However, GC(max) is considerably faster than the classic IRFC algorithm, which we prove theoretically and show experimentally. Specifically, we prove that, in the worst case scenario, the GC(max) algorithm runs in linear time with respect to the variable M=|C|+|Z|, where |C| is the image scene size and |Z| is the size of the allowable range, Z, of the associated weight/affinity function. For most implementations, Z is identical to the set of allowable image intensity values, and its size can be treated as small with respect to |C|, meaning that O(M)=O(|C|). In such a situation, GC(max) runs in linear time with respect to the image size |C|. We show that the output of GC(max) constitutes a solution of a graph cut energy minimization problem, in which the energy is defined as the a"" (a) norm ayenF (P) ayen(a) of the map F (P) that associates, with every element e from the boundary of an object P, its weight w(e). This formulation brings IRFC algorithms to the realm of the graph cut energy minimizers, with energy functions ayenF (P) ayen (q) for qa[1,a]. Of these, the best known minimization problem is for the energy ayenF (P) ayen(1), which is solved by the classic min-cut/max-flow algorithm, referred to often as the Graph Cut algorithm. We notice that a minimization problem for ayenF (P) ayen (q) , qa[1,a), is identical to that for ayenF (P) ayen(1), when the original weight function w is replaced by w (q) . Thus, any algorithm GC(sum) solving the ayenF (P) ayen(1) minimization problem, solves also one for ayenF (P) ayen (q) with qa[1,a), so just two algorithms, GC(sum) and GC(max), are enough to solve all ayenF (P) ayen (q) -minimization problems. We also show that, for any fixed weight assignment, the solutions of the ayenF (P) ayen (q) -minimization problems converge to a solution of the ayenF (P) ayen(a)-minimization problem (ayenF (P) ayen(a)=lim (q -> a)ayenF (P) ayen (q) is not enough to deduce that). An experimental comparison of the performance of GC(max) and GC(sum) algorithms is included. This concentrates on comparing the actual (as opposed to provable worst scenario) algorithms' running time, as well as the influence of the choice of the seeds on the output.
Auditory brainstem implant outcomes and MAP parameters: Report of experiences in adults and children
Resumo:
The auditory brainstem implant (ABI) was first developed to help neurofibromatosis type 2 patients. Recently, its use has been recently extended to adults with non-tumor etiologies and children with profound hearing loss who were not candidates for a cochlear implant (Cl). Although the results has been extensively reported, the stimulation parameters involved behind the outcomes have received less attention. Objective: The aim of this study is to describe the audiologic outcomes and the MAP parameters in ABI adults and children at our center. Methods: Retrospective chart review. Five adults and four children were implanted with the ABI24M from September 2005 to June 2009. In the adult patients, four had Neurofibromatosis type 2, and one had postmeningitic deafness with complete ossification of both cochleae. Three of the children had cochlear malformation or dysplasia, and one had complete ossified cochlea due to meningitis. Map parameters as well as the intraoperative electrical auditory brainstem responses were collected. Evaluation was performed with at least six months of device use and included free-field hearing thresholds, speech perception tests in the adult patients and for the children, the Infant-Toddler Meaningful Auditory Integration Scale (IT-MAIS) and (ESP) were used to evaluate the development of auditory skills, besides the MUSS to evaluate. Results: The number of active electrodes that did not cause any non-auditory sensation varied from three to nineteen. All of them were programmed with SPEAK strategy, and the pulse widths varied from 100 to 300 mu s. Free-field thresholds with warble tones varied from very soft auditory sensation of 70 dBHL at 250 Hz to a pure tone average of 45 dBHL. Speech perception varied from none to 60% open-set recognition of sentences in silence in the adult population and from no auditory sensation at all to a slight improvement in the IT-MAIS/MAIS scores. Conclusion: We observed that ABI may be a good option for offering some hearing attention to both adults and children. In children, the results might not be enough to ensure oral language development. Programming the speech processor in children demands higher care to the audiologist. (C) 2011 Elsevier Ireland Ltd. All rights reserved.
Resumo:
We consider various problems regarding roots and coincidence points for maps into the Klein bottle . The root problem where the target is and the domain is a compact surface with non-positive Euler characteristic is studied. Results similar to those when the target is the torus are obtained. The Wecken property for coincidences from to is established, and we also obtain the following 1-parameter result. Families which are coincidence free but any homotopy between and , , creates a coincidence with . This is done for any pair of maps such that the Nielsen coincidence number is zero. Finally, we exhibit one such family where is the constant map and if we allow for homotopies of , then we can find a coincidence free pair of homotopies.
Resumo:
The Euler obstruction of a function f can be viewed as a generalization of the Milnor number for functions defined on singular spaces. In this work, using the Euler obstruction of a function, we establish several Lê–Greuel type formulas for germs f:(X,0)→(C,0) and g:(X,0)→(C,0). We give applications when g is a generic linear form and when f and g have isolated singularities.
Resumo:
Hermite interpolation is increasingly showing to be a powerful numerical solution tool, as applied to different kinds of second order boundary value problems. In this work we present two Hermite finite element methods to solve viscous incompressible flows problems, in both two- and three-dimension space. In the two-dimensional case we use the Zienkiewicz triangle to represent the velocity field, and in the three-dimensional case an extension of this element to tetrahedra, still called a Zienkiewicz element. Taking as a model the Stokes system, the pressure is approximated with continuous functions, either piecewise linear or piecewise quadratic, according to the version of the Zienkiewicz element in use, that is, with either incomplete or complete cubics. The methods employ both the standard Galerkin or the Petrov–Galerkin formulation first proposed in Hughes et al. (1986) [18], based on the addition of a balance of force term. A priori error analyses point to optimal convergence rates for the PG approach, and for the Galerkin formulation too, at least in some particular cases. From the point of view of both accuracy and the global number of degrees of freedom, the new methods are shown to have a favorable cost-benefit ratio, as compared to velocity Lagrange finite elements of the same order, especially if the Galerkin approach is employed.