Impact of insecticide resistance on the field control of Aedes aegypti in the State of São Paulo

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Search for invisible decays of Higgs bosons in the vector boson fusion and associated ZH production modes

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Study of vector boson scattering and search for new physics in events with two same-sign leptons and two jets

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Electromagnetic gauge field interpolation between the instant form and the front form of the Hamiltonian dynamics

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Mobile vector soliton in a spin-orbit coupled spin-1 condensate

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Vector solitons in a spin-orbit-coupled spin-2 Bose-Einstein condensate

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Search for vector-like T quarks decaying to top quarks and Higgs bosons in the all-hadronic channel using jet substructure

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Amazonian malaria: Asymptomatic human reservoirs, diagnostic challenges, environmentally driven changes in mosquito vector populations, and the mandate for sustainable control strategies

Across the Americas and the Caribbean, nearly 561,000 slide-confirmed malaria infections were reported officially in 2008. The nine Amazonian countries accounted for 89% of these infections; Brazil and Peru alone contributed 56% and 7% of them, respectively. Local populations of the relatively neglected parasite Plasmodium vivax, which currently accounts for 77% of the regional malaria burden, are extremely diverse genetically and geographically structured. At a time when malaria elimination is placed on the public health agenda of several endemic countries, it remains unclear why malaria proved so difficult to control in areas of relatively low levels of transmission such as the Amazon Basin. We hypothesize that asymptomatic parasite carriage and massive environmental changes that affect vector abundance and behavior are major contributors to malaria transmission in epidemiologically diverse areas across the Amazon Basin. Here we review available data supporting this hypothesis and discuss their implications for current and future malaria intervention policies in the region. Given that locally generated scientific evidence is urgently required to support malaria control interventions in Amazonia, we briefly describe the aims of our current field-oriented malaria research in rural villages and gold-mining enclaves in Peru and a recently opened agricultural settlement in Brazil. (C) 2011 Elsevier B.V. All rights reserved.

Polynomial and Poisson dependence in free Poisson algebras and free Poisson fields

We prove that any two Poisson dependent elements in a free Poisson algebra and a free Poisson field of characteristic zero are algebraically dependent, thus answering positively a question from Makar-Limanov and Umirbaev (2007) [8]. We apply this result to give a new proof of the tameness of automorphisms for free Poisson algebras of rank two (see Makar-Limanov and Umirbaev (2011) [9], Makar-Limanov et al. (2009) [10]). (C) 2011 Elsevier Inc. All rights reserved.

A graded subring of an inverse limit of polynomial rings

We study the power series ring R= K[[x1,x2,x3,...]]on countably infinitely many variables, over a field K, and two particular K-subalgebras of it: the ring S, which is isomorphic to an inverse limit of the polynomial rings in finitely many variables over K, and the ring R', which is the largest graded subalgebra of R. Of particular interest are the homogeneous, finitely generated ideals in R', among them the generic ideals. The definition of S as an inverse limit yields a set of truncation homomorphisms from S to K[x1,...,xn] which restrict to R'. We have that the truncation of a generic I in R' is a generic ideal in K[x1,...,xn]. It is shown in Initial ideals of Truncated Homogeneous Ideals that the initial ideal of such an ideal converge to the initial ideal of the corresponding ideal in R'. This initial ideal need no longer be finitely generated, but it is always locally finitely generated: this is proved in Gröbner Bases in R'. We show in Reverse lexicographic initial ideals of generic ideals are finitely generated that the initial ideal of a generic ideal in R' is finitely generated. This contrast to the lexicographic term order. If I in R' is a homogeneous, locally finitely generated ideal, and if we write the Hilbert series of the truncated algebras K[x1,...,xn] module the truncation of I as qn(t)/(1-t)n, then we show in Generalized Hilbert Numerators that the qn's converge to a power series in t which we call the generalized Hilbert numerator of the algebra R'/I. In Gröbner bases for non-homogeneous ideals in R' we show that the calculations of Gröbner bases and initial ideals in R' can be done also for some non-homogeneous ideals, namely those which have an associated homogeneous ideal which is locally finitely generated. The fact that S is an inverse limit of polynomial rings, which are naturally endowed with the discrete topology, provides S with a topology which makes it into a complete Hausdorff topological ring. The ring R', with the subspace topology, is dense in R, and the latter ring is the Cauchy completion of the former. In Topological properties of R' we show that with respect to this topology, locally finitely generated ideals in R'are closed.

Evaluation of a viral vector system, based on a defective interfering RNA of tomato bushy stunt virus, for protein expression and the induction of gene silencing

A viral vector system was developed based on a DI-RNA, a sub-viral particle derived from TBSV-BS3-statice. This newly designed vector system was tested for its applicability in protein expression and induction of gene silencing. Two strategies were pursued. The first strategy was replication of the DI-RNA by a transgenically expressed TBSV replicase and the second was the replication by a so called helper virus. It could be demonstrated by northern blot analysis that the replicase, expressed by the transgenic N. benthamiana plant line TR4 or supplied by the helper virus, is able to replicate DI-RNA introduced into the plant cells. Various genes were inserted into different DI constructs in order to study the vector system with regard to protein expression. However, independent of how the replicase was provided no detectable amounts of protein were produced in the plants. Possible reasons for this failure are identified: the lack of systemic movement of the DI-RNA in the transgenic TR4 plants and the occurrence of deletions in the inserted genes in both systems. As a consequence the two strategies were considered unsuitable for protein expression. The DI-RNA vector system was able to induce silencing of transgenes as well as endogenous genes. Several different p19 deficient helper virus constructs were made to evaluate their silencing efficiency in combination with our DI-RNA constructs. However, it was found that our vector system can not compete with other existing VIGS (virus induced gene silencing) systems in this field. Finally, the influence of DI sequences on mRNA stability on transient GUS expression experiments in GUS silenced plants was evaluated. The GUS reporter gene system was found to be unsuitable for distinguishing between expression levels of wild type plants and GUS silenced transgenic plants. The results indicate a positive effect of the DI sequences on the level of protein expression and therefore further research into this area is recommended.

HIGH PERFORMANCE, LOW COST SUBSPACE DECOMPOSITION AND POLYNOMIAL ROOTING FOR REAL TIME DIRECTION OF ARRIVAL ESTIMATION: ANALYSIS AND IMPLEMENTATION

This thesis develops high performance real-time signal processing modules for direction of arrival (DOA) estimation for localization systems. It proposes highly parallel algorithms for performing subspace decomposition and polynomial rooting, which are otherwise traditionally implemented using sequential algorithms. The proposed algorithms address the emerging need for real-time localization for a wide range of applications. As the antenna array size increases, the complexity of signal processing algorithms increases, making it increasingly difficult to satisfy the real-time constraints. This thesis addresses real-time implementation by proposing parallel algorithms, that maintain considerable improvement over traditional algorithms, especially for systems with larger number of antenna array elements. Singular value decomposition (SVD) and polynomial rooting are two computationally complex steps and act as the bottleneck to achieving real-time performance. The proposed algorithms are suitable for implementation on field programmable gated arrays (FPGAs), single instruction multiple data (SIMD) hardware or application specific integrated chips (ASICs), which offer large number of processing elements that can be exploited for parallel processing. The designs proposed in this thesis are modular, easily expandable and easy to implement. Firstly, this thesis proposes a fast converging SVD algorithm. The proposed method reduces the number of iterations it takes to converge to correct singular values, thus achieving closer to real-time performance. A general algorithm and a modular system design are provided making it easy for designers to replicate and extend the design to larger matrix sizes. Moreover, the method is highly parallel, which can be exploited in various hardware platforms mentioned earlier. A fixed point implementation of proposed SVD algorithm is presented. The FPGA design is pipelined to the maximum extent to increase the maximum achievable frequency of operation. The system was developed with the objective of achieving high throughput. Various modern cores available in FPGAs were used to maximize the performance and details of these modules are presented in detail. Finally, a parallel polynomial rooting technique based on Newton’s method applicable exclusively to root-MUSIC polynomials is proposed. Unique characteristics of root-MUSIC polynomial’s complex dynamics were exploited to derive this polynomial rooting method. The technique exhibits parallelism and converges to the desired root within fixed number of iterations, making this suitable for polynomial rooting of large degree polynomials. We believe this is the first time that complex dynamics of root-MUSIC polynomial were analyzed to propose an algorithm. In all, the thesis addresses two major bottlenecks in a direction of arrival estimation system, by providing simple, high throughput, parallel algorithms.

A computer vision approach for weeds identification through Support Vector Machines

This paper outlines an automatic computervision system for the identification of avena sterilis which is a special weed seed growing in cereal crops. The final goal is to reduce the quantity of herbicide to be sprayed as an important and necessary step for precision agriculture. So, only areas where the presence of weeds is important should be sprayed. The main problems for the identification of this kind of weed are its similar spectral signature with respect the crops and also its irregular distribution in the field. It has been designed a new strategy involving two processes: image segmentation and decision making. The image segmentation combines basic suitable image processing techniques in order to extract cells from the image as the low level units. Each cell is described by two area-based attributes measuring the relations among the crops and weeds. The decision making is based on the SupportVectorMachines and determines if a cell must be sprayed. The main findings of this paper are reflected in the combination of the segmentation and the SupportVectorMachines decision processes. Another important contribution of this approach is the minimum requirements of the system in terms of memory and computation power if compared with other previous works. The performance of the method is illustrated by comparative analysis against some existing strategies.

Implementación de una Support Vector Machine en RVC – CAL para imágenes hiperespectrales

El análisis de imágenes hiperespectrales permite obtener información con una gran resolución espectral: cientos de bandas repartidas desde el espectro infrarrojo hasta el ultravioleta. El uso de dichas imágenes está teniendo un gran impacto en el campo de la medicina y, en concreto, destaca su utilización en la detección de distintos tipos de cáncer. Dentro de este campo, uno de los principales problemas que existen actualmente es el análisis de dichas imágenes en tiempo real ya que, debido al gran volumen de datos que componen estas imágenes, la capacidad de cómputo requerida es muy elevada. Una de las principales líneas de investigación acerca de la reducción de dicho tiempo de procesado se basa en la idea de repartir su análisis en diversos núcleos trabajando en paralelo. En relación a esta línea de investigación, en el presente trabajo se desarrolla una librería para el lenguaje RVC – CAL – lenguaje que está especialmente pensado para aplicaciones multimedia y que permite realizar la paralelización de una manera intuitiva – donde se recogen las funciones necesarias para implementar el clasificador conocido como Support Vector Machine – SVM. Cabe mencionar que este trabajo complementa el realizado en [1] y [2] donde se desarrollaron las funciones necesarias para implementar una cadena de procesado que utiliza el método unmixing para procesar la imagen hiperespectral. En concreto, este trabajo se encuentra dividido en varias partes. La primera de ellas expone razonadamente los motivos que han llevado a comenzar este Trabajo de Investigación y los objetivos que se pretenden conseguir con él. Tras esto, se hace un amplio estudio del estado del arte actual y, en él, se explican tanto las imágenes hiperespectrales como sus métodos de procesado y, en concreto, se detallará el método que utiliza el clasificador SVM. Una vez expuesta la base teórica, nos centraremos en la explicación del método seguido para convertir una versión en Matlab del clasificador SVM optimizado para analizar imágenes hiperespectrales; un punto importante en este apartado es que se desarrolla la versión secuencial del algoritmo y se asientan las bases para una futura paralelización del clasificador. Tras explicar el método utilizado, se exponen los resultados obtenidos primero comparando ambas versiones y, posteriormente, analizando por etapas la versión adaptada al lenguaje RVC – CAL. Por último, se aportan una serie de conclusiones obtenidas tras analizar las dos versiones del clasificador SVM en cuanto a bondad de resultados y tiempos de procesado y se proponen una serie de posibles líneas de actuación futuras relacionadas con dichos resultados. ABSTRACT. Hyperspectral imaging allows us to collect high resolution spectral information: hundred of bands covering from infrared to ultraviolet spectrum. These images have had strong repercussions in the medical field; in particular, we must highlight its use in cancer detection. In this field, the main problem we have to deal with is the real time analysis, because these images have a great data volume and they require a high computational power. One of the main research lines that deals with this problem is related with the analysis of these images using several cores working at the same time. According to this investigation line, this document describes the development of a RVC – CAL library – this language has been widely used for working with multimedia applications and allows an optimized system parallelization –, which joins all the functions needed to implement the Support Vector Machine – SVM - classifier. This research complements the research conducted in [1] and [2] where the necessary functions to implement the unmixing method to analyze hyperspectral images were developed. The document is divided in several chapters. The first of them introduces the motivation of the Master Thesis and the main objectives to achieve. After that, we study the state of the art of some technologies related with this work, like hyperspectral images, their processing methods and, concretely, the SVM classifier. Once we have exposed the theoretical bases, we will explain the followed methodology to translate a Matlab version of the SVM classifier optimized to process an hyperspectral image to RVC – CAL language; one of the most important issues in this chapter is that a sequential implementation is developed and the bases of a future parallelization of the SVM classifier are set. At this point, we will expose the results obtained in the comparative between versions and then, the results of the different steps that compose the SVM in its RVC – CAL version. Finally, we will extract some conclusions related with algorithm behavior and time processing. In the same way, we propose some future research lines according to the results obtained in this document.

Effects of a bifenthrin-treated net on the natural enemies Aphidius colemani (Haliday) and Adalia bipunctata L. in a cucumber crop in Central Spain. Semi-field experiments

Pest management practices that rely on pesticides are growing increasingly less effective and environmentally inappropriate in many cases and the search of alternatives is under focus nowadays. Exclusion of pests from the crop by means of pesticide-treated screens can be an eco-friendly method to protect crops, especially if pests are vectors of important diseases. The mesh size of nets is crucial to determine if insects can eventually cross the barrier or exclude them because there is a great variation in insect size depending on the species. Long-lasting insecticide-treated (LLITN) nets, factory pre-treated, have been used since years to fight against mosquitoes vector of malaria and are able to retain their biological efficacy under field for 3 years. In agriculture, treated nets with different insecticides have shown efficacy in controlling some insects and mites, so they seem to be a good tool in helping to solve some pest problems. However, treated nets must be carefully evaluated because can diminish air flow, increase temperature and humidity and decrease light transmission, which may affect plant growth, pests and natural enemies. As biological control is considered a key factor in IPM nowadays, the potential negative effects of treated nets on natural enemies need to be studied carefully. In this work, the effects of a bifentrhin-treated net (3 g/Kg) (supplied by the company Intelligent Insect Control, IIC) on natural enemies of aphids were tested on a cucumber crop in Central Spain in autumn 2011. The crop was sown in 8x6.5 m tunnels divided in 2 sealed compartments with control or treated nets, which were simple yellow netting with 25 mesh (10 x 10 threads/cm2; 1 x 1 mm hole size). Pieces of 2 m high of the treated-net were placed along the lateral sides of one of the two tunnel compartments in each of the 3 available tunnels (replicates); the rest was covered by a commercial untreated net of a similar mesh. The pest, Aphis gossypii Glover (Aphidae), the parasitoid Aphidius colemani (Haliday) (Braconidae) and the predator Adalia bipunctata L. (Coccinellidae) were artificially introduced in the crop. Weekly sampling was done determining the presence or absence of the pest and the natural enemies (NE) in the 42 plants/compartment as well as the number of insects in 11 marked plants. Environmental conditions (temperature, relative humidity, UV and PAR radiation) were recorded. Results show that when aphids were artificially released inside the tunnels, neither its number/plant nor their distribution was affected by the treated net. A lack of negative effect of the insecticide-treated net on natural enemies was also observed. Adalia bipunctata did not establish in the crop and only a short term control of aphids was observed one week after release. On the other hand, A. colemani did establish in the crop and a more long-term effect on the numbers of aphids/plant was detected irrespective of the type of net. KEY WORDS: bifenthrin-treated net, Adalia bipunctata, Aphidius colemani, Aphis gossypii, semi-field