The application of gibberellic acid increases berry size of ‘Emperatriz’ seedless grape

Gibberellic acid (GA3) increases berry size of "Emperatriz" seedless grape, the response depending on the phenological stage of vine at treatment date and on the concentration applied. From berry fruit set to 21 days later, 80 mg/L GA3 increased commercial berry weight by 50%-90%, depending on the year, reaching similar size to that of "Aledo" seeded grape, used as comparison. This effect takes place through: a) a larger berry growth rate; b) an early glucose, fructose and sucrose uptake; c) an increase of absolute glucose and fructose content (mg/berry) of seedless berries up to similar values to those of seeded berries; and d) an increase of absolute berry water content but not of relative content to fresh weight, thus water potential and osmotic potential are not significantly modified by treatments. GA3 does not affect berry pericarp cell number but increases pericarp cell diameter

Monitoramento eletrônico da atividade alimentar de percevejos pelo uso do EPG em soja Bt versus soja convencional.

Orientador: Antônio Ricardo Panizzi

Fingermark Detection on Thermal Papers: Proposition of an Updated Processing Sequence

The detection of latent fingermarks on thermal papers proves to be particularly challenging because the application of conventional detection techniques may turn the sample dark grey or black, thus preventing the observation of fingermarks. Various approaches aiming at avoiding or solving this problem have been suggested. However, in view of the many propositions available in the literature, it gets difficult to choose the most advantageous method and to decide which processing sequence should be followed when dealing with a thermal paper. In this study, 19 detection techniques adapted to the processing of thermal papers were assessed individually and then were compared to each other. An updated processing sequence, assessed through a pseudo-operational test, is suggested

A Spiritual Vision for Catholic Educator Prep in a Time of Disruption: A Reflective Essay

This essay reflects on the spiritual lessons learned as a Catholic graduate-level teacher prep program guided novice teachers through the first months of the COVID-19 pandemic. We observed the importance of articulating a clear spiritual vision rooted in scripture, history, and personal experience. The guiding spiritual lens has been the Emmaus story which helps us look to the past and to the future as we form and support early-career educators in Catholic schools

A Spiritual Vision for Catholic Educator Prep in a Time of Disruption: A Reflective Essay

This essay reflects on the spiritual lessons learned as a Catholic graduate-level teacher prep program guided novice teachers through the first months of the COVID-19 pandemic. We observed the importance of articulating a clear spiritual vision rooted in scripture, history, and personal experience. The guiding spiritual lens has been the Emmaus story which helps us look to the past and to the future as we form and support early-career educators in Catholic schools

Parameterized Study of the Test Cover Problem

We carry out a systematic study of a natural covering problem, used for identification across several areas, in the realm of parameterized complexity. In the {\sc Test Cover} problem we are given a set $[n]=\{1,...,n\}$ of items together with a collection, $\cal T$, of distinct subsets of these items called tests. We assume that $\cal T$ is a test cover, i.e., for each pair of items there is a test in $\cal T$ containing exactly one of these items. The objective is to find a minimum size subcollection of $\cal T$, which is still a test cover. The generic parameterized version of {\sc Test Cover} is denoted by $p(k,n,|{\cal T}|)$-{\sc Test Cover}. Here, we are given $([n],\cal{T})$ and a positive integer parameter $k$ as input and the objective is to decide whether there is a test cover of size at most $p(k,n,|{\cal T}|)$. We study four parameterizations for {\sc Test Cover} and obtain the following: (a) $k$-{\sc Test Cover}, and $(n-k)$-{\sc Test Cover} are fixed-parameter tractable (FPT). (b) $(|{\cal T}|-k)$-{\sc Test Cover} and $(\log n+k)$-{\sc Test Cover} are W[1]-hard. Thus, it is unlikely that these problems are FPT

La posmodernidad: intento de aproximación desde la historia del pensamiento

Tradicionalmente, la Historia se divide en cuatro períodos que se suceden a lo largo de la trama temporal: Antigüedad, Medievo, Modernidad y Contemporaneidad. Sin embargo, desde otra perspectiva, se puede distinguir entre un pensamiento pre-moderno, otro moderno y un tercero post-moderno. Centrándonos en este último, surgen varios interrogantes. ¿Cómo definir la Posmodernidad? ¿Se puede entender tal paradigma en términos cronológicos? ¿De verdad ha llegado tal momento? ¿En este caso, tiene fecha de caducidad? El propósito del presente trabajo es definir la Posmodernidad desde una visión histórica, y ver, en tres partes, las posibles etapas de su surgimiento, sus características más destacadas, y la cuestión de sus límites.Palabras claves: Modernidad, Posmodernidad, Historia del pensamiento, Conocimiento.AbstractTraditionally, History is divided into four periods that succeeded one after another all along the temporal plot: Antiquity, Middle Ages, Modern period and Contemporary period. However, from another point of view, we can distinguish between pre-modern, then modern, and thirdly post-modern thought. Focusing on the latter one, several questions emerge. How can postmodernism be defined? Can such a paradigm be understood in chronological terms? Has this moment really come? And if that is the case, does it have an expiration date? The aim of the present paper is to define postmodernism from an historic point of view, and to study, in three parts, the possible stages of its emergence, its main outstanding features, and the question of its limits.Keywords: Modernism, Postmodernism, History of Thought, Knowledge.</p

Answering Conjunctive Queries under Updates

We consider the task of enumerating and counting answers to $k$-ary conjunctive queries against relational databases that may be updated by inserting or deleting tuples. We exhibit a new notion of q-hierarchical conjunctive queries and show that these can be maintained efficiently in the following sense. During a linear time preprocessing phase, we can build a data structure that enables constant delay enumeration of the query results; and when the database is updated, we can update the data structure and restart the enumeration phase within constant time. For the special case of self-join free conjunctive queries we obtain a dichotomy: if a query is not q-hierarchical, then query enumeration with sublinear$^\ast$ delay and sublinear update time (and arbitrary preprocessing time) is impossible. For answering Boolean conjunctive queries and for the more general problem of counting the number of solutions of k-ary queries we obtain complete dichotomies: if the query's homomorphic core is q-hierarchical, then size of the the query result can be computed in linear time and maintained with constant update time. Otherwise, the size of the query result cannot be maintained with sublinear update time. All our lower bounds rely on the OMv-conjecture, a conjecture on the hardness of online matrix-vector multiplication that has recently emerged in the field of fine-grained complexity to characterise the hardness of dynamic problems. The lower bound for the counting problem additionally relies on the orthogonal vectors conjecture, which in turn is implied by the strong exponential time hypothesis. $^\ast)$ By sublinear we mean $O(n^{1-\varepsilon})$ for some $\varepsilon>0$, where $n$ is the size of the active domain of the current database