The present study was designed to investigate whether chronic (from 12 to 23 months of age) dietary treatment with the L-type Ca2+ channel blocker nimodipine (30 mg/kg body weight) enhances the cognitive behavior of aged animals and whether such a treatment would have long-term effects on the mechanisms of Ca2+ regulation in synaptic terminals from the aged… (More)
A set C of vertices of a graph G is P3-convex if v ∈ C for every path uvw in G with u, w ∈ C. We prove that it is NP-complete to decide for a given graph G and a given integer p whether the vertex set of G can be partitioned into p non-empty disjoint P3-convex sets. Furthermore, we study such partitions for a variety of graph classes.
Grape pomace provides a rich source of polyphenols that have the capacity to act as powerful antioxidants. An experiment was conducted to study the effect of inclusion of grape pomace concentrate (GPC) at levels of 15, 30, and 60 g/kg and alpha-tocopheryl acetate (200 mg/kg) in broiler chicks (21 to 42 d of age) on performance; digestive organ sizes;… (More)
We study the graphs G for which the hull number h(G) and the geodetic number g(G) with respect to P3-convexity coincide. These two parameters correspond to the minimum cardinality of a set U of vertices of G such that the simple expansion process that iteratively adds to U , all vertices outside of U that have two neighbors in U , produces the whole vertex… (More)
BACKGROUND The present study sought to evaluate the usefulness of EBUS-TBNA in the diagnosis of locoregional recurrence of lung cancer in a cohort of lung cancer patients who were previously treated surgically, and describe our initial experience of EUS-B-FNA in this clinical scenario. METHODS We retrospectively studied the clinical records of all… (More)
Dynamic monopolies in graphs have been studied as a model for spreading processes within networks. Together with their dual notion, the generalized degenerate sets, they form the immediate generalization of the classical notions of vertex covers and independent sets in a graph. We present results concerning dynamic monopolies in graphs of given average… (More)
do Rio de Janeiro, como parte dos requisitos necessários à obtenção do título de Doutor em Engenharia de Sistemas e Computação.