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.

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.