Spatial distribution of Echinolitorina peruviana (Lamarck, 1882) for intertidal rocky shore in Antofagasta (23° S, Chile).

The intertidal rocky shores in continental Chile have high species diversity mainly in northern Chile (18-27° S), and one of the most widespread species is the gastropod Echinolittorina peruviana (Lamarck, 1822). The aim of the present study is do a first characterization of spatial distribution of E. peruviana in along rocky shore in Antofagasta town in northern Chile. Individuals were counted in nine different sites that also were determined their spectral properties using remote sensing techniques (LANDSAT ETM+). The results revealed that sites without marked human intervention have more abundant in comparison to sites located in the town, also in all studied sites was found an aggregated pattern, and in six of these sites were found a negative binomial distribution. The low density related to sites with human intervention is supported when spectral properties for sites were included. These results would agree with other similar results for rocky shore in northern and southern Chile.

Graph coarsening: from scientific computing to machine learning

The general method of graph coarsening or graph reduction has been a remarkably useful and ubiquitous tool in scientific computing and it is now just starting to have a similar impact in machine learning. The goal of this paper is to take a broad look into coarsening techniques that have been successfully deployed in scientific computing and see how similar principles are finding their way in more recent applications related to machine learning. In scientific computing, coarsening plays a central role in algebraic multigrid methods as well as the related class of multilevel incomplete LU factorizations. In machine learning, graph coarsening goes under various names, e.g., graph downsampling or graph reduction. Its goal in most cases is to replace some original graph by one which has fewer nodes, but whose structure and characteristics are similar to those of the original graph. As will be seen, a common strategy in these methods is to rely on spectral properties to define the coarse graph.

Reconstruction of Differential Operators with Frozen Argument

We study spectral properties of a wide class of differential operators with frozen arguments by putting them into a general framework of rank-one perturbation theory. In particular, we give a complete characterization of possible eigenvalues for these operators and solve the inverse spectral problem of reconstructing the perturbation from the resulting spectrum. This approach provides a unified treatment of several recent studies and gives a clear explanation and interpretation of the obtained results.