Supervised link prediction aims at finding missing links in a network by learning directly from the data suitable criteria for classifying link types into existent or non-existent. Recently, along this line, subgraph-based methods learning a function that maps subgraph patterns to link existence have witnessed great successes. However, these approaches still have drawbacks. First, the construction of the subgraph relies on an arbitrary nodes selection, often ineffective.

Here some issues are studied, related to the numerical solution of Richards' equation in a one dimensional spatial domain by a technique based on the Transversal Method of Lines (TMoL). The core idea of TMoL approach is to semi-discretize the time derivative of Richards' equation: afterward a system of second order differential equations in the space variable is derived as an initial value problem. The computational framework of this method requires both Dirichlet and Neumann boundary conditions at the top of the column. The practical motivation for choosing such a condition is argued.

Background The host's immune system develops in equilibrium with both cellular self-antigens and non-self-antigens derived from microorganisms which enter the body during lifetime. In addition, during the years, a tumor may arise presenting to the immune system an additional pool of non-self-antigens, namely tumor antigens (tumor-associated antigens, TAAs; tumor-specific antigens, TSAs). Methods In the present study, we looked for homology between published TAAs and non-self-viral-derived epitopes. Bioinformatics analyses and ex vivo immunological validations have been performed.

The main focus of this paper is the characterization and exploitation of the asymptotic spectrum of the saddle--point matrix sequences arising from the discretization of optimization problems constrained by elliptic partial differential equations. They uncover the existence of an hidden structure in these matrix sequences, namely, they show that these are indeed an example of Generalized Locally Toeplitz (GLT) sequences.

X-ray Small and Wide Scattering scanning microscopies have been adopted to inspect morphological and structural properties of collagen-based tissues at the atomic and nano scale 1 .

In network analysis, many community detection algorithms have been developed. However, their implementation leaves unaddressed the question of the statistical validation of the results. Here, we present robin (ROBustness In Network), an R package to assess the robustness of the community structure of a network found by one or more methods to give indications about their reliability.

We present a simple model describing the chemical aggression undergone by calcium carbonate rocks in presence of acid atmosphere. A large literature is available on the deterioration processes of building stones, in particular in connection with problems concerning historical buildings in the field of Cultural Heritage. It is well known that the greatest aggression is caused by SO2 andNO3. In this paper we consider the corrosion caused by sulphur dioxide, which, reacting with calcium carbonate, produces gypsum.

We present a new multistage method to study the N-Methyl-D-Aspartate (NMDA) neuroreceptor starting from the reconstruction of its crystallographic structure. Thanks to the combination of Homology Modelling, Molecular Dynamics and Lattice Boltzmann simulations, we analyse the allosteric transition of NDMA upon ligand binding and compute the receptor response to ionic passage across the membrane.

We study nonnegative solutions of the Cauchy problem

Bandelt and Mulder's structural characterization of bipartite distance hereditary graphs 16 asserts that such graphs can be built inductively starting from a single vertex and by re- 17 peatedly adding either pendant vertices or twins (i.e., vertices with the same neighborhood 18 as an existing one). Dirac and Duffin's structural characterization of 2-connected series- 19 parallel graphs asserts that such graphs can be built inductively starting from a single edge 20 by adding either edges in series or in parallel.