Unlike for systems in equilibrium, a straightforward definition of a metastable set in the non-stationary, non-equilibrium case may only be given case-by-case-and therefore it is not directly useful any more, in particular in cases where the slowest relaxation time scales are comparable to the time scales at which the external field driving the system varies. We generalize the concept of metastability by relying on the theory of coherent sets.

Motor learning induces changes in resting-state (RS) network properties in fronts-parietal (Albert et al, 2009) and sensorimotor (Taubert et al, 2011) networks. This study explores the putative modulations of spontaneous resting-state oscillations following a sensori-motor learning task. The task consisted in lifting a load with the right hand, which triggered the unloading of a load suspended to the left forearm (Paulignan et al., 1989). Because learning stabilizes quickly, a temporal delay was implemented, hence placing the subject in a dynamic learning state.

Estimates for solutions to homogeneous Dirichlet problems for a class of elliptic equations with zero order term in the form L(u) = g(x, u) + f (x),where the operator L fulfills an anisotropic elliptic condition, are established. Such estimates are obtained in terms of solutions to suitable problems with radially symmetric data, when no sign conditions on g are required.

We present the latest version of OpenCAPWAP, our open-source implementation of the Internet Engineering Task Force control and provisioning of wireless access point (CAPWAP) protocol. The CAPWAP protocol is designed to support centralized management of large-scale and heterogeneous wireless networks, with a special focus on IEEE 802.11-based networks. The implementation presented in this paper improves substantially on the previous version, adding full support for the Split MAC architecture and decoupling completely the implementation from a specific driver solution.

We report a coarse-grained molecular dynamics simulation study of a bundle of parallel actin filaments under supercritical conditions pressing against a loaded mobile wall using a particle-based approach where each particle represents an actin unit. The filaments are grafted to a fixed wall at one end and are reactive at the other end, where they can perform single monomer (de) polymerization steps and push on a mobile obstacle.

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.

Graphics Processing Units (GPUs) exhibit significantly higher peak performance than conventional CPUs. However, in general only highly parallel algorithms can exploit their potential. In this scenario, the iterative solution to sparse linear systems of equations could be carried out quite efficiently on a GPU as it requires only matrix-by-vector products, dot products, and vector updates. However, to be really effective, any iterative solver needs to be properly preconditioned and this represents a major bottleneck for a successful GPU implementation.

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.

The problem is addressed of the maximal integrability of the gradient of solutions to quasilinear elliptic equations, with merely measurable coefficients, in two variables. Optimal results are obtained in the framework of Orlicz spaces, and in the more general setting of all rearrangement-invariant spaces. Applications to special instances are exhibited, which provide new gradient bounds, or improve certain results available in the literature. (C) 2016 Elsevier Ltd. All rights reserved.

In the present study, we revisit the MEG inverse problem, regularization and depth weighting from a Bayesian hierarchical point of view: the primary unknown is the discretized current density and each dipole has a preferred direction extracted from the MRI of the subject and encoded in the prior distribution.