2,440 research outputs found

    Conditional Involvement of CONSTITUTIVE PHOTOMORPHOGENIC1 in the Degradation of Phytochrome A.

    Get PDF
    All higher plants possess multiple phytochrome photoreceptors, with phytochrome A (phyA) being light labile and other members of the family being relatively light stable (phyB-phyE in Arabidopsis [Arabidopsis thaliana]). phyA also differs from other members of the family because it enables plants to deetiolate in far-red light-rich environments typical of dense vegetational cover. Later in development, phyA counteracts the shade avoidance syndrome. Light-induced degradation of phyA favors the establishment of a robust shade avoidance syndrome and was proposed to be important for phyA-mediated deetiolation in far-red light. phyA is ubiquitylated and targeted for proteasome-mediated degradation in response to light. Cullin1 and the ubiquitin E3 ligase CONSTITUTIVE PHOTOMORPHOGENIC1 (COP1) have been implicated in this process. Here, we systematically analyze the requirement of cullins in this process and show that only CULLIN1 plays an important role in light-induced phyA degradation. In addition, the role of COP1 in this process is conditional and depends on the presence of metabolizable sugar in the growth medium. COP1 acts with SUPPRESSOR OF PHYTOCHROME A (SPA) proteins. Unexpectedly, the light-induced decline of phyA levels is reduced in spa mutants irrespective of the growth medium, suggesting a COP1-independent role for SPA proteins

    Identidade visual da Biblioteca da Embrapa Florestas: uma proposta de sinalização.

    Get PDF
    Organizado por Patricia Póvoa de Mattos, Celso Garcia Auer, Rejane Stumpf Sberze, Katia Regina Pichelli e Paulo César Botosso

    On the Approximability of Digraph Ordering

    Full text link
    Given an n-vertex digraph D = (V, A) the Max-k-Ordering problem is to compute a labeling :V[k]\ell : V \to [k] maximizing the number of forward edges, i.e. edges (u,v) such that \ell(u) < \ell(v). For different values of k, this reduces to Maximum Acyclic Subgraph (k=n), and Max-Dicut (k=2). This work studies the approximability of Max-k-Ordering and its generalizations, motivated by their applications to job scheduling with soft precedence constraints. We give an LP rounding based 2-approximation algorithm for Max-k-Ordering for any k={2,..., n}, improving on the known 2k/(k-1)-approximation obtained via random assignment. The tightness of this rounding is shown by proving that for any k={2,..., n} and constant ε>0\varepsilon > 0, Max-k-Ordering has an LP integrality gap of 2 - ε\varepsilon for nΩ(1/loglogk)n^{\Omega\left(1/\log\log k\right)} rounds of the Sherali-Adams hierarchy. A further generalization of Max-k-Ordering is the restricted maximum acyclic subgraph problem or RMAS, where each vertex v has a finite set of allowable labels SvZ+S_v \subseteq \mathbb{Z}^+. We prove an LP rounding based 42/(2+1)2.3444\sqrt{2}/(\sqrt{2}+1) \approx 2.344 approximation for it, improving on the 222.8282\sqrt{2} \approx 2.828 approximation recently given by Grandoni et al. (Information Processing Letters, Vol. 115(2), Pages 182-185, 2015). In fact, our approximation algorithm also works for a general version where the objective counts the edges which go forward by at least a positive offset specific to each edge. The minimization formulation of digraph ordering is DAG edge deletion or DED(k), which requires deleting the minimum number of edges from an n-vertex directed acyclic graph (DAG) to remove all paths of length k. We show that both, the LP relaxation and a local ratio approach for DED(k) yield k-approximation for any k[n]k\in [n].Comment: 21 pages, Conference version to appear in ESA 201

    High-resolution abundance analysis of red giants in the globular cluster NGC 6522

    Get PDF
    The [Sr/Ba] and [Y/Ba] scatter observed in some galactic halo stars that are very metal-poor stars and in a few individual stars of the oldest known Milky Way globular cluster NGC 6522,have been interpreted as evidence of early enrichment by massive fast-rotating stars (spinstars). Because NGC 6522 is a bulge globular cluster, the suggestion was that not only the very-metal poor halo stars, but also bulge stars at [Fe/H]~-1 could be used as probes of the stellar nucleosynthesis signatures from the earlier generations of massive stars, but at much higher metallicity. For the bulge the suggestions were based on early spectra available for stars in NGC 6522, with a medium resolution of R~22,000 and a moderate signal-to-noise ratio. The main purpose of this study is to re-analyse the NGC 6522 stars previously reported using new high-resolution (R~45,000) and high signal-to-noise spectra (S/N>100). We aim at re-deriving their stellar parameters and elemental ratios, in particular the abundances of the neutron-capture s-process-dominated elements such as Sr, Y, Zr, La, and Ba, and of the r-element Eu. High-resolution spectra of four giants belonging to the bulge globular cluster NGC 6522 were obtained at the 8m VLT UT2-Kueyen telescope with the UVES spectrograph in FLAMES-UVESconfiguration. The spectroscopic parameters were derived based on the excitation and ionization equilibrium of \ion{Fe}{I} and \ion{Fe}{II}. Our analysis confirms a metallicity [Fe/H] = -0.95+-0.15 for NGC 6522, and the overabundance of the studied stars in Eu (with +~0.2 < [Eu/Fe] < +~0.4) and alpha-elements O and Mg. The neutron-capture s-element-dominated Sr, Y, Zr, Ba, La now show less pronounced variations from star to star. Enhancements are in the range 0.0 < [Sr/Fe] < +0.4, +0.23 < [Y/Fe] < +0.43, 0.0 < [Zr/Fe] < +0.4, 0.0 < [La/Fe] < +0.35,and 0.05 < [Ba/Fe] < +0.55.Comment: date of acceptation: 31/07/2014, in press, 24 pages, 19 figures,Astronomy & Astrophysics, 201

    Lagarta-dos-cafezais: o caso de Rondônia.

    Get PDF
    Nesta publicação verificou-se a existência de 64 propriedades com 618 hectares afetados pelo ataque da lagarta-dos-cafezais no município de Cacoal-RO e as medidas de controle adotadas para conter a expansão de E. imperialis com a redução significativa da área atacada.bitstream/item/72102/1/0000004037-ct68-lagartadoscafezais.pd

    Principais pragas do cafeeiro em Rondônia: característica, infestação e controle.

    Get PDF
    A cultura do café está sujeita ao ataque de pragas, que de conformidade com as condições climáticas, sistema de cultivo ou desequilíbrio biológico, podem causar danos consideráveis, prejudicando o desenvolvimento e produção das plantas. Na Região Amazônica, particularmente em Rondônia, onde o sistema monocultural é predominante, prevalecem condições ambientais com alto potencial de susceptibilidade a pragas habitualmente existentes neste agroecossistema. Quanto às pragas destacam-se a broca-do-café, principal praga na Amazônia, sendo responsável por grandes perdas na produtividade do café Conilon; o ácaro vermelho, considerado segunda praga em importância na região; o bicho-mineiro, não obstante à tolerância do ‘Conilon’, tem-se observado lavouras em Rondônia com alta infestação; e a lagarta-dos-cafezais que vem atacando pelo quinto ano consecutivo, cafeeiros no Município de Cacoal-RO.bitstream/item/70849/1/0000003287-CT59-lagartadoscafezais.pd

    On small-noise equations with degenerate limiting system arising from volatility models

    Full text link
    The one-dimensional SDE with non Lipschitz diffusion coefficient dXt=b(Xt)dt+σXtγdBt, X0=x, γ<1dX_{t} = b(X_{t})dt + \sigma X_{t}^{\gamma} dB_{t}, \ X_{0}=x, \ \gamma<1 is widely studied in mathematical finance. Several works have proposed asymptotic analysis of densities and implied volatilities in models involving instances of this equation, based on a careful implementation of saddle-point methods and (essentially) the explicit knowledge of Fourier transforms. Recent research on tail asymptotics for heat kernels [J-D. Deuschel, P.~Friz, A.~Jacquier, and S.~Violante. Marginal density expansions for diffusions and stochastic volatility, part II: Applications. 2013, arxiv:1305.6765] suggests to work with the rescaled variable Xε:=ε1/(1γ)XX^{\varepsilon}:=\varepsilon^{1/(1-\gamma)} X: while allowing to turn a space asymptotic problem into a small-ε\varepsilon problem with fixed terminal point, the process XεX^{\varepsilon} satisfies a SDE in Wentzell--Freidlin form (i.e. with driving noise εdB\varepsilon dB). We prove a pathwise large deviation principle for the process XεX^{\varepsilon} as ε0\varepsilon \to 0. As it will become clear, the limiting ODE governing the large deviations admits infinitely many solutions, a non-standard situation in the Wentzell--Freidlin theory. As for applications, the ε\varepsilon-scaling allows to derive exact log-asymptotics for path functionals of the process: while on the one hand the resulting formulae are confirmed by the CIR-CEV benchmarks, on the other hand the large deviation approach (i) applies to equations with a more general drift term and (ii) potentially opens the way to heat kernel analysis for higher-dimensional diffusions involving such an SDE as a component.Comment: 21 pages, 1 figur

    Espécies frutíferas nativas do Sul do Brasil.

    Get PDF
    bitstream/item/33526/1/documento-129.pd

    On Upward Drawings of Trees on a Given Grid

    Full text link
    Computing a minimum-area planar straight-line drawing of a graph is known to be NP-hard for planar graphs, even when restricted to outerplanar graphs. However, the complexity question is open for trees. Only a few hardness results are known for straight-line drawings of trees under various restrictions such as edge length or slope constraints. On the other hand, there exist polynomial-time algorithms for computing minimum-width (resp., minimum-height) upward drawings of trees, where the height (resp., width) is unbounded. In this paper we take a major step in understanding the complexity of the area minimization problem for strictly-upward drawings of trees, which is one of the most common styles for drawing rooted trees. We prove that given a rooted tree TT and a W×HW\times H grid, it is NP-hard to decide whether TT admits a strictly-upward (unordered) drawing in the given grid.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017
    corecore