Tracking the evolution of waste recycling research using overlay maps of science

Tracking the evolution of research in waste recycling science (WRS) can be valuable for environmental agencies, as well as for recycling businesses. Maps of science are visual, easily readable representations of the cognitive structure of a branch of science, a particular area of research or the global spectrum of scientific production. They are generally built upon evidence collected from reliable sources of information, such as patent and scientific publication databases. This study uses the methodology developed by Rafols et al. (2010) to make a “double overlay map” of WRS upon a basemap reflecting the cognitive structure of all journal-published science, for the years 2005 and 2010. The analysis has taken into account the cognitive areas where WRS articles are published and the areas from where it takes its intellectual nourishing, paying special attention to the growing trends of the key areas. Interpretation of results lead to the conclusion that extraction of energy from waste will probably be an important research topic in the future, along with developments in general chemistry and chemical engineering oriented to the recovery of valuable materials from waste. Agricultural and material sciences, together with the combined economics, politics and geography field, are areas with which WRS shows a relevant and ever increasing cognitive relationship.

Data analysis advances in marine science for fisheries management : supervised classification application

169 p. : il. col.

Wide Screening of Phage-Displayed Libraries Identifies Immune Targets in Planta

Microbe-Associated Molecular Patterns and virulence effectors are recognized by plants as a first step to mount a defence response against potential pathogens. This recognition involves a large family of extracellular membrane receptors and other immune proteins located in different sub-cellular compartments. We have used phage-display technology to express and select for Arabidopsis proteins able to bind bacterial pathogens. To rapidly identify microbe-bound phage, we developed a monitoring method based on microarrays. This combined strategy allowed for a genome-wide screening of plant proteins involved in pathogen perception. Two phage libraries for high-throughput selection were constructed from cDNA of plants infected with Pseudomonas aeruginosa PA14, or from combined samples of the virulent isolate DC3000 of Pseudomonas syringae pv. tomato and its avirulent variant avrRpt2. These three pathosystems represent different degrees in the specificity of plant-microbe interactions. Libraries cover up to 26107 different plant transcripts that can be displayed as functional proteins on the surface of T7 bacteriophage. A number of these were selected in a bio-panning assay for binding to Pseudomonas cells. Among the selected clones we isolated the ethylene response factor ATERF-1, which was able to bind the three bacterial strains in competition assays. ATERF-1 was rapidly exported from the nucleus upon infiltration of either alive or heat-killed Pseudomonas. Moreover, aterf-1 mutants exhibited enhanced susceptibility to infection. These findings suggest that ATERF-1 contains a microbe-recognition domain with a role in plant defence. To identify other putative pathogen-binding proteins on a genome-wide scale, the copy number of selected-vs.-total clones was compared by hybridizing phage cDNAs with Arabidopsis microarrays. Microarray analysis revealed a set of 472 candidates with significant fold change. Within this set defence-related genes, including well-known targets of bacterial effectors, are over-represented. Other genes non-previously related to defence can be associated through this study with general or strain-specific recognition of Pseudomonas.

Treewidth: theory and applications to computer science

This report is an introduction to the concept of treewidth, a property of graphs that has important implications in algorithms. Some basic concepts of graph theory are presented in the first chapter for those readers that are not familiar with the notation. In Chapter 2, the definition of treewidth and some different ways of characterizing it are explained. The last two chapters focus on the algorithmic implications of treewidth, which are very relevant in Computer Science. An algorithm to compute the treewidth of a graph is presented and its result can be later applied to many other problems in graph theory, like those introduced in the last chapter.