946 resultados para Tell and show routine
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
We compute the tree level cross section for gluon-gluon elastic scattering taking into account a dynamical gluon mass, and show that this mass scale is a natural regulator for this subprocess cross section. Using an eikonal approach in order to examine the relationship between this gluon-gluon scattering and the elastic pp and (p) over barp channels, we found that the dynamical gluon mass is of the same order of magnitude as the ad hoc infrared mass scale m(0) underlying eikonalized QCD-inspired models. We argue that this correspondence is not an accidental result, and that this dynamical scale indeed represents the onset of nonperturbative contributions to the elastic hadron-hadron scattering. We apply the eikonal model with a dynamical infrared mass scale to obtain predictions for sigma(tot)(pp,(p) over barp), rho(pp,(p) over barp), slope B-pp,B-(p) over barp, and differential elastic scattering cross section d sigma((p) over barp)/dt at Tevatron and CERN-LHC energies.
Resumo:
The objective of the present study was to optimize a radiographic technique for hand examinations using a computed radiography (CR) system and demonstrate the potential for dose reductions compared with clinically established technique. An exposure index was generated from the optimized technique to guide operators when imaging hands. Homogeneous and anthropomorphic phantoms that simulated a patient's hand were imaged using a CR system at various tube voltages and current settings (40-55 kVp, 1.25-2.8 mAs), including those used in clinical routines (50 kVp, 2.0 mAs) to obtain an optimized chart. The homogeneous phantom was used to assess objective parameters that are associated with image quality, including the signal difference-to-noise ratio (SdNR), which is used to define a figure of merit (FOM) in the optimization process. The anthropomorphic phantom was used to subjectively evaluate image quality using Visual Grading Analysis (VGA) that was performed by three experienced radiologists. The technique that had the best VGA score and highest FOM was considered the gold standard (GS) in the present study. Image quality, dose and the exposure index that are currently used in the clinical routine for hand examinations in our institution were compared with the GS technique. The effective dose reduction was 67.0%. Good image quality was obtained for both techniques, although the exposure indices were 1.60 and 2.39 for the GS and clinical routine, respectively.
Resumo:
In this article we introduce a three-parameter extension of the bivariate exponential-geometric (BEG) law (Kozubowski and Panorska, 2005) [4]. We refer to this new distribution as the bivariate gamma-geometric (BGG) law. A bivariate random vector (X, N) follows the BGG law if N has geometric distribution and X may be represented (in law) as a sum of N independent and identically distributed gamma variables, where these variables are independent of N. Statistical properties such as moment generation and characteristic functions, moments and a variance-covariance matrix are provided. The marginal and conditional laws are also studied. We show that BBG distribution is infinitely divisible, just as the BEG model is. Further, we provide alternative representations for the BGG distribution and show that it enjoys a geometric stability property. Maximum likelihood estimation and inference are discussed and a reparametrization is proposed in order to obtain orthogonality of the parameters. We present an application to a real data set where our model provides a better fit than the BEG model. Our bivariate distribution induces a bivariate Levy process with correlated gamma and negative binomial processes, which extends the bivariate Levy motion proposed by Kozubowski et al. (2008) [6]. The marginals of our Levy motion are a mixture of gamma and negative binomial processes and we named it BMixGNB motion. Basic properties such as stochastic self-similarity and the covariance matrix of the process are presented. The bivariate distribution at fixed time of our BMixGNB process is also studied and some results are derived, including a discussion about maximum likelihood estimation and inference. (C) 2012 Elsevier Inc. All rights reserved.
Resumo:
Souza J.O.T., Andriolo A., Franci C.R. & Genaro G. 2012. Pre- and post-puberty physiological plasma oxytocin concentrations in male domestic cats (Felis silvestris catus). Pesquisa Veterinaria Brasileira 32(11):1196-1198. Programa de Pos-Graduacao em Psicobiologia, Faculdade de Filosofia Ciencias e Letras de Ribeirao Preto, Universidade de Sao Paulo, Cx. Postal 390, Ribeirao Preto, SP 14001-970, Brazil. E-mail: gelsongenaro@hotmail.com The hormone oxytocin is released by the neuropituitary gland through stimulation of the neurons of the supraoptic and paraventricular nuclei of the hypothalamus. In order to determine the physiological concentrations of this hormone in domestic cats, blood samples were collected from 15 male animals (Felis silvestris catus) during the pre- and post-puberty periods (at four and eight months of age, respectively). Oxytocin determination was accomplished by radioimmunoassay. The average oxytocin concentrations measured in the pre- and post-puberty periods were 2.54 +/- 0.24 (mu g/dL) and 2.53 +/- 0.28 (mu g/dL), respectively, and there were no statistical differences between these measurements. Because there are few literature on the analysis of this hormone, especially in the case of male Felis silvestris catus, more studies on the influence of oxytocin on the physiology and reproduction of this species should be conducted under maintenance and situations of stress (such as transportation), and other routine events.
Resumo:
In this work we report results of continuous wave (CW) electron paramagnetic resonance (EPR) spectroscopy of vanadium oxide nanotubes. The observed EPR spectra are composed of a weak well-resolved spectrum of isolated V4+ ions on top of an intense and broad structure-less line shape, attributed to spin-spin exchanged V4+ clusters. With the purpose to deconvolute the structured weak spectrum from the composed broad line, a new approach based on the Krylov basis diagonalization method (KBDM) is introduced. It is based on the discrimination between broad and sharp components with respect to a selectable threshold and can be executed with few adjustable parameters, without the need of a priori information on the shape and structure of the lines. This makes the method advantageous with respect to other procedures and suitable for fast and routine spectral analysis, which, in conjunction with simulation techniques based on the spin Hamiltonian parameters, can provide a full characterization of the EPR spectrum. Results demonstrate and characterize the coexistence of two V4+ species in the nanotubes and show good progress toward the goal of obtaining high fidelity deconvoluted spectra from complex signals with overlapping broader line shapes. (C) 2012 Elsevier Inc. All rights reserved.
Resumo:
DEP domain-containing mTOR-interacting protein (DEPTOR) inhibits the mechanistic target of rapamycin (mTOR), but its in vivo functions are unknown. Previous work indicates that Deptor is part of the Fob3a quantitative trait locus (QTL) linked to obesity/leanness in mice, with Deptor expression being elevated in white adipose tissue (WAT) of obese animals. This relation is unexpected, considering the positive role of mTOR in adipogenesis. Here, we dissected the Fob3a QTL and show that Deptor is the highest-priority candidate promoting WAT expansion in this model. Consistently, transgenic mice overexpressing DEPTOR accumulate more WAT. Furthermore, in humans, DEPTOR expression in WAT correlates with the degree of obesity. We show that DEPTOR is induced by glucocorticoids during adipogenesis and that its overexpression promotes, while its suppression blocks, adipogenesis. DEPTOR activates the proadipogenic Akt/PKB-PPAR-gamma axis by dampening mTORC1-mediated feedback inhibition of insulin signaling. These results establish DEPTOR as a new regulator of adipogenesis.
Resumo:
Five new species are described herein for the Neotropical genus Psilochlorops, up to now known only from the type-species, P. clavitibia Duda-P. brunneus sp. n., P. elongatum sp. n., P. flavisoma sp. n., P. nigrifemur sp. n. and P. paganelliae sp. n. All new species are described in detail and illustrated. A key to the species of the genus is provided. The diagnosis of Psilochlorops, after the addition of these species, is emended. A cladistic analysis of the genus indicates that Psilochlorops is monophyletic and show the affinities between the species.
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.
Resumo:
Dynamical properties for a beam light inside a sinusoidally corrugated waveguide are discussed in this paper. The beam is confined inside two-mirrors: one is flat and the other one is sinusoidally corrugated. The evolution of the system is described by the use of a two-dimensional and nonlinear mapping. The phase space of the system is of mixed type therefore exhibiting a large chaotic sea, periodic islands and invariant KAM curves. A careful discussion of the numerical method to solve the transcendental equations of the mapping is given. We characterize the probability of observing successive reflections of the light by the corrugated mirror and show that it is scaling invariant with respect to the amplitude of the corrugation. Average properties of the chaotic sea are also described by the use of scaling arguments.
Resumo:
The vertebrate retina has a very high dynamic range. This is due to the concerted action of its diverse cell types. Ganglion cells, which are the output cells of the retina, have to preserve this high dynamic range to convey it to higher brain areas. Experimental evidence shows that the firing response of ganglion cells is strongly correlated with their total dendritic area and only weakly correlated with their dendritic branching complexity. On the other hand, theoretical studies with simple neuron models claim that active and large dendritic trees enhance the dynamic range of single neurons. Theoretical models also claim that electrical coupling between ganglion cells via gap junctions enhances their collective dynamic range. In this work we use morphologically reconstructed multi-compartmental ganglion cell models to perform two studies. In the first study we investigate the relationship between single ganglion cell dynamic range and number of dendritic branches/total dendritic area for both active and passive dendrites. Our results support the claim that large and active dendrites enhance the dynamic range of a single ganglion cell and show that total dendritic area has stronger correlation with dynamic range than with number of dendritic branches. In the second study we investigate the dynamic range of a square array of ganglion cells with passive or active dendritic trees coupled with each other via dendrodendritic gap junctions. Our results suggest that electrical coupling between active dendritic trees enhances the dynamic range of the ganglion cell array in comparison with both the uncoupled case and the coupled case with cells with passive dendrites. The results from our detailed computational modeling studies suggest that the key properties of the ganglion cells that endow them with a large dynamic range are large and active dendritic trees and electrical coupling via gap junctions.
Resumo:
The automatic disambiguation of word senses (i.e., the identification of which of the meanings is used in a given context for a word that has multiple meanings) is essential for such applications as machine translation and information retrieval, and represents a key step for developing the so-called Semantic Web. Humans disambiguate words in a straightforward fashion, but this does not apply to computers. In this paper we address the problem of Word Sense Disambiguation (WSD) by treating texts as complex networks, and show that word senses can be distinguished upon characterizing the local structure around ambiguous words. Our goal was not to obtain the best possible disambiguation system, but we nevertheless found that in half of the cases our approach outperforms traditional shallow methods. We show that the hierarchical connectivity and clustering of words are usually the most relevant features for WSD. The results reported here shed light on the relationship between semantic and structural parameters of complex networks. They also indicate that when combined with traditional techniques the complex network approach may be useful to enhance the discrimination of senses in large texts. Copyright (C) EPLA, 2012
Resumo:
We analyze the global phase diagram of a Maier-Saupe lattice model with the inclusion of shape-disordered degrees of freedom to mimic a mixture of oblate and prolate molecules (discs and cylinders). In the neighborhood of a Landau multicritical point, solutions of the statistical problem can be written as a Landau-de Gennes expansion for the free energy. If the shape-disordered degrees of freedom are quenched, we confirm the existence of a biaxial nematic structure. If orientational and disorder degrees of freedom are allowed to thermalize, this biaxial solution becomes thermodynamically unstable. Also, we use a two-temperature formalism to mimic the presence of two distinct relaxation times, and show that a slight departure from complete thermalization is enough to stabilize a biaxial nematic phase.
Resumo:
This paper reports experiments on the use of a recently introduced advection bounded upwinding scheme, namely TOPUS (Computers & Fluids 57 (2012) 208-224), for flows of practical interest. The numerical results are compared against analytical, numerical and experimental data and show good agreement with them. It is concluded that the TOPUS scheme is a competent, powerful and generic scheme for complex flow phenomena.
Resumo:
We deal with the optimization of the production of branched sheet metal products. New forming techniques for sheet metal give rise to a wide variety of possible profiles and possible ways of production. In particular, we show how the problem of producing a given profile geometry can be modeled as a discrete optimization problem. We provide a theoretical analysis of the model in order to improve its solution time. In this context we give the complete convex hull description of some substructures of the underlying polyhedron. Moreover, we introduce a new class of facet-defining inequalities that represent connectivity constraints for the profile and show how these inequalities can be separated in polynomial time. Finally, we present numerical results for various test instances, both real-world and academic examples.