A sharp integrability condition on the right-hand side of the p-Laplace system for all its solutions to be continuous is exhibited. Their uniform continuity is also analyzed and estimates for their modulus of continuity are provided. The relevant estimates are shown to be optimal as the right-hand side ranges in classes of rearrangement-invariant spaces, such as Lebesgue, Lorentz, Lorentz-Zygmund, and Marcinkiewicz spaces, as well as some customary Orlicz spaces

We present the results obtained by using an evolution of our CUDA-based solution for the exploration, via a breadth first search, of large graphs. This latest version exploits at its best the features of the Kepler architecture and relies on a combination of techniques to reduce both the number of communications among the GPUs and the amount of exchanged data. The final result is a code that can visit more than 800 billion edges in a second by using a cluster equipped with 4,096 Tesla K20X GPUs.

Rollout methodology is a constructive metaheuristic algorithm and its main characteristics are its modularity, the adaptability to different objectives and constraints and the easiness of implementation. Multi-heuristic Rollout extends the Rollout by incorporating several constructive heuristics in the Rollout framework and it is able to easily incorporate human experience inside its research patterns to fulfil complex requirements dictated by the application at hand. However, a drawback for both Rollout and multi-heuristic Rollout is often represented by the required computation time.

A comparison between first-order microscopic and macroscopic differential models of crowd dynamics is established for an increasing number N of pedestrians. The novelty is the fact of considering massive agents, namely, particles whose individual mass does not become infinitesimal when N grows. This implies that the total mass of the system is not constant but grows with N. The main result is that the two types of models approach one another in the limit N -> ?, provided the strength and/or the domain of pedestrian interactions are properly modulated by N at either scale.

The estimation of parameters in a linear model is considered under the hypothesis that the noise, with finite second order statistics, can be represented by random coefficients in a given deterministic basis. An extended underdetermined design matrix is then formed, and the estimator of the extended parameters with minimum l(1) norm is computed.

Searching for words or sentences within large sets of textual documents can be very challenging unless an index of the data has been created in advance. However, indexing can be very time consuming especially if the text is not readily available and has to be extracted from files stored in different formats. Several solutions, based on the MapReduce paradigm, have been proposed to accelerate the process of index creation. These solutions perform well when data are already distributed across the hosts involved in the elaboration.

Here we describe NeuroPype, which is a free open-source Python package, we developed for efficient multi-thread processing of MEG and EEG studies. The proposed package is based on the Nipype framework , a tool developed in fMRI field, which facilitates data analyses by wrapping many commonly-used neuro-imaging software into a common python framework.

Connections between microscopic follow-the-leader and macroscopic fluid-dynamics traffic flow models are already well understood in the case of vehicles moving on a single road. Analogous connections in the case of road networks are instead lacking. This is probably due to the fact that macroscopic traffic models on networks are in general ill-posed, since the conservation of the mass is not sufficient alone to characterize a unique solution at junctions.

Graphics processing units (GPU) are currently used as a cost-effective platform forcomputer simulations and big-data processing. Large scale applications require thatmultiple GPUs work together but the efficiency obtained with cluster of GPUs is, at times,sub-optimal because the GPU features are not exploited at their best. We describe how itis possible to achieve an excellent efficiency for applications in statistical mechanics,particle dynamics and networks analysis by using suitable memory access patterns andmechanisms like CUDA streams, profiling tools, etc.