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

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

On the Approximability of Digraph Ordering

Given an n-vertex digraph D = (V, A) the Max-k-Ordering problem is to compute a labeling $\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 $\varepsilon > 0$, Max-k-Ordering has an LP integrality gap of 2 - $\varepsilon$ for $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 $S_v \subseteq \mathbb{Z}^+$. We prove an LP rounding based $4\sqrt{2}/(\sqrt{2}+1) \approx 2.344$ approximation for it, improving on the $2\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\in [n]$.Comment: 21 pages, Conference version to appear in ESA 201

Evolutionary analysis of gene ages across TADs associates chromatin topology with whole-genome duplications

\ua9 2024 The AuthorsTopologically associated domains (TADs) are interaction subnetworks of chromosomal regions in 3D genomes. TAD boundaries frequently coincide with genome breaks while boundary deletion is under negative selection, suggesting that TADs may facilitate genome rearrangements and evolution. We show that genes co-localize by evolutionary age in humans and mice, resulting in TADs having different proportions of younger and older genes. We observe a major transition in the age co-localization patterns between the genes born during vertebrate whole-genome duplications (WGDs) or before and those born afterward. We also find that genes recently duplicated in primates and rodents are more frequently essential when they are located in old-enriched TADs and interact with genes that last duplicated during the WGD. Therefore, the evolutionary relevance of recent genes may increase when located in TADs with established regulatory networks. Our data suggest that TADs could play a role in organizing ancestral functions and evolutionary novelty

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

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

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

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

On Upward Drawings of Trees on a Given Grid

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 $T$ and a $W\times H$ grid, it is NP-hard to decide whether $T$ 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

Determinação do poder calorífico de resíduos florestais em função do seu teor de umidade.

Resumo

Evaluation of Antifingerprint Properties of Plastic Surfaces Used in Automotive Components

The antifingerprint properties of a range of surfaces produced with different technologies (in-mould decoration, in-mould labeling, and painted) were objectively evaluated by depositing on them in standard conditions an artificial fingerprint for direct determination of its visibility. The artificial fingerprint behaves similarly to the real human fingerprints. A classification method is then proposed to classify surfaces on the base of antifingerprint properties by measuring the roughness profile (Ra) and calculating the % variation of gloss (GU 20 and 60°), haze, luminance (L), and diffuse reflectance (R) values after fingerprint deposition. This approach provides an objective and quantitative test method to determine visual antifingerprint properties of coated surfaces, instead of the "easy-to-clean" properties commonly evaluated. The data acquired provides a design guideline for fabricating visually fingerprint-free surfaces by controlling roughness, texture, color, and transparency of surfaces, with the aim of optically masking fingerprints

A357 alloy by LPBF for Industry Applications

The aim of this study is to define the process parameters to build components for industrial applications in A357 alloy by Laser Powder Bed Fusion (LPBF) and to evaluate the effects of post-processing heat treatments on the microstructure and mechanical properties in order to obtain the highest hardness and strength. First, process parameters values were defined to obtain full dense components with highest productivity. Then samples were built for microstructural, hardness, and tensile strength investigation in different conditions: as-built, after a stress-relieving treatment, and after a T6 precipitation hardening treatment. For this latest treatment, different time and temperatures for solution and ageing were investigated to find the best in terms of final hardness achievable. It is demonstrated that samples in A357 alloy can be successfully fabricated by LPBF with a density of 99.9% and a mean hardness value achievable of 116 HV0.1, in as-built condition. However, for production purposes, it is fundamental to reduce the residual stresses typical of LPBF. It was shown that a similar hardness value could be obtained after a stress-relieving treatment followed by a proper T6 treatment, together with a coarser but more isotropic microstructure