In this paper we consider the final distribution of fuel oil from a storage depot to a set of petrol stations faced by an oil company, which has to decide the weekly replenishment plan for each station, and determine petrol station visiting sequences (vehicle routes) for each day of the week, assuming a fleet of homogeneous vehicles (tankers). The aim is to minimize the total distance travelled by tankers during the week, while loading tankers possibly near to their capacity in order to maximize the resource utilization.

A {0, 1}-matrix A is balanced if it does not contain a submatrix of odd order having exactly two 1's per row and per column. A graph is balanced if its clique-matrix is balanced. No characterization of minimally unbalanced graphs is known, and even no conjecture on the structure of such graphs has been posed, contrary to what happened for perfect graphs. In this paper, we provide such a characterization for the class of diamond-free graphs and establish a connection between minimally unbalanced diamond-free graphs and Dyck-paths.

Magnetoencephalopgraphy (MEG) is a non-invasive functional imaging modality for mapping cerebral electromagnetic activity from measurements of the weak magnetic field that it generates. It is well known that the MEG inverse problem, i.e. the problem of identifying electric currents from the induced magnetic fields, is a severely underdetermined problem and, without complementary prior information, no unique solution can be found.

Introduction: The brain is a connected network, requiring complex-system measures to describe its organization principles [1,2]. Here, we aim at testing whether the normalized compression distance (NCD) [3] is a suitable quantifier of the functional connectivity between cortical regions. This new measure estimates the information shared by two signals comparing the compression length of one signal given the other, without requiring any representation of the single in harmonics or selecting a specific time window where to compare the two signals.

The paper concerns a continuous model governed by a ODE system originated by a discrete duopoly model with bounded rationality, based on constant conjectural variation. The aim of the paper is to show (i) the existence of an absorbing set in the phase space; (ii) linear stability analysis of the critical points of the system; (iii) nonlinear, global asymptotic stability of equilibrium of constant conjectural variation.

The brain is a connected network, requiring complex-system measures to describe its organization principles. The normalized compression distance (NCD) [1] is a parameter -free, quasi universal similarity measure that estimates the information shared by two signals comparing the compression length of one signal given the other. Here, we aim at testing whether this new measure is a suitable quantifier of the functional connectivity between cortical regions.

For clathrate-hydrate polymorphic structure-type (sI versus sII), geometric recognition criteria have been developed and validated. These are applied to the study of the rich interplay and development of both sI and sII motifs in a variety of hydrate-nucleation events for methane and H2S hydrate studied by direct and enhanced-sampling molecular dynamics (MD) simulations.

Electrocorticography (ECoG) is a neurophysiological modality that measures the distribution of electrical potentials, associated with either spontaneous or evoked neural activity, by means of electrodes grids implanted close to the cortical surface. A full interpretation of ECoG data, however, requires solving the ill-posed inverse problem of reconstructing the spatio-temporal distribution of neural currents responsible for the recorded signals.

In this paper we study a semilinear hyperbolic-parabolic system modeling biological phenomena evolving on a network composed of oriented arcs. We prove the existence of global (in time) smooth solutions to this problem. The result is obtained by using energy estimates with suitable transmission conditions at nodes.

We give a complete characterization of bipartite graphs having tree-like Galois lattices. We prove that the poset obtained by deleting bottom and top elements from the Galois lattice of a bipartite graph is tree-like if and only if the graph is a bipartite distance hereditary graph. Relations with the class of Ptolemaic graphs are discussed and exploited to give an alternative proof of the result. (C) 2015 Elsevier B.V. All rights reserved.