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.

Additive partial linear models with nonparametric additive components of heterogeneous smoothness are studied. To achieve optimal rates in large sample situations we use block wavelet penalisation techniques combined with adaptive (group) LASSO procedures for selecting the variables in the linear part and the the additive components in the nonparametric part of the models. Numerical implementations of our procedures for proximal like algorithms are discussed.

We derive a rule for the reconstruction of the internal heat transfer coefficient hint of a pipe, from temperature maps collected on the external face. The pipe is subjected to internal heating by connecting two electrodes to the external surface. To estimate hint we apply the perturbation theory to a thin plate approximation of a boundary value problem for the stationary heat equation.[object Object]

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.

We study the initial-boundary value problem (Formula presented.) with measure-valued initial data. Here ? is a bounded open interval, ?(0)=?(?)=0, ? is increasing in (0,?) and decreasing in (?,?), and the regularising term ? is increasing but bounded. It is natural to study measure-valued solutions since singularities may appear spontaneously in finite time. Nonnegative Radon measure-valued solutions are known to exist and their construction is based on an approximation procedure. Until now nothing was known about their uniqueness.

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 effects of a nonminimally coupled curvature-matter model of gravity on a perturbed Minkowski metric are presented.

This paper proposes a crowd dynamic macroscopic model grounded on microscopic phenomenological observations which are upscaled by means of a formal mathematical procedure. The actual applicability of the model to real-world problems is tested by considering the pedestrian traffic along footbridges, of interest for Structural and Transportation Engineering. The genuinely macroscopic quantitative description of the crowd flow directly matches the engineering need of bulk results.

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

The large amount of work on community detection and its applications leaves unaddressed one important question: the statistical validation of the results. We present a methodology able to clearly detect the truly significance of the communities identified by some technique, permitting us to discard those that could be merely the consequence of edge positions in the network. Given a community detection method and a network of interest, our procedure examines the stability of the partition recovered against random perturbations of the original graph structure.